An efficient searching algorithm for receive minimum distance in MIMO systems with ML receiver

Myeongcheol Shin; Jiwon Kang; Byungwook Yoo; Chungyong Lee

doi:10.1587/transcom.E92.B.330

An efficient searching algorithm for receive minimum distance in MIMO systems with ML receiver

Myeongcheol Shin, Jiwon Kang, Byungwook Yoo, Chungyong Lee

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article

2 Citations (Scopus)

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	https://doi.org/10.1587/transcom.E92.B.330
Publication status	Published - 2009 Jan 1

Fingerprint

All Science Journal Classification (ASJC) codes

Software
Computer Networks and Communications
Electrical and Electronic Engineering

Cite this

Shin, M., Kang, J., Yoo, B., & Lee, C. (2009). An efficient searching algorithm for receive minimum distance in MIMO systems with ML receiver. IEICE Transactions on Communications, E92-B(1), 330-333. https://doi.org/10.1587/transcom.E92.B.330

@article{e77c4f4235164129932c8fd7eddf0456,

title = "An efficient searching algorithm for receive minimum distance in MIMO systems with ML receiver",

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.",

author = "Myeongcheol Shin and Jiwon Kang and Byungwook Yoo and Chungyong Lee",

year = "2009",

month = jan

day = "1",

doi = "10.1587/transcom.E92.B.330",

language = "English",

volume = "E92-B",

pages = "330--333",

journal = "IEICE Transactions on Communications",

issn = "0916-8516",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "1",

}

TY - JOUR

T1 - An efficient searching algorithm for receive minimum distance in MIMO systems with ML receiver

AU - Shin, Myeongcheol

AU - Kang, Jiwon

AU - Yoo, Byungwook

AU - Lee, Chungyong

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=77952642576&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952642576&partnerID=8YFLogxK

U2 - 10.1587/transcom.E92.B.330

DO - 10.1587/transcom.E92.B.330

M3 - Article

AN - SCOPUS:77952642576

VL - E92-B

SP - 330

EP - 333

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 1

ER -

Access to Document

10.1587/transcom.E92.B.330