MétaCan
Menu
Back to cohort
Record W4288786134 · doi:10.1109/lcomm.2022.3195042

Deep Unfolding Network for PAPR Reduction in Multicarrier OFDM Systems

2022· article· en· W4288786134 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Communications Letters · 2022
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsEricsson (Canada)Université du Québec à Montréal
FundersFonds de recherche du QuébecMitacs
KeywordsOrthogonal frequency-division multiplexingReduction (mathematics)Computer scienceAlgorithmBit error rateBackpropagationPower (physics)Constraint (computer-aided design)Transmitter power outputCompandingFunction (biology)Transfer functionControl theory (sociology)Channel (broadcasting)Artificial neural networkMathematicsTelecommunicationsTransmitterControl (management)Decoding methodsArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

In this letter, we propose a Deep Unfolding Network called PR-DUN to reduce the peak-to-average power ratio (PAPR), which is a thorny problem in Orthogonal Frequency-Division Multiplexing (OFDM) systems. The proposed multi-layer model is constructed by unrolling an iterative algorithm resulting in layers with trainable parameters, which are optimized to minimize a loss function related to the PAPR value. The deep unfolding model uses the backpropagation algorithm to transfer gradients backwards to adjust parameters. Furthermore, the proposed scheme can accommodate any transmit power constraint, and therefore can control the power increase caused by the auxiliary signal. Simulation results show that the proposed PR-DUN model achieves a larger PAPR reduction and a smaller bit error rate while being less computationally intensive than related solutions.

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: Empirical
Teacher disagreement score0.327
Threshold uncertainty score0.661

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.0010.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.029
GPT teacher head0.258
Teacher spread0.229 · 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