.png){kind=icon}
Return
Near optimum error correcting coding and decoding: Turbo-codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.539767.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving, Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveDesigning seawater RO for clean and fouling RO feed. Desalination experiences with the FilmTec SW30HR-380 and SW30HR-320 elements — technical—economic review.png)
Desalination
DesalinationIF0
PREAI
ShareSaveShareSave no more
no more