Analysis of Parallel Decodable Turbo Codes
Loading...
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Ieice-inst Electronics information Communications Eng
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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.
Description
Keywords
Memory Collision, Parallel Processing, Turbo Codes
Fields of Science
0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Gazi, O. (2012). Analysis of parallel decodable turbo codes. IEICE Transactions On Communications, E95B(5), 1584-1591. http://dx.doi.org/10.1587/transcom.E95.B.1584
WoS Q
Q4
Scopus Q
Q4
OpenCitations Citation Count
N/A
Source
IEICE Transactions on Communications
Volume
E95B
Issue
5
Start Page
1584
End Page
1591
PlumX Metrics
Citations
Scopus : 1
Google Scholar™
