Browse > Article

Path Metric Comparison-based Adaptive QRD-M Algorithm for MUHO Systems  

Kim, Bong-Seok (영남대학교 정보통신공학과 광대역무선통신 연구실)
Kim, Han-Nah (영남대학교 정보통신공학과 광대역무선통신 연구실)
Choi, Kwon-Hue (영남대학교 정보통신공학과 광대역무선통신 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.6C, 2008 , pp. 487-497 More about this Journal
Abstract
This paper proposes a new adaptive QRD-M algorithm for MIMO systems. The proposed scheme controls the number of survivor paths,0 based on the channel condition at each layer. The original QRD-M algorithm used fixed M at each layer and it needs large M to achieve near-MLD (maximum-likelihood detection) performance. However, using the large M increases the computation complexity. In this paper, we further effectively control M by employing the channel indicator which includes not only the channel gain, but also instantaneous noise information without necessity of SNR measurement. We found that the ratio of the minimum path metric to the second minimum is good reliability indicator for the channel condition. By adaptively changing M based on this ratio, the proposed scheme effectively achieves near MLD performance and computation complexity of the proposed scheme is significantly smaller than the conventional QRD-M algorithms.
Keywords
MIMO; QRD-M; M-algorithm; tree-search; Low computation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. Viterbo and J. Boutros, "A Universal Lattice Decoder for Fading Channels," IEEE Trans. Inform. Theory, Vol.45, pp. 1639-1642, July 1999   DOI   ScienceOn
2 H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM MIMO Multiplexing," IEEE J. Sel. Areas Commun., Vol.24, No.6, pp.1130-1140, June 2006   DOI   ScienceOn
3 Chin, W.H."QRD Based Tree Search Data Detection for MIMO Communication Systems", Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st
4 Mohamed Oussama Damen, Hesham El Gamal and Giuseppe Caire, "On Maximum-Likelihood Detection and the Search for the Closest Lattice Point," IEEE Trans. Inform. Theory, Vol.49, pp.2389-2402, Oct. 2003   DOI   ScienceOn
5 B. Kim, K. Choi "Low complexity QRD-M Algorithm Based on Limited search Area for MIMO Systems", to appear in VTC 2008 spring, http://bwc.yu.ac.kr/110408.pdf
6 K.J. Kim, J. Yue. R.A, Iltis J.D.Gibson IEEE "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMO-OFDM Systems" Transactions on wireless communications, Vol.4, No.2, pp. 710-721, March 2005   DOI   ScienceOn
7 J. Yin, H.N Lee, M. Ahmed, B.Ryu and Lewis Peterson, "Iterative MMSE-Sphere List Detection and Graph Decoding MIMO OFDM Transceiver," IEEE Vehicular Technology Conference, May 2004
8 C. Jankiraman Space-Time codes and MIMO systems, Artech House, 2004, ISBN-1-58053-865-7
9 Joakim Jalden and Bjorn Ottersten, "An Exponential Lower Bound on the Expected Complexity of Sphere Decoding," IEEE International Conference on Acoustics, Speech and Signal Processing, May 2004
10 Wanlun Zhao and Georgios B. Giannakis, "Sphere Decoding Algorithms With Improved Radius Search" IEEE Transactions on Communications, Vol.53, No.7, JULY 2005
11 J. Kim, J. Kang and C. Lee, "An Adaptive K-best Detection Algorithm for MIMO Systems", Journal of The Institute of Electronic Engineers of Korea, Vol.43-TC, No.10, pp1-7, Oct 2006
12 Wei Peng, Shanodan Ma, Tung Sang Ng, and Jiang Zhou Wang "Adaptive QRD-M Detection with Variable Number of Surviving Paths for MIMO Systems", Communications and Information Technologies, 2007. ISCIT '07, Oct 2007