Analysis of Parallel Decodable Turbo Codes

Orhan GAZ  

Publication
IEICE TRANSACTIONS on Communications   Vol.E95-B    No.5    pp.1584-1591
Publication Date: 2012/05/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.1584
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
Keyword: 
Turbo codes,  memory collision,  parallel processing,  

Full Text: PDF(815.7KB)>>
Buy this Article



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.