LDPC Lifting Scheme for Lower-Complexity Wireless Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LDPC coding schemes for wireless communications are computationally complex and energy-intensive, limiting the ability of wireless communication devices to scale throughput effectively.
Innovation Solution
The proposed method involves encoding bits using a LDPC code defined by a base graph and a lifting scheme, where the base graph includes multiple check nodes and variable nodes, including at least one second-degree variable node. The lifting scheme defines the number of copies of the base graph used to generate the LDPC code and specifies cyclic shifts associated with connected variable and check nodes, ensuring restrictions on second-degree variable nodes and least significant bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LDPC encoding and decoding is implemented to improve error correction capability, then communication reliability is improved, but computational complexity and energy consumption increase
Solution Approach 1:
The patent segments the base graph into multiple subgraphs and processes them in parallel using multiple processing elements. This segmentation allows the encoding and decoding operations to be distributed across multiple units, reducing the computational burden on any single unit while maintaining overall error correction capability.
Solution Approach 2:
The patent introduces a parallel processing dimension by implementing multiple processing elements that operate simultaneously on different subgraphs. This dimensional expansion from sequential to parallel processing reduces computational complexity and energy consumption while preserving reliability.
2Reliability
If LDPC encoding and decoding is implemented to improve error correction capability, then communication reliability is improved, but energy consumption increases
Solution Approach 1:
The patent divides the encoding and decoding functions across multiple processing elements that operate in parallel. This segmentation reduces the energy burden on any single processing unit while maintaining overall error correction capability, as each unit processes a smaller portion of the total data.
Solution Approach 2:
The patent transitions from sequential processing to parallel processing by introducing multiple processing elements. This dimensional change enables simultaneous execution of encoding and decoding operations on different subgraphs, significantly reducing total energy consumption while preserving error correction performance.
3Reliability
If traditional LDPC coding schemes are used to ensure error correction, then communication reliability is maintained, but throughput scaling is limited
Solution Approach 1:
The patent segments the base graph into multiple subgraphs that can be processed independently and in parallel. This segmentation enables throughput scaling by allowing multiple processing elements to work simultaneously on different subgraphs, increasing overall data transmission capacity while maintaining error correction reliability.
Solution Approach 2:
The patent introduces parallel processing as an additional dimension to traditional sequential LDPC coding. This enables throughput to scale with the number of processing elements while maintaining error correction performance, as each processing element handles a portion of the total data stream independently.
Data Source
AI summary
Methods, systems, and devices for wireless communications are described. A wireless communication device may implement a low-density parity-check (LDPC) code to encode and/or decode bits of a signal. The LDPC code may be defined by a base graph and a lifting scheme. The base graph may include check nodes and variable nodes. The lifting scheme may define a quantity of copies of the base graph used to generate the LDPC code and respective cyclic shifts associated with connected variable nodes and check nodes. The respective cycle shifts may be defined such that one or more cycles associated with a minimum length of the LDPC code are associated with a restriction on second degree variable nodes, nodes associated with least significant bits, or a combination thereof. Additionally, or alternatively, the respective cycle shifts may be defined such that a weighted girth of the LDPC code satisfies a threshold.