LDPC Circular Buffer Coding for Variable-Length Bit Sequences
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data processing methods for LDPC codes struggle to efficiently support coding requirements for information bit sequences of various lengths, which hampers system coding and decoding performance.
Innovation Solution
A data processing method that involves coding a first bit sequence by adding a padding bit to obtain a second bit sequence with redundant bits, which is then stored in a circular buffer, allowing for more flexible and efficient coding and decoding of information bits of different lengths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a fixed-size LDPC base matrix is used for coding, then the coding structure is simple and regular, but it cannot efficiently support information bit sequences of various lengths
Solution Approach 1:
The information bit sequence is segmented into multiple code blocks, each of which is independently coded using the fixed-size LDPC base matrix. This allows the system to handle information sequences of various total lengths while maintaining the simplicity of the fixed matrix structure for each block.
Solution Approach 2:
The patent introduces a time dimension by processing information bits in multiple code blocks sequentially. Instead of requiring a single large matrix to handle all bit lengths simultaneously, the system uses repetition in the time domain (multiple code blocks) to achieve versatility for various information lengths while keeping each matrix operation simple and fixed-size.
2Adaptability or versatility
If padding bits are included in the circular buffer, then the coding can support various bit lengths, but the storage capacity for actual information bits is reduced
Solution Approach 1:
The patent extracts and removes padding bits from the circular buffer after coding is complete. By separating the padding function (used only during coding) from the storage function (circular buffer), the system maintains versatility for various bit lengths during coding while maximizing the storage capacity for actual information bits during transmission.
Solution Approach 2:
Padding bits are added preliminarily during the coding phase to enable various bit length support, but are subsequently removed before storage in the circular buffer. This preliminary action allows the system to achieve adaptability when needed while eliminating the storage overhead.
3Productivity
If rate matching is performed to select to-be-sent information bits, then the transmission can be optimized, but the processing time increases
Solution Approach 1:
The patent performs rate matching preliminarily during the coding phase, selecting and organizing the required information bits before they are stored in the circular buffer. This preliminary rate matching reduces the processing burden during transmission, as the circular buffer is pre-configured with the correct bits ready for immediate transmission without additional processing delays.
Data Source
AI summary
This application provides a data processing method, a data processing apparatus, and a communications device. The data processing method includes: coding a first bit sequence, to obtain a second bit sequence, where the first bit sequence includes a first information bit and a first padding bit, and the second bit sequence includes a second information bit and a redundant bit; and storing the second bit sequence in a circular buffer.