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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
On parallelized serially concatenated codes
Download
index.pdf
Date
2007-03-15
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
96
views
0
downloads
Cite This
Serial concatenated codes show very good performance at low signal to noise ratios. However, large decoding delays due to long input frame lengths constitute a major disadvantage for these type of codes. In this study we introduce a new class of concatenated convolutional codes which are very suitable for parallel decoding, thus have much less decoding delays and also show comparable performance to that of classical serial concatenated convolutional codes. The analytical upper bound expressions for performance of the proposed structures are derived using the uniform interleaver concept.
Subject Keywords
Product Codes
URI
https://hdl.handle.net/11511/31355
DOI
https://doi.org/10.1109/wcnc.2007.137
Conference Name
IEEE Wireless Communications and Networking Conference
Collections
Graduate School of Natural and Applied Sciences, Conference / Seminar
Suggestions
OpenMETU
Core
Fine resolution frequency estimation from three DFT samples: Case of windowed data
Candan, Çağatay (2015-09-01)
An efficient and low complexity frequency estimation method based on the discrete Fourier transform (DFT) samples is described. The suggested method can operate with an arbitrary window function in the absence or presence of zero-padding. The frequency estimation performance of the suggested method is shown to follow the Cramer-Rao bound closely without any error floor due to estimator bias, even at exceptionally high signal-to-noise-ratio (SNR) values.
Finite-length construction of high performance spatially-coupled codes via optimized partitioning and lifting
Esfahanizadeh, Homa; Hareedy, Ahmed; Dolecek, Lara (2019-01-01)
© 1972-2012 IEEE.Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention, thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the se...
Noise reduction in time-frequency domain
Kalyoncu, Özden; SÜnver, Zafer; Department of Electrical and Electronics Engineering (2007)
In this thesis work, time-frequency filtering of nonstationary signals in noise using Wigner-Ville Distribution is investigated. Continuous-time, discrete-time and discrete Wigner Ville Distribution definitions, their relations, and properties are given. Time-Frequency Peak Filtering Method is presented. The effects of different parameters on the performance of the method are investigated, and the results are presented. Time-Varying Wiener Filter is presented. Using simulations it is shown that the performa...
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...
A New Method For Efficient Bandwidth Control of Narrowband Planar Filters
Alicioglu, Bulent; Boyacioglu, Gokhan; Oruc, Sacid; Yavuz, Caglar; Yıldırım, Nevzat (2013-10-10)
Narrowband filters that are utilized in the IF stages are almost the most effective components when the performance parameters such as the Intermodulation Spurs (IMS) and noise floor of the entire strip are considered. Thus, selectivity of the IF filters should be as high as possible. Required sharpness and ultimate rejection often dictate high Q-structures like cavity or waveguide structures, but these type of filters fail to comply with physical parameters such as space and weight that planar filters do. ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. GAZİ and A. Yılmaz, “On parallelized serially concatenated codes,” presented at the IEEE Wireless Communications and Networking Conference, Hong Kong, PEOPLES R CHINA, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31355.