Reconfigurable LDPC Decoder Schedules for Multi-Code Support

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

LDPC decoders require pre-loading different parity-check matrices for various code configurations, leading to wasted cycles and storage, especially when only one configuration is used, due to the need to scan and store multiple matrices.

Innovation Solution

A reconfigurable LDPC decoder system that uses customized decoding schedules generated in software, providing step-by-step instructions for decoding LDPC codewords without the need for large parity-check matrices, allowing for flexible code configurations and reducing memory usage and processing time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If multiple parity-check matrices are pre-loaded for different code configurations, then the decoder can support multiple code configurations, but memory storage and processing time increase

Engineering Contradiction:

Improvecode configuration supportVSAvoidmemory storage

Core Design Contradiction:

Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

The patent implements a universal parity-check matrix that can be reconfigured through row permutations to support multiple code configurations. Instead of storing separate matrices for different code rates and lengths, a single matrix structure is designed to adapt to various configurations by reordering its rows, thereby reducing memory storage requirements while maintaining multi-configurational support

Inventive Principle:

Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent introduces dynamic reconfiguration capability where the parity-check matrix can be dynamically permuted and reorganized during operation. The system uses control logic to rearrange matrix rows based on the desired code configuration, enabling the decoder to adapt to different code rates and lengths without requiring separate pre-loaded matrices for each configuration

Inventive Principle:

Principle #15Dynamics

2Adaptability or versatility

If multiple parity-check matrices are pre-loaded for different code configurations, then the decoder can support multiple code configurations, but processing time increases due to parsing through large matrices

Engineering Contradiction:

Improvecode configuration supportVSAvoidprocessing time

Core Design Contradiction:

Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent pre-computes and stores permutation patterns that define how to rearrange the universal matrix rows for different code configurations. During operation, instead of parsing through large matrices, the system quickly applies pre-determined permutation patterns to reconfigure the matrix, significantly reducing processing time while maintaining support for multiple configurations

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent segments the parity-check matrix into smaller blocks or groups of rows that can be independently permuted. This segmentation allows the system to reconfigure the matrix for different code configurations by reordering these smaller segments rather than processing the entire large matrix, thereby reducing the computational burden and processing time

Inventive Principle:

Principle #1Segmentation

3Reliability

If a fixed decoder design is used for a specific code configuration, then decoding performance is optimized for that configuration, but the decoder cannot decode other configurations

Engineering Contradiction:

Improvedecoding performanceVSAvoidcode configuration flexibility

Core Design Contradiction:

ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent designs a universal decoder architecture with a reconfigurable parity-check matrix that maintains optimized decoding performance across multiple code configurations. The matrix is constructed with specific properties that ensure reliable decoding while allowing row permutations to adapt to different configurations, thus achieving both reliability and flexibility

Inventive Principle:

Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent changes the structural parameters of the parity-check matrix through row permutations and reorganizations to adapt to different code configurations. By modifying the matrix parameters (row ordering, block structure) while maintaining the underlying code structure, the decoder achieves optimized performance for each configuration without sacrificing adaptability

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS9026886B1Methods and systems for reconfigurable LDPC decoders

Publication Date: 2015.05.05 MARVELL ASIA PTE LTD

AI summary

The present disclosure includes systems and methods for acquiring a first set of information for a plurality of low density parity check (LDPC)-encoded data symbols, acquiring a second set of information for the plurality of LDPC-encoded data symbols, and selecting a window including a subset of the plurality of LDPC-encoded data symbols. The present disclosure includes acquiring a decoder schedule having information for controlling the decoder, wherein the information in the decoder schedule includes decoding instructions based on a configuration of at least one of the first set of information and the second set of information. The present disclosure further includes determining a likelihood of an error in the window using the decoding instructions in the decoder schedule, and updating the second set of information for selected data symbols of the subset based on the likelihood of an error in the window.