5 citations · 9 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.IT2026
Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimensional Grassmannian Constellation
Kotaro Shigenaga, Hiroki Iimori, Yuto Hama +3
Grassmannian constellations achieve the capacity of noncoherent communications over Rayleigh fading channels at high SNR, yet their efficient construction remains challenging. In t…
eess.SP2026
Low-Complexity and Power-Efficient Precoding Codebook Design on Sparse Grassmannian
Joe Asano, Yuto Hama, Hiroki Iimori +3
We propose a sparse Grassmannian design for precoding codebooks. Due to their sparse structure, our proposed codebooks achieve low peak-to-average power ratio (PAPR), low complexit…
eess.SP2026
Sparse Grassmannian Design for Noncoherent Codes via Schubert Cell Decomposition
Joe Asano, Yuto Hama, Hiroki Iimori +3
In this paper, we propose a method for designing sparse Grassmannian codes for noncoherent multiple-input multiple-output systems. Conventional pairwise error probability formulati…