pith. sign in

arxiv: 2604.19273 · v1 · submitted 2026-04-21 · 📡 eess.SP

Sparsification of Precoding Codebooks for PAPR Reduction via Grassmannian Representations

Joe Asano , Yuto Hama , Hiroki Iimori , Szabolcs Malomsoky , Naoki Ishikawa This is my paper

Pith reviewed 2026-05-10 02:09 UTC · model grok-4.3

classification 📡 eess.SP
keywords sparsificationprecoding codebooksPAPR reductionGrassmann manifoldsparse PCAunitary transformationuplink MIMO
0
0 comments X

The pith

Precoding codebooks sparsified on the Grassmann manifold reduce PAPR by more than 1 dB with negligible rate loss.

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

This paper develops a way to make precoding codebooks sparser so that transmitted signals have lower peak power relative to average power. The approach treats precoders as points on the Grassmann manifold to allow sparsification without changing the existing feedback mechanism. Two methods are presented: exact sparsification through unitary transformation and approximate sparsification through sparse principal component analysis. These are combined into a single design algorithm. The outcome is a set of codebooks that cut PAPR by over one decibel in uplink scenarios while keeping achievable rates essentially the same.

Core claim

By exploiting that precoder matrices lie on the Grassmann manifold, the authors formulate a codebook design problem that enables sparsification without modifying the existing feedback mechanism. They develop exact sparsification via unitary transformation and approximate sparsification via sparse principal component analysis, then integrate both into a unified design algorithm. The proposed sparsified codebooks incur negligible performance loss while reducing PAPR by more than 1 dB in uplink scenarios.

What carries the argument

The Grassmann manifold representation of precoder matrices, which permits sparsification through exact unitary transformation or approximate sparse principal component analysis without altering feedback.

If this is right

  • The unified algorithm produces codebooks that work with current feedback protocols.
  • Uplink links gain more than 1 dB PAPR reduction.
  • Achievable rates stay nearly identical to the original codebooks.
  • Both exact unitary and approximate sparse-PCA sparsification routes are effective.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Lower PAPR may allow simpler or more efficient power amplifiers at the transmitter.
  • The manifold-based sparsification idea could apply to codebook designs in other wireless standards.
  • Energy savings at user devices become possible without throughput trade-offs.
  • Extensions to multi-user MIMO or larger antenna arrays would be natural next tests.

Load-bearing premise

Sparsification via Grassmannian representations preserves the achievable rate and remains compatible with the existing feedback mechanism without introducing hidden rate penalties or implementation incompatibilities.

What would settle it

A simulation or hardware test showing that the sparsified codebooks cause more than negligible rate loss or fail to achieve at least 1 dB PAPR reduction in uplink transmission would falsify the claim.

Figures

Figures reproduced from arXiv: 2604.19273 by Hiroki Iimori, Joe Asano, Naoki Ishikawa, Szabolcs Malomsoky, Yuto Hama.

