By Topic

Efficient restarted radius bisection algorithm for sphere decoding with applications to multiple-in multiple-out 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

3 Author(s)
Xu, W. ; Dept. of Math., Tongji Univ., Shanghai, China ; Zheng, B. ; Zhang, J.

Integer least square problem is widely used in wireless communications, cryptography and some other fields. In this study, the authors propose a radius bisection algorithm with restart strategy to solve the ILS problem. Compared with the original sphere-decoding method, the algorithm can solve the ILS problem with higher speed and lower complexity. Also, users can specify a stop criterion to control the accuracy and complexity of the algorithm. Finally, some simulated experiments show the efficiency and effectiveness of the proposed algorithm.

Published in:

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