An ML Decoding Algorithm with Reduced Complexity for Multi-Input Multi-Output Systems

Author

Kang, Hyun Gu ; Park, Juho ; An, Taehun ; Oh, Jongho ; Song, Iickho

Author_Institution

Korea Adv. Inst. of Sci. & Technol, Daejeon

fYear

2007

fDate

July 30 2007-Aug. 2 2007

Firstpage

339

Lastpage

342

Abstract

In this paper, employing the ´breadth-first´ search algorithm for the decoding of received signals in multi-input multi-output systems, we propose a novel decoder exhibiting the maximum likelihood performance with reduced complexity. The proposed algorithm is compared with the sphere decoder. Simulation results show that the proposed decoder allows significantly lower computational complexity than the sphere decoder.

Keywords

MIMO communication; codecs; computational complexity; maximum likelihood decoding; tree searching; ML decoding algorithm; breadth-first search algorithm; computational complexity; maximum likelihood decoding; multi-input multi-output systems; reduced complexity; signal decoding; sphere decoder; Bit error rate; Computational complexity; Euclidean distance; Lattices; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Transmitters; Transmitting antennas; breadth-first searching; maximum likelihood detection; multi-input multi-output system; sphere decoder;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Electronics, 2007. ISSSE '07. International Symposium on

Conference_Location

Montreal, Que.

Print_ISBN

1-4244-1448-2

Electronic_ISBN

1-4244-1449-0

Type

conf

DOI

10.1109/ISSSE.2007.4294482

Filename

4294482