A List Sphere Decoding Algorithm with Improved Radius Setting Strategies

Complexity of different sphere-decoding (SD) algorithms is heavily influenced by their own distinctive computational features. Sphere radius setting for initialization and reduction during the search process, is one of the most important aspects affecting the SD efficiency. This paper examines radiu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Wireless personal communications Ročník 61; číslo 1; s. 189 - 200
Hlavní autori:	Wang, Ping, Le-Ngoc, Tho
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.11.2011
Predmet:	Communications Engineering Computer Communication Networks Engineering Networks Signal,Image and Speech Processing Maximum-likelihood (ML) List Sphere Decoding (LSD) MIMO Sphere decoding (SD) Integer Least-square (ILS)
ISSN:	0929-6212, 1572-834X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	Complexity of different sphere-decoding (SD) algorithms is heavily influenced by their own distinctive computational features. Sphere radius setting for initialization and reduction during the search process, is one of the most important aspects affecting the SD efficiency. This paper examines radius setting strategies for list sphere-decoding (LSD) algorithms to calculate the soft-output information for coded systems, and proposes strategies to improve both the radius initialization and reduction in the original LSD algorithm. The proposed strategies can avoid the instability problem in the radius initialization of the original LSD algorithm and significantly increase its search efficiency as confirmed by simulation for both full-column-rank and underdetermined MIMO channels.
ISSN:	0929-6212 1572-834X
DOI:	10.1007/s11277-010-0018-4