MétaCan
Menu
Back to cohort
Record W2118114660 · doi:10.1109/cwit.2011.5872111

Design of multi-edge-type LDPC codes for high-order coded modulation

2011· article· en· W2118114660 on OpenAlexaff
Lei Zhang, Frank R. Kschischang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLow-density parity-check codeAlgorithmQuadrature amplitude modulationQAMDecoding methodsComputer scienceEnhanced Data Rates for GSM EvolutionModulation (music)Bit error rateTopology (electrical circuits)MathematicsTelecommunicationsCombinatorics

Abstract

fetched live from OpenAlex

A design method for bandwidth-efficient LDPC coded modulation for 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2m</sup> -QAM constellations at rate (2m - 1)/(2m) in complex AWGN is presented. A multi-edge-type parameterization is used to exploit the distinct bit-channel capacities unique to high-order modulation using LDPC structures. EXIT analysis is adapted to multi-edge by introducing multi-dimensional EXIT iterated-function system analysis. Under this conceptualization, a successful decoding condition is developed by estimating fixed points of the dynamical system using its numerical gradient. Optimized ensembles are found for 16-QAM with thresholds matching the best known ensembles of equal complexity. For 64 to 1024-QAM, sufficiently high bit-channel capacities allow for extension of lower-order optimized ensembles, leading a practical nested code structure. The nested structure provides flexible rate selection with a single decoder. The gap to constrained, non-iterative capacity of all optimized code ensembles of maximum variable degree of 15 is within 0.21 dB.

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.632
Threshold uncertainty score0.425

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.0010.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.097
GPT teacher head0.299
Teacher spread0.202 · 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
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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicError Correcting Code TechniquesFrench-language works237,207