Sparse Parity-Check Matrix Encoding for MIMO OFDM Error Bursts

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current error control coding technologies, particularly in MIMO OFDM systems, face challenges in effectively preventing long sequences of noisy bits and achieving high-performance error correction, especially with optional LDPC codes in IEEE 802.11n standards.

Innovation Solution

A MIMO transmitter system employing a scrambler, forward error correction encoder with a parity check matrix derived from a base matrix, interleaver, QAM mapping module, and inverse fast Fourier transform module, along with specific parity check matrices and encoding methods like Richardson-Urbanke encoding, to encode data blocks and prevent sequences of adjacent noisy bits.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional error control coding is used in MIMO OFDM systems, then the system can transmit data, but long sequences of noisy bits cannot be effectively prevented

Engineering Contradiction:
Improveerror correction capabilityVSAvoidsequences of noisy bits
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent segments the data stream into multiple parallel streams and applies different encoding schemes to different segments. Specifically, it uses convolutional encoding for some streams and LDPC encoding for others, then interleaves them. This segmentation allows the system to prevent long sequences of noisy bits by distributing errors across different encoded segments rather than having them concentrated in one location.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an interleaver as an intermediary component between the encoding stage and the transmission stage. This interleaver reorders the encoded bits from multiple streams, acting as a mediator that distributes adjacent noisy bits across different code words and streams. This intermediary operation breaks up long sequences of noisy bits into shorter, more manageable error patterns that can be corrected by the decoding process.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If LDPC codes are used to achieve high-performance error correction, then error correction capability improves, but the system complexity increases

Engineering Contradiction:
Improveerror correction performanceVSAvoidencoding system complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent merges multiple encoding techniques (convolutional encoding and LDPC encoding) into a hybrid system. By combining the strengths of both approaches - the simplicity and robustness of convolutional codes with the high performance of LDPC codes - the system achieves superior error correction capability while managing complexity through structured integration. The merged approach allows optional use of LDPC while maintaining compatibility with simpler convolutional encoding paths.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent implements a dynamic encoding system where the choice between convolutional encoding and LDPC encoding can be adjusted based on channel conditions and performance requirements. The system dynamically selects encoding parameters such as code rate, block length, and encoding type to optimize the trade-off between error correction performance and computational complexity for different operating scenarios.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS9009560B1Apparatus for encoding and decoding using sparse matrices
Publication Date: 2015.04.14 MARVELL ASIA PTE LTD
  • US9009560B1 patent drawing
  • US9009560B1 patent drawing
  • US9009560B1 patent drawing

AI summary

An apparatus includes a circuit configured to at least one of (i) encode first data to produce encoded data or (ii) decode second data to produce decoded data. The circuit is configured to operate according to a predetermined matrix. The predetermined matrix is represented by a two-dimensional grid of elements. Each element of the predetermined matrix labeled with a hyphen corresponds to a zero matrix. Each element of the predetermined matrix labeled with a number corresponds to a respective cyclic-permutation matrix.