Parallel SFSD MIMO detection with SOFT-HARD combination enumeration

Author

Yu, Jianpeng ; Ma, Jun ; Mao, Zhigang

Author_Institution

Sch. of Microelectron., Shanghai Jiao Tong Univ., Shanghai, China

fYear

2011

fDate

4-7 Oct. 2011

Firstpage

228

Lastpage

233

Abstract

A novel soft-extension of fixed-complexity sphere decoding (FSD) algorithm is proposed, taking Soft FSD (SFSD)¹ algorithm as a starting point, which suffers from the multiple-tree-search problem, and the so called iteration problem, that is, its performance degrades as the number of the receiver iteration increases. The proposed parallel SFSD (PSFSD) performs a single tree search by taking partial best nodes to generate counter-hypotheses. To make use of priori information in tree search to overcome the iteration problem, soft-hard combination (SHC) enumeration method is presented as a low complexity algorithm to find the best child with prior term added. The proposed scheme is suitable for hardware implementations and can be easily extended to other tree search schemes.

Keywords

MIMO communication; iterative decoding; search problems; trees (mathematics); fixed-complexity sphere decoding algorithm; iteration problem; iterative decoding; low complexity algorithm; multiple-tree-search problem; parallel SFSD MIMO detection; receiver iteration; single tree search scheme; soft FSD algorithm; soft-hard combination enumeration method; Bit error rate; Complexity theory; Decoding; MIMO; Maximum likelihood estimation; Measurement; Receivers; FSD; Multiple input multiple output (MIMO); iterative detection and decoding; soft-input soft-output (SISO) detection;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Systems (SiPS), 2011 IEEE Workshop on

Conference_Location

Beirut

ISSN

2162-3562

Print_ISBN

978-1-4577-1920-2

Type

conf

DOI

10.1109/SiPS.2011.6088979

Filename

6088979