MétaCan
Menu
Back to cohort
Record W2541492143 · doi:10.1109/acssc.2007.4487529

PAPR Reduction in OFDM Systems by Successive Random Sign Negation

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

VenueConference record/Conference record - Asilomar Conference on Signals, Systems, & Computers · 2007
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsBlackberry (Canada)
Fundersnot available
KeywordsReduction (mathematics)Sign (mathematics)Orthogonal frequency-division multiplexingNegationAlgorithmSet (abstract data type)MathematicsSequence (biology)Simple (philosophy)Computational complexity theoryComputer scienceBlock (permutation group theory)ArithmeticTelecommunicationsCombinatorics

Abstract

fetched live from OpenAlex

Successive random sign negation (SRSN) is a simple yet effective PAPR reduction method for OFDM. The symbols to be transmitted by an OFDM block are successively multiplied by a set of randomly generated sign-negating sequences (SNS). The multiplications continue until a resultant PAPR which falls below a predefined threshold is found or all SNS in the set are tried. In the latter case, the resultant sequence with minimum PAPR is selected. The average number of sign-negating sequences tried before finding a suitable one and the overall PAPR performance of the technique are analyzed, with analytical results well supported by simulations. SRSN provides substantial PAPR reductions comparable to some existing approaches with lower complexity.

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.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesMeta-epidemiology (narrow)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.872
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0030.000
Bibliometrics0.0020.002
Science and technology studies0.0000.000
Scholarly communication0.0020.002
Open science0.0020.000
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0000.001

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.031
GPT teacher head0.257
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