Fractional Fourier Domain PAPR Reduction

Rose Qingyang Hu; Yewen Cao; Yulin Shao

REVIEW 3 major objections 6 minor 22 references

Fractional Fourier Domain PAPR Reduction

T0 review · 3 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that per-block selection of a fractional Fourier angle can cut the peak-to-average power ratio of multi-carrier signals to nearly half the OFDM baseline, while preserving one-tap equalization and ICI mitigation.

desk verdict Genuinely new dynamic-angle FrFT-PAPR scheme with a clever equalization trick, but the angle-search algorithm rests on an unproven surrogate and the ICI evidence is thin. read the letter →

arxiv 2411.08473 v1 pith:OPRSQ2AB submitted 2024-11-13 cs.IT eess.SPmath.IT

Yewen Cao , Yulin Shao , Rose Qingyang Hu This is my paper · ORCID

classification cs.ITeess.SPmath.IT

keywords fractionalFouriertransformPAPRreductionOFDMDFrFTone-tapequalizationdoublydispersivechannelsQAMGaussiansignals

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces DA-FrFDM, a multi-carrier modulation scheme that reduces peak-to-average power ratio (PAPR) by transmitting each data block in a fractional Fourier domain whose angle is dynamically chosen per block. The paper argues that PAPR behaves in a dual manner between the time and frequency domains, and an intermediate fractional angle can balance the two, cutting the PAPR at a CCDF of $10^{-3}$ to roughly half of the OFDM baseline for both QAM and Gaussian symbols. It further shows that a simple quadratic phase sequence makes the received signal equalizable with one tap, so the PAPR gain does not come at the cost of receiver complexity. This matters because high PAPR forces inefficient power-amplifier back-off, and the scheme also suits the Gaussian-like signals found in newer communication paradigms such as joint source-channel coding.

What carries the argument

The central object is the discrete fractional Fourier transform (DFrFT) with angle $\alpha\in(0,\pi)$, whose inverse maps data symbols placed in the fractional domain to time-domain samples. PAPR is expressed as a periodic function of the combined parameter $A_\alpha$, and the derivative of the surrogate $I=\int_0^T g(t)^4\,dt$ is evaluated by a trigonometric product-integral identity (Theorem 3) that reduces the computation to checking which frequency terms coincide. Algorithm 1 uses sign changes of $I'(\alpha)$ to build a short candidate set, then evaluates true PAPR only over that set. The last piece is the quadratic phase sequence $\theta(n)=\frac{1}{2}n^2\cot\alpha\,T_s^2$, which makes a circular convolution theorem hold in the ordinary frequency domain, so the channel response does not need to be recomputed when $\alpha$ changes.

What would settle it

Run Algorithm 1 on a large set of random QAM and Gaussian blocks with the same parameters as reported in the paper, then exhaustively evaluate true PAPR over the full angle range with a very fine grid. If any block's true PAPR-minimizing angle lies outside Algorithm 1's candidate set, or if exhaustive search yields a PAPR at least 0.5 dB lower than Algorithm 1's chosen angle, then the surrogate-guided search is not reliable as stated.

Watch

Extended reading notes

Core claim

The central claim is that dynamic per-block selection of the fractional Fourier transform angle can serve as a standalone PAPR reduction mechanism that outperforms clipping, selective mapping, and partial transmit sequence, without requiring extra spectrum or heavy side information. The argument rests on three results: PAPR depends on the angle only through the parameter $A_\alpha = -\frac{\pi^2\sin(2\alpha)}{T^2}$; PAPR is $\pi$-periodic in $A_\alpha$, so the whole search collapses into a narrow angle interval; and the derivative of a surrogate integral $I = \int_0^T g(t)^4\,dt$ can be computed in closed form, letting Algorithm 1 isolate promising angles cheaply. Theorem 4 then proves that multiplying time samples by a quadratic phase sequence $e^{j\theta(n)}$ with $\theta(n)=\frac{1}{2}n^2\cot\alpha\,T_s^2$ diagonalizes the channel in the fixed frequency domain, so equalization stays a single tap regardless of $\alpha$. The paper demonstrates with simulations that the PAPR gain persists for both QAM and complex Gaussian inputs, and that the ICI penalty of the angle search is only about 0.0004 dB in the doubly dispersive channel example.

