Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC (0803.1807v1)

Published 12 Mar 2008 in cs.IT and math.IT

Abstract: In this paper we investigate the decoding of parallel turbo codes over the binary erasure channel suited for upper-layer error correction. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received. This algorithm compares with the iterative decoding of codes defined on graphs, in that it propagates in the trellises of the turbo code by removing transitions in the same way edges are removed in a bipartite graph under message-passing decoding. Performance comparison with LDPC codes for different coding rates is shown.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Ghassan M. Kraidy (8 papers)
  2. Valentin Savin (33 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.