pith. sign in

arxiv: 2605.04545 · v1 · submitted 2026-05-06 · 💻 cs.IT · eess.SP· math.IT

Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimensional Grassmannian Constellation

Kotaro Shigenaga , Hiroki Iimori , Yuto Hama , Chandan Pradhan , Szabolcs Malomsoky , Naoki Ishikawa This is my paper

Pith reviewed 2026-05-08 17:05 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT
keywords Grassmannian constellationBloch spherenoncoherent detectionsphere packingconstellation constructionlow complexity detectorRayleigh fading channel
0
0 comments X

The pith

Mapping Grassmannian constellation design to the Bloch sphere yields packings that reach or approach the theoretical maximum minimum distance, paired with simple detectors.

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

Grassmannian constellations can achieve high capacity in noncoherent Rayleigh fading channels at high SNR, but building good ones and detecting them efficiently has been difficult. This paper maps the problem of placing one-dimensional subspaces in two-dimensional space to packing points on the Bloch sphere, where the relevant distance becomes ordinary Euclidean distance. Using this, the authors create an S-Opt constellation that matches the best known sphere-packing bound for several sizes and a Z-Opt version that stacks polygons to get close for more sizes. They also give detectors whose complexity grows only linearly with the number of receive antennas and that perform as well as the much slower optimal detector. If these constructions work as claimed, they make noncoherent communication more practical for systems with many antennas.

Core claim

By establishing that chordal distance on the Grassmann manifold is proportional to Euclidean distance on the Bloch sphere, the paper derives an upper bound from the Fejes-Tóth sphere-packing result. The S-Opt construction attains this bound for the packings considered, while the Z-Opt construction, formed by stacking regular polygons, approaches the bound for a range of constellation sizes. Both proposed detectors achieve identical error performance to the generalized likelihood ratio test detector while reducing computational complexity.

What carries the argument

The proportionality between chordal distance on the Grassmann manifold and Euclidean distance on the Bloch sphere, which allows direct use of sphere-packing solutions for constellation construction and simplified detection rules.

If this is right

  • For the evaluated sizes, S-Opt constellations achieve the maximum possible minimum chordal distance.
  • Z-Opt constellations provide near-maximal minimum distances without requiring full sphere-packing optimization.
  • The S-Opt detector runs in time linear in receive antennas and logarithmic in constellation size.
  • The Z-Opt detector runs in time linear in receive antennas.
  • Both detectors match the bit error rate of the optimal GLRT detector.

Where Pith is reading between the lines

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

  • Similar distance mappings might allow optimal constructions in higher-dimensional Grassmann manifolds used in MIMO systems.
  • The regular-polygon stacking method offers a simple heuristic that could be tested on other manifolds or in three-dimensional subspaces.
  • If the detectors scale well, they could support larger constellations in fast-fading environments where coherent detection is impractical.
  • The explicit bound provides a concrete target for measuring how close any new 2D Grassmannian design comes to optimality.

Load-bearing premise

The Fejes-Tóth bound provides a tight limit on the minimum distance for the finite number of points used in these constructions, and the distance proportionality applies without approximation error.

What would settle it

Computing the actual minimum chordal distance for an S-Opt constellation of size 8 or 16 and finding it smaller than the reported upper bound, or measuring higher error rates for the Z-Opt detector than for GLRT on the same points.

Figures

Figures reproduced from arXiv: 2605.04545 by Chandan Pradhan, Hiroki Iimori, Kotaro Shigenaga, Naoki Ishikawa, Szabolcs Malomsoky, Yuto Hama.

