dc.contributor.author |
Gazi, Orhan
|
|
dc.date.accessioned |
2017-02-28T11:15:21Z |
|
dc.date.available |
2017-02-28T11:15:21Z |
|
dc.date.issued |
2012-05 |
|
dc.identifier.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 |
tr_TR |
dc.identifier.issn |
0916-8516 |
|
dc.identifier.uri |
http://hdl.handle.net/20.500.12416/1327 |
|
dc.description.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 |
tr_TR |
dc.language.iso |
eng |
tr_TR |
dc.publisher |
IEICE-INTS Electronics Information Communications Eng |
tr_TR |
dc.relation.isversionof |
10.1587/transcom.E95.B.1584 |
tr_TR |
dc.rights |
info:eu-repo/semantics/closedAccess |
|
dc.subject |
Turbo Codes |
tr_TR |
dc.subject |
Memory Collision |
tr_TR |
dc.subject |
Parallel Processing |
tr_TR |
dc.title |
Analysis of parallel decodable turbo codes |
tr_TR |
dc.type |
article |
tr_TR |
dc.relation.journal |
IEICE Transactions On Communications |
tr_TR |
dc.contributor.authorID |
102896 |
tr_TR |
dc.identifier.volume |
E95B |
tr_TR |
dc.identifier.issue |
5 |
tr_TR |
dc.identifier.startpage |
1584 |
tr_TR |
dc.identifier.endpage |
1591 |
tr_TR |
dc.contributor.department |
Çankaya Üniversitesi, Mühendislik Fakültesi, Elektronik ve Haberleşme Mühendisliği |
tr_TR |