Lifted LDPC Code Description for Lower Storage Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in efficiently encoding and decoding data at high rates while maintaining cost-effectiveness, particularly in the context of emerging technologies like 5G and NR, where improvements in LDPC codes are needed to support diverse data transmission requirements.
Innovation Solution
The method involves selecting lifting size values and sets of lifting values to generate compactly described lifted LDPC codes by interconnecting edges in multiple copies of a base parity check matrix, allowing for efficient encoding and decoding of data using a single base graph that can be scaled for various block lengths and code rates, reducing the complexity of storing and generating multiple parity check matrices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple separate parity check matrices are stored for different block lengths and code rates, then coding performance can be optimized for specific requirements, but storage requirements and system complexity increase significantly
Solution Approach 1:
The patent merges multiple parity check matrices into a single base graph that can generate all required matrices through lifting operations. Instead of storing separate matrices for different block lengths and code rates, the system stores one compact base graph and uses lifting size parameters to generate the specific matrix needed at runtime, significantly reducing storage requirements while maintaining coding performance.
Solution Approach 2:
The base graph is designed to serve multiple functions by supporting different lifting sizes to generate parity check matrices for various block lengths and code rates. This universal structure replaces the need for multiple specialized matrices, allowing the same base graph to be used across different communication scenarios and requirements.
2Adaptability or versatility
If multiple separate parity check matrices are generated and stored, then specific coding requirements can be met, but device complexity and processing overhead increase
Solution Approach 1:
The system transitions from static storage of multiple fixed matrices to a dynamic generation approach where a single base graph adaptively generates the required matrix based on lifting size parameters. This dynamic approach reduces the number of stored components while maintaining the ability to meet specific coding requirements through parameter adjustment.
Solution Approach 2:
The patent segments the functionality of multiple matrices into a modular base graph structure with configurable lifting operations. Instead of managing multiple complete matrices, the system segments the problem into a compact base structure and parameter-based generation, reducing overall system complexity while preserving adaptability.
3Ease of manufacture
If traditional LDPC encoding methods are used without lifting, then implementation is straightforward, but efficiency and scalability to high data rates are limited
Solution Approach 1:
The patent introduces lifting size as a key parameter that transforms the base graph into scaled-up parity check matrices suitable for high data rate transmissions. By changing the lifting size parameter, the system can efficiently scale from low to high data rates while maintaining implementation simplicity through the same base graph structure, thus improving productivity without sacrificing ease of implementation.
Data Source
AI summary
Certain aspects of the present disclosure generally relate to techniques for compactly describing lifted low-density parity-check (LDPC) codes. A method by a transmitting device generally includes selecting a first lifting size value and a first set of lifting values; generating a first lifted LDPC code by applying the first set of lifting values to interconnect edges in copies of a parity check matrix (PCM) having a first number of variable nodes and a second number of check nodes; determining a second set of lifting values for generating a second lifted LDPC code for a second lifting size value based on the first lifted PCM and the first set of lifting values; encoding a set of information bits based the first lifted LDPC code or the second lifted LDPC code to produce a code word; and transmitting the code word.