Quantum Speedup for Index Modulation

Ishikawa, Naoki

doi:10.1109/access.2021.3103207

Cited by 7 publications

(3 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As mentioned above, many IM techniques can be found in the literature [20]- [30], [33]- [42], [45]- [48] which address various issues of the problem such as integration with other functionalities (e.g. radar and/or sensing), achievable rates, decoding complexity and, of course which resource domains to exploit and under which architecture.…”

Section: System Modelmentioning

confidence: 99%

“…It can be understood that obtaining a given codebook A out of the larger set of N T P possible activation vectors is a subject of optimization, and has been addressed, for instance, under a channel diversity criterion in [45], and under a decoding complexity criterion via QC in [48].…”

Section: A Gqsm System Model and Transmitter Structurementioning

confidence: 99%

“…2) [32,32,4] UVD-GaBP (Alg. 2) [48,48,3] Fig. 10: The BER performance comparison for the ML and UVD-GaBP decoders under varying system size parameters but the approximately same decoding complexities.…”

Section: ) Iq-decoupled Vector-valued Gabp Decodermentioning

confidence: 99%

See 2 more Smart Citations

Scalable Quadrature Spatial Modulation

Rou

Abreu

Iimori

et al. 2022

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We consider quadrature spatial modulation (QSM) schemes, which achieve high spectral efficiency (SE) via the dispersion of a relatively small number P of M -ary modulated symbols over a large number of combinations of nT transmit antennas and T transmit instances. In particular, we design a new space-time block code (STBC)-based scalable QSM scheme combining high SE with maximum diversity and optimum coding gains. Deriving a closed-form expression for the optimum SE, we show that scaling the size T with nT not only is required to achieve SE optimality, but also results in further gains in bit error rate (BER) performance. Building on the latter optimal parameterization, a fully optimized scalable QSM (OS-QSM) transmitter design is then obtained by introducing a new dispersion matrix index selection algorithm that ensures even utilization of spatial-temporal resources. Finally, a new greedy boxed iterative shrinkage thresholding algorithm (GB-ISTA) QSM receiver is proposed, which exploits the inherent sparsity of QSM signals and while detecting spatially and digitally modulated bits in a greedy fashion. The resulting low complexity of the new receiver, which is linear on nT , enables the utilization of OS-QSM in systems of previously prohibitive dimensions.

show abstract

Section: System Modelmentioning

confidence: 99%

Section: A Gqsm System Model and Transmitter Structurementioning

confidence: 99%

See 1 more Smart Citation

Scalable Quadrature Spatial Modulation

Rou

Abreu

Iimori

et al. 2022

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

Quantum search algorithm for binary constant weight codes

Yukiyoshi,

Ishikawa

2024

Quantum Inf Process

View full text Add to dashboard Cite

A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this paper, we propose a quantum search algorithm for binary constant weight codes. Specifically, the search problem is formulated as a polynomial binary optimization problem and Grover adaptive search is used for providing the quadratic speedup. Focusing on the inherent structure of the problem, we derive an upper bound on the minimum of the objective function value and a lower bound on the exact number of solutions. By exploiting these two bounds, we successfully reduced the constant overhead of the algorithm, although the overall query complexity remains exponential due to the NP-complete nature of the problem. In our algebraic analysis, it was found that this proposed algorithm is capable of reducing the number of required qubits, thus enhancing the feasibility. Additionally, our simulations demonstrated that it reduces the average number of classical iterations by 63% as well as the average number of total Grover rotations by 31%. The proposed approach may be useful for other quantum search algorithms and optimization problems.

show abstract