A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning

Date

2017-08-09

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

85
views

0
downloads

© 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 overlap partitioning, that outperforms previous methods. We also present a general approach for the enumeration of problematic objects in the error-floor regime that can be applied to any circulant-based SC code and to a variety of partitioning schemes. Compared to the uncoupled block codes, an SC code constructed by the new approach has more than 1.5 and 3 orders of magnitude performance improvement for the memory 1 and 2, respectively. Additionally, it outperforms the existing method of partitioning via cutting vectors by at least half an order of magnitude; this performance advantage becomes more pronounced for SC codes with higher memories.

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85034099961&origin=inward
https://hdl.handle.net/11511/98243

DOI

https://doi.org/10.1109/isit.2017.8006818

Conference Name

2017 IEEE International Symposium on Information Theory, ISIT 2017

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
A Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage Hareedy, Ahmed; Lanka, Chinmayi; Guo, Nian; Dolecek, Lara (2019-04-01) © 2018 IEEE.Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are increasingly being considered as a powerful error correction tool for modern dense storage devices. Optimizing NB-LDPC codes to overcome their error floor is one of the main code design challenges facing storage engineers upon deploying such codes in practice. Furthermore, the increasing levels of asymmetry incorporated by the channels underlying modern dense storage systems, e.g., multi-level Flash systems, exa...
The finite length analysis of spatially-coupled codes for 1-D magnetic recording channels Esfahanizadeh, Homa; Hareedy, Ahmed; Dolecek, Lara (2017-03-01) © 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...
A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes Hareedy, Ahmed; Wu, Ruiyi; Dolecek, Lara (2020-08-01) Because of their capacity-approaching performance and their complexity/latency advantages, spatially-coupled (SC) codes are among the most attractive error-correcting codes for use in modern dense data storage systems. SC codes are constructed by partitioning an underlying block code and coupling the partitioned components. Here, we focus on circulant-based SC codes. Recently, the optimal overlap (OO), circulant power optimizer (CPO) approach was introduced to construct high performance SC codes for additiv...
Spatially-Coupled Code Design for Partial-Response Channels: Optimal Object-Minimization Approach Hareedy, Ahmed; Esfahanizadeh, Homa; Tan, Andrew; Dolecek, Lara (2018-01-01) © 2018 IEEE.Spatially-coupled (SC) codes are among the most attractive error-correcting codes for use in modern storage devices. SC codes are constructed by partitioning an underlying block code and coupling the partitioned components. Here, we focus on circulant-based SC codes. Recently, the optimal overlap (OO), circulant power optimizer (CPO) approach was introduced to construct high performance SC codes for AWGN and Flash channels. The OO partitioning stage operates on the protograph of the SC code, whi...

Citation Formats

H. Esfahanizadeh, A. Hareedy, and L. Dolecek, “A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning,” presented at the 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Almanya, 2017, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85034099961&origin=inward.