MétaCan
Menu
Back to cohort
Record W2099784141 · doi:10.1109/icc.2006.255377

Trellis Shaping for PAR Reduction in OFDM Systems

2006· article· fr· W2099784141 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue2006 IEEE International Conference on Communications · 2006
Typearticle
Languagefr
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTrellis (graph)Orthogonal frequency-division multiplexingDecoding methodsComputer scienceReduction (mathematics)Space–time trellis codeMetric (unit)AlgorithmMultiplexingFrequency domainTheoretical computer scienceElectronic engineeringMathematicsTelecommunicationsChannel (broadcasting)Block codeEngineeringConcatenated error correction code

Abstract

fetched live from OpenAlex

The application of trellis shaping was recently proposed to reduce the peak-to-average power ratio (PAR) of orthogonal frequency division multiplexing signals. In this paper, we review the trellis shaping schemes presented in the literature and we introduce modifications such as a new decoding metric and the use of sequential decoding, which improve PAR reduction and/or reduce complexity of trellis shaping. Based on implementation onisuggestions, we conduct a complexity and performance comparison for the different schemes. One interesting result of this work is that trellis shaping with time-domain metrics is superior to trellis shaping with frequency-domain metrics.

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.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.921
Threshold uncertainty score1.000

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.001
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.159
GPT teacher head0.352
Teacher spread0.194 · 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