Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes

Date

2022-01-01

Author

Yang, Siyi
Hareedy, Ahmed
Calderbank, Robert
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

115
views

0
downloads

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 density distribution of partitioning matrices. While adopting higher memories results in improved SC code performance, obtaining finite-length, high-performance SC codes with high memory is known to be computationally challenging.We break this computational bottleneck by developing a novel probabilistic framework that obtains (locally) optimal density distributions via gradient descent. Starting from random partitioning matrices abiding by the obtained distribution, we perform low-complexity optimization algorithms that minimize the number of detrimental objects to construct high-memory, high-performance quasi-cyclic SC codes. We apply our framework to various objects of interest, from the simplest short cycles, to more sophisticated objects such as concatenated cycles aiming at finer-grained optimization. Simulation results show that codes obtained through our proposed method notably outperform state-of-the-art SC codes with the same constraint length and optimized SC codes with uniform partitioning. The performance gain is shown to be universal over a variety of channels, from canonical channels such as additive white Gaussian noise and binary symmetric channels, to practical channels underlying flash memory and magnetic recording systems.

Subject Keywords

absorbing sets, Codes, communications, Convolutional codes, data storage, edge distribution, Flash memories, gradient descent, LDPC codes, magnetic recording, Memory management, near-optimal partitioning, Optimization, Parity check codes, Partitioning algorithms, Probabilistic logic, spatially-coupled codes

URI

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

Journal

IEEE Transactions on Information Theory

DOI

https://doi.org/10.1109/tit.2022.3207321

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes with High Memories Yang, Siyi; Hareedy, Ahmed; Venkatasubramanian, Shyam; Calderbank, Robert; Dolecek, Lara (2021-07-12) Spatially-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. While adopting higher memories results in improved SC code performance, obtaining opti...
Belief propagation decoding of polar codes under factor graph permutations Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018) Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
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...
Managing Device Lifecycle: Reconfigurable Constrained Codes for M/T/Q/P-LC Flash Memories Hareedy, Ahmed; Dabak, Beyza; Calderbank, Robert (2021-01-01) © 1963-2012 IEEE.Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce the effect of physical instabilities. Constrained codes are used in storage to avoid problematic patterns, and thus prevent errors from happening. Recently, we introduced binary symmetric lexicographically-ordered constrained codes (LOCO c...
Minimizing the Number of Detrimental Objects in Multi-Dimensional Graph-Based Codes Hareedy, Ahmed; Kuditipudi, Rohith; Calderbank, Robert (2020-09-01) © 1972-2012 IEEE.The increasing demand for access to data has led to dramatic increases in data storage densities, and as densities increase, new sources of error appear. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. A recent innovation improves the performance of MD spatially-coupled codes that are based on circulants by carefully relocating some circulants to minimize the number of short cycles. Howev...

Citation Formats

S. Yang, A. Hareedy, R. Calderbank, and L. Dolecek, “Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes,” IEEE Transactions on Information Theory, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85139386445&origin=inward.