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...

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications Vol. 61; no. 1; pp. 189 - 200
Main Authors: Wang, Ping, Le-Ngoc, Tho
Format: Journal Article
Language:English
Published: Boston Springer US 01.11.2011
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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