Load-bearing premise

The entire efficient search relies on the belief that the local minima of the auxiliary quantity $I=\int_0^T g(t)^4\,dt$ are good stand-ins for the angles that actually minimize true peak power; if that link breaks for some data blocks, Algorithm 1 can miss the true best angle even though an exhaustive search would still find it.

Editorial extensions

If this is right

DA-FrFDM can be dropped into existing OFDM-style transceivers by replacing the FFT with an inverse DFrFT and adding a per-block angle search, keeping the same subcarrier structure.
Systems using continuous-amplitude symbols, such as joint source-channel coding or analog transmission, get PAPR relief without switching to a different waveform.
Because equalization remains one tap per subcarrier, receivers keep the low complexity of OFDM while gaining a lower peak factor.
The angle $\alpha$ becomes a controllable knob for trading PAPR against inter-carrier interference in fast-fading channels, with the example showing a PAPR cut at a cost of only 0.0004 dB of interference power.
Lower PAPR can translate directly into higher power-amplifier efficiency or relaxed linearity requirements, which is economically relevant in base stations and user devices.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If the surrogate derivative reliably locates the true optimum, the same bracket-and-refine search could be adapted to other peak metrics, such as the cubic metric, which matters for some amplifier models.
The per-block angle is side information the receiver must know; a natural testable extension is to estimate $\alpha$ at the receiver from a small pilot block, or to restrict the angle set to a codebook to avoid explicit signaling.
In MIMO or OFDMA downlinks, assigning different angles to different users would break subcarrier orthogonality; an extension is to use one common angle per resource block and study whether PAPR gains survive scheduling constraints.
The nearly negligible ICI cost suggests a nearly orthogonal trade-off dimension, so a joint PAPR-and-ICI optimization over $\alpha$ could yield a two-dimensional operating curve for doubly dispersive channels.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The new thing here is real: per-block dynamic selection of the fractional Fourier angle for PAPR reduction, paired with a quadratic phase term that keeps one-tap equalization in the fractional domain. That combination is not in the cited prior art, and the equalization trick is a legitimate contribution. The PAPR reduction itself is partly by construction—the algorithm evaluates actual PAPR and picks the best angle, so the gains in Fig. 2 are not a fitted prediction; they are the output of a search. That is the same logic as SLM/PTS and is fine.

The soft spot is Algorithm 1. The paper prunes the search space using local minima of I = ∫g(t)^4 dt, a surrogate for max g(t), but never proves or demonstrates that the surrogate's minima contain the true PAPR-minimizing angles. The final step can only select among the surrogate-filtered candidates. No control experiment compares Algorithm 1 with exhaustive search or random selection under the 128-evaluation budget. If the surrogate systematically discards good angles, the reported gains are not attributable to the proposed search. This is the main correctness risk, and it is about the efficiency claim rather than the feasibility of dynamic-angle PAPR reduction. Even a dense grid over alpha would likely show gains, so the concept survives; the algorithm as presented does not.

Other issues are proportional: Theorem 4's proof is garbled (the exponent variables don't cancel cleanly as written), the doubly dispersive ICI section rests on a single illustrative curve, and there is no code/data or error bars. These are repairable. The citations look honest; the FrFT-OFDM prior art is there.

Verdict: worth a serious referee. I would send it out, but with a clear request to fix Theorem 4, justify the surrogate (formally or with an ablation), and add a control experiment for Algorithm 1. I wouldn't cite it yet in my own work, but I'd bring it to the group to see if others think the dynamic-angle idea generalizes.

Referee Report

3 major / 6 minor

