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
The finite length analysis of spatially-coupled codes for 1-D magnetic recording channels
Date
2017-03-01
Author
Esfahanizadeh, Homa
Hareedy, Ahmed
Dolecek, Lara
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
34
views
0
downloads
Cite This
© 2016 IEEE.Spatially-coupled (SC) codes have recently attracted significant attention due to their capability to achieve capacity approaching performance. Significant recent research has been devoted to the asymptotic study of SC codes. Although the asymptotic analysis is relevant, it cannot be directly applied in the finite-length setting due to cycle-free and averaging assumptions. In this paper, we consider the problem of finite length analysis of SC codes for magnetic-recording (MR) applications. First, we propose an efficient approach to enumerate certain combinatorial objects inside the Tanner graph representation of SC codes, objects that are found to lead to decoding errors in the high reliability regime. This enumeration approach exploits the structure of SC codes to dramatically decrease the complexity of the enumeration. Next, we consider the class of array-based SC codes with column weight 3 as a representative example, and identify the problematic combinatorial objects that cause performance degradation in the error floor area. We show that SC codes designed to have a minimal number of these problematic objects have a notable performance improvement in the error floor area.
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016236122&origin=inward
https://hdl.handle.net/11511/98454
DOI
https://doi.org/10.1109/acssc.2016.7869546
Conference Name
50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning
Esfahanizadeh, Homa; Hareedy, Ahmed; Dolecek, Lara (2017-08-09)
© 2017 IEEE.Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance. An SC code is constructed by partitioning an underlying block code into a number of components, and coupling their copies together. The number of components is determined by the memory parameter. In this paper, we study a finite length construction for the circulant-based SC codes. We introduce a new partitioning scheme, which we call minimum ...
The Development and Performance Characterization of Turbine Prototypes for a MEMS Spirometer
GOREKE, Utku; HABİBİABAD, Sahar; Azgın, Kıvanç; Serinağaoğlu Doğrusöz, Yeşim; Beyaz, Mustafa Ilker (2016-02-01)
The design, optimization, and performance characterization of turbine prototypes for the development of a Microelectromechanical Systems spirometer is reported. Four different turbines were designed based on large-scale Savonius turbine architecture. The number of turbine blades was optimized through finite-element simulations to maximize the induced moment and rotational speed at normal breathing flow rates. The turbines were manufactured and tested for their speed performance with respect to input flow ra...
An integrated scheduling and control model for multi-mode projects
Hazır, Öncü; Schmidt, Klaus Verner (2013-01-01)
In today's highly competitive uncertain project environments, it is of crucial importance to develop analytical models and algorithms to schedule and control project activities so that the deviations from the project objectives are minimized. This paper addresses the integrated scheduling and control in multi-mode project environments. We propose an optimization model that models the dynamic behavior of projects and integrates optimal control into a practically relevant project scheduling problem. From the ...
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...
An Analysis of the Bidirectional LMS Algorithm over Fast-Fading Channels
Yapici, Yavuz; Yılmaz, Ali Özgür (2012-07-01)
A bidirectional LMS algorithm is considered for estimation of fast frequency-selective time-varying channels with a promise of near optimal tracking performance and robustness to parameter imperfections under various scenarios at a practical level of complexity. The performance of the algorithm is verified by the theoretical steady-state MSE analysis and experimental bit error rate (BER) results.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Esfahanizadeh, A. Hareedy, and L. Dolecek, “The finite length analysis of spatially-coupled codes for 1-D magnetic recording channels,” presented at the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016, California, Amerika Birleşik Devletleri, 2017, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016236122&origin=inward.