2012
DOI: 10.1007/s11432-011-4441-2
|View full text |Cite
|
Sign up to set email alerts
|

Analysis on parallel implementations of fixed-complexity sphere decoder

Abstract: Sphere decoders are widely investigated for the implementation of multiple-input multiple-output (MIMO) detection. Among a large number of sphere decoding algorithms, the fixed-complexity sphere decoder (FSD) exhibits remarkable advantages in terms of constant throughput and high flexibility of parallel implementation. In this paper, we present a four-nodes-per-cycle parallel FSD architecture with balanced performance and hardware complexity, and several examples of VLSI implementation for different types of m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 19 publications
(24 reference statements)
0
1
0
Order By: Relevance
“…These methods have been implemented over different hardware technologies such as FPGA and GPUs [40], particularly FSD algorithm because its structure is well suited for parallel computing [41][42] [43].…”
Section: Fixed-complexity Detectorsmentioning
confidence: 99%
“…These methods have been implemented over different hardware technologies such as FPGA and GPUs [40], particularly FSD algorithm because its structure is well suited for parallel computing [41][42] [43].…”
Section: Fixed-complexity Detectorsmentioning
confidence: 99%