By Topic

Effective reduction for sphere decoder in linear multi-input multi-output channel systems

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
$31 $31
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

1 Author(s)
Zhang, Y. ; Sch. of Math. & Stat., Nanjing Audit Univ., Nanjing, China

In linear multi-input multi-output channel systems, reduction process is employed to reduce the computational cost of sphere decoding (SD) algorithm. Usually a reduction process includes not only permutations but also unimodular transformations. However, owing to the box-constraint, the current reduction strategies are limited to only permutations, which makes SD algorithm still very time-consuming. In this study a theoretical complexity analysis on SD algorithm is first proposed to show what kind of criteria a reduction process should pursue. Then a new reduction strategy which combines permutations with unimodular transformations is presented to obtain a better reduced detection problem. Simulation results showed that this new reduction strategy can make SD algorithm much more efficient than those reduction strategies with only permutations.

Published in:

Communications, IET  (Volume:6 ,  Issue: 11 )