2015 4th International Conference on Computer Science and Network Technology (ICCSNT) 2015
DOI: 10.1109/iccsnt.2015.7490866
|View full text |Cite
|
Sign up to set email alerts
|

A novel array architecture and routing structure for massive-MIMO detection in Coarse-Grained Reconfigurable Architecture platform

Abstract: Based on the data flow feature analysis of the MIMO detection algorithms, a more efficient array architecture and a multi-hierarchical routing structure are proposed in the Coarse-Grained Reconfigurable Architecture platform, named Reconfigurable Signal Processor 2.0 (RaSP2.0) in this paper. The proposed design with higher throughput requires less hardware resource and has more efficient routing structure when compared with the first generation of RaSP. Implemented in TSMC 40nm technology, the single core of R… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
(12 reference statements)
0
2
0
Order By: Relevance
“…end Using the scheduling algorithm in Algorithm 1, the latency of the three different algorithms is found. First of all, by utilizing an unlimited number of PEs, each with a latency of one clock cycle, the theoretically lowest latency is obtained 5 . This corresponds to scheduling all possible operations in every clock cycle and the results of the operations are available in the next clock cycle.…”
Section: Algorithm Additions Multiplications Reciprocalsmentioning
confidence: 99%
See 1 more Smart Citation
“…end Using the scheduling algorithm in Algorithm 1, the latency of the three different algorithms is found. First of all, by utilizing an unlimited number of PEs, each with a latency of one clock cycle, the theoretically lowest latency is obtained 5 . This corresponds to scheduling all possible operations in every clock cycle and the results of the operations are available in the next clock cycle.…”
Section: Algorithm Additions Multiplications Reciprocalsmentioning
confidence: 99%
“…Since the latency of all operations is the same, this is also a least slack time approach 5. In this case, the scheduling algorithm is guaranteed to be optimal.…”
mentioning
confidence: 99%