Browse > Article

Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems  

Mohaisen, Manar (인하대학교 정보통신대학원 이동통신연구실)
An, Hong-Sun (인하대학교 정보통신대학원 이동통신연구실)
Chang, Kyung-Hi (인하대학교 정보통신대학원 이동통신연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.34, no.4C, 2009 , pp. 460-468 More about this Journal
Abstract
Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.
Keywords
MIMO-OFDM detection; sphere decoding; QRD-M; ULBC QRD-M; maximum likelihood; receiver complexity;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Anderson, S. Mohan, 'Sequential coding algorithms: A survey and cost analysis,' IEEE Trans. on Communications, vol. 32, no. 2, pp. 169-176, Feb. 1984   DOI
2 K. Jeon, H. Kim, H. Park, 'An efficient QRD-M algorithm using partial decision feedback detection,' in Proc. 40th Asilomar Conference on Signal, Systems, and Computers, pp. 1658-1661, Oct 2006   DOI
3 H. Vikalo, B. Hassibi, T. Kailath, 'Iterative decoding for MIMO channels via modified sphere decoding,' IEEE Trans. on Wireless Communications, vol. 3, no. 6, pp. 2299-2311, Nov. 2004   DOI   ScienceOn
4 D. S. Baum, J. Salo, G. Del Galdo, M. Milojevic, P. Ky$\ddot{o}$sti, J. Hansen, 'An interim channel model for beyond-3G systems,' in Proc. IEEE VTC'05, vol. 5, pp. 3132-3136, May2005   DOI
5 B. M. Hockwald, S. ten Brink, 'Achieving near-capacity on a multiple-antenna channel,' IEEE Trans. on Communications, vol. 51, no. 3, pp. 389-399, Mar. 2003   DOI   ScienceOn
6 G. Golub, C. F. Van Loan, Matrix Computations. The Johns Hopkins Uni-versity Press, London, 1996
7 B. Hassibi, H. Vikalo, 'On the expected complexity of integer least-squares problems,' in Proc. IEEE ICASSP'02, vol. 2, pp. 1497-1500, May 2002
8 K.-J. Kim, R. Iltis, 'Joint detection and channel estimation algorithms for QSCDMA signals over time-varying channels,' IEEE Trans. on Communications, vol. 50, no. 5, pp. 845-855, May 2002   DOI   ScienceOn
9 E. Agrell, T. Eriksson, A. Vardy, K. Zeger, 'Closest point search in lattices,' IEEE Trans. on Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Nov. 2002   DOI   ScienceOn
10 H. Kawai, K. Higuchi, N. Maeda, M. Sawahashi, 'Adaptive control of surviving symbol replica candidates in QRD-MLD for OFDM MIMO multiplexing,' IEEE J. Sel. Areas Commun., vol. 24, no. 6, pp. 1130-1140, June 2006   DOI   ScienceOn
11 Y. Dai, S. Suni, Z. Lei, 'A comparative study of QRD-M detection and sphere decoding for MIMO-OFDM systems,' in Proc. PIMRC'05, vol. 1, pp.186-190, Sep. 2005   DOI
12 J. Jalden and B. Ottersten, 'On the complexity of sphere decoding in digital communications,' IEEE Trans. on Sig. Processing, vol. 53, no. 4, pp. 1474-1484, Apr. 2005   DOI   ScienceOn
13 J. Boutros, N. Gresset, L. Brunel, M. Fossorier, 'Soft-input soft-output lattice sphere decoder for linear channels,' in Proc. GLOBECOM'03, vol. 3, pp. 1583- 1587, 2003
14 S. Haykin and M. Moher, Modern Wireless Communications. Pearson Prentice Hall, New Jersey, 2005
15 K. Su, Efficient Maximum Likelihood Detection for Communication over Multiple Input Multiple Output Channels. Doctoral Dissertation, University of Cambridge, 2005
16 U. Fincke, M. Pohst, 'Improved methods for calculating vectors of short length in a lattice, including complexity analysis,' Mathematics of Computation, vol. 44, no. 170, pp. 463-471, Apr. 1985   DOI   ScienceOn
17 L. Babai, 'On Lovasz' lattice reduction and the nearest point problem,' Combinatorica, vol. 6, no. 1, pp. 1-13, Mar. 1986   DOI