Figure 2
Figure 2. Figure 2: Structure diagrams for B ∈ {4, 5}. The black dotted lines indicate candidate distances that may become minimal when optimizing θ. (a) B /∈ {5, 7} (b) B ∈ {5, 7} view at source ↗
Figure 3
Figure 3. Figure 3: Generalization of θ and the candidate distances that may become the minimum. be narrowed down. In view at source ↗
Figure 4
Figure 4. Figure 4: Structure diagrams for B ∈ {1, 2, 3}. closed form. The structure diagram is shown in view at source ↗
Figure 5
Figure 5. Figure 5: A low-complexity detector using the structure diagram for view at source ↗
Figure 6
Figure 6. Figure 6: Comparison of the minimum chordal distance for each constellation. view at source ↗
Figure 7
Figure 7. Figure 7: Comparison of SERs for each constellation at view at source ↗
Figure 8
Figure 8. Figure 8: SER comparison between the GLRT and S-Opt detectors at view at source ↗
Figure 9
Figure 9. Figure 9: SER comparison between the GLRT and Z-Opt detectors for the Z view at source ↗
Figure 10
Figure 10. Figure 10: Distance-metric computations per objective-function evaluation for view at source ↗
read the original abstract

Grassmannian constellations are known to achieve the capacity of noncoherent communications over Rayleigh fading channels in the high-SNR regime, yet their efficient construction remains challenging. In this paper, we propose two construction methods for Grassmannian constellations of one-dimensional subspaces in a two-dimensional space, termed S-Opt and Z-Opt, along with two low-complexity detectors. Both the construction and detection procedures are performed on the unit sphere, known as the Bloch sphere in quantum computing. We show that the chordal distance on the Grassmann manifold is proportional to the Euclidean distance on the Bloch sphere and derive a corresponding theoretical upper bound based on the Fejes--T\'oth bound on the minimum chordal distance. The S-Opt constellation is constructed from sphere-packing solutions and attains the derived upper bound for the optimal Bloch-sphere packings considered. The S-Opt detector can be applied to arbitrary Grassmannian constellations on $\mathcal{G}(2,1)$, and its time complexity scales linearly with the number of receive antennas and logarithmically with the constellation size, while yielding the same detection performance as the GLRT detector. Furthermore, based on the insight obtained through the S-Opt construction, the Z-Opt constellation is constructed by stacking regular polygons on the Bloch sphere, and its minimum chordal distance approaches the derived upper bound over the evaluated constellation sizes. The Z-Opt detector's time complexity scales linearly with the number of receive antennas, while yielding the same detection performance as the GLRT detector for Z-Opt.

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

0 major / 2 minor

Summary. The paper proposes S-Opt and Z-Opt constructions for one-dimensional Grassmannian constellations in two-dimensional complex space by mapping the problem to packings on the Bloch sphere. It establishes that the chordal distance on the Grassmann manifold is proportional to the Euclidean distance on the Bloch sphere, derives a corresponding upper bound from the Fejes-Tóth bound, shows that S-Opt attains this bound when using known optimal spherical codes, and that Z-Opt approaches the bound via explicit regular-polygon stacking. It further presents two low-complexity detectors (one applicable to arbitrary constellations on G(2,1)) whose performance matches that of the GLRT detector, with stated linear or linear-plus-logarithmic complexity scaling in the number of receive antennas and constellation size.

Significance. If the isometry, bound transfer, attainment claims, and detector equivalence hold, the work supplies concrete, near-optimal Grassmannian constellations together with practical detectors for the high-SNR noncoherent Rayleigh-fading setting. The reduction of the G(2,1) problem to spherical codes on the Bloch sphere is a clean insight that may aid both analysis and implementation; the explicit complexity scaling and GLRT equivalence are additional practical strengths.

minor comments (2)
  1. The abstract states that the Z-Opt minimum chordal distance 'approaches the derived upper bound over the evaluated constellation sizes' but does not list those sizes or reference the corresponding table/figure; adding this information would allow immediate assessment of the gap to optimality.
  2. The complexity statements (linear in receive antennas, logarithmic in constellation size for the S-Opt detector) are given only in the abstract; the main text should include explicit operation counts or pseudocode to make the scaling claims verifiable.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our work on S-Opt and Z-Opt constructions for one-dimensional Grassmannian constellations in two-dimensional space, including the Bloch-sphere mapping, chordal-distance isometry, Fejes-Tóth bound transfer, attainment claims, and the low-complexity GLRT-equivalent detectors. We are pleased with the recommendation for minor revision and will incorporate any editorial or minor technical suggestions in the revised manuscript.

