Soft-output sphere decoding: algorithms and VLSI implementation

Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be used as an efficient tool to implement soft-...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE journal on selected areas in communications Ročník 26; číslo 2; s. 290 - 300
Hlavní autori: Studer, C., Burg, A., Bolcskei, H.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Channels
Complexity
Computation
Computational complexity
Decoders
Decoding
Detection algorithms
Detectors
Integrated circuits
Interference constraints
Maximum likelihood decoding
MIMO
Runtime
Sociotechnical systems
Very large scale integration
ISSN:0733-8716, 1558-0008
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be used as an efficient tool to implement soft-output MIMO detection with flexible trade-offs between computational complexity and (error rate) performance. In particular, we provide VLSI implementation results which demonstrate that single tree-search, sorted QR-decomposition, channel matrix regularization, log-likelihood ratio clipping, and imposing runtime constraints are the key ingredients for realizing soft-output MIMO detectors with near max-log performance at a chip area that is only 58% higher than that of the best-known hard-output sphere decoder VLSI implementation.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2008.080206