MétaCan
Menu
Back to cohort
Record W2142479299 · doi:10.1109/isplc.2010.5479929

Adaptive bit-interleaved coded OFDM

2010· article· fr· W2142479299 on OpenAlexaff
Mohammad Mohammadnia-Avval, Alireza Kenarsari-Anhari, Lutz Lampe

Bibliographic record

Venuenot available
Typearticle
Languagefr
FieldEngineering
TopicPower Line Communications and Noise
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingBit error rateComputer scienceTransmitterAlgorithmCoding (social sciences)Channel (broadcasting)MinificationLink adaptationTransmission (telecommunications)Electronic engineeringDecoding methodsMathematicsTelecommunicationsFadingEngineeringStatistics

Abstract

fetched live from OpenAlex

Bit-interleaved coded orthogonal frequency division multiplexing (BIC-OFDM) is a popular transmission format for high and also some low data rate power line communication (PLC) systems. In this paper, we consider the problem of optimizing the BIC-OFDM transmitter based on channel information feedback from the receiver side. In particular, the problem of adaptive bit-loading, power allocation, and code (rate) selection for bit-error rate (BER) minimization is addressed. To this end, we first derive BER approximations for BIC-OFDM. The main difference between this analysis and many previous works on adaptive OFDM for PLC is that we include the effect of coding on BER. In the next step, we use the derived expression to formulate adaptive BIC-OFDM for BER minimization and show that the optimization problem can be solved efficiently using greedy-type algorithms. Finally, we propose a simple formula to predict the performance of the optimized system.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.696
Threshold uncertainty score0.999

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.001
Insufficient payload (model declined to judge)0.0050.002

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.241
Teacher spread0.224 · 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; both teacher heads agree on what is shown here.

Study designNot applicable
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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicPower Line Communications and NoiseFrench-language works237,207