Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Collision Free Row Column S-random Interleaver
Date
2009-04-01
Author
GAZİ, ORHAN
Yılmaz, Ayşen
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
49
views
0
downloads
Cite This
Parallel decodable turbo codes (PDTCs) are suitable for concurrent decoding and hence have low latency. Memory collision issue is an important problem met during parallel processing. In this article, we propose a collision free interleaver for parallel processing operations. The performance of PDTCs is analyzed with the proposed random interleaver preventing the memory collision problem. Distance spectra of PDTCs with the proposed interleaves are computed and compared to those with S-random interleaver.
Subject Keywords
Parallel decodable turbo codes
,
Parallel processing
,
Collision free interleaves
URI
https://hdl.handle.net/11511/32374
Journal
IEEE COMMUNICATIONS LETTERS
DOI
https://doi.org/10.1109/lcomm.2009.082142
Collections
Graduate School of Natural and Applied Sciences, Article
Suggestions
OpenMETU
Core
Belief propagation decoding of polar codes under factor graph permutations
Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018)
Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
Power-delay optimized VLSI threshold detection circuits and their use in parallel integer multiplication
Ercan, Furkan; Muhtaroğlu, Ali; Sustainable Environment and Energy Systems (2015-6)
Threshold detection is a fundamental logic function that has broad use in arithmetic processors, and other digital applications. Thus, any improvement in threshold detection in terms of power and/or delay contributes significantly to the field of digital circuit design. A recently reported parallel integer multiplier architecture, ABACUS, uses column compression networks to compress partial products through the final addition network. Architecture of column compression network of ABACUS is suitable for thre...
Synchronization of linear systems via relative actuation
Tuna, Sezai Emre (Elsevier BV, 2019-12-01)
Synchronization in networks of discrete-time linear time-invariant systems is considered under relative actuation. Neither input nor output matrices are assumed to be commensurable. A distributed algorithm that ensures synchronization via dynamic relative output feedback is presented.
Dimension reduced robust beamforming for towed arrays
Topçu, Emre; Candan, Çağatay; Department of Electrical and Electronics Engineering (2015)
Adaptive beamforming methods are used to obtain higher signal to interference plus noise ratio at the array output. However, these methods are very sensitive to steering vector and covariance matrix estimation errors. To overcome this issue, robust methods are usually employed. On the other hand, implementation of these robust methods can be computationally expensive for arrays with large number of sensors. Reduced dimension techniques aim to lower the computational load of adaptive beamforming algorithms w...
Wideband doa estimation for nonuniform linear arrays with wiener array interpolation
Yasar, T. Kaya; Tuncer, Temel Engin (2008-07-23)
Coherent wideband DOA estimation for non-uniform linear arrays (NLA) is considered. Array interpolation is used for two mappings. In the first mapping, NLA is mapped to a uniform linear array with the same array aperture. In the second mapping covariance matrices for each frequency bin are mapped to a single one at the center frequency for coherent DOA estimation. A Wiener formulation is used for array interpolation where both signal and noise powers are estimated with maximum likelihood method. Different a...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. GAZİ and A. Yılmaz, “Collision Free Row Column S-random Interleaver,”
IEEE COMMUNICATIONS LETTERS
, pp. 257–259, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32374.