한국정보통신학회:학술대회논문집 (Proceedings of the Korean Institute of Information and Commucation Sciences Conference)
- 한국해양정보통신학회 2008년도 춘계종합학술대회 A
- /
- Pages.567-571
- /
- 2008
A Study of Ordering Sphere Decoder Class for Space-Time Codes
- Pham, Van-Su (Information and Communications University (ICU)) ;
- Mai, Linh (Information and Communications University (ICU)) ;
- Kabir, S.M. Humayun (Information and Communications University (ICU)) ;
- Yoon, Gi-Wan (Information and Communications University (ICU))
- 발행 : 2008.05.30
초록
In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.
키워드