BROWSE
Detail
Conference Paper
Computational Complexities of Sphere Decoding according to Initial Radius Selection Schemes and an Efficient Initial Radius Reduction Scheme
Cited 7 time in 
Share 
Share
- Authors
- Hee Goo Han, Seong Keun Oh, Seung Joon Lee, Dong Seung Kwon
- Issue Date
- 2005-11
- Citation
- GLOBECOM 2005, pp.2354-2358
- Language
- English
- Type
- Conference Paper
- Abstract
- We analyze the computational complexity of sphere decoding (SD) for maximum likelihood detection (MLD) according to initial radius selection schemes, and also propose an efficient initial radius reduction scheme that reduces further the initial radius. As the initial radius for SD, we use the Euclidean distance between the received signal vector and the lattice vector corresponding to a suboptimum initial estimate. The proposed initial radius reduction scheme selects a new lattice vector closer to the received signal vector than the initial lattice vector in order to reduce the initial radius further. From our analyses, the reduction in the overall complexity due to further reduction of initial radius gets more significant as the SNR decreases. The ZF-DFE scheme in a combination with the proposed radius reduction scheme has the fewest computations over practical SNR range for communications, and its computations are less than that of the vertical Bell-labs layered space-time (V-BLAST) detection scheme with optimal ordering, even at low SNR values achieving an uncoded bit error rate (BER) of 0.1. © 2005 IEEE.
- KSP Keywords
- Bit Error Rate(And BER), Computational complexity, Detection scheme, Low SNR, Optimal ordering, Radius selection, Space time(ST), V-BLAST, euclidean distance, initial radius, maximum likelihood detection