MétaCan
Menu
Back to cohort
Record W3214808368 · doi:10.1109/lwc.2021.3131848

On the Design of Channel Coding Autoencoders With Arbitrary Rates for ISI Channels

2021· article· en· W3214808368 on OpenAlexafffund
Yitian Zhang, Huihui Wu, Mark Coates

Bibliographic record

VenueIEEE Wireless Communications Letters · 2021
Typearticle
Languageen
FieldComputer Science
TopicWireless Signal Modulation Classification
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAutoencoderAdditive white Gaussian noiseTransmitterComputer scienceAlgorithmConvolutional codeLow-density parity-check codeChannel (broadcasting)EncoderCoding (social sciences)Intersymbol interferenceDecoding methodsElectronic engineeringTelecommunicationsDeep learningMathematicsArtificial intelligenceStatisticsEngineering

Abstract

fetched live from OpenAlex

This letter presents an autoencoder-based channel coding scheme in the presence of inter-symbol interference (ISI) and additive white Gaussian noise (AWGN), supporting arbitrary coding rates. Both the transmitter and receiver of the proposed autoencoder employ bi-directional gated recurrent unit (Bi-GRU) layers. Additional extra dense layers are applied at the end of the transmitter and at the beginning of the receiver, serving as learnable puncture and depuncture modules, respectively. Different code rates can be achieved by adjusting the output dimension of the extra dense layers. Experimental results demonstrate that the proposed autoencoder significantly outperforms conventional convolutional codes over ISI channels, for multiple code rates. The proposed autoencoder also outperforms LDPC codes in the low signal-to-noise ratio (SNR) regime. The neural codes still require improvement to be competitive in the high SNR regime.

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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.082
GPT teacher head0.289
Teacher spread0.207 · 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 designSimulation or modeling
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

Citations10
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicWireless Signal Modulation ClassificationFrench-language works237,207