AFDM Chirp-Permutation-Index Modulation with Quantum-Accelerated Codebook Design
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917656369561600 |
|---|---|
| author | Rou, Hyeon Seok Yukiyoshi, Kein Mikuriya, Taku de Abreu, Giuseppe Thadeu Freitas Ishikawa, Naoki |
| author_facet | Rou, Hyeon Seok Yukiyoshi, Kein Mikuriya, Taku de Abreu, Giuseppe Thadeu Freitas Ishikawa, Naoki |
| contents | We describe a novel index modulation (IM) scheme exploiting a unique feature of the recently proposed affine frequency division multiplexing (AFDM) in doubly-dispersive (DD) channels. Dubbed AFDM chirp-permutation-index modulation (CPIM), the proposed method encodes additional information via the permutation of the discrete affine Fourier Transform (DAFT) chirp sequence, without any sacrifice of the various beneficial properties of the AFDM waveform in DD channels. The effectiveness of the proposed method is validated via simulation results leveraging a novel reduced-complexity minimum mean-squared-error (MMSE)-based maximum-likelihood (ML) detector, highlighting the gains over the classical AFDM. As part of the work two interesting problems related to optimizing AFDM-CPIM are identified: the optimal codebook design problem, over a discrete solution space of dimension $\binom{N!}{K}$, where $N$ is the number of subcarriers and $K$ is the number of codewords; and the ML detection problem whose solution space is of dimension $KM^N$, where $M$ is the constellation size. In order to alleviate the computational complexity of these problems and enable large-scale variations of AFDM-CPIM, the two problems are reformulated as a higher-order binary optimization problem and mapped to the well-known quantum Grover adaptive search (GAS) algorithm for their solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_02085 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | AFDM Chirp-Permutation-Index Modulation with Quantum-Accelerated Codebook Design Rou, Hyeon Seok Yukiyoshi, Kein Mikuriya, Taku de Abreu, Giuseppe Thadeu Freitas Ishikawa, Naoki Signal Processing We describe a novel index modulation (IM) scheme exploiting a unique feature of the recently proposed affine frequency division multiplexing (AFDM) in doubly-dispersive (DD) channels. Dubbed AFDM chirp-permutation-index modulation (CPIM), the proposed method encodes additional information via the permutation of the discrete affine Fourier Transform (DAFT) chirp sequence, without any sacrifice of the various beneficial properties of the AFDM waveform in DD channels. The effectiveness of the proposed method is validated via simulation results leveraging a novel reduced-complexity minimum mean-squared-error (MMSE)-based maximum-likelihood (ML) detector, highlighting the gains over the classical AFDM. As part of the work two interesting problems related to optimizing AFDM-CPIM are identified: the optimal codebook design problem, over a discrete solution space of dimension $\binom{N!}{K}$, where $N$ is the number of subcarriers and $K$ is the number of codewords; and the ML detection problem whose solution space is of dimension $KM^N$, where $M$ is the constellation size. In order to alleviate the computational complexity of these problems and enable large-scale variations of AFDM-CPIM, the two problems are reformulated as a higher-order binary optimization problem and mapped to the well-known quantum Grover adaptive search (GAS) algorithm for their solution. |
| title | AFDM Chirp-Permutation-Index Modulation with Quantum-Accelerated Codebook Design |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2405.02085 |