MétaCan
Menu
Back to cohort
Record W2152029010 · doi:10.1109/isplc.2005.1430472

Low-density parity-check coding for impulse noise correction on power-line channels

2005· article· en· W2152029010 on OpenAlexaff
Masoud Ardakani, Frank R. Kschischang, Wei Yu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLow-density parity-check codeImpulse noiseComputer scienceAdditive white Gaussian noiseGaussian noiseAlgorithmCoding gainBinary erasure channelErasureElectronic engineeringChannel capacityChannel (broadcasting)Decoding methodsTelecommunicationsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

This paper considers the design of near capacity-achieving error correcting codes for a discrete multi-tone system in the presence of both additive white Gaussian noise and impulse noise. Impulse noise is one of the main channel impairments in the power-line channel. One way to combat impulse noise is to detect the presence of the impulses and to declare an erasure when an impulse occurs. In this paper, we propose a coding system based on irregular low-density parity-check (LDPC) codes and bit-interleaved coded modulation. We show that by carefully choosing the degree distribution of the irregular LDPC code, both the additive noise and the erasures can be handled in a single code. We show that the proposed system can perform close to the capacity of the channel and for the same redundancy is significantly more immune to the impulse noise than the existing methods based on an outer Reed-Solomon code.

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: Empirical · Consensus signal: none
Teacher disagreement score0.911
Threshold uncertainty score0.651

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.016
GPT teacher head0.270
Teacher spread0.254 · 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

Citations21
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207