基于量子计算方法的多址DCSK通信系统的研究

J4 ›› 2016, Vol. 33 ›› Issue (5): 566-572.

基于量子计算方法的多址DCSK通信系统的研究

李辉¹,郝晓晓²

河南理工大学物理与电子信息学院河南焦作 454000

收稿日期:2015-05-18 修回日期:2016-07-06 出版日期:2016-09-28 发布日期:2016-09-28
通讯作者: 李辉（1976-），河南新乡人，博士，教授，主要研究方向为混沌通信，多址通信，量子理论. E-mail:li20042007@163.com
基金资助:
base and cutting-edge technology research project of Henan Province(河南省基础与前沿技术研究项目，152300410103）

Multiple access DCSK communication system based on quantum computing method

LI Hui, HAO Xiao-xiao

School of physical and electronic information, Henan Polytechnic University, Jiaozuo 454000, China

Received:2015-05-18 Revised:2016-07-06 Published:2016-09-28 Online:2016-09-28

摘要/Abstract

摘要： 为了降低多用户之间的干扰问题，提出了一种新的混沌多址通信系统（多比特MA-DCSK），并设计了该系统的多用户检测算法。通过仿真实验，比较了该多比特MA-DCSK系统与可变延时MA-DCSK系统的误码率性能，证明了该系统具有更低的误码率。利用量子并行运算的特性，采用Grover量子算法解决多用户检测算法的计算复杂度，这种算法可以将复杂度从降低到。仿真结果表明，在不影响系统性能的同时，量子算法可以有效地降低计算复杂度。

关键词: 混沌通信；多比特MA-DCSK；多用户检测算法；Grover量子算法；计算复杂度

Abstract: In order to reduce the interference among multiple users, a new system (multi-bit MA-DCSK) of chaotic multiple access communication is proposed, and the multi-user detection algorithm is designed for it. Through the simulation, the bit error rate (BER) of the multi-bit MA-DCSK system is compared with the variable delay MA-DCSK (VDMA-DCSK), and the result proves the new system has lower BER. By making use of the parallelism computation characteristic of quantum, the Grover quantum algorithm is used to solve the computational complexity of the multi-user detection algorithm, and it can reduce the computational complexity from to . The simulation result shows Grover quantum algorithm can effectively reduce the computational complexity without affecting the performance of the system at the same time.

Key words: chaotic communication; Multi-bit MA-DCSK; multi-user detection algorithm; Grover quantum algorithm; computational complexity

李辉郝晓晓. 基于量子计算方法的多址DCSK通信系统的研究[J]. J4, 2016, 33(5): 566-572.

LI Hui, HAO Xiao-xiao. Multiple access DCSK communication system based on quantum computing method[J]. J4, 2016, 33(5): 566-572.

参考文献

[1] Pecora L M, Carroll T L. Synchronization in chaotic systems[J]. Phys. Rev. Lett., 1990, 64(8): 821-824.
[2] Kolumban G, Kennedy M P, Kis G. Multilevel differential chaos shift keying. Proc. International Workshop on Nonlinear Dynamics of Electronic Systems (NDES’97). Moscow, Russia, 1997, 191-196.
[3] Lau F C M, Yip M M , Tse C K. A Multiple Access Technique for Differential Chaos Shift Keying. IEEE Trans. on Circ. Sys. I, 2001, 49(1):96-104.
[4] Lau F C M, Cheong K Y, Tse C K. A Permutation-based Multiple Access DCSK System. International Symposium on Nonlinear Theory and its Applications. 2002:512-514
[5] Li H, Dai X C, Xu P X. A CDMA Based Multiple-Access Scheme for DCSK. IEEE 6th CAS Symp. on Emerging Technologies: Mobile and Wireless Comm. 2004:313-31
[6 ] Wang M, Chou H B, Wu S X. Improvement of FM - DCSK: a new modulate way of chaotic communication. Journal of communication. 2003, 8(2)：92-96
[7] Kolumban G, Jako Z, Kennedy M P. Enhanced versions of DCSK and FM-DCSK data transmission systems. Proc. IEEE International Symposium on Circuits and Systems(ISCAS’99). Orland, USA, 1999, 475-478
[8] Botsinis P, Soon X N, Hanzo L. "Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA." IEEE Transactions on Communications. 2014, 62(3): 990-1000.
[9] Kolumban G, Vizvari G K, Schwarz W, Abel A. Differential chaos shift keying: A robust coding for chaos communication. Proc. International Workshop on Nonlinear Dynamics of Electronic Systems. Seville, Spain, 1996, 87-92
[10] F. C. M. Lau, M. M. Yip, C. K. Tse, and S. F. Hau,“A multiple access technique for differential chaos shift keying,” IEEE Trans. on Circ. Sys. I, 2002, 49(1): 96–104.
[11] Verdu S. Multiuser Detection. Cambridge University Press，1998.
[12] Grover L K. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. , 1997, 79(2):325-328.
[13] Grover L K. A fast quantum mechanical algorithm for database search[C]//Proc. of the 28th Annual ACM Symposium on the Theory of Computing. New York, USA: ACM Press, 1996.6: 212-219.