Complexity limited sphere decoder and its ser performance analysis

Sung Jeon Eun, Hoon Yang Jang, Ku Kim Dong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

Original languageEnglish
Title of host publicationProceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007
Pages85-89
Number of pages5
Volume1
Publication statusPublished - 2007 Dec 1
Event2007 International Conference on Future Generation Communication and Networking, FGCN 2007 - Jeju Island, Korea, Republic of
Duration: 2007 Dec 62007 Dec 8

Other

Other2007 International Conference on Future Generation Communication and Networking, FGCN 2007
CountryKorea, Republic of
CityJeju Island
Period07/12/607/12/8

Fingerprint

Decoding
Time delay
Signal to noise ratio
Polynomials
Degradation

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Cite this

Eun, S. J., Jang, H. Y., & Dong, K. K. (2007). Complexity limited sphere decoder and its ser performance analysis. In Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007 (Vol. 1, pp. 85-89). [4426099]
Eun, Sung Jeon ; Jang, Hoon Yang ; Dong, Ku Kim. / Complexity limited sphere decoder and its ser performance analysis. Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007. Vol. 1 2007. pp. 85-89
@inproceedings{a70ce0e3007e4311a68adad1a146a71c,
title = "Complexity limited sphere decoder and its ser performance analysis",
abstract = "It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.",
author = "Eun, {Sung Jeon} and Jang, {Hoon Yang} and Dong, {Ku Kim}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "0769530486",
volume = "1",
pages = "85--89",
booktitle = "Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007",

}

Eun, SJ, Jang, HY & Dong, KK 2007, Complexity limited sphere decoder and its ser performance analysis. in Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007. vol. 1, 4426099, pp. 85-89, 2007 International Conference on Future Generation Communication and Networking, FGCN 2007, Jeju Island, Korea, Republic of, 07/12/6.

Complexity limited sphere decoder and its ser performance analysis. / Eun, Sung Jeon; Jang, Hoon Yang; Dong, Ku Kim.

Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007. Vol. 1 2007. p. 85-89 4426099.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Complexity limited sphere decoder and its ser performance analysis

AU - Eun, Sung Jeon

AU - Jang, Hoon Yang

AU - Dong, Ku Kim

PY - 2007/12/1

Y1 - 2007/12/1

N2 - It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

AB - It is well known that the sphere decoder has polynomial complexity at high signal to noise ratio (SNR). However, the worst case complexity is exponential leading to severe decoding time delay. In this paper, we present a scheme to overcome the worst case complexity of the sphere decoder. If the number of visited lattice points reaches the threshold, the detected symbol vector is determined between two candidate symbol vectors. One candidate symbol vector is obtained from the demodulated output of ZF receiver which is initial stage of the sphere decoder. The other candidate symbol vector consists of two sub-symbol vectors. The first sub-symbol vector consists of lately visited lattice points running from the most upper layer. The second one contains corresponding demodulated outputs of zero-forcing (ZF) receiver. Between these two candidate symbol vectors, the one with smaller Euclidean distance to the received symbol vector is chosen as detected symbol vector. In addition, we show the upper bound of symbol error rate (SER) performance for the sphere decoder using the proposed scheme. In the simulation, the proposed scheme shows the significant reduction of the worst case complexity while having negligible SER performance degradation.

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

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

M3 - Conference contribution

SN - 0769530486

SN - 9780769530482

VL - 1

SP - 85

EP - 89

BT - Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007

ER -

Eun SJ, Jang HY, Dong KK. Complexity limited sphere decoder and its ser performance analysis. In Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007. Vol. 1. 2007. p. 85-89. 4426099