LDPC Transport Block Segmentation for High-Throughput Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LTE turbo codes exhibit high error rates and complexity, leading to unnecessary data retransmissions and increased latency, which are unsuitable for next-generation communication systems requiring high throughput and low latency.
Innovation Solution
A method for segmenting a transport block of an LDPC code using a 2n shifting network, where the number of code blocks is determined based on a maximum lifting value, and the transport block is segmented into code blocks with specific length constraints to optimize transmission efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LTE turbo codes are used with increased code size to improve error correction performance, then error rate decreases, but complexity increases and latency increases
Solution Approach 1:
The transport block is segmented into multiple code blocks, each of which is independently encoded using LDPC codes. This segmentation allows the system to achieve reliable error correction for each block while maintaining manageable complexity for each encoding operation, avoiding the exponential complexity growth associated with encoding very large single blocks.
Solution Approach 2:
The patent changes the code type from turbo code to LDPC code, and adjusts the code block size parameters to optimize performance. By selecting appropriate lifting values and code block lengths, the system achieves low error rates while maintaining low complexity and meeting latency requirements for next-generation communication systems.
2Reliability
If LTE turbo codes are used with increased code size to improve error correction performance, then error rate decreases, but transmission latency increases
Solution Approach 1:
By dividing the transport block into multiple smaller code blocks that can be processed in parallel, the overall encoding and decoding time is reduced. Each code block is independently encoded and can be transmitted separately, allowing for faster processing and reduced latency while maintaining reliable error correction through the use of LDPC codes with appropriate block sizes.
3Device complexity
If the transport block is segmented into many code blocks to reduce complexity, then code complexity decreases, but the length of minimum-length code blocks decreases causing performance deterioration
Solution Approach 1:
The patent carefully selects the lifting value and code block length parameters to ensure that code blocks maintain sufficient length for good performance while keeping the number of blocks manageable. By adjusting these parameters, the system achieves an optimal balance where code blocks are long enough to provide reliable error correction but not so long that encoding complexity becomes excessive.
4Adaptability or versatility
If code blocks are shortened to fit transport block size, then adaptability increases, but minimum-length code block performance deteriorates
Solution Approach 1:
The patent uses variable lifting values to adjust code block lengths to match the transport block size while maintaining minimum length requirements. By selecting appropriate lifting values from a set of predetermined values, the system can adapt to different transport block sizes without excessively shortening code blocks, thereby preserving error correction performance while achieving the required adaptability.
Data Source
AI summary
Disclosed are a method for dividing a carrying block of a Low Density Parity Check (LDPC) code and an apparatus therefor. The method for dividing a LDPC code of the present disclosure can obtain a high throughput by using a limited size of shifting network. Moreover, it is possible to prevent degradation in performance due to a minimum size of code block by performing shortening for a large size of code block while minimizing the number of code blocks. Furthermore, in selection of a minimum size of code block, since a minimum size of code block is selected on the basis of shortening for a relatively large size of code block, it is possible to increase the size of the minimum size of code block.