IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.
DOI: 10.1109/spawc.2005.1506276
|View full text |Cite
|
Sign up to set email alerts
|

Reduced latency turbo decoding

Abstract: Reduced latency versions of i terative decoding of turbo codes are analyzed in this paper. The proposed schemes converge faster than the standard and plain shuffled approaches. EXIT chart is used to analyze the performance of the proposed algorithms. Both theoretica1 analysis and simdation resuits show that the new schedules offer better performance / com-pIexity trade-offs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…In [10], [11], the two decoders operate in synchronous manner: when the first decoder is working on its decoding, it considers the instantaneously generated extrinsic values form the other one, bit by bit. A method is proposed in [12] to use twice the number of decoders: as two SISO decoders per a convolutional code. Each one of the twin decoders run in the opposite direction to deliver the LLRs faster to the other decoders.…”
Section: Deploying Parallel Decodingmentioning
confidence: 99%
“…In [10], [11], the two decoders operate in synchronous manner: when the first decoder is working on its decoding, it considers the instantaneously generated extrinsic values form the other one, bit by bit. A method is proposed in [12] to use twice the number of decoders: as two SISO decoders per a convolutional code. Each one of the twin decoders run in the opposite direction to deliver the LLRs faster to the other decoders.…”
Section: Deploying Parallel Decodingmentioning
confidence: 99%