MétaCan
Menu
Back to cohort
Record W2167583366 · doi:10.1109/lsp.2010.2046191

Blind Unique Identification of MIMO Channels Using Signal Designs and High-Order Moments

2010· article· en· W2167583366 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Signal Processing Letters · 2010
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsMIMOChannel (broadcasting)MathematicsPhase-shift keyingFadingAlgorithmTransmission (telecommunications)SIGNAL (programming language)Diophantine equationClosed-form expressionControl theory (sociology)Applied mathematicsTopology (electrical circuits)Computer scienceTelecommunicationsBit error rateMathematical analysisDiscrete mathematicsCombinatorics

Abstract

fetched live from OpenAlex

In this letter, a necessary and sufficient condition is developed to check whether a set of polynomial equations is solvable. Furthermore, under the sufficient condition, a closed-form solution is attained using linear Diophantine equation theory. With this, a novel signal design and a row-circular transmission scheme of phase shift keying (PSK) constellations for MIMO flat fading channels are proposed so that the channel coefficients can be uniquely identified. When certain high-order moments of the received signals are available, a closed-form solution to uniquely determine the channel coefficients is given. When only finite received data are available, a numerical algorithm is provided to efficiently and effectively estimate the channel.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.478
Threshold uncertainty score0.882

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.027
GPT teacher head0.273
Teacher spread0.247 · 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