Iterative decoding for MIMO channels via modified sphere decoding

IEEE Transactions on Wireless Communications

Volumn 3, Issue 6, 2004, Pages 2299-2311

  Vikalo, H ^a   Hassibi, B ^a   Kailath, T ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

Author keywords

Expected complexity; Iterative decoding; Low density parity check (LDPC) codes; Multiantenna systems; Polynomial time complexity; Space time codes; Sphere decoding; Turbo codes; Wireless communications

Indexed keywords

ALGORITHMS; ANTENNAS; CHANNEL CAPACITY; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; SPACE TIME ADAPTIVE PROCESSING; TURBO CODES; WIRELESS TELECOMMUNICATION SYSTEMS;

EXPECTED COMPLEXITY; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) CODES; MULTIANTENNA SYSTEMS; WIRELESS COMMUNICATIONS;

DECODING;

EID: 11844253863     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2004.837271     Document Type: Article

References (21)

1. I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecom., vol. 10, pp. 585-595, Nov. 1999.
2. V. Tarokh V. N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communication: Performance criterion and code construction," IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, Mar. 1998.
3. B. M. Hochwald and T. L. Marzetta, "Unitary space-time modulation for multiple-antenna communication in Rayleigh flat-fading," IEEE Trans. Inform. Theory, vol. 46, pp. 543-564, Mar. 2000.
4. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs. Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
5. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1997.
6. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, no. 4, pp. 463-471, Apr. 1985.
7. M. O. Damen, A. Chkeif, and J. C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000.
8. B. Hassibi and H. Vikalo, "Expected complexity of the sphere decoder algorithm,", submitted for publication.
9. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding. Turbo codes," in Proc. Int. Conf. Communications. 1993, pp. 1064-1070.
10. J. P. Woodard and L. Hanzo, "Comparative study of turbo decoding techniques: An overview," IEEE Trans. Veh. Technol., vol. 49, pp. 2208-2233, Nov. 2000.
11. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
12. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
13. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
14. A. Stefanov and T. M. Duman, "Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: System model, decoding approaches, and practical considerations," IEEE J. Select. Areas Commun., vol. 19, pp. 958-968, May 2001.
15. P. D. Alexander, A. J. Grant, and M. C. Reed, "Iterative detection in code-division multiple-access with error control coding," Eur. Trans. Tel., vol. 9, pp. 419-425, 1998.
16. H. Vikalo and B. Hassibi, "Low-complexity iterative decoding over multiple antenna channels via a modified sphere decoder," in Proc. Allerton Conf. Commun., Control, and Computing, Monticello, IL, Oct. 2001.
17. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," in Proc. Allerton Conf. Commun., Control, and Computing, Monticello, IL, Oct. 2001.
18. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, pp. 284-287, Mar. 1974.
19. B. Hassibi and B. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1804-1824, July 2002.
20. P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and suboptimal maximum a posteriori algorithms suitable for turbo decoding," Euro, Trans. Telecommun., vol. 8, pp. 119-125, Mar.-Apr. 1997.
21. M. Tuechler, A. Singer, and R. Koetter, "Minimum mean squared error equalization using a-priori information," IEEE Trans. Signal Processing, vol. 50, pp. 673-683, 2002.