Reduced complexity FSD algorithm based on noise variance
Автор: Xinyu Mao, Shubo Ren, Haige Xiang
Журнал: International Journal of Computer Network and Information Security(IJCNIS) @ijcnis
Статья в выпуске: 2 vol.2, 2010 года.
Бесплатный доступ
Multiple-input multiple-output (MIMO) system has very high spectrum efficiency. However, detection is a major challenge for the utilization of MIMO system. But even the fixed sphere decoding (FSD), which is known for its simplicity in calculation, requests too much computation in high order modulation and large number antenna system, especially for mobile battery-operated devices. In this paper, a reduced FSD algorithm is proposed to simplify the calculation complexity of the FSD while maintaining the performance at the same time. Simulation results show the effect of the proposed algorithm. Especially the results in a 4×4 64QAM system show that up to 81.2% calculation can be saved while the performance drop is less than 0.1dB when SNR=30.
Multiple-input multiple-out (MIMO) systems, fixed sphere decoding (FSD), sphere decoding (SD)
Короткий адрес: https://sciup.org/15010989
IDR: 15010989
Список литературы Reduced complexity FSD algorithm based on noise variance
- A. Paulraj, D. Gore, R. Nabar, and H. Bolcskei, “An overview of MIMO communications - a key to gigabit wireless,” Proceedings of the IEEE, vol. 92, no. 2, pp. 198-218, 2004.
- G. Golden, C. Foschini, R. Valenzuela, and P. Wolniansky, “Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture,” Electronics Letters, vol. 35, no. 1, pp. 14-16, 1999.
- Xu Zhu and R. Murch, “Performance analysis of maximum likelihood detection in a MIMO antenna system,” IEEE Transactions on Communications, vol. 50, no. 2, pp. 187-191, Feb. 2002.
- E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” Information Theory, IEEE Transactions on, vol. 45, no. 5, pp. 1639-1642, 1999.
- A. Murugan, H. El Gamal, M. Damen, and G. Caire, “A unified framework for tree search decoding: rediscovering the sequential decoder,” Information Theory, IEEE Transactions on, vol. 52, no. 3, pp. 933-953, 2006.
- Kwan-wai Wong, Chi-ying Tsui, R. Cheng, and Wai-ho Mow, “A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels,” in 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), pp. III-273-III-276.
- L. G. Barbero and J. S. Thompson, “A Fixed-Complexity MIMO Detector Based on the Complex Sphere Decoder,” in 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, pp. 1-5, 2006.
- L. Barbero and J. Thompson, “Fixing the Complexity of the Sphere Decoder for MIMO Detection,” Wireless Communications, IEEE Transactions on, vol. 7, no. 6, pp. 2131-2142, 2008.
- X. G. Dai, S. W. Cheung, and T. I. Yuk, “Simplified ordering for fixed-complexity sphere decoder,” in Proceedings of the 6th International Wireless Communications and Mobile Computing Conference on ZZZ - IWCMC '10, p. 804, 2010.
- K. Lee and B. Daneshrad, “Reduced complexity two-stage approximate sorting Fixed Complexity Sphere Decoder with real-valued lattice formulation for MIMO system,” in Military Communications Conference, 2008. MILCOM 2008. IEEE, pp. 1-7, 2008.
- Cong Xiong, Xin Zhang, Kai Wu, and Dacheng Yang, “A simplified fixed-complexity sphere decoder for V-BLAST systems,” Communications Letters, IEEE, vol. 13, no. 8, pp. 582-584, 2009.
- X. Wu, J. S. Thompson, and A. M. Wallace, “An improved sphere decoding scheme for mimo systems using an adaptive statistical threshold,” 2009.
- X. Wu and J. Thompson, “Accelerated sphere decoding for multipleinput multiple-output systems using an adaptive statistical threshold,” Signal Processing, IET, vol. 3, no. 6, pp. 433-444, 2009.
