Abstract

Block transmission over noisy communication channels is characterized by two performance criteria: the bit error probability P/sub b/ and the block error probability P/sub B/. If P/sub B/ goes to zero when N/spl rarr//spl infin/ (where N denotes the length of the permutors), P/sub b/ also must go to zero for all symbols in the block but, in general, the reverse is not true. Therefore we formulate the Shannon's condition for reliable communication over noisy channels. In this paper, we address the problem of reliable communication for iterative decoding of turbo codes.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.