A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes

Hareedy, Ahmed
Wu, Ruiyi
Dolecek, Lara
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 additive white Gaussian noise (AWGN) and Flash channels. The OO stage operates on the protograph of the SC code to derive the optimal partitioning that minimizes the number of graphical objects that undermine the performance of SC codes under iterative decoding. Then, the CPO optimizes the circulant powers to further reduce this number. Since the nature of detrimental objects in the graph of a code critically depends on the characteristics of the channel of interest, extending the OO-CPO approach to construct SC codes for channels with intrinsic memory is not a straightforward task. In this paper, we tackle one relevant extension; we construct high performance SC codes for practical 1-D magnetic recording channels, i.e., partial-response (PR) channels. Via combinatorial techniques, we carefully build and solve the optimization problem of the OO partitioning, focusing on the objects of interest in the case of PR channels. Then, we customize the CPO to further reduce the number of these objects in the graph of the code. SC codes designed using the proposed OO-CPO approach for PR channels outperform prior state-of-the-art SC codes by up to around 3 orders of magnitude in frame error rate (FER) and 1.1 dB in signal-to-noise ratio (SNR). More intriguingly, our SC codes outperform structured block codes of the same length and rate by up to around 1.8 orders of magnitude in FER and 0.4 dB in SNR. The performance advantage of SC codes designed using the devised OO-CPO approach over block codes of the same parameters is not only pronounced in the error floor region, but also in the waterfall region.
IEEE Transactions on Information Theory


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...
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...
Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes
Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2022-01-01)
IEEESpatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, followed by rearranging and concatenating the partitioned components in a convolutional manner. The number of partitioned components determines the memory of SC codes. In this paper, we investigate the relation between the performance of SC codes and the...
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....
The Secret Arithmetic of Patterns: A General Method for Designing Constrained Codes Based on Lexicographic Indexing
Hareedy, Ahmed; Dabak, Beyza; Calderbank, Robert (2022-01-01)
IEEEConstrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of solid-state storage devices, and in increasing the reliability of data transmission over wires. Over the years, designing practical (complexity-wise) capacity-achieving constrained codes has been an area of research gaining significant interest. We recently designed various constrained c...
Citation Formats
A. Hareedy, R. Wu, and L. Dolecek, “A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes,” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4834–4852, 2020, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/98540.