MétaCan
Menu
Back to cohort
Record W2165333292 · doi:10.1109/cnsr.2007.52

PTS Peak Power Reduction of OFDM Signals with Low Complexity IFFTs

2007· article· en· W2165333292 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 Victoria
Fundersnot available
KeywordsFast Fourier transformOrthogonal frequency-division multiplexingComputational complexity theoryReduction (mathematics)DecimationAlgorithmSIGNAL (programming language)MathematicsComputer scienceSplit-radix FFT algorithmRadix (gastropod)Power (physics)Frequency-division multiplexingMultiplexingTelecommunicationsFourier transformBandwidth (computing)Channel (broadcasting)Short-time Fourier transformFourier analysisPhysics

Abstract

fetched live from OpenAlex

Partial transmit sequence (PTS) is a distortionless technique used to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. However, it has a relatively high computational complexity due to the computation of multiple inverse fast Fourier transforms (IFFTs). We reduce this complexity by using a radix FFT that computes multiple IFFTs with low computational complexity. Signals at the middle stages of an N-point radix-r FFT using decimation in frequency (DIF) are employed for PTS subblocking. Performance results are presented which show that PAPR reduction similar to other techniques such as ordinary PTS (O-PTS) is achieved.

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

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.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.018
GPT teacher head0.245
Teacher spread0.227 · 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

Citations8
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicPAPR reduction in OFDMFrench-language works237,207