Quasi-Cyclic LDPC Matrix Scaling for Flexible Multimedia FEC

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Multimedia communication systems face challenges in efficiently transmitting and receiving high-capacity content due to data congestion and loss, leading to increased complexity with conventional Forward Error Correction (FEC) schemes that require different FEC codes for varying codeword lengths and code rates.

Innovation Solution

A quasi-cyclic Low Density Parity Check (LDPC) code transmission and reception method that supports various codeword lengths and code rates using scaling, row separation/merge, and puncturing schemes, generating a parity check matrix based on a base matrix with permutation and zero matrices to adapt to different transmission requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional AL-FEC schemes are used to support various codeword lengths and code rates, then error control capability is improved, but system complexity increases due to requiring different FEC codes for each configuration

Engineering Contradiction:
Improveerror control capabilityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies universality by designing a single base parity check matrix that can generate multiple different parity check matrices through scaling operations. This base matrix serves multiple functions by supporting various codeword lengths and code rates through parameter adjustments (scaling factors), eliminating the need for separate FEC codes for each configuration while maintaining error control capability.

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

Solution Approach 2:

The patent utilizes parameter changes by introducing scaling factors that modify the size of permutation matrices and zero matrices within the base parity check matrix. By changing these scaling parameters, the system can adapt to different codeword lengths and code rates without changing the fundamental code structure, thus reducing complexity while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If data is transmitted on a packet basis to enable flexible content delivery, then adaptability is improved, but data loss occurs on a packet basis leading to user inconvenience

Engineering Contradiction:
Improvecontent delivery flexibilityVSAvoiddata loss
Core Design Contradiction:
Adaptability or versatilityVSLoss of information

Solution Approach 1:

The patent applies beforehand cushioning by incorporating forward error correction capabilities into the data transmission system prior to transmission. The parity check matrices are designed to detect and correct errors that may occur during packet-based transmission, providing a buffer against data loss before it affects the received content.

Inventive Principle:
Principle #11Beforehand cushioning (Prior cushioning)

Data Source

PatentUS9059741B2Apparatus and method for transmitting and receiving a quasi-cyclic low density parity check code in a multimedia communication system
Publication Date: 2015.06.16 SAMSUNG ELECTRONICS CO LTD
  • US9059741B2 patent drawing
  • US9059741B2 patent drawing
  • US9059741B2 patent drawing

AI summary

A method is provided for transmitting a Low Density Parity Check (LDPC) code by a signal transmission apparatus in a multimedia system. The method includes generating the LDPC code based on a resulting parity check matrix, which is generated by performing a scaling down operation on a base parity check matrix; and transmitting the LDPC code. The scaling down operation is performed based on a scaling factor for determining a size of each permutation matrix in the resulting parity check matrix and a size of each zero matrix included in the resulting parity check matrix, and the scaling factor is determined based on a number of column blocks included in the base parity check matrix and a size of each permutation matrix included in the base parity check matrix.