Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.07643 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916123863154688 |
|---|---|
| author | Winter, Samuel Zhang, Yangyishi Zheng, Gan Hanzo, Lajos |
| author_facet | Winter, Samuel Zhang, Yangyishi Zheng, Gan Hanzo, Lajos |
| contents | Quantum annealing (QA) is proposed for vector perturbation precoding (VPP) in multiple input multiple output (MIMO) communications systems. The mathematical framework of VPP is presented, outlining the problem formulation and the benefits of lattice reduction algorithms. Lattice reduction aided quantum vector perturbation (LRAQVP) is designed by harnessing physical quantum hardware, and the optimization of hardware parameters is discussed. We observe a 5dB gain over lattice reduction zero forcing precoding (LRZFP), which behaves similarly to a quantum annealing algorithm operating without a lattice reduction stage. The proposed algorithm is also shown to approach the performance of a sphere encoder, which exhibits an exponentially escalating complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_07643 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Lattice-Reduction Aided Vector Perturbation Precoder Relying on Quantum Annealing Winter, Samuel Zhang, Yangyishi Zheng, Gan Hanzo, Lajos Information Theory Quantum annealing (QA) is proposed for vector perturbation precoding (VPP) in multiple input multiple output (MIMO) communications systems. The mathematical framework of VPP is presented, outlining the problem formulation and the benefits of lattice reduction algorithms. Lattice reduction aided quantum vector perturbation (LRAQVP) is designed by harnessing physical quantum hardware, and the optimization of hardware parameters is discussed. We observe a 5dB gain over lattice reduction zero forcing precoding (LRZFP), which behaves similarly to a quantum annealing algorithm operating without a lattice reduction stage. The proposed algorithm is also shown to approach the performance of a sphere encoder, which exhibits an exponentially escalating complexity. |
| title | A Lattice-Reduction Aided Vector Perturbation Precoder Relying on Quantum Annealing |
| topic | Information Theory |
| url | https://arxiv.org/abs/2402.07643 |