MétaCan
Menu
Back to cohort
Record W2147446451 · doi:10.1109/icc.2004.1312490

Linear dispersion over time and frequency

2004· article· en· W2147446451 on OpenAlexaff
Jinsong Wu, Steven D. Blostein

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingFadingInterleavingComputer scienceBit error rateAlgorithmDecoding methodsDiversity schemeElectronic engineeringMathematicsChannel (broadcasting)TelecommunicationsEngineering

Abstract

fetched live from OpenAlex

High rate linear dispersion codes (LDC) for space time channels can support arbitrary numbers of transmit and receive antennas. In contrast to the one-to-one transformations used in interleaving, these codes disperse data in linear combinations over space and time. To improve performance of orthogonal frequency division multiplexing (OFDM) for wireless fading channels, this paper investigates increasing frequency and time diversity using LDC. To overcome the requirement of constant channel gains over an entire LDC time interval, a new decoding algorithm for a special subclass of LDC is proposed. The newly proposed LDC-OFDM linearly disperses data over both time and frequency, i.e., over multiple subcarriers and OFDM blocks. Simulations show the bit error rate (BER) performance of rate-one LDC-OFDM with zero padding is superior to that of uncoded OFDM with zero padding. Further, compared to uncoded OFDM, LDC-OFDM may have improved performance without increasing the peak-to-average power ratio (PAPR).

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 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: Empirical
Teacher disagreement score0.236
Threshold uncertainty score0.187

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.006
GPT teacher head0.224
Teacher spread0.219 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
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

Citations12
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207