Circularity Check

0 steps flagged

No significant circularity; derivation uses external bound via exact isometry

full rationale

The paper first proves an exact proportionality (isometry) between Grassmannian chordal distance and Bloch-sphere Euclidean distance, then transfers the external Fejes-Tóth bound directly as an upper bound on minimum chordal distance. S-Opt attains the bound by explicit construction from known optimal spherical codes; Z-Opt approaches it by polygon stacking informed by that construction. Detector equivalence to GLRT follows immediately from the shared inner-product metric. No step reduces to a fitted parameter renamed as prediction, no self-citation is load-bearing for the central claims, and no ansatz or uniqueness result is smuggled in from prior author work. The chain is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claims rest on the derived proportionality between chordal and Euclidean distances plus the external Fejes-Tóth bound; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption Chordal distance on the Grassmann manifold is proportional to Euclidean distance on the Bloch sphere
    Stated as a derived result used to import sphere-packing bounds.

pith-pipeline@v0.9.0 · 5609 in / 1239 out tokens · 33728 ms · 2026-05-08T17:05:25.582927+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

31 extracted references · 31 canonical work pages

  1. [1]

    Challenges toward wireless communications for high-speed railway,

    B. Ai, X. Cheng, T. K ¨urner, Z.-D. Zhong, K. Guan, R.-S. He, L. Xiong, D. W. Matolak, D. G. Michelson, and C. Briso-Rodriguez, “Challenges toward wireless communications for high-speed railway,”IEEE Trans- actions on Intelligent Transportation Systems, vol. 15, no. 5, pp. 2143– 2158, 2014

    work page 2014

  2. [2]

    TS 138.211 - V15.2.0 - 5G; NR; Physical channels and modulation (3GPP TS 38.211 version 15.2.0 Release 15),

    3GPP, “TS 138.211 - V15.2.0 - 5G; NR; Physical channels and modulation (3GPP TS 38.211 version 15.2.0 Release 15),” 2018

    work page 2018

  3. [3]

    Noncoherent MIMO signaling for block-fading channels: Approaches and challenges,

    R. H. Gohary and H. Yanikomeroglu, “Noncoherent MIMO signaling for block-fading channels: Approaches and challenges,”IEEE V ehicular Technology Magazine, vol. 14, no. 1, pp. 80–88, 2019

    work page 2019

  4. [4]

    Noncoherent mimo communications: Theoretical foundation, design approaches, and future challenges,

    K.-H. Ngo, D. Cuevas, R. de Miguel Gil, V . M. Baeza, A. G. Armada, and I. Santamaria, “Noncoherent mimo communications: Theoretical foundation, design approaches, and future challenges,” arXiv:2505.23172, 2025

    work page arXiv 2025

  5. [5]

    Information-bearing nonco- herently modulated pilots for MIMO training,

    Y . Yu, G. B. Giannakis, and N. Jindal, “Information-bearing nonco- herently modulated pilots for MIMO training,”IEEE Transactions on Information Theory, vol. 53, no. 3, pp. 1160–1168, 2007

    work page 2007

  6. [6]

    Boosting spectral efficiency with data-carrying reference signals on the Grassmann manifold,

    N. Endo, H. Iimori, C. Pradhan, S. Malomsoky, and N. Ishikawa, “Boosting spectral efficiency with data-carrying reference signals on the Grassmann manifold,”IEEE Transactions on Wireless Communications, vol. 23, no. 8, pp. 10 137–10 149, 2024

    work page 2024

  7. [7]

    Maximizing spectrum efficiency of data-carrying reference signals via Bayesian optimization,

    T. Kato, H. Iimori, C. Pradhan, S. Malomsoky, and N. Ishikawa, “Maximizing spectrum efficiency of data-carrying reference signals via Bayesian optimization,”IEEE Open Journal of the Communications Society, vol. 6, pp. 3892–3903, 2025. May 7, 2026 12

    work page 2025

  8. [8]

    Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading,

    B. M. Hochwald and T. L. Marzetta, “Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading,”IEEE Trans. Inf. Theor ., vol. 46, no. 2, pp. 543–564, 2006

    work page 2006

  9. [9]

    Differential unitary space-time mod- ulation,

    B. Hochwald and W. Sweldens, “Differential unitary space-time mod- ulation,”IEEE Transactions on Communications, vol. 48, no. 12, pp. 2041–2052, 2000

    work page 2041

  10. [10]

    A differential detection scheme for transmit diversity,

    V . Tarokh and H. Jafarkhani, “A differential detection scheme for transmit diversity,”IEEE Journal on Selected Areas in Communications, vol. 18, no. 7, pp. 1169–1174, 2000

    work page 2000

  11. [11]

    Differ- ential space-time coding dispensing with channel estimation approaches the performance of its coherent counterpart in the open-loop mas- sive MIMO-OFDM downlink,

    N. Ishikawa, R. Rajashekar, C. Xu, S. Sugiura, and L. Hanzo, “Differ- ential space-time coding dispensing with channel estimation approaches the performance of its coherent counterpart in the open-loop mas- sive MIMO-OFDM downlink,”IEEE Transactions on Communications, vol. 66, no. 12, pp. 6190–6204, 2018

    work page 2018

  12. [12]

    Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel,

    L. Zheng and D. Tse, “Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel,”IEEE Transactions on Information Theory, vol. 48, no. 2, pp. 359–383, 2002

    work page 2002

  13. [13]

    Spectrally efficient noncoherent commu- nication,

    D. Warrier and U. Madhow, “Spectrally efficient noncoherent commu- nication,”IEEE Transactions on Information Theory, vol. 48, no. 3, pp. 651–668, 2002

    work page 2002

  14. [14]

    Noncoherent MIMO communication: Grassmannian constellations and efficient detection,

    R. H. Gohary and T. N. Davidson, “Noncoherent MIMO communication: Grassmannian constellations and efficient detection,”IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 1176–1205, 2009

    work page 2009

  15. [15]

    Cube-split: A structured Grassmannian constellation for non-coherent SIMO commu- nications,

    K.-H. Ngo, A. Decurninge, M. Guillaud, and S. Yang, “Cube-split: A structured Grassmannian constellation for non-coherent SIMO commu- nications,”IEEE Transactions on Wireless Communications, vol. 19, no. 3, pp. 1948–1964, 2020

    work page 1948

  16. [16]

    Union bound minimization approach for designing Grassmannian constellations,

    D. Cuevas, J. ´Alvarez-Vizoso, C. Beltr ´an, I. Santamaria, V . Tu ˇcek, and G. Peters, “Union bound minimization approach for designing Grassmannian constellations,”IEEE Transactions on Communications, vol. 71, no. 4, pp. 1940–1952, 2023

    work page 1940

  17. [17]

    Multi-user detection based on expectation propagation for the non- coherent SIMO multiple access channel,

    K.-H. Ngo, M. Guillaud, A. Decurninge, S. Yang, and P. Schniter, “Multi-user detection based on expectation propagation for the non- coherent SIMO multiple access channel,”IEEE Transactions on Wireless Communications, vol. 19, no. 9, pp. 6145–6161, 2020

    work page 2020

  18. [18]

    A new family of Grassmann space-time codes for non-coherent MIMO systems,

    I. Kammoun and J.-C. Belfiore, “A new family of Grassmann space-time codes for non-coherent MIMO systems,”IEEE Communications Letters, vol. 7, no. 11, pp. 528–530, 2003

    work page 2003

  19. [19]

    Non-coherent codes over the Grassmannian,

    I. Kammoun, A. M. Cipriano, and J.-C. Belfiore, “Non-coherent codes over the Grassmannian,”IEEE Transactions on Wireless Communica- tions, vol. 6, no. 10, pp. 3657–3667, 2007

    work page 2007

  20. [20]

    Constellations on the sphere with efficient encoding-decoding for noncoherent communications,

    D. Cuevas, J. ´Alvarez-Vizoso, C. Beltr ´an, I. Santamaria, V . Tuˇcek, and G. Peters, “Constellations on the sphere with efficient encoding-decoding for noncoherent communications,”IEEE Transactions on Wireless Com- munications, vol. 23, no. 3, pp. 1886–1898, 2024

    work page 2024

  21. [21]

    A noncoherent space-time code from quantum error correc- tion,

    S. A. Lanham, T. C. Cuvelier, C. Ostrove, B. L. Cour, G. Ott, and R. Heath, “A noncoherent space-time code from quantum error correc- tion,” inProc. 53rd Annu. Conf. Inf. Sci. Syst. (CISS), Mar. 2019, pp. 1–6

    work page 2019

  22. [22]

    Quan- tum codes in classical communication: A space-time block code from quantum error correction,

    T. C. Cuvelier, S. A. Lanham, B. R. L. Cour, and R. W. Heath, “Quan- tum codes in classical communication: A space-time block code from quantum error correction,”IEEE Open Journal of the Communications Society, vol. 2, pp. 2383–2412, 2021

    work page 2021

  23. [23]

    Kerdock codes for limited feedback precoded MIMO systems,

    T. Inoue and R. W. Heath, “Kerdock codes for limited feedback precoded MIMO systems,”IEEE Transactions on Signal Processing, vol. 57, no. 9, pp. 3711–3716, 2009

    work page 2009

  24. [24]

    A family of optimal packings in grassmannian manifolds,

    P. W. Shor and N. J. A. Sloane, “A family of optimal packings in grassmannian manifolds,”arXiv:math/0208003, 2002

    work page arXiv 2002

  25. [25]

    Quantum-accelerated wireless communications: Concepts, connections, and implications,

    N. Ishikawa, G. T. F. de Abreu, P. Popovski, and R. W. Heath, “Quantum-accelerated wireless communications: Concepts, connections, and implications,”IEEE Communications Magazine, pp. 1–7, 2025

    work page 2025

  26. [26]

    Manopt, a Matlab toolbox for optimization on manifolds,

    N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre, “Manopt, a Matlab toolbox for optimization on manifolds,”Journal of Machine Learning Research, vol. 15, no. 42, pp. 1455–1459, 2014

    work page 2014

  27. [27]

    Pymanopt: A Python toolbox for optimization on manifolds using automatic differentiation,

    J. Townsend, N. Koep, and S. Weichwald, “Pymanopt: A Python toolbox for optimization on manifolds using automatic differentiation,”Journal of Machine Learning Research, vol. 17, no. 137, pp. 1–5, 2016

    work page 2016

  28. [28]

    The Tammes Problem for N = 14,

    O. R. Musin and A. S. Tarasov, “The Tammes Problem for N = 14,” Experimental Mathematics, vol. 24, no. 4, pp. 460–468, 2015

    work page 2015

  29. [29]

    Table of spherical codes,

    H. Cohn, “Table of spherical codes,” Dataset. MIT DSpace Repository, 2024, Available: https://dspace.mit.edu/handle/1721.1/153543

    work page 2024

  30. [30]

    ¨Uber eine absch¨atzung des k ¨urzesten abstandes zweier punkte eines auf einer kugelfl ¨ache liegenden punktsystems

    L. Fejes, “ ¨Uber eine absch¨atzung des k ¨urzesten abstandes zweier punkte eines auf einer kugelfl ¨ache liegenden punktsystems.”Jahresbericht der Deutschen Mathematiker-V ereinigung, vol. 53, pp. 66–68, 1943

    work page 1943

  31. [31]

    Scikit-learn: Machine learning in Python,

    F. Pedregosa, G. Varoquaux, A. Gramfort, V . Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V . Dubourg, J. Vander- plas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and ´E. Duch- esnay, “Scikit-learn: Machine learning in Python,”Journal of Machine Learning Research, vol. 12, no. 85, pp. 2825–2830, 2011

    work page 2011