2013
DOI: 10.1109/wcl.2013.052813.130259
|View full text |Cite
|
Sign up to set email alerts
|

A CRC-Aided Hybrid Decoding Algorithm for Turbo Codes

Abstract: Turbo codes and CRC codes are usually decoded separately according to the serially concatenated inner codes and outer codes respectively. In this letter, we propose a hybrid decoding algorithm of turbo-CRC codes, where the outer codes, CRC codes, are not used for error detection but as an assistance to improve the error correction performance. Two independent iterative decoding and reliability based decoding are carried out in a hybrid schedule, which can efficiently decode the two different codes as an entire… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…E. Migabo et al [40] study the energy-efficient channel coding scheme based on adaptive MCS scheme. Authors in [41] studied the CRC aided hybrid decoding for turbo codes. J. Yang et al [42] proposed an energy-efficient HARQ transmission using field test analysis.…”
Section: Related Workmentioning
confidence: 99%
“…E. Migabo et al [40] study the energy-efficient channel coding scheme based on adaptive MCS scheme. Authors in [41] studied the CRC aided hybrid decoding for turbo codes. J. Yang et al [42] proposed an energy-efficient HARQ transmission using field test analysis.…”
Section: Related Workmentioning
confidence: 99%
“…In this Letter, we change the computation sequence of the block position x nN and the weight of the S-bit data on the sub-block x mS , so that the decoded S-bit a n , mS + k •x k is weighted by the CRC of the block position with the GF multiplication as denoted in (3). The computation within the indices of the clock cycle m can be performed by fully combinational logic and it is processed in one clock cycle.…”
Section: Fig 1 Timing and Computation Process Diagrams Of Conventionmentioning
confidence: 99%
“…As shown in Fig. 2, we reduce the complexity of the GF multiplier and propose a weighted S-bit parallel LFSR by exploiting (3). The most significant improvement is that the GF multiplier can be simplified from the general 24 bit multiplicand to the small S-bit multiplicand compared with the merged CRC unit.…”
Section: Fig 1 Timing and Computation Process Diagrams Of Conventionmentioning
confidence: 99%
“…Hence, an alternative error detection method should be used when the proposed algorithm is applied in LTE systems. The NED criterion proposed in [7] can efficiently reduce the UER caused by CRC-aided OSD. The NED of the decoding output :0 with the minimum Euclidean distance is…”
Section: A Error Detection Without Crcmentioning
confidence: 99%