IEICE TRANSACTIONS on Communications
Analysis of Parallel Decodable Turbo Codes
Summary :
Turbo codes suffer from high decoding latency which hinders their utilization in many communication systems. Parallel decodable turbo codes (PDTCs) are suitable for parallel decoding and hence have low latency. In this article, we analyze the worst case minimum distance of parallel decodable turbo codes with both S-random interleaver and memory collision free Row-Column S-random interleaver. The effect of minimum distance on code performance is determined through computer simulations.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.5 pp.1584-1591
- Publication Date
- 2012/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.1584
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Orhan GAZ, "Analysis of Parallel Decodable Turbo Codes" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 5, pp. 1584-1591, May 2012, doi: 10.1587/transcom.E95.B.1584.
Abstract: Turbo codes suffer from high decoding latency which hinders their utilization in many communication systems. Parallel decodable turbo codes (PDTCs) are suitable for parallel decoding and hence have low latency. In this article, we analyze the worst case minimum distance of parallel decodable turbo codes with both S-random interleaver and memory collision free Row-Column S-random interleaver. The effect of minimum distance on code performance is determined through computer simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.1584/_p
Copy
@ARTICLE{e95-b_5_1584,
author={Orhan GAZ, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Parallel Decodable Turbo Codes},
year={2012},
volume={E95-B},
number={5},
pages={1584-1591},
abstract={Turbo codes suffer from high decoding latency which hinders their utilization in many communication systems. Parallel decodable turbo codes (PDTCs) are suitable for parallel decoding and hence have low latency. In this article, we analyze the worst case minimum distance of parallel decodable turbo codes with both S-random interleaver and memory collision free Row-Column S-random interleaver. The effect of minimum distance on code performance is determined through computer simulations.},
keywords={},
doi={10.1587/transcom.E95.B.1584},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Analysis of Parallel Decodable Turbo Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 1584
EP - 1591
AU - Orhan GAZ
PY - 2012
DO - 10.1587/transcom.E95.B.1584
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2012
AB - Turbo codes suffer from high decoding latency which hinders their utilization in many communication systems. Parallel decodable turbo codes (PDTCs) are suitable for parallel decoding and hence have low latency. In this article, we analyze the worst case minimum distance of parallel decodable turbo codes with both S-random interleaver and memory collision free Row-Column S-random interleaver. The effect of minimum distance on code performance is determined through computer simulations.
ER -
English
