2008
DOI: 10.1109/twc.2008.060378
|View full text |Cite
|
Sign up to set email alerts
|

Fixing the Complexity of the Sphere Decoder for MIMO Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
383
0
8

Year Published

2012
2012
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 442 publications
(394 citation statements)
references
References 25 publications
0
383
0
8
Order By: Relevance
“…This implementation is cumbersome for practical systems; however, its complexity can be substantially reduced by means of tree-search detection methods such as the fixed-complexity sphere decoder (FSD) [8] or many other sphere decoding (SD) methods [9]. If a QR factorization of the channel matrix (H = QR) is employed, the problem (2) can be transformed into an equivalent one that can be solved using a tree structure [10].…”
Section: System Model and Mimo Detectionmentioning
confidence: 99%
See 3 more Smart Citations
“…This implementation is cumbersome for practical systems; however, its complexity can be substantially reduced by means of tree-search detection methods such as the fixed-complexity sphere decoder (FSD) [8] or many other sphere decoding (SD) methods [9]. If a QR factorization of the channel matrix (H = QR) is employed, the problem (2) can be transformed into an equivalent one that can be solved using a tree structure [10].…”
Section: System Model and Mimo Detectionmentioning
confidence: 99%
“…In [8] the authors proposed a MIMO detection strategy intended to overcome the two main problems of other tree-search methods from an implementation point of view: their variable complexity and their sequential nature. This algorithm was called fixed-complexity SD (FSD) and combines a preprocessing stage followed by a predetermined tree-search composed of two di↵erent stages: a full expansion of the tree (FE) in the first (highest) T levels and a single-path expansion (SE) in the remaining tree-levels n T T [8].…”
Section: Fixed-complexity Sphere Decodermentioning
confidence: 99%
See 2 more Smart Citations
“…첫 번째는 추가 검출 할 간섭신호의 스트림의 수를 제 한하는 방법이고 [7] , 두 번째는 전체 간섭신호 검출을 위한 수신기를 quasi-ML 성능을 갖는 저 복잡도 알고 리즘을 사용하는 방법이다. 본 논문에서는 qausi-ML 성능을 갖는 fixed-complexity SD(FSD) [9,10] …”
unclassified