By Topic

An early termination-based improved algorithm for fixed-complexity sphere decoder

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Guanghui Li ; Wireless Theories and Technologies Lab, Beijing Univ. of Posts and Telecommunications, Beijing, China ; Xin Zhang ; Sheng Lei ; Cong Xiong
more authors

The fixed-complexity sphere decoder (FSD) has been proposed to attain the near-optimal performance achieving the same diversity order as the maximum-likelihood decoder (MLD) recently. However, it suffers great redundant computations resulting in high power consumption. In this paper, we conduct an improved algorithm for the original FSD by using early termination (ET). This algorithm (abbreviated as ET-FSD) preserves the advantages of sphere decoder (SD) such as branch pruning and an adaptively updated pruning threshold. We compare the ET-FSD with the original FSD and a lately developed statistical threshold-based FSD (ST-FSD). Simulation results demonstrate that the ET-FSD attains the same performance with a much lower cost than the FSD, and is much more efficient than the ST-FSD in practice. In addition, the statistical threshold-based method can also be used for the ET-FSD (i.e., ST-ET-FSD) to further reduce the complexity.

Published in:

2012 IEEE Wireless Communications and Networking Conference (WCNC)

Date of Conference:

1-4 April 2012