Finite-length construction of high performance spatially-coupled codes via optimized partitioning and lifting

Date

2019-01-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

103
views

0
downloads

© 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 sense that it effectively works for SC codes with various partitioning schemes, column weights, and memories. Next, we present a two-stage framework for the construction of high performance binary SC codes optimized for the additive white Gaussian noise channels; we aim at minimizing the number of detrimental combinatorial objects in the error floor region. In the first stage, we deploy a novel partitioning scheme, called the optimal overlap partitioning, to produce the optimal partitioning corresponding to the smallest number of detrimental objects. In the second stage, we apply a new circulant power optimizer to further reduce the number of detrimental objects in the lifted graph. SC codes constructed by our new framework have up to two orders of magnitude error floor performance improvement and up to 0.6 dB SNR gain compared to prior state-of-the-art SC codes.

Subject Keywords

Absorbing sets, Circulant-based, Error floor, Finite-length, LDPC codes, Optimal partitioning, Optimized lifting, Spatially-coupled codes

URI

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

Journal

IEEE Transactions on Communications

DOI

https://doi.org/10.1109/tcomm.2018.2867493

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Non-Binary LDPC Codes for Magnetic Recording Channels: Error Floor Analysis and Optimized Code Design Hareedy, Ahmed; Amiri, Behzad; Galbraith, Rick; Dolecek, Lara (2016-08-01) © 2016 IEEE.In this paper, we provide a comprehensive analysis of the error floor along with code optimization guidelines for structured and regular non-binary low-density parity-check (NB-LDPC) codes in magnetic recording (MR) applications. While the topic of the error floor performance of binary LDPC codes over additive white Gaussian noise (AWGN) channels has recently received considerable attention, very little is known about the error floor performance of NB-LDPC codes over other types of channels, des...
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...
Spatially Coupled Codes Optimized for Magnetic Recording Applications Esfahanizadeh, Homa; Hareedy, Ahmed; Dolecek, Lara (2017-02-01) © 1965-2012 IEEE.Spatially coupled (SC) codes are a class of sparse graph-based codes known to have capacity-approaching performance. SC codes are constructed based on an underlying low-density parity-check (LDPC) code, by first partitioning the underlying block code and then putting replicas of the components together. Significant recent research efforts have been devoted to the asymptotic, ensemble-averaged study of SC codes, as these coupled variants of the existing LDPC codes offer excellent properties....
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...
Errors-and-Erasures Decoding for Block Codes With Feedback Nakiboğlu, Barış (2012-01-01) Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the stra...

Citation Formats

H. Esfahanizadeh, A. Hareedy, and L. Dolecek, “Finite-length construction of high performance spatially-coupled codes via optimized partitioning and lifting,” IEEE Transactions on Communications, vol. 67, no. 1, pp. 3–16, 2019, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85052628626&origin=inward.