Run-Length-Limited Low-Density Parity Check Codes Based on Deliberate Error Insertion

Vasić, Bane; Pedagani, K.

doi:10.1109/tmag.2004.826904

Cited by 30 publications

(18 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Depending on whether the length of the input or the output is fixed, we obtain a fixed-to-variable or variableto-fixed length encoder, respectively. An alternative approach, presented in [9], is to introduce deliberate errors in the output of the encoder, leading to a fixed code rate.…”

Section: Rll Encodermentioning

confidence: 99%

Linear and Non-Linear Run Length Limited Codes

2015

View full text Add to dashboard Cite

We compare achievable rates of binary linear and non-linear run length limited codes where the constraint is on the number of consecutive ones. We show that there is a significant loss in rate when linear codes are used. For non-linear codes, we present practical encoders with rates close to the theoretical limits. We show that our approach can be generalised to avoid arbitrary sequences in the data stream.

show abstract

Section: Rll Encodermentioning

confidence: 99%

Linear and Non-Linear Run Length Limited Codes

2015

View full text Add to dashboard Cite

show abstract

“…Furthermore, various row-by-row coding methods for specific 2-D constraints were presented in [32], [33]. Vasić and Pedagani proposed an alternative approach in [34], known as deliberate bit flipping (DBF), for applying binary 1-D (0, k)-RLL constraint to error correction codewords (when k is large e.g., k = 15) to overcome the non-linear effects of 1-D constrained codes. Using a (0, k)-RLL constraint monitor, a deliberate bit error is introduced into an error correction codeword whenever the number of consecutive zeros in the codeword reaches k. The method only relies on the capability of the ECC to correct both the deliberate errors and channel errors at the receiver.…”

Section: Introductionmentioning

confidence: 99%

“…Nevertheless, there is no attempt to minimize the number of bit flips for removing the forbidden configurations by the 1-D (0, k)-RLL constraint from a given binary codeword. Moreover, the main problem with the DBF method introduced in [34] still is the number of deliberate bit errors that may overwhelm the ECC decoder and affect the errorfloor performance (which limits its applications).…”

Section: Introductionmentioning

confidence: 99%

A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels

Bahrami

Vasić

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, we present a deliberate bit flipping (DBF) coding scheme for binary two-dimensional (2-D) channels, where specific patterns in channel inputs are the significant cause of errors. The idea is to eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword that is arranged into a 2-D array by deliberately flipping the bits that violate the constraint. The DBF method relies on the error correction capability of the code being used so that it should be able to correct both deliberate errors and channel errors. Therefore, it is crucial to flip minimum number of bits in order not to overburden the error correction decoder. We devise a constrained combinatorial formulation for minimizing the number of flipped bits for a given set of harmful patterns. The generalized belief propagation algorithm is used to find an approximate solution for the problem. We evaluate the performance gain of our proposed approach on a data-dependent 2-D channel, where 2-D isolated-bits patterns are the harmful patterns for the channel. Furthermore, the performance of the DBF method is compared with classical 2-D constrained coding schemes for the 2-D no isolated-bits constraint on a memoryless binary symmetric channel. Index Terms-Data dependent channels, constrained coding, probabilistic inference, graphical models, and generalized belief propagation (GBP).

show abstract

“…In [6] a systematic approach was given for obtaining RLL-ECCs from binary error-correcting codes. The storage system industry motivated research into relatively complex RLLECCs based on turbo codes and low density parity check (LDPC) codes [7][8][9][10][11]. Recently, new RLL Codes were proposed for visible light communication (VLC) systems together with soft decoding methods [12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Run length limited error control codes construction based on one control matrix property

Farkas

Schindler

2017

Journal of Electrical Engineering

View full text Add to dashboard Cite

In this manuscript a simple method is presented for constructing run length limited error control codes from linear binary block codes. The run length limited properties are obtained via addition of a carefully chosen fixed binary vector - a modifier to all codewords without introducing any additional redundancy. Modifier selection is based on a specific property, which can be found in some of the linear binary block codes control matrices. Similar known methods are based on properties of generator matrices. However some codes are specified via control matrices, for example low density parity check codes. The method proposed in this letter could be applied to some of them directly. This is illustrated in this manuscript using example in which a run length limited low density parity check code is obtained from Gallager code.

show abstract

Run-Length-Limited Low-Density Parity Check Codes Based on Deliberate Error Insertion

Cited by 30 publications

References 14 publications

Linear and Non-Linear Run Length Limited Codes

Linear and Non-Linear Run Length Limited Codes

A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels

Run length limited error control codes construction based on one control matrix property

Contact Info

Product

Resources

About