Code Block Segmentation With Equal-Length Padding for Turbo Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile communication systems, the existing code block segmentation methods increase channel coding complexity due to a large number of codeword types and interleavers, especially when the information word size exceeds a certain threshold, leading to reduced intervals between code blocks and increased system complexity.
Innovation Solution
A method for segmenting information words into code blocks by setting the number of code blocks to a minimum integer value and determining equal or varying code block sizes, with the option to insert filler bits, to maintain consistent codeword lengths and reduce system complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the information word is segmented into multiple code blocks using conventional methods, then the coding length is reduced to improve error correction performance, but the number of codeword types and interleavers increases, leading to increased channel coding complexity
Solution Approach 1:
The information word is segmented into multiple code blocks of equal size, where each code block is independently encoded. This segmentation reduces the coding length of each block while maintaining a systematic approach that controls the number of codeword types, thereby improving error correction performance without excessively increasing channel coding complexity
Solution Approach 2:
The patent determines code block sizes based on specific parameters including information word length, transport block size, and code block size constraints. By dynamically adjusting these parameters and using filler bits to pad code blocks to equal sizes, the system optimizes the balance between error correction performance and coding complexity
2Reliability
If the code block size is reduced to improve turbo code performance, then error correction capability increases, but the number of interleavers and codeword types increases, reducing system efficiency
Solution Approach 1:
The information is divided into multiple code blocks of equal size, each independently processed by the turbo encoder. This segmentation enables the system to utilize smaller, more efficient code blocks that improve error correction capability while maintaining a manageable number of interleavers and codeword types through the equal-size structure
Solution Approach 2:
The system determines optimal code block sizes based on information word length and transport block size parameters, using filler bits to ensure equal-sized code blocks. This parameter optimization ensures that each code block achieves optimal turbo coding performance while maintaining overall system efficiency
3Device complexity
If filler bits are inserted to equalize code block sizes, then channel coding complexity is reduced through consistent codeword lengths, but transmission overhead increases
Solution Approach 1:
The patent determines the number of filler bits needed based on information word length and target code block size parameters. By calculating and inserting the minimum necessary filler bits to achieve equal-sized code blocks, the system reduces channel coding complexity through consistent codeword lengths while minimizing transmission overhead through efficient padding
Data Source
AI summary
A method for segmenting an information word into code blocks in a mobile communication system. The method includes setting a number C of code blocks to a minimum integer not less than a value obtained by dividing X by Z; when sizes K of all code blocks are determined to be equal when a length X of the information word is greater than a maximum length Z of each code block, determining a minimum integer value T not less than a value obtained by dividing a size of the information word by a number of code blocks, and determining, as K, a maximum value most approaching the value T among the values based on which a size of the code block can be set in units of eight bits; and generating a code block by inserting filler bits into a specific code block when a value obtained by multiplying K by C is greater than X.