Hard-Decision LDPC Decoder With Shared Logic for Low-Latency Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional LDPC decoders face challenges in reducing latency and chip area while maintaining high throughput, as they often require storing and processing bit values in a different order than received, leading to increased time and space requirements.

Innovation Solution

A hard-decision LDPC decoder is designed with shared logic between a bit-flipping decoder and a syndrome calculator, utilizing a variation of the Gallagher B algorithm, which continuously updates parity check equations and processes bit values in the order they are received, reducing latency and chip area by eliminating the need for bit memory.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If conventional LDPC decoders store and process bit values in a different order than received, then decoding accuracy is maintained, but latency and chip area increase

Engineering Contradiction:
Improvedecoding latencyVSAvoidbit memory requirements
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The patent inverts the conventional processing order by processing bit values in the same order they are received, eliminating the need for reordering memory operations. This is achieved through a systematic reorganization of the parity check matrix processing to accommodate sequential bit input without requiring additional bit memory storage and retrieval operations.

Inventive Principle:
Principle #13The other way round (Inversion)

Solution Approach 2:

The patent extracts and eliminates the bit memory component from the decoder architecture by redesigning the processing flow to work directly with incoming bit sequences. The syndrome calculator and bit-flipping logic are reconfigured to operate on sequential bit inputs without requiring intermediate storage, thereby removing the latency and area overhead associated with bit memory.

Inventive Principle:
Principle #2Taking out (Extraction)

2Area of stationary object

If shared logic is used between bit-flipping decoder and syndrome calculator, then chip area is reduced, but logic complexity increases

Engineering Contradiction:
Improvechip areaVSAvoidlogic element sharing
Core Design Contradiction:
Area of stationary objectVSDevice complexity

Solution Approach 1:

The patent implements multi-functionality by designing logic elements that serve dual purposes: the syndrome calculator performs both initial syndrome computation and ongoing syndrome updates during bit-flipping iterations. The same XOR gates and logic circuits are reused for different stages of decoding, eliminating redundant logic and reducing overall chip area while managing complexity through unified design.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent merges the bit-flipping decoder logic and syndrome calculator into a unified processing structure where shared logic elements perform both functions. The bit-flipping unit and syndrome computation unit are integrated such that they share common computational resources, reducing the total number of logic elements required while maintaining the functional separation needed for correct operation.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS9544090B2Hard input low density parity check decoder
Publication Date: 2017.01.10 AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LTD
  • US9544090B2 patent drawing
  • US9544090B2 patent drawing
  • US9544090B2 patent drawing

AI summary

A hard input low density parity check decoder is provided that shares logic between a bit-flipping decoder and a syndrome calculator. The hard-decision decoder decodes one or more error-correcting (EC) codewords and comprises a bit-flipping decoder that flips one or more bit nodes connected to one or more unsatisfied parity checks; and a syndrome calculator that performs a parity check to determine whether the bit-flipping decoder has converged on a valid codeword, wherein the bit-flipping decoder and the syndrome calculator share one or more logic elements. The decoder optionally includes means for updating a parity check equation of each flipped bit. Error-correcting (EC) codewords are decoded by flipping one or more bit nodes connected to one or more unsatisfied parity checks; and updating one or more parity check equations associated with the one or more bit nodes each time the one or more bit nodes are flipped. The parity check equations are updated whenever a bit is updated. The exemplary method terminates based on a predefined syndrome output.