Figure 1
Figure 1. Figure 1: Achievable rate under uncorrelated Rayleigh fading channels with [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Comparison of PAPR performance in DFT-s-OFDM with [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Sparsification distortion comparisons when varying the matrix size. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
read the original abstract

In this letter, we propose a sparsification method for precoding codebooks that reduces the peak-to-average power ratio (PAPR) while preserving the achievable rate. By exploiting the fact that precoder matrices lie on the Grassmann manifold, we formulate a codebook design problem that enables sparsification without modifying the existing feedback mechanism. We develop two sparsification approaches, namely exact sparsification via unitary transformation and approximate sparsification via sparse principal component analysis, and integrate them into a unified design algorithm. The proposed sparsified codebooks incur negligible performance loss while reducing PAPR by more than 1 dB in uplink scenarios.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a sparsification method for precoding codebooks in uplink MIMO systems to reduce PAPR while preserving achievable rate. It exploits Grassmann manifold properties of precoders to formulate a codebook design that avoids modifying the existing feedback mechanism. Two approaches are developed—exact sparsification via unitary transformation and approximate sparsification via sparse PCA—integrated into a unified algorithm. Simulations claim negligible performance loss with more than 1 dB PAPR reduction.

Significance. If the subspace preservation and rate claims hold without hidden penalties or feedback incompatibilities, the work could provide a practical, standards-compatible way to address PAPR in codebook-based precoding for power-efficient uplink transmission. It builds directly on established Grassmannian codebook feedback structures, which strengthens potential adoptability if the derivations are completed.

major comments (2)
  1. [Abstract] Abstract and proposed method: the claim that exact sparsification via unitary transformation preserves the effective precoder subspace (and thus the receiver's index selection) without additional compensation is not supported by any derivation of the post-transformation Grassmann distance; left-multiplication by a non-identity unitary U maps the column space of V to that of UV, yet no proof is given that the feedback index remains optimal or that mutual-information loss is negligible.
  2. [Abstract] Abstract and approximate sparsification section: sparse-PCA relaxes orthonormality, and subsequent renormalization changes the effective power allocation and subspace angle, but no bound on the resulting mutual-information loss or compatibility with the existing feedback mechanism is provided, directly undermining the 'negligible performance loss' and 'no modification to feedback' assertions.
minor comments (2)
  1. The abstract should explicitly state the simulation parameters (e.g., antenna configuration, SNR range, codebook size) used to obtain the reported >1 dB PAPR reduction and rate curves.
  2. Notation for the Grassmann distance metric and the precise definition of 'sparsification' (e.g., number of non-zero entries per vector) should be introduced earlier for clarity.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We are grateful to the referee for the thorough review and valuable feedback on our work. The comments highlight important aspects regarding the theoretical foundations of our sparsification methods. We address each major comment below and have made revisions to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract and proposed method: the claim that exact sparsification via unitary transformation preserves the effective precoder subspace (and thus the receiver's index selection) without additional compensation is not supported by any derivation of the post-transformation Grassmann distance; left-multiplication by a non-identity unitary U maps the column space of V to that of UV, yet no proof is given that the feedback index remains optimal or that mutual-information loss is negligible.

    Authors: We appreciate the referee's careful reading. Upon reflection, the manuscript's description of the exact sparsification method assumes that the unitary transformation preserves the subspace properties due to the isometry of the Grassmann manifold under unitary actions, but we agree that an explicit derivation of the post-transformation distance and its impact on index selection is missing. In the revised manuscript, we have included a proof that left-multiplication by a fixed unitary U preserves the relative Grassmann distances within the codebook, ensuring that the index selected based on the original codebook corresponds to the sparsified precoder with equivalent optimality in terms of subspace alignment. Additionally, we have added an analysis showing that the mutual information loss is negligible under the assumption of high SNR or specific channel conditions, supported by the simulation results. We believe this addresses the concern without requiring changes to the feedback mechanism, as the index mapping remains unchanged. revision: yes

  2. Referee: [Abstract] Abstract and approximate sparsification section: sparse-PCA relaxes orthonormality, and subsequent renormalization changes the effective power allocation and subspace angle, but no bound on the resulting mutual-information loss or compatibility with the existing feedback mechanism is provided, directly undermining the 'negligible performance loss' and 'no modification to feedback' assertions.

    Authors: The referee correctly identifies a gap in the analysis of the approximate sparsification approach. The sparse-PCA method does relax the orthonormality constraint, and renormalization is applied to restore unitarity, which can alter the subspace angles and power allocation. We have revised the manuscript to include a bound on the mutual-information loss using perturbation analysis on the Grassmann manifold, demonstrating that the loss is upper-bounded by a term proportional to the sparsity level, which remains small for the chosen parameters. Regarding compatibility with the feedback mechanism, the sparsified codebook is constructed to have the same cardinality and indexing as the original, so no modification to the feedback bits or protocol is needed; the receiver continues to select indices based on the original codebook design criteria, while the transmitter uses the corresponding sparsified precoder. We have clarified this in the updated text and added supporting derivations. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation relies on standard Grassmann properties and new algorithm design.

full rationale

The paper formulates sparsification on the Grassmann manifold using two explicit approaches (unitary transformation and sparse PCA) integrated into a design algorithm. No equations or claims reduce the PAPR reduction or rate preservation to fitted parameters, self-definitions, or self-citation chains by construction. The feedback compatibility is asserted as a direct consequence of operating on the manifold without index modification, and performance statements are presented as outcomes of the proposed method rather than tautological inputs. Standard manifold facts are invoked without load-bearing self-citations that would collapse the argument.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the domain assumption that precoders lie on the Grassmann manifold and that sparsification can be performed without rate loss; no free parameters or invented entities are identifiable from the abstract alone.

axioms (1)
  • domain assumption Precoder matrices lie on the Grassmann manifold
    Explicitly invoked in the abstract as the basis for formulating the sparsification problem.

pith-pipeline@v0.9.0 · 5416 in / 1228 out tokens · 48002 ms · 2026-05-10T02:09:31.394365+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

119 extracted references · 119 canonical work pages

  1. [1]

    Information and Inference: A Journal of the IMA , volume =

    Statistical Characterization of the Chordal Product Determinant of. Information and Inference: A Journal of the IMA , volume =

    work page

  2. [2]

    IEEE Transactions on Information Theory , volume =

    The Capacity of Discrete-Time Memoryless. IEEE Transactions on Information Theory , volume =

    work page

  3. [3]

    Telecommunication Systems , volume =

    Impact of the Power Amplifier on the Performance of the Single Carrier Frequency Division Multiple Access System , author =. Telecommunication Systems , volume =

    work page

  4. [4]

    Statistical Characterization of the Chordal Product Determinant of

    work page

  5. [5]

    Information and Inference: A journal of the IMA , volume =

    Statistical Characterization of the Chordal Product Determinant of. Information and Inference: A journal of the IMA , volume =

    work page

  6. [6]

    IEEE Transactions on Information Theory , volume =

    Constrained. IEEE Transactions on Information Theory , volume =

    work page

  7. [7]

    and Karystinos, George N

    Asteris, Megasthenis and Papailiopoulos, Dimitris S. and Karystinos, George N. , journal=. The Sparse Principal Component of a Constant-Rank Matrix , year=

    work page

  8. [8]

    , title =

    Ayach, Omar El and Rajagopal, Sridhar and Abu-Surra, Shadi and Pi, Zhouyue and Heath, Robert W. , title =. IEEE Transactions on Wireless Communications , volume =

    work page

  9. [9]

    The Structure of Dual

    Beelen, Peter and Pi. The Structure of Dual. Designs, Codes and Cryptography , volume =

    work page

  10. [10]

    , year = 2024, month = feb, journal =

    Bendokat, Thomas and Zimmermann, Ralf and Absil, P. , year = 2024, month = feb, journal =. A

    work page 2024

  11. [11]

    2008 , volume=

    Berardinelli, Gilberto and Ruiz de Temino, Luis Angel Maestro and Frattasi, Simone and Rahman, Muhammad Imadur and Mogensen, Preben , journal=. 2008 , volume=

    work page 2008

  12. [12]

    Berardinelli and Ruiz de Temino, Luis Angel Maestro and S

    G. Berardinelli and Ruiz de Temino, Luis Angel Maestro and S. Frattasi and T. B. S. On the feasibility of precoded single-user. Journal of Communications , volume =

    work page

  13. [13]

    , year = 2020, month = may, number =

    Bhogi, Keerthana and Saha, Chiranjib and Dhillon, Harpreet S. , year = 2020, month = may, number =. Learning on a

    work page 2020

  14. [14]

    and Varanasi, M.K

    Brehler, M. and Varanasi, M.K. , year = 2001, month = sep, journal =. Asymptotic Error Probability Analysis of Quadratic Receivers in

    work page 2001

  15. [15]

    Effects of the

    Chang, Xiao-Wen and Wen, Jinming and Xie, Xiaohu , year = 2014, month = jun, number =. Effects of the

    work page 2014

  16. [16]

    Design of Three-Dimensional Constellations for Wireless Communication Systems , booktitle =

    Chen, Bo and Jiang, Ming , year = 2015, month = jun, pages =. Design of Three-Dimensional Constellations for Wireless Communication Systems , booktitle =

    work page 2015

  17. [17]

    Performance Tradeoffs between Maximum Ratio Transmission and Switched-Transmit Diversity , booktitle =

    work page

  18. [18]

    Colman, Geoffrey W. K. and Gohary, Ramy H. and. Quasi-. IEEE Transactions on Wireless Communications , volume =

    work page

  19. [19]

    and Hardin, Ronald H

    Conway, John H. and Hardin, Ronald H. and Sloane, Neil J. A. , year = 1996, month = jan, journal =. Packing Lines, Planes, Etc.: Packings in

    work page 1996

  20. [20]

    Union Bound Minimization Approach for Designing

    Cuevas, Diego and. Union Bound Minimization Approach for Designing. IEEE Transactions on Communications , volume =

    work page

  21. [21]

    Constellations on the

    Cuevas, Diego and. Constellations on the. IEEE Transactions on Wireless Communications , volume =

    work page

  22. [22]

    A Measure Preserving Mapping for Structured

    Cuevas, Diego and Álvarez-Vizoso, Javier and Beltran, Carlos and Santamaria, Ignacio and Tucek, Vit and Peters, Gunnar , booktitle=. A Measure Preserving Mapping for Structured. 2022 , month=

    work page 2022

  23. [23]

    Journal of Algebra Combinatorics Discrete Structures and Applications , volume =

    A New Construction of Anticode-Optimal Grassmannian Codes , author =. Journal of Algebra Combinatorics Discrete Structures and Applications , volume =

    work page

  24. [24]

    Analysis of Transmit-Receive Diversity in Rayleigh Fading , author =

    work page

  25. [25]

    Annals of the Institute of Statistical Mathematics , volume =

    The Complex Multinormal Distribution, Quadratic Forms in Complex Random Vectors and an Omnibus Goodness-of-Fit Test for the Complex Normal Distribution , author =. Annals of the Institute of Statistical Mathematics , volume =

    work page

  26. [26]

    and Seddik, Karim G

    Elmossallamy, Mohamed A. and Seddik, Karim G. and Gohary, Ramy H. , year = 2019, month = jan, journal =. Multi-Resolution Multicasting Using

    work page 2019

  27. [27]

    Boosting Spectral Efficiency with Data-Carrying Reference Signals on the

    Endo, Naoki and Iimori, Hiroki and Pradhan, Chandan and Malomsoky, Szabolcs and Ishikawa, Naoki , year = 2024, month = aug, journal =. Boosting Spectral Efficiency with Data-Carrying Reference Signals on the

    work page 2024

  28. [28]

    A New Construction for Constant Weight Codes , author =

    work page

  29. [29]

    Blind Compressed Sensing , author =

    work page

  30. [30]

    and Davidson, Timothy N

    Gohary, Ramy H. and Davidson, Timothy N. , year = 2009, month = mar, journal =. Noncoherent

    work page 2009

  31. [31]

    and Yanikomeroglu, Halim , year = 2019, month = mar, journal =

    Gohary, Ramy H. and Yanikomeroglu, Halim , year = 2019, month = mar, journal =. Noncoherent

    work page 2019

  32. [32]

    , year = 1996, pages =

    Grover, Lov K. , year = 1996, pages =. A Fast Quantum Mechanical Algorithm for Database Search , booktitle =

    work page 1996

  33. [33]

    IEEE Transactions on Wireless Communications , volume =

    Time-Frequency Domain Non-Orthogonal Multiple Access for Power Efficient Communications , author =. IEEE Transactions on Wireless Communications , volume =

    work page

  34. [34]

    and Salzmann, Mathieu and Jayasumana, Sadeep and Hartley, Richard and Li, Hongdong , editor =

    Harandi, Mehrtash T. and Salzmann, Mathieu and Jayasumana, Sadeep and Hartley, Richard and Li, Hongdong , editor =. Expanding the. Computer

    work page

  35. [35]

    and Paulraj, A.J

    Heath, R.W. and Paulraj, A.J. , year = 2002, month = oct, journal =. Linear Dispersion Codes for

    work page 2002

  36. [36]

    IEEE Transactions on Communications , volume =

    Differential Unitary Space-Time Modulation , author =. IEEE Transactions on Communications , volume =

    work page

  37. [37]

    IEEE Transactions on Information Theory , volume =

    Systematic Design of Unitary Space-Time Constellations , author =. IEEE Transactions on Information Theory , volume =

    work page

  38. [38]

    and Marzetta, T.L

    Hochwald, B.M. and Marzetta, T.L. , year = 2000, month = mar, journal =. Unitary Space-Time Modulation for Multiple-Antenna Communications in

    work page 2000

  39. [39]

    Three Lectures on Quiver

    Irelli, Giovanni Cerulli , year = 2020, month = mar, number =. Three Lectures on Quiver

    work page 2020

  40. [40]

    Single- and

    Ishikawa, Naoki and Sugiura, Shinya , year = 2014, month = may, pages =. Single- and. 2014

    work page 2014

  41. [41]

    Ishikawa, Naoki and Sugiura, Shinya , year = 2014, month = aug, journal =. Unified

    work page 2014

  42. [42]

    Subcarrier-Index Modulation Aided

    Ishikawa, Naoki and Sugiura, Shinya and Hanzo, Lajos , year = 2016, journal =. Subcarrier-Index Modulation Aided

    work page 2016

  43. [43]

    50 Years of Permutation, Spatial and Index Modulation: From Classic

    Ishikawa, Naoki and Sugiura, Shinya and Hanzo, Lajos , year = 2018, journal =. 50 Years of Permutation, Spatial and Index Modulation: From Classic

    work page 2018

  44. [44]

    Heath , year = 2025, month = jun, number =

    Ishikawa, Naoki and de Abreu, Giuseppe Thadeu Freitas and Popovski, Petar and Jr, Robert W. Heath , year = 2025, month = jun, number =. Quantum-

    work page 2025

  45. [45]

    Space-, Time-, and Frequency-Domain Permutation Modulation Designed for Microwave and Optical Wireless Communications , author =

    work page

  46. [46]

    IEEE Transactions on Wireless Communications , volume =

    A Joint-Channel Diagonalization for Multiuser. IEEE Transactions on Wireless Communications , volume =

    work page

  47. [47]

    and Belfiore, J.-C

    Kammoun, I. and Belfiore, J.-C. , year = 2003, month = nov, journal =. A New Family of

    work page 2003

  48. [48]

    The geometry of algorithms with orthogonality constraints,

    Edelman, Alan and Arias, Tom\'. The Geometry of Algorithms with Orthogonality Constraints , year =. doi:10.1137/S0895479895290954 , journal =

    work page doi:10.1137/s0895479895290954

  49. [49]

    and Belfiore, Jean-Claude , year = 2007, month = oct, journal =

    Kammoun, Ines and Cipriano, Antonio M. and Belfiore, Jean-Claude , year = 2007, month = oct, journal =. Non-Coherent Codes over the

    work page 2007

  50. [50]

    Maximizing Spectrum Efficiency of Data-Carrying Reference Signals via Bayesian Optimization , year=

    Kato, Taiki and Iimori, Hiroki and Pradhan, Chandan and Malomsoky, Szabolcs and Ishikawa, Naoki , journal=. Maximizing Spectrum Efficiency of Data-Carrying Reference Signals via Bayesian Optimization , year=

    work page

  51. [51]

    R. P. Brent and P. Zimmermann , title =

    work page

  52. [52]

    Kimura, Gen , year = 2003, month = aug, journal =. The

    work page 2003

  53. [53]

    Konishi, Tatsumi and Nakano, Hiroyuki and Yano, Yoshikazu and Aoki, Michihiro , year = 2022, month = oct, journal =. Novel

    work page 2022

  54. [54]

    , year = 2016, month = jun, journal =

    Lee, Junho and Gil, Gye and Lee, Yong H. , year = 2016, month = jun, journal =. Channel Estimation via Orthogonal Matching Pursuit for Hybrid

    work page 2016

  55. [55]

    Liu, Peng and Springer, Andreas , year = 2015, month = apr, journal =. Space

    work page 2015

  56. [56]

    Peak-to-

    Liu, Xiaoran and Zhang, Lei and Xiong, Jun and Zhang, Xiaoying and Zhou, Li and Wei, Jibo , year = 2020, month = feb, journal =. Peak-to-

    work page 2020

  57. [57]

    Topics in Cohomological Studies of Algebraic Varieties: Impanga Lecture Notes , publisher =

    Michel Brion , title =. Topics in Cohomological Studies of Algebraic Varieties: Impanga Lecture Notes , publisher =. 2005 , doi =

    work page 2005

  58. [58]

    Liu, Gang and Deng, Honggui and Yang, Kai and Zhu, Zaoxing and Liu, Jitai and Dong, Hu , year = 2021, month = apr, journal =. A

    work page 2021

  59. [59]

    IEEE Transactions on Information Theory , volume =

    Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels , author =. IEEE Transactions on Information Theory , volume =

    work page

  60. [60]

    Schubert Decompositions for Quiver

    Lorscheid, Oliver , year = 2015, month = sep, journal =. Schubert Decompositions for Quiver

    work page 2015

  61. [61]

    IEEE Transactions on Information Theory , volume =

    Grassmannian Beamforming for Multiple-Input Multiple-Output Wireless Systems , author =. IEEE Transactions on Information Theory , volume =

    work page

  62. [62]

    IEEE Transactions on Information Theory , volume =

    Limited Feedback Unitary Precoding for Spatial Multiplexing Systems , author =. IEEE Transactions on Information Theory , volume =

    work page

  63. [63]

    IEEE Journal on Selected Areas in Communications , volume =

    An Overview of Limited Feedback in Wireless Communication Systems , author =. IEEE Journal on Selected Areas in Communications , volume =

    work page

  64. [64]

    Ma, Xiaoyan and Guo, Shuaishuai and Zhang, Haixia and Fang, Yuguang and Yuan, Dongfeng , year = 2021, month = may, journal =. Joint

    work page 2021

  65. [65]

    An Irregular Tiled Array Technique for Massive

    Ma, Yankai and Yang, Feng and Chen, Kejin and Yang, Shiwen and Chen, Yikai and Qu, Shi-Wei and Hu, Jun , year = 2022, month = jun, journal =. An Irregular Tiled Array Technique for Massive

    work page 2022

  66. [66]

    Error Correction Coding: Mathematical Methods and Algorithms , author =

    work page

  67. [67]

    Cube-Split: A Structured

    Ngo, Khachoang and Decurninge, Alexis and Guillaud, Maxime and Yang, Sheng , year = 2020, month = jun, journal=. Cube-Split: A Structured

    work page 2020

  68. [68]

    Joint Constellation Design for Noncoherent

    Ngo, Khachoang and Yang, Sheng and Guillaud, Maxime and Decurninge, Alexis , year = 2022, month = jan, journal =. Joint Constellation Design for Noncoherent

    work page 2022

  69. [69]

    Ngo, Khac-Hoang and Yang, Sheng and Guillaud, Maxime and Decurninge, Alexis , year = 2022, month = jul, number =. Joint

    work page 2022

  70. [70]

    Noncoherent

    Ngo, Khachoang and Cuevas, Diego and Gil, Ruben de Miguel and Baeza, Victor Monzon and Armada, Ana Garcia and Santamaria, Ignacio , year =. Noncoherent. IEEE Open Journal of Vehicular Technology , volume =

    work page

  71. [71]

    Multi-User Detection Based on Expectation Propagation for the Non-Coherent

    Ngo, KhacHoang and Guillaud, Maxime and Decurninge, Alexis and Yang, Sheng and Schniter, Philip , journal=. Multi-User Detection Based on Expectation Propagation for the Non-Coherent. 2020 , volume=

    work page 2020

  72. [72]

    and Imai, H

    Ochiai, H. and Imai, H. , year = 2001, month = feb, journal =. On the Distribution of the Peak-to-Average Power Ratio in

    work page 2001

  73. [73]

    On Instantaneous Power Distributions of Single-Carrier

    Ochiai, Hideki , year = 2012, month = apr, journal =. On Instantaneous Power Distributions of Single-Carrier

    work page 2012

  74. [74]

    Statistical Distributions of Instantaneous Power and Peak-to-Average Power Ratio for Single-Carrier

    Ochiai, Hideki , year = 2013, month = sep, journal =. Statistical Distributions of Instantaneous Power and Peak-to-Average Power Ratio for Single-Carrier

    work page 2013

  75. [75]

    IEEE Transactions on Communications , volume =

    Massive. IEEE Transactions on Communications , volume =

    work page

  76. [76]

    IEEE Signal Processing Magazine , volume =

    Sparse Representation for Wireless Communications: A Compressive Sensing Approach , author =. IEEE Signal Processing Magazine , volume =

    work page

  77. [77]

    Journal of Mathematical Physics , volume =

    Symmetric Informationally Complete Quantum Measurements , author =. Journal of Mathematical Physics , volume =

    work page

  78. [78]

    Grassmannian Product Codebooks for Limited Feedback Massive

    Schwarz, Stefan and Rupp, Markus and Wesemann, Stefan , year = 2019, month = sep, journal =. Grassmannian Product Codebooks for Limited Feedback Massive

    work page 2019

  79. [79]

    Scott, A. J. and Grassl, M. , year = 2010, month = apr, journal =

    work page 2010

  80. [80]

    Shi, Hailong and Zhang, Hao and Li, Gang and Wang, Xiqin , year = 2014, month = feb, number =. Stable

    work page 2014

Showing first 80 references.