DocumentCode
2062517
Title
Channel dependent tree pruning for the sphere decoder
Author
Artés, Harold
Author_Institution
Inf. Syst. Lab., Stanford Univ., CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
538
Abstract
We reduce the complexity of sphere decoding for space-time transmission by "guessing" the first few levels of the search tree a priori. These guesses are based on a simplified channel model. The resulting complexity is only a fraction of the original complexity while performance remains close to optimal.
Keywords
maximum likelihood decoding; telecommunication channels; tree searching; channel dependent tree pruning; channel model; maximum likelihood decoding; search tree; space-time transmission; sphere decoder; Additive white noise; Colored noise; Fading; Information systems; Laboratories; Maximum likelihood decoding; Maximum likelihood detection; Quantization; Receiving antennas; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365576
Filename
1365576
Link To Document