2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications 2008
DOI: 10.1109/ictta.2008.4530232
|View full text |Cite
|
Sign up to set email alerts
|

Very Low Cost Configurable Hardware Interleaver for 3G Turbo Decoding

Abstract: A very low cost hardware interleaver for 3rd Generation Partnership Project (3GPP) turbo coding algorithm is presented. The interleaver is a key component of turbo codes and it is used to minimize the effect of burst errors in the transmission. Using conventional design methods, it consumes a large part of silicon area in the design of turbo encoder and decoder. The presented hardware interleaver architecture utilizes the algorithmic level hardware simplifications as well as the iterative modulo computation to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2008
2008
2010
2010

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(16 citation statements)
references
References 5 publications
0
16
0
Order By: Relevance
“…However, it can be noticed that the q i sequences (as mentioned in [2]) are almost the same in most cases and they only differ by one or two elements from other sequences. Based on this observation, we decided to place sub groups of q i sequence into a ROM and then choose one according to the p value.…”
Section: A Pre-computation Modementioning
confidence: 99%
See 4 more Smart Citations
“…However, it can be noticed that the q i sequences (as mentioned in [2]) are almost the same in most cases and they only differ by one or two elements from other sequences. Based on this observation, we decided to place sub groups of q i sequence into a ROM and then choose one according to the p value.…”
Section: A Pre-computation Modementioning
confidence: 99%
“…There already exists an architecture to compute these operations and it works fine in the pre-computation mode, but in run time mode it fails almost in 12 percent of the block sizes [2]. The problem occurs when q(i)-2p+1>0, in this case the modulo operation cannot be performed correctly (in run time mode); this architecture is shown in Fig.…”
Section: I_addr((i×c)+j)=(c ×Tmentioning
confidence: 99%
See 3 more Smart Citations