Turbo codes and Shannon's condition for reliable communication
(2004) IEEE International Symposium on Information Theory (ISIT), 2004 p.442-442- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1045434
- author
- Truhachev, Dmitri ; Lentmaier, Michael LU ; Costello,Jr, D.J. and Zigangirov, Kamil LU
- organization
- publishing date
- 2004
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- International Symposium on Information Theory, 2004. ISIT 2004. Proceedings.
- pages
- 442 - 442
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2004
- conference location
- Chicago, IL, United States
- conference dates
- 2004-06-27 - 2004-07-02
- external identifiers
-
- scopus:5044246386
- ISBN
- 0-7803-8280-3
- DOI
- 10.1109/ISIT.2004.1365479
- language
- English
- LU publication?
- yes
- id
- ca374fbc-9d3a-4b85-9794-f5244583de51 (old id 1045434)
- date added to LUP
- 2016-04-04 10:52:30
- date last changed
- 2022-01-29 20:58:34
@inproceedings{ca374fbc-9d3a-4b85-9794-f5244583de51, 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.}}, author = {{Truhachev, Dmitri and Lentmaier, Michael and Costello,Jr, D.J. and Zigangirov, Kamil}}, booktitle = {{International Symposium on Information Theory, 2004. ISIT 2004. Proceedings.}}, isbn = {{0-7803-8280-3}}, language = {{eng}}, pages = {{442--442}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Turbo codes and Shannon's condition for reliable communication}}, url = {{http://dx.doi.org/10.1109/ISIT.2004.1365479}}, doi = {{10.1109/ISIT.2004.1365479}}, year = {{2004}}, }