WoS İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8653
Browse
5 results
Search Results
Article Prunable collision free random interleaver design(Springer, 2012) Gazi, OrhanIn this article we introduce a new collision free prunable random interleaver. The suggested interleaver is a joint structure involving rectangular and S-random interleaver. It comprises a general model for all kind of collision free prunable random interleavers. In addition, it can be designed for any number of parallel processors and any length of information sequence vector and can be considered also as a template for collision free prunable interleavers. The proposed interleaver can be used with all kind of turbo-like codes. The performance of the proposed interleaver is measured with parallel decodable serially concatenated convolutional codes (PDSCCCs) and compared to the PDSCCCs' performance with collision full S-random interleaver.Article Citation - WoS: 1Citation - Scopus: 2Prunable Collision Free Random Interleaver Design(Springer, 2012) Gazi, OrhanIn this article we introduce a new collision free prunable random interleaver. The suggested interleaver is a joint structure involving rectangular and S-random interleaver. It comprises a general model for all kind of collision free prunable random interleavers. In addition, it can be designed for any number of parallel processors and any length of information sequence vector and can be considered also as a template for collision free prunable interleavers. The proposed interleaver can be used with all kind of turbo-like codes. The performance of the proposed interleaver is measured with parallel decodable serially concatenated convolutional codes (PDSCCCs) and compared to the PDSCCCs' performance with collision full S-random interleaver.Article Citation - Scopus: 1Analysis of Parallel Decodable Turbo Codes(Ieice-inst Electronics information Communications Eng, 2012) Gazi, OrhanTurbo 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.Article Citation - WoS: 5Fast Decodable Turbo Codes(Ieee-inst Electrical Electronics Engineers inc, 2007) Gazi, Orhan; Yilmaz, A. OzgarDecoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo codes.Article Zero State Doped Turbo Equalizer(Ieee-inst Electrical Electronics Engineers inc, 2007) Yilmaz, A. Ozgur; Gazi, OrhanAlthough iterative equalizers perform well at low signal to noise ratios, high latency is a major disadvantage for their use in practical communication systems. In this article we propose zero state doped turbo equalizers (ZSDTEs) which can be processed in parallel and have significantly reduced processing delays. The proposed technique shows better performance when compared to the sliding window method.