Turbo Interleaver Size Selection for Contention-Free Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing turbo coding systems face challenges in implementing contention-free interleavers for various information block sizes, leading to inefficiencies and potential memory access contentions during decoding, which affect the error-correcting performance and parallel processing capabilities.
Innovation Solution
A method for selecting interleaver sizes using a set of predefined sizes based on semi-log slicing, where the interleaver size K′ is determined from a set of sizes (K″=ap×f) and adjusted to avoid multiples of (2m−1, with optional addition or subtraction of a small integer δ, to ensure contention-free and quasi-cyclic properties, allowing for efficient decoding and parallel processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a turbo interleaver is designed to provide good weight distribution and error-correcting capabilities, then decoding performance is improved, but memory access contentions occur during parallel processing
Solution Approach 1:
The patent changes the structural parameters of the interleaver by defining specific mathematical relationships between row and column indices (using equations involving constants α and β) to generate permutation patterns that simultaneously achieve good weight distribution and avoid memory access contentions during parallel decoding operations
2Adaptability or versatility
If the interleaver size is increased to accommodate larger information blocks, then coding versatility is improved, but filler bits increase causing inefficiency
Solution Approach 1:
The patent defines interleaver sizes based on specific mathematical formulas (K′=a×p×f and K″=a×p×f) with constrained parameter ranges, allowing the system to efficiently support various information block sizes while minimizing the number of filler bits required through optimized size selection
3Productivity
If the interleaver size is reduced to minimize filler bits, then encoding efficiency is improved, but the ability to support various information block sizes is reduced
Solution Approach 1:
The patent creates a universal interleaver design framework where a single set of mathematical equations and parameter constraints can generate appropriate interleaver configurations for multiple different information block sizes, allowing one interleaver structure to serve multiple functions across varying data rates and block sizes
Data Source
AI summary
A method and apparatus for selecting interleaver sizes for turbo codes is provided herein. During operation information block of size K is received. An interleaver size K′ is determined that is related to K″, where K″ from a set of sizes; wherein the set of sizes comprise K″=ap×f, pmin≦p≦pmax; fmin≦f≦fmax, wherein a is an integer and f is a continuous integer between fmin and fmax, p takes integer values between pmin and pmax, a>1, pmax>pmin, pmin>1. The information block of size K is padded into an input block of size K′ using filler bits, if needed. Encoding is performed using the original input block and the interleaved input block to obtain a codeword block using a turbo encoder. The codeword block is transmitted through the channel.