Wireless Receiver Iterative Decoding for Interleaving Mismatch
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication methods using convolutional interleaving and block interleaving combined, the sequence of bits is rearranged across blocks, leading to a mismatch between bit likelihood information handled by the demodulator and the decoder, making it difficult to perform ideal iterative decoding processing, as both require a block of infinite length, which is unrealistic.
Innovation Solution
A receiver configuration that includes a demodulator, a deinterleaver, a decoder, and an interleaver, performing iterative decoding processing using finite-length blocks that include bit information from the blocks immediately before and after the target block, allowing for reverse deinterleaving and re-interleaving to align bit information for effective decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If convolutional interleaving and block interleaving are used in combination to rearrange bits across blocks, then the simplicity of bit interleaving configuration is improved, but the matching between bit likelihood information handled by demodulator and decoder deteriorates
Solution Approach 1:
The patent segments the bit likelihood information into distinct groups: those handled by the demodulator and those handled by the decoder. By identifying and separating these groups, the system can apply different processing approaches to each segment, allowing convolutional interleaving to be used for bit-level rearrangement while block interleaving handles symbol-level operations, thus maintaining both simplicity and matching integrity.
Solution Approach 2:
The patent introduces an intermediary mechanism that coordinates the operations of the demodulator and decoder regarding bit likelihood information. This intermediary ensures that the bit likelihood information groups are properly aligned and matched after convolutional and block interleaving operations, resolving the mismatch issue while preserving the simplicity of the interleaving configuration.
2Device complexity
If block-type random interleaving is used for symbol rearrangement, then the device complexity is reduced, but the applicability to BICM-ID processing deteriorates due to sequence rearrangement across blocks
Solution Approach 1:
The patent applies local quality by making the interleaving behavior context-dependent. For bits within a single symbol block, simple block-type random interleaving is used. For bits that need to be rearranged across block boundaries, convolutional interleaving is applied locally. This localized application of different interleaving strategies maintains low overall device complexity while enabling BICM-ID processing.
Solution Approach 2:
The patent introduces dynamic control over the interleaving process, where the system adaptively determines which bits require convolutional interleaving versus block interleaving based on the BICM-ID processing requirements. This dynamic approach allows the simple block-type interleaver to be enhanced selectively, improving adaptability without significantly increasing device complexity.
3Measurement precision
If ideal iterative decoding processing is performed with infinite-length blocks, then the decoding accuracy is improved, but the loss of time and computational resources worsens
Solution Approach 1:
The patent applies partial action by performing iterative decoding processing on finite-length blocks that are sufficient for practical purposes rather than attempting to process infinite-length blocks. The system processes bit likelihood information in manageable finite segments, achieving adequate decoding accuracy for wireless communication applications without the prohibitive time and computational costs of infinite-block processing.
Solution Approach 2:
The patent performs preliminary organization of bit likelihood information into properly matched groups before initiating iterative decoding processing. By pre-grouping the bit likelihood information according to demodulator and decoder handling requirements, the system prepares the data in an optimal format for finite-block processing, thereby achieving near-ideal decoding accuracy with reduced processing time compared to unprepared infinite-block processing.
Data Source
AI summary
A wireless communication technique in which information that has been encoded and interleaved (the sequence of bits has been rearranged) on the transmission side is subjected to iterative decoding processing by using a demodulator, a deinterleaver, a decoder, and an interleaver on the receiving side.