A Reduced-Complexity Tree Search Detection Algorithm for MIMO Systems

In this correspondence, we propose a simplified QR-decomposition-M algorithm for coded multiple-input multiple-output systems based on the idea of selective branch extension. The proposed algorithm results in significant complexity reductions without observable performance losses, especially for large modulation orders where complexity reduction is most important.

[1]  Kazuaki Murakami,et al.  Reducing power consumption of instruction ROMs by exploiting instruction frequency , 2002, Asia-Pacific Conference on Circuits and Systems.

[2]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[3]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[4]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[5]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

[6]  Chang-Jun Ahn,et al.  Parallel detection algorithm using multiple QR decompositions with permuted channel matrix for SDM/OFDM , 2008, 2008 3rd International Symposium on Wireless Pervasive Computing.

[7]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[8]  Lars Wanhammar,et al.  A hardware efficient control of memory addressing for high-performance FFT processors , 2000, IEEE Trans. Signal Process..

[9]  Ieee Standards Board.  IEEE Standard for local and metropolitan area networks : supplement to Integrated Services (IS) LAN Interface at the Medium Access Control (MAC) and Physical (PHY) layers : Managed Object Conformance (MOCS) Proforma , 1996 .

[10]  K. Itoh,et al.  VLSI memory technology: Current status and future trends , 1999, Proceedings of the 25th European Solid-State Circuits Conference.

[11]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[12]  Anthony S. Acampora,et al.  A reservation-based media access control (MAC) protocol design for cellular systems using smart antennas-part I. Flat fading , 2005, IEEE Transactions on Wireless Communications.

[13]  William H. Press,et al.  Numerical recipes in C , 2002 .

[14]  Hiroyuki Kawai,et al.  Adaptive selection of surviving symbol replica candidates based on maximum reliability in QRM-MLD for OFCDM MIMO multiplexing , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[15]  Sergey Loyka.  Channel capacity of two-antenna BLAST architecture , 1999 .

[16]  S. Loyka,et al.  Channel capacity of n-antenna BLAST architecture , 2000 .

[17]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[18]  Jiang Yue,et al.  A QRD-M/Kalman filter-based detection and channel estimation algorithm for MIMO-OFDM systems , 2005, IEEE Transactions on Wireless Communications.

[19]  Ronald A. Iltis,et al.  Iterative soft-QRD-M for turbo coded MIMO-OFDM systems , 2008, IEEE Transactions on Communications.

[20]  Ronald A. Iltis,et al.  Joint detection and channel estimation algorithms for QS-CDMA signals over time-varying channels , 2002, IEEE Trans. Commun..

[21]  R. Muirhead.  Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.

[22]  Tricia J. Willink,et al.  Iterative tree search detection for MIMO wireless systems , 2005, IEEE Transactions on Communications.

[23]  William Stallings,et al.  Local and Metropolitan Area Networks , 1993 .