Sciweavers

28 search results - page 2 / 6
» An Efficient Tree Search for Reduced Complexity Sphere Decod...
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Infinity-Norm Sphere-Decoding
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
Dominik Seethaler, Helmut Bölcskei
CORR
2004
Springer
116views Education» more  CORR 2004»
13 years 7 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy...
CORR
2008
Springer
75views Education» more  CORR 2008»
13 years 7 months ago
Soft-Input Soft-Output Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
Christoph Studer, Helmut Bölcskei
TCOM
2010
112views more  TCOM 2010»
13 years 5 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
SIPS
2007
IEEE
14 years 1 months ago
MIMO Detector Based on Viterbi Algorithm
: - Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so...
Jin Lee, Sin-Chong Park