MétaCan
Menu
Back to cohort
Record W2110085878 · doi:10.1109/vetecs.2007.365

PAPR Reduction in Wavelet Packet Modulation Using Tree Pruning

2007· article· en· W2110085878 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 institutionsDalhousie University
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingNetwork packetWavelet packet decompositionTree (set theory)Reduction (mathematics)WaveletRedundancy (engineering)Modulation (music)AlgorithmComputer scienceWavelet transformMathematicsPruningReal-time computingTelecommunicationsChannel (broadcasting)Artificial intelligenceComputer network

Abstract

fetched live from OpenAlex

High peak-to-average power ratio (PAPR) of transmitted signals is a major drawback for multicarrier modulation systems such as orthogonal frequency division multiplexing (OFDM) and wavelet packet modulation (WPM). In this paper, wavelet packet tree pruning is proposed for the reduction of PAPR in WPM systems. In this technique, a full wavelet packet tree is dynamically pruned via joining and splitting of terminal nodes to achieve a minimized PAPR. Specifically, alternative mappings of data symbols onto different tree structures are generated, and the time domain sequence with the smallest PAPR is transmitted. The information about the pruned tree is sent as side information similar to techniques such as selective mapping (SLM) in OFDM systems. Using a small level of redundancy for side information, the proposed scheme achieves significant reduction in PAPR at the expense of acceptable computational complexity. The complementary cumulative distribution function (CCDF) of the PAPR optimized signal shows about a 3.5 dB improvement over the original WPM signal.

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.361
Threshold uncertainty score0.439

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.024
GPT teacher head0.257
Teacher spread0.233 · 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

Citations17
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicPAPR reduction in OFDMFrench-language works237,207