MétaCan
Menu
Back to cohort
Record W2110950528 · doi:10.1109/pacrim.2007.4313237

Avoiding PAPR degradation in Convolutional Coded OFDM Signals

2007· article· en· W2110950528 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsDegradation (telecommunications)Orthogonal frequency-division multiplexingComputer scienceConvolutional codeElectronic engineeringRemote sensingDecoding methodsTelecommunicationsGeologyEngineeringChannel (broadcasting)

Abstract

fetched live from OpenAlex

Orthogonal Frequency Division Multiplexing (OFDM) is a promising technique for high bit rate transmission in wireless communications systems. Convolutional coding is often used in conjunction with OFDM to improve the reliability of transmission. However, in this paper, we show that the peak to average power ratio (PAPR) statistics of convolutional coded OFDM (C-COFDM) signals can be significantly degraded when compared with uncoded-OFDM. We have found that this degradation can occur for code rates R < 1/2 and relatively low constraint lengths K=3 through K=6. For these codes, it is especially important to use PAPR reduction techniques to counteract this degradation. We further demonstrate that the use of Guided Scrambling (GS) as a PAPR reduction technique does not help in all of the cases, and therefore that reduction techniques applied after convolutional encoding, such as Selected Mapping (SLM), should be used instead.

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.001
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: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.240
Threshold uncertainty score0.360

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.019
GPT teacher head0.244
Teacher spread0.226 · 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

Quick stats

Citations7
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicPAPR reduction in OFDMFrench-language works237,207