Complexity reduction method with joint candidate symbols and layer sorting for the sphere decoder

Eun Sung Jeon, Yohan Kim, Dong Ku Kim

Research output: Contribution to journalConference article

Abstract

The sphere decoder finds the maximum-likelihood (ML) solution with moderate complexity. The computational complexity of the sphere decoder can be further reduced by conventional decoding order scheme sorting the candidate symbols, where the candidate symbols are sorted in ascending order of the distance from the soft-output signal points of a zero-forcing (ZF) receiver. The soft-output signal point of ZF, however, may not be a reliable reference of sorting for finding ML solutions. Moreover, conventional sorting scheme does not consider the searching of the following layer. In this paper, a new sorting scheme is proposed which gives more reliable sorting criteria. It is to sort candidate symbols by considering the number of candidate symbols of the following layer, which are called child symbols. The proposed sorting scheme is combined with layer sorting in order to allow for more reliability at the first detected layer. It is shown that the proposed candidate symbol sorting combined with layer sorting provides around 40% complexity reduction compared with the conventional sorting scheme.

Original languageEnglish
Article number4195486
Pages (from-to)1640-1642
Number of pages3
JournalInternational Conference on Advanced Communication Technology, ICACT
Volume3
DOIs
Publication statusPublished - 2007 Jan 1
Event9th International Conference on Advanced Communication Technology, ICACT 2007 - Gangwon-Do, Korea, Republic of
Duration: 2007 Feb 122007 Feb 14

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Complexity reduction method with joint candidate symbols and layer sorting for the sphere decoder'. Together they form a unique fingerprint.

  • Cite this