Single S-Random Interleaver Iterative Diversity Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional turbo-coded systems face computational complexity and large memory requirements due to the need for multiple or large S-random interleavers, which limits data rates and is undesirable for diversity transmissions.
Innovation Solution
A system and method utilizing a single S-random interleaver iteratively for diversity transmissions, where each subsequent transmission employs a concatenation of the same interleaver, reducing memory storage needs and enabling efficient data processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple or large S-random interleavers are used for diversity transmissions, then turbo code performance is improved, but computational complexity and memory requirements increase
Solution Approach 1:
The patent combines multiple interleaving operations into a single interleaver by concatenating the input sequence with its own interleaved version. This merging approach achieves the diversity effect of multiple interleavers while using only one interleaver instance, thereby reducing computational complexity and memory requirements while maintaining turbo code performance
Solution Approach 2:
The single interleaver is designed to perform multiple functions: it serves as both the primary interleaver and the diversity generating element through iterative concatenation. This multi-functional design eliminates the need for separate interleavers for each diversity transmission, reducing overall system complexity
2Reliability
If multiple or large S-random interleavers are used for diversity transmissions, then turbo code performance is improved, but memory storage requirements increase
Solution Approach 1:
The patent merges the functionality of multiple large interleavers into a single interleaver by using iterative concatenation of the input sequence with its interleaved version. This approach achieves the same diversity effect while requiring storage for only one interleaver instance instead of multiple large ones, significantly reducing memory storage requirements
Solution Approach 2:
Instead of storing multiple separate interleavers, the patent creates copies of the interleaved sequence through iterative processing. The same interleaver is applied multiple times to the concatenated sequence, generating diversity without requiring multiple interleaver instances in memory
3Ease of operation
If pre-computed address permutation is stored in memory, then real-time computation difficulty is resolved, but large memory storage is required
Solution Approach 1:
The patent uses periodic iterative processing where the same interleaver operation is applied repeatedly to the concatenated sequence. This periodic application of the single interleaver generates the diversity effect without requiring pre-computed address permutations for multiple interleavers, reducing memory storage while maintaining ease of operation
Solution Approach 2:
The input sequence is preliminarily concatenated with itself before interleaving. This preliminary action creates a longer sequence that, when processed by the single interleaver, generates the diversity effect that would otherwise require multiple interleavers, reducing the need for large pre-computed address permutation tables
Data Source
AI summary
A diversity code transmission system is disclosed. The diversity code transmission system comprises an encoder encoding a set of bits. The system also comprises an interleaver receiving the encoded bits and providing an output. A coder or modulator for providing a first transmission signal is also used. The interleaver iteratively receives its own output to provide an iterated output to a coder or modulator to provide a diversity transmission signal. The receiving system supports iterative decoding and joint iterative demodulation and decoding.