18521574. BIT FLIPPING DECODER WITH OPTIMIZED MAXIMUM ITERATIONS FOR VARIED BIT FLIPPING THRESHOLDS simplified abstract (Micron Technology, Inc.)

From WikiPatents
Jump to navigation Jump to search

BIT FLIPPING DECODER WITH OPTIMIZED MAXIMUM ITERATIONS FOR VARIED BIT FLIPPING THRESHOLDS

Organization Name

Micron Technology, Inc.

Inventor(s)

Mustafa N. Kaynak of San Diego CA (US)

Eyal En Gad of Highland CA (US)

Sivagnanam Parthasarathy of Carlsbad CA (US)

BIT FLIPPING DECODER WITH OPTIMIZED MAXIMUM ITERATIONS FOR VARIED BIT FLIPPING THRESHOLDS - A simplified explanation of the abstract

This abstract first appeared for US patent application 18521574 titled 'BIT FLIPPING DECODER WITH OPTIMIZED MAXIMUM ITERATIONS FOR VARIED BIT FLIPPING THRESHOLDS

Simplified Explanation

The abstract describes a patent application for a bit flipping (BF) decoder that uses two sets of BF thresholds to decode codewords and achieve target decoding rates.

  • The BF decoder decodes codewords using a first set of BF thresholds.
  • A minimum number of iterations of decoding is determined to achieve a target decoding rate.
  • A second set of BF thresholds is used to decode codewords, which are less likely to cause bit flips.
  • Another minimum number of iterations is determined to achieve a second target decoding rate.
  • Bits in a codeword are flipped using the first set of BF thresholds initially, and then using the second set if the codeword remains undecoded.

Potential Applications

The technology can be applied in:

  • Error correction in communication systems
  • Data storage systems

Problems Solved

This technology helps in:

  • Improving decoding efficiency
  • Enhancing error correction capabilities

Benefits

The benefits of this technology include:

  • Higher decoding rates
  • More reliable data transmission

Potential Commercial Applications

Potential commercial applications include:

  • Telecommunications industry
  • Data centers

Possible Prior Art

One possible prior art for this technology could be:

  • Previous BF decoding methods in error correction systems

Unanswered Questions

How does this technology compare to other error correction methods?

The article does not provide a comparison with other error correction methods.

What is the computational complexity of this decoding technique?

The article does not discuss the computational complexity of the decoding technique.


Original Abstract Submitted

A of bit flipping (BF) decoder decodes codewords using a first set of BF thresholds. A first minimum number of iterations of decoding performed on the codewords is determined to achieve a first target decoding rate. Codewords are decoded using a second set of BF thresholds. The first set of BF thresholds are more likely to cause bit flips than the second set of BF thresholds. A second minimum number of iterations of decoding performed on the codewords is determined to achieve a second target decoding rate. Bits in a codeword are flipped using the first set of BF thresholds for the first minimum number of iterations. Bits are flipped in the codeword using the second set of BF thresholds in response to determining the codeword remains undecoded as a result of the first minimum number of iterations.