2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings
DOI: 10.1109/icassp.2006.1660947
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Decoder Scheme for Double Binary Circular Turbo Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(25 citation statements)
references
References 5 publications
0
25
0
Order By: Relevance
“…The initial forward and backward state metrics of each frame can be attained by two distinct methods for the WiMAX-based standard and LTE-based standard. The method used in WiMAX-based standard is the circular encoding [21], which ensure the ending trellis state equals the initial trellis state. Thus, the initial values of the forward state metrics a k 0 (s) and backward …”
Section: Circular Parallel Map Decodingmentioning
confidence: 99%
“…The initial forward and backward state metrics of each frame can be attained by two distinct methods for the WiMAX-based standard and LTE-based standard. The method used in WiMAX-based standard is the circular encoding [21], which ensure the ending trellis state equals the initial trellis state. Thus, the initial values of the forward state metrics a k 0 (s) and backward …”
Section: Circular Parallel Map Decodingmentioning
confidence: 99%
“…To determine the initial values, two methods are generally preferred. The first one is to pre-compute several trellis stages to get reliable initial values [6]. Another way is to use the metric values of the prior iteration [5] [6].…”
Section: Max-log-map Algorithmmentioning
confidence: 99%
“…The first one is to pre-compute several trellis stages to get reliable initial values [6]. Another way is to use the metric values of the prior iteration [5] [6]. It has been reported that using the information of the prior iteration shows better performance and lower computational complexity than the pre-computing method [6].…”
Section: Max-log-map Algorithmmentioning
confidence: 99%
“…As shown in Figure 6, four branch transitions are associated with each α/β state update. The decoding algorithm for double binary codes is inherently based on the Radix-4 algorithm (Zhan, 2006), hence the same Radix-4 α, β and L(φ) function units as used in the binary codes can be applied to the double binary codes in a straightforward manner. The only different parts are the branch metrics γ ij calculations and the tail-biting trellis termination scheme.…”
Section: Radix-4 Decoding Of Double Binary Turbo Codesmentioning
confidence: 99%
“…For double binary codes, the main difference with ordinary binary codes is the trellis termination scheme and the symbol-wise decoding scheme (Zhan, 2006). The double binary trellis is closed as a circle with the start state equal to the end state.…”
Section: Radix-4 Decoding Of Double Binary Turbo Codesmentioning
confidence: 99%