Minimizing the Number of Detrimental Objects in Multi-Dimensional Graph-Based Codes

Download

index.pdf

Date

2020-09-01

Author

Hareedy, Ahmed
Kuditipudi, Rohith
Calderbank, Robert

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

121
views

47
downloads

© 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. However, cycles become more detrimental when they combine together to form more advanced objects, e.g., absorbing sets, including low-weight codewords. In this paper, we show how MD relocations can be exploited to minimize the number of detrimental objects in the graph of an MD code. Moreover, we demonstrate the savings in the number of relocation arrangements earned by focusing on objects rather than their constituent cycles. Our technique is applicable to a wide variety of one-dimensional (OD) codes. Simulation results demonstrate significant lifetime gains achieved by the proposed MD codes on an industry-recommended model for Flash systems, and signal-to-noise ratio gains on an industry-recommended model for magnetic recording systems, both with respect to OD codes with similar parameters. The second order analysis of MD relocations relies on conditions and options for an object, called a pattern, to form a bigger cycle after MD relocations, which are discussed in this paper.

Subject Keywords

absorbing sets, data storage, Flash memory, Graph-based codes, LDPC codes, lifetime, magnetic recording, multi-dimensional codes, relocations, spatially-coupled codes

URI

https://hdl.handle.net/11511/98521

Journal

IEEE Transactions on Communications

DOI

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

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

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...
A General Non-Binary LDPC Code Optimization Framework Suitable for Dense Flash Memory and Magnetic Storage Hareedy, Ahmed; Lanka, Chinmayi; Dolecek, Lara (2016-09-01) © 2017 IEEE.Transmission channels underlying modern dense storage systems, e.g., Flash memory and magnetic recording (MR) systems, significantly differ from canonical channels, like additive white Gaussian noise (AWGN) channels. While existing low-density parity-check (LDPC) codes optimized for symmetric, AWGN-like channels are being actively considered for Flash applications, we demonstrate that, due to channel asymmetry, such approaches are inadequate. We introduce a refined definition of absorbing sets, ...
Compressive sensing for radar target detection Çağlıyan, Firuze; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2014) Compressive sampling, also known as compressive sensing and sparse recovery, is a new type of sampling theory, which predicts that sparse signals and images can be reconstructed from far less amount of data than what was traditionally considered necessary (i.e. Nyquist/Shannon sampling theory). The theory has many applications such as design of new imaging systems, cameras, sensor networks and analog to digital converters. Several algorithms have been proposed for the measurement and recovery process of the...
Improving the scalability of ILP-based multi-relational concept discovery system through parallelization Mutlu, Ayşe Ceyda; Karagöz, Pınar; Kavurucu, Yusuf (2012-03-01) Due to the increase in the amount of relational data that is being collected and the limitations of propositional problem definition in relational domains, multi-relational data mining has arisen to be able to extract patterns from relational data. In order to cope with intractably large search space and still to be able to generate high-quality patterns. ILP-based multi-relational data mining and concept discovery systems employ several search strategies and pattern limitations. Another direction to cope w...
Minimization of Transmission Duration of Data Packets over an Energy Harvesting Fading Channel Ozcelik, F. Mehmet; Uctu, Goksel; Uysal, Elif (2012-12-01) The offline problem of transmission completion time minimization for an energy harvesting transmitter under fading is extended to allow packet arrivals during transmission. A method for computing an optimal power and rate allocation (i.e., an optimal offline schedule) is developed and studied.

Citation Formats

A. Hareedy, R. Kuditipudi, and R. Calderbank, “Minimizing the Number of Detrimental Objects in Multi-Dimensional Graph-Based Codes,” IEEE Transactions on Communications, vol. 68, no. 9, pp. 5299–5312, 2020, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/98521.