A faster ML sphere decoder with competing branches

Author

Li, Anxin ; Xu, Weiyu ; Wang, Youzheng ; Zhou, Zucheng ; Wang, Jing

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing, China

Volume

1

fYear

2005

fDate

30 May-1 June 2005

Firstpage

438

Abstract

A novel fast recursive sphere decoder with parallel competing branches (P-SD) is proposed for exact maximum-likelihood (ML) detection in multiple-input multiple-output (MIMO) systems. P-SD introduces a novel competition mechanism which makes P-SD dynamically choose the targeted branch to perform a bounded search among the competing parallel branches. In P-SD, the search radius shrinks to the minimum Euclidean distance as early as possible. Numerical results show that P-SD achieves considerable computational complexity reduction even compared with the Schnorr-Euchner enumeration (SEE) based sphere decoder (SE-SD).

Keywords

MIMO systems; computational complexity; decoding; maximum likelihood detection; radio links; tree searching; trees (mathematics); MIMO system; ML sphere decoder; Schnorr-Euchner enumeration; bounded search; competition mechanism; computational complexity reduction; exact maximum-likelihood detection; minimum Euclidean distance; multiple-input multiple-output system; parallel competing branches; recursive sphere decoder; search radius; tree nodes; wireless communications; AWGN; Detectors; Euclidean distance; Lattices; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Multiuser detection; Receiving antennas; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st

ISSN

1550-2252

Print_ISBN

0-7803-8887-9

Type

conf

DOI

10.1109/VETECS.2005.1543328

Filename

1543328