Quasi-Cyclic LDPC Bit Selection to Limit Padding-Bit Instability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Quasi-cyclic LDPC encoding in communication systems leads to unstable transmission due to padding bits, reducing encoding and decoding efficiency and affecting data communication robustness, especially in high-order modulation and fading channels.
Innovation Solution
A data encoding method that performs quasi-cyclic LDPC encoding on information packet bit sequences, determines a one-dimensional finite-length circular buffer size, selects a redundancy version, and reads data bits from a specific starting position based on predefined parameters like lifting size and base graph matrix dimensions to form a bit sequence for stable transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If code block partition and padding bits are performed to match transport block size with quasi-cyclic LDPC encoding basic matrix, then encoding can be performed, but transmission stability deteriorates and encoding/decoding efficiency is reduced
Solution Approach 1:
The patent changes the parameter of code block grouping by setting the number of code blocks in each group to be equal (using Kmax design method), and adjusts padding bit strategies to optimize transmission stability while maintaining encoding feasibility for different transport block sizes
Solution Approach 2:
The patent introduces dynamic code block partitioning and grouping strategies that adapt to different transport block sizes and channel conditions, allowing the system to dynamically adjust the number of code blocks per group and padding bit placement to maintain optimal transmission stability
2Ease of manufacture
If more padding bits are added to match transport block size, then encoding can be performed, but encoding and decoding efficiency is reduced
Solution Approach 1:
The patent extracts and removes unnecessary padding bits by optimizing the code block partitioning strategy, keeping only the minimum required padding bits to achieve transport block size alignment, thereby improving encoding and decoding efficiency
Solution Approach 2:
The patent optimizes padding bit parameters by adjusting the code block group size and padding bit placement strategies to minimize the number of padding bits while maintaining encoding feasibility for various transport block sizes
3Adaptability or versatility
If code block groups have different numbers of code blocks, then partitioning is flexible, but overall performance deteriorates due to cask effects
Solution Approach 1:
The patent enforces homogeneity by requiring that all code block groups contain an equal number of code blocks (using Kmax design), eliminating the cask effect where groups with fewer code blocks limit overall performance, while maintaining partitioning flexibility through adjustable group numbers
4Adaptability or versatility
If quasi-cyclic LDPC encoding is performed on data with varying sizes, then data can be transmitted, but transmission stability deteriorates
Solution Approach 1:
The patent implements dynamic code block partitioning and grouping strategies that adapt to different data sizes while maintaining equal code block distribution across groups, ensuring transmission stability varies smoothly with data size rather than experiencing abrupt performance drops
Solution Approach 2:
The patent optimizes parameters such as code block size, number of groups, and padding bit placement based on the actual data size, creating a systematic approach that maintains transmission stability across different data lengths
Data Source
AI summary
Provided are a data encoding method and device, a storage medium, and a processor. The method includes: obtaining data to be sent; performing quasi-cyclic low-density parity check (LDPC) encoding on the data to be sent to obtain an LDPC codeword sequence, and interleaving the LDPC codeword sequence to obtain an interleaved LDPC codeword sequence; performing cyclic bit selection on the interleaved LDPC codeword sequence from a starting position to obtain a rate-matched codeword sequence, where the starting position is determined according to a predetermined parameter; and sending the rate-matched codeword sequence. The solution above resolves the problem in the related art of unstable transmission after performing quasi-cyclic LDPC encoding on data to be transmitted, and achieves stable transmission after the quasi-cyclic LDPC encoding.