Name
Abstract | ||
|---|---|---|
In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of 16×16 with 16-QAM modulation. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/JCN.2014.000108 | Journal of Communications and Networks |
Keywords | Field | DocType |
MIMO,Resource management,Computational complexity,Vectors,Maximum likelihood decoding | Monte Carlo method,Computer science,Parallel computing,MIMO,Real-time computing,Theoretical computer science,Modulation,Operator (computer programming),Soft-decision decoder,Critical path method,Decoding methods,Computational complexity theory | Journal |
Volume | Issue | ISSN |
16 | 6 | 1229-2370 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jihun Koo | 1 | 6 | 3.46 |
| Yong Soo Kim | 2 | 185 | 23.42 |
| Jaeseok Kim | 3 | 405 | 58.33 |