A generalized branch and bound decoder for asymmetrical space-time communication architecture

Author

Laamari, Hedi ; Belfiore, Jean-Claude ; Ibrahim, Niko

Author_Institution

Dept. COMELEC, ENST, Paris, France

fYear

2004

fDate

19-23 April 2004

Firstpage

285

Lastpage

286

Abstract

This paper presents the generalized version of the Branch and Bound decoder for asymmetrical space-time communication architecture. The branch and bound algorithm gives the ML solution to the rank deficiency problem. The algorithm will do an exhaustive search on the last component of the vector. Simulations are also performed for different configurations of the system.

Keywords

antenna arrays; cellular radio; decoding; maximum likelihood detection; tree searching; ML solution; asymmetrical space-time communication architecture; generalized branch-bound decoder; multiantenna cellular system; rank deficiency problem; Base stations; Data mining; Decoding; Digital communication; Digital signal processing; Lattices; Matched filters; Matrix decomposition; Mobile antennas; Quadrature amplitude modulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies: From Theory to Applications, 2004. Proceedings. 2004 International Conference on

Print_ISBN

0-7803-8482-2

Type

conf

DOI

10.1109/ICTTA.2004.1307738

Filename

1307738

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3099567