LDPC Constellation Block Interleaving for Burst Error Spreading

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional cell interleaving methods often fail to sufficiently enhance reception performance in communication systems due to limitations in spreading burst errors across codewords.

Innovation Solution

A method is introduced that generates multiple constellation block sequences from a codeword, employing a constellation block interleaver to spread these blocks across a code block, thereby reducing the impact of burst errors and equalizing reception performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional cell interleaving is applied to spread burst errors across codewords, then reception performance should improve, but the improvement is insufficient in modern communication systems

Engineering Contradiction:
Improvereception performanceVSAvoidinterleaving structure complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent divides the codeword into multiple sections, with each section containing a specific number of complex cells. This segmentation allows for more granular control of error spreading compared to conventional cell-by-cell interleaving, enabling better reception performance while maintaining manageable system complexity through structured organization.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a two-dimensional interleaving structure where complex cells are arranged in sections with both row and column indices. This dimensional approach transforms the traditional one-dimensional cell interleaving into a multi-dimensional structure, enhancing the spreading of burst errors across different sections and improving reception performance.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If cell interleaving is applied to spread burst errors, then error distribution improves, but the interleaving process becomes more complex

Engineering Contradiction:
Improveerror distribution capabilityVSAvoidinterleaving process complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

By dividing the codeword into multiple sections with defined structures, the patent achieves versatile error distribution across different parts of the codeword. Each section can be independently processed, providing adaptability in how burst errors are spread while keeping the overall process organized and manageable.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary organization of complex cells into sections with specific row and column assignments before the actual interleaving operation. This preliminary structuring simplifies the subsequent interleaving process by providing a predefined framework, reducing the complexity of the overall operation while maintaining effective error distribution capability.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentEP3493408B1Transmission method
Publication Date: 2020.06.17 SUN PATENT TRUST
  • EP3493408B1 patent drawingFigure 1
  • EP3493408B1 patent drawingFigure 2
  • EP3493408B1 patent drawingFigure 3

AI summary

In order to transmit a codeword that is generated based on a quasi-cyclic low-density parity-check coding scheme and consists of N cyclic blocks each consisting of Q bits, a bit permutation is applied to the bits of the codeword, a plurality of constellation blocks each consisting of G×M bits are generated, and a block permutation is applied to the constellation blocks. The bit permutation is adopted for each of N/M sections each consisting M cyclic blocks such that the constellation blocks each consist of G×M bits from M distinct cyclic blocks of the associated section. The block permutation is equivalent to writing the constellation blocks into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k is a positive integer.