ASAP 2011 - 22nd IEEE International Conference on Application-Specific Systems, Architectures and Processors 2011
DOI: 10.1109/asap.2011.6043259
|View full text |Cite
|
Sign up to set email alerts
|

High-throughput Contention-Free concurrent interleaver architecture for multi-standard turbo decoder

Abstract: Abstract-To meet the higher data rate requirement of emerging wireless communication technology, numerous parallel turbo decoder architectures have been developed. However, the interleaver has become a major bottleneck that limits the achievable throughput in the parallel decoders due to the massive memory conflicts. In this paper, we propose a flexible Double-Buffer based Contention-Free (DBCF) interleaver architecture that can efficiently solve the memory conflict problem for parallel turbo decoders with ver… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(16 citation statements)
references
References 23 publications
(44 reference statements)
0
16
0
Order By: Relevance
“…1, if more than one SISO decoder tries to access the same memory module, a memory conflict occurs. The ratio of memory conflicts increases exponentially as the parallelism goes higher [12,13]. To solve the memory conflict problem, extra clock cycles need to be spent, which prevent the turbo decoder from achieving high data rate.…”
Section: B Solving Memory Conflict Problemmentioning
confidence: 99%
See 4 more Smart Citations
“…1, if more than one SISO decoder tries to access the same memory module, a memory conflict occurs. The ratio of memory conflicts increases exponentially as the parallelism goes higher [12,13]. To solve the memory conflict problem, extra clock cycles need to be spent, which prevent the turbo decoder from achieving high data rate.…”
Section: B Solving Memory Conflict Problemmentioning
confidence: 99%
“…In addition, researchers in [12] mentioned that memory reordering may be used to solve the memory reading conflict problem, but the reordering logic will add too much overhead to the memory control blocks. To solve the aforementioned problems, we propose a new scheduling scheme which allows us to utilize an efficient buffer architecture proposed in our previous work [13].…”
Section: B Solving Memory Conflict Problemmentioning
confidence: 99%
See 3 more Smart Citations