By Topic

A successive interference cancellation algorithm in MIMO systems via breadth-first search

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

3 Author(s)
Yongtao Su ; Department of Automation, Tsinghua University, Beijing, 100084 China ; Xian-Da Zhang ; Xiaodong Wang

A successive interference cancellation (SIC) algorithm based on breadth-first search (BFS) is developed to achieve a soft-input soft-output detector via the tree structure of the MIMO system model in this paper. Instead of visiting all nodes of the tree, the proposed BFS-SIC algorithm only browses and extends those paths with large metrics. If paths are enough, the performance of BFS-SIC algorithm can approach that of sphere decoding but is much more flexible due to its providing a good tradeoff between complexity and performance. Moreover, the BFS-SIC algorithm possesses path metrics including only scalar operations rather than matrix operations. Simulation results demonstrate the effectiveness of the proposed algorithm.

Published in:

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

Date of Conference:

March 31 2008-April 4 2008