Pseudo-Inverse MMSE Based QRD-M Algorithm for MIMO OFDM

We propose a pseudo-inverse minimum mean squared error (MMSE) based QR decomposition (QRD) M-algorithm (QRD-M) for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithm can effectively mitigate the detrimental effect of MIMO channel ill-conditions on the bit error rate (BER) performance. As a result, the number of retained branches (M value) can be reduced to half of the original QRD-M algorithm in Kyeong Jin Kim and R.A. Iltis (2002) in order to achieve the same performance for both the uncoded and coded systems. The detection complexity is therefore greatly reduced

[1]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

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

[3]  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).

[4]  Branka Vucetic,et al.  Joint Detection and Channel Estimation Algorithms for QS-CDMA Signals Over Time-Varying Channels , 2002 .

[5]  Zhongding Lei,et al.  An improved square-root algorithm for BLAST , 2004, IEEE Signal Processing Letters.

[6]  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..

[7]  Mathini Sellathurai,et al.  Turbo-BLAST for wireless communications: theory and experiments , 2002, IEEE Trans. Signal Process..

[8]  Wai Ho Mow,et al.  Universal lattice decoding: principle and recent advances , 2003, Wirel. Commun. Mob. Comput..

[9]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[10]  Björn E. Ottersten,et al.  An exponential lower bound on the expected complexity of sphere decoding , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[11]  Jiang Yue,et al.  Channel estimation and data detection for MIMO-OFDM systems , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[12]  Heung-No Lee,et al.  Iterative MMSE-sphere list detection and graph decoding MIMO OFDM transceiver , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[13]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[14]  Yuan Li,et al.  A novel iterative receiver for coded MIMO OFDM systems , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[15]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[16]  Zhongding Lei,et al.  A Comparative Study of QRD-M Detection and Sphere Decoding for MIMO-OFDM Systems , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[17]  Inkyu Lee,et al.  A new reduced-complexity sphere decoder for multiple antenna systems , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[18]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[19]  Xiaodong Wang,et al.  Iterative receivers for multiuser space-time coding systems , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[20]  Babak Hassibi,et al.  On the expected complexity of integer least-squares problems , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.