Wi‑Fi LDPC Codeword Expansion for Parallel Decoding Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing demand for higher throughput in wireless communications, particularly with the introduction of longer codewords in Wi-Fi standards like 802.11be, necessitates enhanced parallel decoding capabilities to handle the larger number of codewords per symbol, which existing LDPC codewords struggle to accommodate efficiently.
Innovation Solution
A method is introduced to generate longer LDPC codewords by applying a mask matrix to a base matrix, expanding the codeword size from 1944 bits to 3888 bits, while maintaining the same row and column weights, allowing for improved parallel processing and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If longer codewords are used to increase throughput, then data transmission capacity is improved, but decoding complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the long codeword decoding task into multiple parallel shorter codeword decoding operations. The base matrix is segmented into multiple sub-matrices, and the encoding process is divided into multiple coding operations that can be executed in parallel, thereby reducing the complexity of decoding long codewords while maintaining high throughput capability
Solution Approach 2:
The patent implements nesting by embedding multiple shorter codeword structures within a longer codeword framework. The base matrix structure is nested with sub-matrices that can be independently processed, allowing the system to handle long codewords by nesting multiple smaller decoding units within a single decoding operation
2Productivity
If more codewords per symbol are transmitted, then spectral efficiency is improved, but parallel decoding capability requirements increase
Solution Approach 1:
The patent achieves universality by designing a base matrix structure that can serve multiple functions simultaneously. The same base matrix with its sub-matrix structure can generate multiple codewords per symbol while maintaining a unified decoding approach, allowing the system to achieve high spectral efficiency without proportionally increasing parallel decoding complexity
3Productivity
If codeword length is extended beyond 1944 bits, then data transmission capacity is improved, but existing LDPC codeword structures become insufficient
Solution Approach 1:
The patent applies dynamics by creating a flexible base matrix structure that can adapt to different codeword length requirements. The base matrix with its sub-matrix configuration can be dynamically adjusted to generate codewords of various lengths, providing the adaptability needed for extended codeword lengths beyond the traditional 1944 bits while maintaining structured decoding capability
Data Source
AI summary
This disclosure describes systems, methods, and devices related to for low-density parity-check (LDPC) Wi-Fi coding and decoding. A device may identify a first base matrix to generate LDPC codewords of 1944 bits; identify a mask matrix to generate a second base matrix based on the first base matrix used to generate LDPC codewords of 3888 bits, the entries of the mask matrix having values of 0, 1, and −1; generate the second base matrix by multiplying each the first base matrix by the mask matrix, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix; generate a parity check matrix by multiplying the second base matrix by the identity matrix; generate a LDPC codeword of 3888 bits based on the parity check matrix; and transmit a frame including the LDPC codeword.