Summary. The paper proposes dynamic-angle fractional Fourier division multiplexing (DA-FrFDM), in which each data block is transformed by an inverse discrete fractional Fourier transform (IDFrFT) whose angle α is chosen per block to reduce PAPR. A quadratic phase term is applied in the time domain to enable one-tap equalization with an angle-independent channel response. The paper derives a closed-form envelope-power expression (Sec. III-A), proves a periodicity property of PAPR in the transformed angle variable (Theorem 2), and proposes a derivative-based surrogate search (Algorithm 1) to identify candidate angles. Simulations in Sec. V report PAPR at CCDF 10^-3 roughly half the OFDM baseline and better than clipping, SLM, and PTS for both complex Gaussian and QAM signals, with comparable BER/MSE in Rayleigh fading and a favorable PAPR-ICI trade-off in a doubly dispersive channel.

Significance. If the claims hold, DA-FrFDM provides a PAPR-reduction method that avoids reserved tones and phase-sequence side information, applies to continuous-amplitude Gaussian signals, and retains simple equalization and ICI mitigation. The analytical pieces are genuinely useful: Eq. (5) gives a compact expression of envelope power as a function of α through Aα; Theorem 2 restricts the search interval; Theorem 3 proposes a structured computation of the derivative of a surrogate cost. The simulation protocol of fixing a PAPR-evaluation budget of 128 for all compared methods is a fair and commendable feature. However, the two main advertised contributions—efficient discovery of the optimal angle and α-independent one-tap equalization—rest on arguments that are currently incomplete, so the paper needs substantial revision before the claims can be accepted.

major comments (3)

[Section III-B, Eq. (7)-(9), Algorithm 1] The surrogate-based search is not validated. Algorithm 1 prunes the search space by detecting sign changes of the derivative of I = ∫₀ᵀ g(t)⁴ dt, then evaluates the true PAPR only over the surviving set Ω. The paper neither proves nor experimentally tests that local minima of I are reliable proxies for angles that minimize the true max-based PAPR η(Aα). Since |x(t)|² = (1/N)Σ|s[k]|² + (2/N)g(t), the peak of |x(t)|² is determined by max g(t), whereas ∫g⁴ is an L4 norm over the whole interval; minimizing it can reduce energy away from the peak without reducing the maximum. Moreover, the coarse initial grid and the local sign-change condition can miss local minima of I itself, and the final argmin over Ω cannot recover angles already discarded. A control experiment comparing Algorithm 1 with an exhaustive fine search or with random candidate selection under the same 128-evaluation budget is needed to establish that the surrogate pruning preserves low-PAPR angles. Without such evidence, the claimed efficient discovery of α* is unsupported, even if the final PAPR reduction itself may be real.
[Section IV, Theorem 4 and its proof] The proof of Theorem 4 is garbled and does not establish the claimed α-independent one-tap equalization. The symbol ex[n] appears without definition, the phase term e^{j/2 n² cot α (T_s L)²} is introduced without justification, and the change of variables that combines the two circular-convolution sums does not correctly track the quadratic phase factors, especially for the term with n − m + N. The notation hf = F1 h is not defined (a DFT is presumably intended, but this must be stated). In addition, the phase function θ(n) = 1/2 n² cot α T_s² is dimensionally inconsistent as written, since T_s² has units of time squared. Because one-tap equalization is one of the three advertised advantages, this theorem and proof must be rewritten carefully and verified before the equalization claim can be accepted.
[Sections II and V-A] The signaling overhead of the dynamic angle is not quantified. DA-FrFDM selects a different α* for each block and must convey it to the receiver; the paper states that overhead is minimal but does not specify the number of bits per block, the effect of angle quantization on PAPR, or the resulting loss of spectral efficiency. The comparison in Fig. 2 fixes the PAPR-evaluation budget for all methods, which is good, but SLM and PTS also require side information, and a fair comparison should state the total overhead (in bits per block) for each scheme. This is load-bearing for the claim that DA-FrFDM achieves PAPR reduction with minimal signaling overhead.

