LDPC Circular Buffer Rate Matching for Flexible Code Rates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data processing methods for wireless communications lack effective rate matching techniques for sequences generated through LDPC encoding, which are essential for adjusting code rates to meet various system transmission requirements.
Innovation Solution
A data processing method and device that involves obtaining a to-be-processed bit sequence, encoding it, storing the encoded bits in a circular buffer, and performing rate matching by outputting bits from the buffer, along with optional bit reordering and interleaving to achieve the desired code rate, utilizing techniques such as intra-vector-subsequence interleaving and channel interleaving.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If rate matching is performed on LDPC-encoded sequences to meet various code rates and lengths, then adaptability to different transmission requirements is improved, but decoding performance may deteriorate without proper bit reordering and interleaving techniques
Solution Approach 1:
The patent applies preliminary action by performing bit reordering and interleaving operations on the LDPC-encoded sequence before rate matching and transmission. Specifically, the encoded bits are reordered according to a predetermined pattern and interleaved to distribute adjacent bits across different transmission resources, which prevents burst errors and maintains decoding performance while enabling flexible rate matching to various code rates and lengths.
Solution Approach 2:
The patent implements dynamics by designing a flexible rate matching mechanism that can dynamically adjust the code rate and length based on transmission requirements. The bit reordering and interleaving patterns can be adapted to different code rates, and the rate matching process can selectively puncture or repeat bits to achieve the desired code rate, making the system adaptable to varying channel conditions and transmission demands while preserving decoding performance.
2Device complexity
If simple encoding is used for LDPC sequences, then encoding complexity is reduced, but the system lacks flexibility to meet various transmission requirements for different code lengths and rates
Solution Approach 1:
The patent applies segmentation by dividing the LDPC encoding process into distinct stages: initial LDPC encoding to generate a base sequence, bit reordering to rearrange the encoded bits, interleaving to distribute bits across transmission resources, and rate matching to adjust the final code rate. This segmented approach allows each stage to be independently optimized and combined flexibly to meet various transmission requirements without significantly increasing overall encoding complexity.
Solution Approach 2:
The patent implements parameter changes by modifying the bit sequence through reordering and interleaving operations that change the position and arrangement of encoded bits. These parameter changes enable the system to adapt to different code rates and lengths by adjusting the rate matching parameters (such as puncturing patterns or repetition factors) while maintaining the same underlying LDPC code structure, thus providing flexibility without requiring completely different encoding schemes.
Data Source
AI summary
Embodiments of this application disclose a data processing method and a data processing device. The method includes: obtaining a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a transport block or a code block generated by performing code block segmentation on a transport block; encoding the first to-be-processed bit sequence to obtain a first encoded bit sequence; storing all or at least some bits of the first encoded bit sequence into a circular buffer; and outputting a first output bit sequence from the bits stored in the circular buffer. According to the method and the device that are provided in this application, rate matching can be implemented for a sequence generated through LDPC encoding.