MétaCan
Menu
Back to cohort
Record W2135288797 · doi:10.1109/tsp.2003.815387

Minimum ber block precoders for zero-forcing equalization

2003· article· en· W2135288797 on OpenAlexaff
Yanwu Ding, Timothy N. Davidson, Zhi‐Quan Luo, K.M. Wong

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2003
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsCyclic prefixMathematicsOrthogonal frequency-division multiplexingEqualization (audio)Bit error rateMinimum mean square errorAlgorithmTransmission (telecommunications)Control theory (sociology)Matrix (chemical analysis)Intersymbol interferenceSignal-to-noise ratio (imaging)TelecommunicationsComputer scienceStatisticsEstimator

Abstract

fetched live from OpenAlex

We determine the linear precoder that minimizes the bit error rate (BER) at moderate-to-high signal-to-noise ratios (SNRs) for block transmission systems with zero-forcing (ZF) equalization and threshold detection. The design is developed for the two standard schemes for eliminating inter-block interference, viz, zero padding (ZP) and cyclic prefix (CP). We show that both the ZP minimum BER precoder and the CP minimum BER precoder provide substantially lower error rates than standard block transmission schemes, such as orthogonal frequency division multiplexing (OFDM). The corresponding SNR gains can be on the order of several decibels. We also show that the CP minimum BER precoder can be obtained by a two-stage modification of the water-filling discrete multitone modulation (DMT) scheme in which the diagonal water-filling power loading is replaced by a full matrix consisting of a diagonal minimum mean square error power loading matrix post multiplied by a discrete Fourier transform (DFT) matrix.

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.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
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.0030.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.026
GPT teacher head0.273
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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations177
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Signal ProcessingSame topicAdvanced Wireless Communication TechniquesFrench-language works237,207