minor comments (6)

[Table I] The step sizes are written as '∆α1' and '∆α1/39'; these should read '∆α' and '∆α'/39' for consistency with Algorithm 1, and the ratio ∆α/∆α' should be stated to be an integer.
[Equations (1) and (4)] The continuous-time signal in Eq. (4) uses t², while the discrete version in Eq. (1) uses n²T_s²; the normalization of time units should be clarified so that the phase exponents are dimensionless.
[Algorithm 1, line 10] The set builder {α_i + j∆α′ : j = 0, 1, 2, ..., ∆α/∆α′} should explicitly restrict j so that the candidate values lie within the search interval from Theorem 2.
[Figure 2 captions] The CCDF subcaptions contain garbled symbols (e.g., 'Γୢ୆' and 'Prηୢ୆ > Γୢ୆'); these should be replaced with standard notation such as Pr(η > Γ).
[Remark 1] The system is referred to as 'DA-DFrFT' instead of 'DA-FrFDM'; the terminology should be consistent throughout.
[Theorem 2] The range statement assumes T²/π ≤ 1 for sin⁻¹ to be defined; the paper should either state this condition or handle the case T²/π > 1 explicitly, since the simulations use a specific value of T.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the PAPR reduction is the intended output of an explicit per-block optimization, and the analytic derivation is self-contained.

full rationale

The paper's derivation chain is self-contained. Lemma 1 computes PAPR from the envelope power expression (5), and Theorem 2 proves periodicity in Aα algebraically; neither imports the conclusion. Theorem 3 gives an exact trigonometric-integral formula for I'(α), used only to prune candidate angles. Algorithm 1's final step explicitly evaluates the true PAPR metric η(Aα) and selects α* = arg min_{α∈Ω} η(Aα) (Section III-B, line 16; Remark 3 confirms survivors still require PAPR evaluation). The reported low-PAPR CCDF in Fig. 2 is therefore the value of the optimization objective itself, which is the intended system mechanism rather than a hidden fit: the transmitter is allowed to know the block and choose α per block. The comparison to OFDM, clipping, SLM, and PTS is made with a fixed 128-evaluation budget, so the benchmark is not statistically forced by a fitted parameter. The self-references ([7], [10], [21]) are background citations on semantic communication, Gaussian-signal PAPR sensitivity, and convolution-theorem context; none carries a load-bearing step of the PAPR derivation. The unproven correspondence between surrogate minima of I = ∫g^4 dt and true PAPR-minimizing angles is a correctness/robustness risk in Algorithm 1, but it is not a circularity: the final selection still uses actual PAPR, and the surrogate is not defined in terms of the reported result.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical entity. Its central claim depends on the angle-search algorithm (hand-picked grid steps), an unproved surrogate-to-max link, the LTI circular-convolution model for one-tap equalization, and perfect side information. These are modeling and algorithmic assumptions rather than fitted constants; no parameter is fit to the reported success metric.

free parameters (3)

Coarse angle step Delta alpha = Delta alpha = (1/80)*asin(T^2/pi)
Hand-chosen grid step in Algorithm 1; determines candidate angle resolution and the achievable PAPR reduction; no sensitivity analysis is given.
Fine angle step Delta alpha' = Delta alpha / 39
Second-stage refinement step in Algorithm 1, chosen ad hoc; affects how many candidates survive the pruning stage.
Oversampling rate L = 10
Used to approximate continuous-time PAPR; chosen in Table I and standard in the PAPR literature, but directly influences the reported CCDF curves.

assumptions (4)

