Transport Block Segmentation Without Dummy Bits in Turbo Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, the segmentation of data blocks into code blocks for turbo coding often requires the addition of dummy bits due to size limitations, which reduces transmission efficiency, especially when the data block size exceeds the internal interleaver size, leading to varying code block sizes and inefficient use of radio resources.
Innovation Solution
A method that determines the number of code blocks and maps a transport block to these blocks with a cyclic redundancy check (CRC) attached, ensuring the sum of each code block's length and CRC length matches the internal interleaver's block size, thereby avoiding the need for dummy bits and maintaining consistent code block sizes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If data blocks are segmented into code blocks for turbo coding, then the coding can be implemented with fixed interleaver sizes, but dummy bits must be added when data block size exceeds interleaver size, reducing transmission efficiency
Solution Approach 1:
The patent changes the parameter of code block size to be dynamically adaptable rather than fixed. By allowing code block sizes to vary based on the data block size and interleaver capacity, the system eliminates the need for dummy bits while maintaining implementability. The code block size is adjusted as a variable parameter to optimize transmission efficiency.
Solution Approach 2:
The patent introduces dynamic segmentation where the number and size of code blocks are determined adaptively based on the input data block size. Instead of static fixed-size segmentation, the system dynamically calculates optimal code block sizes to fill interleaver resources completely without wasting capacity through dummy bits.
2Adaptability or versatility
If data blocks larger than interleaver size are segmented, then coding can proceed, but code blocks end up with different sizes, leading to inefficient radio resource usage
Solution Approach 1:
The patent changes the code block size parameter from fixed to variable, allowing each code block to have a size that perfectly matches the interleaver capacity when combined with CRC. This parameter adjustment ensures uniform code block sizes across all segments, optimizing radio resource allocation and eliminating inefficiencies from size variations.
Solution Approach 2:
The patent performs preliminary calculation of code block sizes before segmentation, determining the exact number and size of code blocks needed to completely fill the interleaver resources. This advance planning ensures that all code blocks have consistent sizes and that radio resources are utilized efficiently without waste.
3Stability of the object's composition
If dummy bits are added to match interleaver size, then the coding structure is maintained, but transmission efficiency decreases due to wasted resources
Solution Approach 1:
The patent changes the code block size parameter to be flexible rather than fixed, allowing code blocks to exactly fill the interleaver capacity when combined with CRC bits. This eliminates the need for dummy bits while maintaining the structural integrity of the coding system through adaptive parameter adjustment.
Solution Approach 2:
The patent enables the coding system to self-adjust its parameters (code block sizes) to perfectly match the available interleaver resources. The system automatically determines optimal segmentation without external intervention or waste, making the coding structure self-optimizing rather than requiring fixed dummy bit padding.
Data Source
AI summary
A method and device for determining a size of a transport block based on modulation and coding related information, and resource information.