Low-Complexity Soft-Output Quantum-Assisted Multiuser Detection for Direct-Sequence Spreading and Slow Subcarrier-Hopping Aided SDMA-OFDM Systems

被引:30
作者
Botsinis, Panagiotis [1 ]
Alanis, Dimitrios [1 ]
Ng, Soon Xin [1 ]
Hanzo, Lajos [1 ]
机构
[1] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
基金
欧洲研究理事会; 英国工程与自然科学研究理事会;
关键词
Ant colony optimization; computational complexity; Durr-Hoyer algorithm; Grover's quantum search algorithm; multiuser detection; orthogonal frequency division multiplexing; quantum computing; spatial division multiple access; spreading sequences; ANT-COLONY-OPTIMIZATION; MIMO-OFDM; CDMA; WIRELESS;
D O I
10.1109/ACCESS.2014.2322013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
Low-complexity suboptimal multiuser detectors (MUDs) are widely used in multiple access communication systems for separating users, since the computational complexity of the maximum likelihood (ML) detector is potentially excessive for practical implementation. Quantum computing may be invoked in the detection procedure, by exploiting its inherent parallelism for approaching the ML MUDs performance at a substantially reduced number of cost function evaluations. In this contribution, we propose a soft-output (SO) quantum-assisted MUD achieving a near-ML performance and compare it to the corresponding SO ant colony optimization MUD. We investigate rank deficient direct-sequence spreading (DSS) and slow subcarrier-hopping aided (SSCH) spatial division multiple access orthogonal frequency division multiplexing systems, where the number of users to be detected is higher than the number of receive antenna elements used. We show that for a given complexity budget, the proposed SO-Durr-Hoyer algorithm (DHA) QMUD achieves a better performance. We also propose an adaptive hybrid SO-ML/SO-DHA MUD, which adapts itself to the number of users equipped with the same spreading sequence and transmitting on the same subcarrier. Finally, we propose a DSS-based uniform SSCH scheme, which improves the system's performance by 0.5 dB at a BER of 10(-5), despite reducing the complexity required by the MUDs employed.
引用
收藏
页码:451 / 472
页数:22
相关论文
共 29 条
[1]
[Anonymous], 2011, OPTIMAL QUANTUM ALGO
[2]
Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA [J].
Botsinis, Panagiotis ;
Soon Xin Ng ;
Hanzo, Lajos .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (03) :990-1000
[3]
Quantum Search Algor thms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design [J].
Botsinis, Panagiotis ;
Ng, Soon Xin ;
Hanzo, Lajos .
IEEE ACCESS, 2013, 1 :94-122
[4]
Boyer M, 1998, FORTSCHR PHYS, V46, P493, DOI 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO
[5]
2-P
[6]
Brassard G, 1998, LECT NOTES COMPUT SC, V1443, P820, DOI 10.1007/BFb0055105
[7]
Minimum bit-error rate design for space-time equalization-based multiuser detection [J].
Chen, Sheng ;
Livingstone, Andrew ;
Hanzo, Lajos .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (05) :824-832
[8]
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[9]
Durr C, 1996, A quantum algorithm for finding the minimum
[10]
Grover L. K., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P212, DOI 10.1145/237814.237866