ad hoc to paper Stationary points of the surrogate I = integral of g(t)^4 over time are reliable proxies for the angles that minimize the true max-based PAPR.
Invoked in Section III-B to justify Algorithm 1; the paper does not prove that minimizing integral g^4 correlates with minimizing max|g|, and global optimality is not guaranteed.
domain assumption The channel is linear time-invariant and the cyclic prefix is long enough that the received block equals the circular convolution h circular z, so the one-tap equalizer in Theorem 4 applies.
Standard in Section IV, but Section V-C then applies DA-FrFDM to a doubly dispersive Doppler channel, where this LTI assumption does not hold and the ICI claim would need a separate time-varying analysis.
domain assumption The receiver knows the selected angle alpha* for every block, and the side information cost is negligible.
The system requires alpha* as side information for demodulation; the paper only states overhead is minimal and does not model its cost or errors.
domain assumption Oversampling with rate L = 10 accurately represents the continuous-time PAPR used in the definition.
Remark 2 and Table I; standard practice in PAPR studies, but it is an approximation and the reported dB values depend on it.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Fractional Fourier Domain PAPR Reduction." pith.science (2026). https://pith.science/paper/OPRSQ2AB

@misc{pith2026241108473,
  author       = {Pith},
  title        = {Pith review of: Fractional Fourier Domain PAPR Reduction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OPRSQ2AB}},
  note         = {Machine review of arXiv:2411.08473}
}

read the original abstract

High peak-to-average power ratio (PAPR) has long posed a challenge for multi-carrier systems, impacting amplifier efficiency and overall system performance. This paper introduces dynamic angle fractional Fourier division multiplexing (DA-FrFDM), an innovative multi-carrier system that effectively reduces PAPR for both QAM and Gaussian signals with minimal signaling overhead. DA-FrFDM leverages the fractional Fourier domain to balance PAPR characteristics between the time and frequency domains, achieving significant PAPR reduction while preserving signal quality. Furthermore, DA-FrFDM refines signal processing and enables one-tap equalization in the fractional Fourier domain through the simple multiplication of time-domain signals by a quadratic phase sequence. Our results show that DA-FrFDM not only outperforms existing PAPR reduction techniques but also retains efficient inter-carrier interference (ICI) mitigation capabilities in doubly dispersive channels.

Figures

Figures reproduced from arXiv: 2411.08473 by the authors.

