Abstract
A modified Schnorr-Euchner sphere decoding (SE-SD) algorithm to search for the receive minimum distance is presented. In the proposed algorithm, the visit to negative symmetric vectors of already spanned vectors is avoided by using a biased spanning, and the redundant processes to visit the all-zero vector are also eliminated. A numerical experiment shows that the modified SE-SD algorithm is much more efficient than the conventional algorithm in terms of average computational complexity.
Original language | English |
---|---|
Pages (from-to) | 330-333 |
Number of pages | 4 |
Journal | IEICE Transactions on Communications |
Volume | E92-B |
Issue number | 1 |
DOIs | |
Publication status | Published - 2009 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering