Turbo Code Block Segmentation for Fewer Filler Bits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Turbo coding and decoding systems face challenges in efficiently matching large concatenated transport blocks to available FEC block sizes, leading to increased padding of filler bits and complexity, especially when the input block size exceeds the maximum FEC block size supported, which limits error correction performance.
Innovation Solution
A method and apparatus that segment a concatenated transport block into segments of equal size using two adjacent FEC block sizes, minimizing the number of filler bits required while using the fewest number of segments allowed by available non-contiguous FEC block sizes, determined by logic circuitry based on the transport block length and available FEC block sizes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the input block size exceeds the maximum FEC block size supported by turbo code, then the CTB must be segmented into several small segments, but this increases the number of segments and the padding of filler bits
Solution Approach 1:
The patent applies segmentation by dividing the concatenated transport block into multiple segments, each fitting within the maximum FEC block size. The key innovation is using two different FEC block sizes (K1 and K2) to segment the CTB, allowing flexible adaptation to available non-contiguous FEC block sizes while minimizing the number of segments and filler bits required.
2Reliability
If the CTB is segmented into several small segments to fit FEC block sizes, then error correction is improved, but the padding of filler bits increases
Solution Approach 1:
The patent changes the parameter of FEC block size by utilizing two different sizes (K1 and K2) from available non-contiguous options. This allows the system to optimize the segmentation to minimize filler bits while maintaining error correction performance, rather than using a single fixed block size that would require excessive padding.
3Reliability
If turbo codes performance improves with increasing interleaver length, then error correction capability increases, but complexity and delay increase limiting maximum FEC block size
Solution Approach 1:
The patent introduces dynamics by allowing the system to adaptively select between two different FEC block sizes (K1 and K2) based on the available non-contiguous block sizes and the CTB length. This dynamic selection enables optimization of performance versus complexity for each specific transmission scenario.
4Device complexity
If a small number of FEC block sizes are supported for high speed decoding and reduced storage, then device complexity is reduced, but adaptability to match CTB size decreases
Solution Approach 1:
The patent achieves universality by designing a segmentation method that works with any available non-contiguous FEC block sizes. The system can handle different CTB sizes and adapt to different available FEC block size configurations using the same two-size segmentation approach, making it universally applicable across various system configurations.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method and apparatus for turbo coding and decoding is provided herein. During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (FEC) block size KI is determined from a group of available non-contiguous FEC block sizes between Kmin and Kmax, and wherein Kmin <=KI< Kmax and wherein KI is additionally based on X. The concatenated transport block of length X is segmented into C segments each of size substantially equal KI. An FEC codeword for each of the C segments is determined using FEC block size KI; and the C FEC codewords are transmitted over the channel.