**Figure 1.** The structural framework of DA-FrFDM. II. DA-FRFDM SYSTEM OVERVIEW This section presents the structural framework of DAFrFDM. An illustrative diagram of the framework is provided in [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

**Figure 2.** CCDF of PAPR with different PAPR reduction techniques: (a) PAPR reduction for complex Gaussian signals; (b) PAPR reduction for 64QAM; (c) [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

**Figure 3.** Decoding performance with different PAPR reduction techniques: (a) MSE of complex Gaussian signals; (b) BER of 64QAM signals; (c) BER of [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗

Figures from the paper (1 more)

**Figure 4.** Figure 4: Trade-off between PAPR and PICI in doubly dispersive channels. symbols, bit error rate (BER) performance is analyzed, while mean square error (MSE) is assessed for Gaussian symbols. As can be seen, the DA-FrFDM system achieves decoding performance comparable to OFDM sy…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 16 canonical work pages

[1]

Broadband MIMO-OFDM wireless communications,

G. L. Stuber, J. R. Barry, S. W. Mclaughlin, Y . Li, M. A. Ingram, and T. G. Pratt, “Broadband MIMO-OFDM wireless communications,” Proceedings of the IEEE , vol. 92, no. 2, pp. 271–294, 2004

work page 2004
[2]

Peak-to-average power ratio reduction in OFDM systems: A survey and taxonomy,

Y . Rahmatallah and S. Mohan, “Peak-to-average power ratio reduction in OFDM systems: A survey and taxonomy,” IEEE communications surveys & tutorials , vol. 15, no. 4, pp. 1567–1592, 2013

work page 2013
[3]

Federated edge learning with misaligned over-the-air computation,

Y . Shao, D. G ¨und¨uz, and S. C. Liew, “Federated edge learning with misaligned over-the-air computation,” IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 3951–3964, 2021

2021
[4]

An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,

S. H. Han and J. H. Lee, “An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,” IEEE Wireless Communications, vol. 12, no. 2, pp. 56–65, 2005

2005
[5]

Joint source-channel coding for a multivariate Gaussian over a Gaussian MAC using variational domain adaptation,

Y . Li, X. Chen, and X. Deng, “Joint source-channel coding for a multivariate Gaussian over a Gaussian MAC using variational domain adaptation,” IEEE Transactions on Cognitive Communications and Net- working, vol. 9, no. 6, pp. 1424–1437, 2023

work page 2023
[6]

Deep joint source- channel coding for wireless image transmission,

E. Bourtsoulatze, D. B. Kurka, and D. G ¨und¨uz, “Deep joint source- channel coding for wireless image transmission,” IEEE Transactions on Cognitive Communications and Networking , vol. 5, no. 3, pp. 567–579, 2019

2019
[7]

A theory of semantic communication,

Y . Shao, Q. Cao, and D. G¨und¨uz, “A theory of semantic communication,” IEEE Transactions on Mobile Computing , 2024

2024
[8]

Atmospheric Turbulence-Immune Free Space Optical Communication System based on Discrete-Time Analog Transmission

H. Huang, Z. Yu, W. Z. Yi Lei, Y . Zhao, S. Huang, and K. Xu, “Atmospheric turbulence-immune free space optical communication system based on discrete-time analog transmission,” arXiv:2409.11928, 2024

work page Pith review arXiv 2024

Show all 22 references

[9]

PAPR reduction through Gaussian pre-coding in DCO-OFDM systems,

I. Cinemre, V . Aydin, and G. Hacioglu, “PAPR reduction through Gaussian pre-coding in DCO-OFDM systems,” Optical and Quantum Electronics, vol. 56, no. 6, p. 958, 2024

2024
[10]

Semantic communications with discrete-time analog transmission: A PAPR perspective,

Y . Shao and D. Gunduz, “Semantic communications with discrete-time analog transmission: A PAPR perspective,” IEEE Wireless Communica- tions Letters, vol. 12, no. 3, pp. 510–514, 2022

2022
[11]

Effects of clipping and filtering on the performance of OFDM,

X. Li and L. J. Cimini, “Effects of clipping and filtering on the performance of OFDM,” in IEEE VTC, vol. 3, 1997, pp. 1634–1638

1997
[12]

A comparison of peak power reduction schemes for OFDM,

S. Muller and J. Huber, “A comparison of peak power reduction schemes for OFDM,” in IEEE GLOBECOM, 1997

1997
[13]

Peak-to-average power ratio reduction of an OFDM signal using partial transmit sequences,

L. Cimini and N. Sollenberger, “Peak-to-average power ratio reduction of an OFDM signal using partial transmit sequences,” IEEE Communi- cations Letters, vol. 4, no. 3, pp. 86–88, 2000

2000
[14]

Minimisation of the peak to mean envelope power ratio of multicarrier transmission schemes by block coding,

T. Wilkinson and A. Jones, “Minimisation of the peak to mean envelope power ratio of multicarrier transmission schemes by block coding,” in IEEE VTC, 1995

1995
[15]

An active-set approach for OFDM PAR reduction via tone reservation,

B. Krongold and D. Jones, “An active-set approach for OFDM PAR reduction via tone reservation,”IEEE Transactions on Signal Processing, vol. 52, no. 2, pp. 495–509, 2004

2004
[16]

Tone injection with hexagonal constellation for peak-to-average power ratio reduction in OFDM,

S. H. Han, J. Cioffi, and J. H. Lee, “Tone injection with hexagonal constellation for peak-to-average power ratio reduction in OFDM,”IEEE Communications Letters, vol. 10, no. 9, pp. 646–648, 2006

2006
[17]

The discrete fractional Fourier transform,

C. Candan, M. A. Kutay, and H. M. Ozaktas, “The discrete fractional Fourier transform,” IEEE Transactions on signal processing , vol. 48, no. 5, pp. 1329–1337, 2000

2000
[18]

Closed-form discrete fractional and affine Fourier transforms,

S.-C. Pei and J.-J. Ding, “Closed-form discrete fractional and affine Fourier transforms,” IEEE Transactions on Signal Processing , vol. 48, no. 5, pp. 1338–1353, 2000

2000
[19]

A new affine fractional Fourier transform with circular convolution property,

A. Nafchi, M. Esmaeili, B. Santhanam, and R. Jordan, “A new affine fractional Fourier transform with circular convolution property,” in Asilomar Conference on Signals, Systems, and Computers , 2023

2023
[20]

A closed form selected mapping algorithm for PAPR reduction in OFDM multicarrier transmission,

A. F. Carcangiu, Sara and A. Montisci, “A closed form selected mapping algorithm for PAPR reduction in OFDM multicarrier transmission,” Energies, vol. 15, no. 5, p. 1938, 2022

1938
[21]

Polarization aware movable antenna,

R. Zhang, Y . Shao, and Y . C. Eldar, “Polarization aware movable antenna,” arXiv:2411.06690, 2024

2024 arXiv
[22]

Near-optimal angle of transform in FRFT-OFDM systems based on ICI analysis,

Z. Mokhtari and M. Sabbaghian, “Near-optimal angle of transform in FRFT-OFDM systems based on ICI analysis,” IEEE Transactions on Vehicular Technology, vol. 65, no. 7, pp. 5777–5783, 2015

2015

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [1]

Broadband MIMO-OFDM wireless communications,

G. L. Stuber, J. R. Barry, S. W. Mclaughlin, Y . Li, M. A. Ingram, and T. G. Pratt, “Broadband MIMO-OFDM wireless communications,” Proceedings of the IEEE , vol. 92, no. 2, pp. 271–294, 2004

work page 2004

[2] [2]

Peak-to-average power ratio reduction in OFDM systems: A survey and taxonomy,

Y . Rahmatallah and S. Mohan, “Peak-to-average power ratio reduction in OFDM systems: A survey and taxonomy,” IEEE communications surveys & tutorials , vol. 15, no. 4, pp. 1567–1592, 2013

work page 2013

[3] [3]

Federated edge learning with misaligned over-the-air computation,

Y . Shao, D. G ¨und¨uz, and S. C. Liew, “Federated edge learning with misaligned over-the-air computation,” IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 3951–3964, 2021

2021

[4] [4]

An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,

S. H. Han and J. H. Lee, “An overview of peak-to-average power ratio reduction techniques for multicarrier transmission,” IEEE Wireless Communications, vol. 12, no. 2, pp. 56–65, 2005

2005

[5] [5]

Joint source-channel coding for a multivariate Gaussian over a Gaussian MAC using variational domain adaptation,

Y . Li, X. Chen, and X. Deng, “Joint source-channel coding for a multivariate Gaussian over a Gaussian MAC using variational domain adaptation,” IEEE Transactions on Cognitive Communications and Net- working, vol. 9, no. 6, pp. 1424–1437, 2023

work page 2023

[6] [6]

Deep joint source- channel coding for wireless image transmission,

E. Bourtsoulatze, D. B. Kurka, and D. G ¨und¨uz, “Deep joint source- channel coding for wireless image transmission,” IEEE Transactions on Cognitive Communications and Networking , vol. 5, no. 3, pp. 567–579, 2019

2019

[7] [7]

A theory of semantic communication,

Y . Shao, Q. Cao, and D. G¨und¨uz, “A theory of semantic communication,” IEEE Transactions on Mobile Computing , 2024

2024

[8] [8]

Atmospheric Turbulence-Immune Free Space Optical Communication System based on Discrete-Time Analog Transmission

H. Huang, Z. Yu, W. Z. Yi Lei, Y . Zhao, S. Huang, and K. Xu, “Atmospheric turbulence-immune free space optical communication system based on discrete-time analog transmission,” arXiv:2409.11928, 2024

work page Pith review arXiv 2024