Variation of the fixed-complexity sphere decoder

Kuei Chiang Lai; Cheng Chieh Huang; Jiun Jie Jia

doi:10.1109/LCOMM.2011.072011.110916

Variation of the fixed-complexity sphere decoder

Kuei Chiang Lai, Cheng Chieh Huang, Jiun Jie Jia

Institute of Computer and Communication Engineering

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

Abstract

The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.

Original language	English
Article number	5962393
Pages (from-to)	1001-1003
Number of pages	3
Journal	IEEE Communications Letters
Volume	15
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2011.072011.110916
Publication status	Published - 2011 Sept

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2011.072011.110916

Cite this

@article{cdb771363633496ea99577f29d0f14e4,

title = "Variation of the fixed-complexity sphere decoder",

abstract = "The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.",

author = "Lai, {Kuei Chiang} and Huang, {Cheng Chieh} and Jia, {Jiun Jie}",

note = "Funding Information: Manuscript received May 2, 2011. The associate editor coordinating the review of this letter and approving it for publication was J. Jalden. This research was supported by the National Science Council, Taiwan, R.O.C., under contract NSC 97-2221-E-006-083-MY3. The authors are with the Department of Electrical Engineering and the Institute of Computer and Communication Engineering, National Cheng Kung University (e-mail: [email protected]). Digital Object Identifier 10.1109/LCOMM.2011.072011.110916",

year = "2011",

month = sep,

doi = "10.1109/LCOMM.2011.072011.110916",

language = "English",

volume = "15",

pages = "1001--1003",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - Variation of the fixed-complexity sphere decoder

AU - Lai, Kuei Chiang

AU - Huang, Cheng Chieh

AU - Jia, Jiun Jie

N1 - Funding Information: Manuscript received May 2, 2011. The associate editor coordinating the review of this letter and approving it for publication was J. Jalden. This research was supported by the National Science Council, Taiwan, R.O.C., under contract NSC 97-2221-E-006-083-MY3. The authors are with the Department of Electrical Engineering and the Institute of Computer and Communication Engineering, National Cheng Kung University (e-mail: [email protected]). Digital Object Identifier 10.1109/LCOMM.2011.072011.110916

PY - 2011/9

Y1 - 2011/9

N2 - The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.

AB - The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.

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

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

U2 - 10.1109/LCOMM.2011.072011.110916

DO - 10.1109/LCOMM.2011.072011.110916

M3 - Article

AN - SCOPUS:80052864422

SN - 1089-7798

VL - 15

SP - 1001

EP - 1003

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

M1 - 5962393

ER -

Variation of the fixed-complexity sphere decoder

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this