MétaCan
Menu
Back to cohort
Record W2118700319 · doi:10.1109/acssc.2005.1599927

On Subspace-based Blind Channel Estimation Algorithms for SFBC MC-CDMA systems

2006· article· en· W2118700319 on OpenAlexaff
Shahrokh Nayeb Nazar, Ioannis Psaromiligkos

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceAlgorithmFadingCode division multiple accessIdentifiabilityTelecommunications linkBlock codeChannel (broadcasting)Transmit diversityMultipath propagationSubspace topologyAntenna diversitySpace–time block codeTheoretical computer scienceTelecommunicationsDecoding methodsWirelessArtificial intelligence

Abstract

fetched live from OpenAlex

The issue of blind channel estimation for the downlink of Space-Frequency Block Coded Multi-Carrier Code Division Multiple Access (SFBC MC-CDMA) systems is ad- dressed. Specifically, we consider an intuitive subspace-based channel estimation method and we investigate the corresponding necessary and sufficient conditions under which the channel estimate is unique (within a complex scalar). The derived identifiability conditions are used to highlight two interesting properties of SFBC MC-CDMA systems: (i) there is no antenna order ambiguity even when only one spreading code is assigned to each user, (ii) channel identifiablility is guaranteed, regardless of the channel zeros location. We also establish the unbiasedness of the channel estimates and we derive closed-form expressions for the mean-square-error (MSE) of the estimates as well as the corresponding Cramer-Rao bound (CRB). For the derivation of the CRB, we follow a novel approach which assumes the knowledge of only the spreading code of the desired user and results in a much tighter bound than the CRB derived based on the knowledge of all users' signatures. I. INTRODUCTION Transmit diversity techniques, and particularly Space- Time/Frequency Block Codes (STBC/SFBC) (1), are known to be very effective for combating multipath fading in broad- band wireless communications. These schemes are even more attractive when applied to a robust multiple access technique such as Multi-Carrier Code Division Multiple Access (MC- CDMA). However, the diversity and coding gains that are possible in such systems can only be realized if the underlying channels are accurately acquired at the receiver (4). The issue of blind channel estimation for STBC MC-CDMA systems has been addressed in the past (2), (3); however, to the authors best knowledge, no channel estimation method has been proposed or analyzed for SFBC MC-CDMA. In this work, as a first step in filling that void, we investigate the problem of blind channel estimation for SFBC MC-CDMA systems. We begin by presenting a system model for complex modulation schemes that enables us to treat the links between the multiple transmit antennas and the single receive antenna as a single channel and, thus, reduces the multichannel estima- tion problem to a single-input single-output (SISO) problem. This allows us to develop a simple, intuitive, subspace-based

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.270
Teacher spread0.246 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207