Turbo Block Interleaving for Pattern Preservation and Low Periodicity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing block interleaving techniques, such as relative prime (RP) algorithms, face limitations in preserving patterns of size p while maintaining high interleaving spreading, leading to periodicity issues and increased non-interleaved data items, especially on large block sizes, which hampers the optimization of digital transmission systems.
Innovation Solution
A block interleaving method using a turbo structure with algebraic functions to calculate intermediate values and output positions, allowing for flexible adjustment of interleaving spreading and pattern preservation, which addresses the constraints of both medium-scale and small-scale interleaving effects, optimizing the transmission system by preserving a pattern of size p and dynamically adapting to the transmission medium.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If relative prime (RP) algorithms are used for block interleaving, then interleaving spreading is improved, but periodicity issues and non-interleaved data items increase
Solution Approach 1:
The patent changes the mathematical parameters of the interleaving algorithm by using a prime number P that is different from the block size K, and by using the formula I(k) = (k×P) mod K. This parameter change eliminates the periodicity issues that occur with traditional RP algorithms while maintaining high interleaving spreading.
Solution Approach 2:
Instead of using the traditional RP approach where the interleaving distance d must be prime relative to K, the patent inverts the approach by using a prime number P and multiplying it by the index k, then taking modulo K. This inversion of the mathematical relationship eliminates the periodicity problem while preserving the interleaving spreading benefit.
2Productivity
If block size K is increased to handle large data blocks, then productivity is improved, but pattern preservation becomes more difficult
Solution Approach 1:
The patent introduces a new parameter P (a prime number) that is independent of the block size K. By using the formula I(k) = (k×P) mod K, the system can handle any block size K while automatically preserving patterns of size P. This decoupling of pattern size from block size allows large blocks to be processed while maintaining pattern integrity.
3Reliability
If interleaving spreading is increased to reduce correlation, then reliability is improved, but device complexity increases
Solution Approach 1:
The patent replaces complex mechanical or procedural interleaving methods with a simple mathematical formula I(k) = (k×P) mod K. This substitution of a straightforward mathematical operation for complex algorithms achieves high interleaving spreading and correlation reduction while minimizing computational complexity and implementation complexity.
Data Source
AI summary
A method and a device (4) for block interleaving of size K with N iterations of index j, N being greater than or equal to 1, of input digital data items indexed by a variable k={0, . . . , K−1}. The interleaving method uses a turbo structure that has two inputs and one output. At the end of each iteration j, the interleaving law I(j)(k) at the output of the interleaver (4) is modified in accordance with an input sequence formed by the position indices of the data items before interleaving (typically a ramp) and in accordance with an interleaved sequence (which provides the position of the data items after interleaving) resulting from the previous iteration of the same interleaving algorithm.