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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Myeongcheol SHIN, Jiwon KANG, Byungwook YOO, Chungyong LEE, "An Efficient Searching Algorithm for Receive Minimum Distance in MIMO Systems with ML Receiver" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 1, pp. 330-333, January 2009, doi: 10.1587/transcom.E92.B.330.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.330/_p
Copy
@ARTICLE{e92-b_1_330,
author={Myeongcheol SHIN, Jiwon KANG, Byungwook YOO, Chungyong LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Searching Algorithm for Receive Minimum Distance in MIMO Systems with ML Receiver},
year={2009},
volume={E92-B},
number={1},
pages={330-333},
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.},
keywords={},
doi={10.1587/transcom.E92.B.330},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - An Efficient Searching Algorithm for Receive Minimum Distance in MIMO Systems with ML Receiver
T2 - IEICE TRANSACTIONS on Communications
SP - 330
EP - 333
AU - Myeongcheol SHIN
AU - Jiwon KANG
AU - Byungwook YOO
AU - Chungyong LEE
PY - 2009
DO - 10.1587/transcom.E92.B.330
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2009
AB - 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.
ER -