[KSCI] Korea Science Citation Index Service

Simplified Maximum-Likelihood Decoder for V-BLAST Architecture

Le Minh-Tuan (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU))
Pham Van-Su (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU))
Mai Linh (students in Communication and Electronics Lab(CEL), Information and Communications University(ICU))
Yoon Giwan (Information and Communications University(ICU))

Publication Information

Journal of information and communication convergence engineering / v.3, no.2, 2005 , pp. 76-79 More about this Journal

Abstract

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the VBLAST schemes with ML performance at low detection complexity

Keywords

Space-time coding; multiple-input multiple-output; maximum likelihood detection; sphere decoding; wireless communication;

Citations & Related Records

Reference

1	G. D. Golden, G. J. Foschini, R. A. Valenzuela, P. W. Wolniansky, 'Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture,' Electronic Letters, Vol. 35, no. 1 ,pp. 14-15, Jan. 1999 DOI ScienceOn
2	B. Vucetic and J. Yuan, 'Space-time coding,' John Wiley & Son, 2003
3	D. Wubben, R. Bohnke, V. Kuhn, and K. D. Kammeyer, 'MMSE Extension of V-BLAST based on sorted QR decomposition,' in IEEE Proc. VTC 2003 Fall, Vol. 1, pp. 508-512, Oct. 2003
4	D. Wubben, R. Bohnke, J. Rinas, V. Kuhn, and K. D. Kammeyer, 'Efficient algorithm for decoding layered space-time codes,' Electronic Letters, Vol. 37, no. 22, pp. 1348-1350, Oct. 2001 DOI ScienceOn
5	M. O. Damen, H. E. Gamal, and G. Caire, 'On maximum- likelihood detection and the search for the closest lattice point,' IEEE Trans. Inform. Theory, Vol. 49, no. 10, pp. 2389-2402, Oct. 2003 DOI ScienceOn
6	R. Bohnke, D. Wubben, J. Rinas, V. Kuhn, and K. D. Kammeyer,'Reduced complexityMMSE detection for BLAST architectures,' in Proc. Globecom, Vol. 4, pp. 2258-2262, Dec. 2003 DOI
7	O. Damen, A. Chkeif, and J. C. Belfiore, 'Lattice code decoder for space-time codes,' IEEE Commun. Letters, Vol. 4, no. 5, pp. 161-163, May 2000 DOI ScienceOn
8	B. Hassibi, 'An efficient square-root algorithm for BLAST,' In Proc. ICASSP 2000, Vol. 2, pp. 737-740, June 2000 DOI
9	G. J. Foschini and M. J. Gans, 'On limits of wireless communications in a fading environment when using multiple antennas,' Wireless Personal Communications, Vol. 6, pp. 311-335, 1998 DOI ScienceOn
10	G. H. Goluband C. F.VanLoan,'Matrix computations,' 3rd edition, The Johns Hopkins Univ. Press, 1996