LDPC Parity-Check Matrix Scaling for Non-Multiple Lifting Values
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LDPC code technologies face limitations in supporting various lengths and code rates due to the multiple relationship of lifting values, which restricts their application in mobile communication systems requiring high data transmission compatibility.
Innovation Solution
A modified lifting method is proposed that allows the Z values to not have a multiple relationship, enabling the design of parity-check matrices with improved cycle characteristics and supporting various lengths without significant performance deterioration, by using an exponential transformation method and determining the entries of the parity-check matrix based on cycle characteristics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional LDPC code technologies use multiple relationship of lifting values, then the code structure is simplified and easier to implement, but the ability to support various lengths and code rates is limited
Solution Approach 1:
The patent changes the fundamental parameter relationship by allowing lifting values Z1 and Z2 to be non-multiples of each other, breaking from the traditional multiple relationship constraint. This enables the parity-check matrix to support various code lengths and rates without requiring the lifting values to follow a multiple relationship, thus improving adaptability while managing complexity through careful matrix design.
Solution Approach 2:
The parity-check matrix is divided into sub-matrices with different lifting values (Z1 for information bits, Z2 for parity bits), where these sub-matrices can have different dimensions. This segmentation allows independent optimization of each section for specific code lengths and rates, enabling flexible support for various configurations without overwhelming structural complexity.
2Reliability
If lifting values have a multiple relationship, then the encoding and decoding processes become more standardized, but the cycle characteristics of the code deteriorate
Solution Approach 1:
By changing from a standardized multiple relationship between lifting values to non-multiple relationships, the patent improves cycle characteristics and reliability. The exponential transformation method is introduced to generate the parity-check matrix entries, which provides a systematic approach that maintains ease of implementation while achieving better code performance through improved cycle structures.
3Adaptability or versatility
If various parity-check matrices are designed for different code lengths, then support for various lengths is improved, but the design complexity and performance optimization become significant challenges
Solution Approach 1:
The patent creates a universal exponential transformation method that can generate parity-check matrices for various code lengths and rates using a unified approach. Rather than designing separate matrices for each configuration, the exponential transformation provides a multi-functional framework that adapts to different requirements while maintaining consistent design principles and performance characteristics.
Data Source
AI summary
The present invention related to a 5G or pre-5G communication system to be provided to support a higher data transmission rate since 4G communication systems like LTE. The present invention relates to a method and an apparatus for encoding a channel in a communication or broadcasting system supporting parity-check matrices having various sizes are provided. The method for encoding a channel includes determining a block size of the parity-check matrix; reading a sequence for generating the parity-check matrix, and transforming the sequence by applying a previously defined operation to the sequence based on the determined block size.