Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.02515 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910038970335232 |
|---|---|
| author | Asano, Joe Hama, Yuto Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki |
| author_facet | Asano, Joe Hama, Yuto Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki |
| contents | 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 complexity of precoder multiplication, and low storage cost, while demonstrating performance comparable to the optimal codebook. Specifically, we introduce a method for constructing codebooks based on Schubert cell decomposition on the Grassmann manifold. Designing an optimal Grassmannian precoding codebook generally requires high computational complexity. In the proposed approach, by exploiting its sparsity, the objective function can be simplified, and the search space can also be significantly reduced compared to state-of-the-art codebooks. Numerical simulations in uplink systems demonstrate that the proposed sparse codebook asymptotically approaches the optimal codebook and outperforms the codebook currently adopted in 5G NR, in terms of achievable rate under uncorrelated Rayleigh fading channels, while maintaining substantially lower PAPR than conventional dense designs. These results confirm that the proposed sparse codebook can be a practical and power-efficient alternative to conventional codebooks for a wide range of uplink transmission scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_02515 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low-Complexity and Power-Efficient Precoding Codebook Design on Sparse Grassmannian Asano, Joe Hama, Yuto Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki Signal Processing 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 complexity of precoder multiplication, and low storage cost, while demonstrating performance comparable to the optimal codebook. Specifically, we introduce a method for constructing codebooks based on Schubert cell decomposition on the Grassmann manifold. Designing an optimal Grassmannian precoding codebook generally requires high computational complexity. In the proposed approach, by exploiting its sparsity, the objective function can be simplified, and the search space can also be significantly reduced compared to state-of-the-art codebooks. Numerical simulations in uplink systems demonstrate that the proposed sparse codebook asymptotically approaches the optimal codebook and outperforms the codebook currently adopted in 5G NR, in terms of achievable rate under uncorrelated Rayleigh fading channels, while maintaining substantially lower PAPR than conventional dense designs. These results confirm that the proposed sparse codebook can be a practical and power-efficient alternative to conventional codebooks for a wide range of uplink transmission scenarios. |
| title | Low-Complexity and Power-Efficient Precoding Codebook Design on Sparse Grassmannian |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2603.02515 |