MétaCan
Menu
Back to cohort
Record W2055505453 · doi:10.1504/ijcnds.2008.020257

A low complexity selective mapping OFDM using multiple IFFT stages

2008· article· en· W2055505453 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

VenueInternational Journal of Communication Networks and Distributed Systems · 2008
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsFast Fourier transformOrthogonal frequency-division multiplexingComputational complexity theoryComputer scienceReduction (mathematics)DecimationAlgorithmMultiplicative functionMultiplexingMathematicsTelecommunications

Abstract

fetched live from OpenAlex

A low complexity Selective Mapping (SLM) technique for reducing the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing (OFDM) signal is introduced. The intermediate signals within an N-point IFFT using a radix Decimation In Time (DIT) or Decimation In Frequency (DIF) IFFT algorithm are used to generate the phase sequences. It is shown that DIF provides lower multiplicative complexity in generating the SLM sequences compared to DIT, with the same PAPR reduction. In addition, a high radix FFT algorithm provides better PAPR reduction performance per stage with less multiplicative complexity compared to a low radix algorithm. We further reduce the computational complexity by proposing a low computational complexity technique based on multiplying the phase sequences at multiple IFFT stages. This new technique greatly reduces the multiplicative complexity while providing similar PAPR reduction to Ordinary SLM (O-SLM). The additive complexity is also reduced.

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 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.557
Threshold uncertainty score0.522

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.046
GPT teacher head0.266
Teacher spread0.220 · 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