Turbo Rate Matching with Redundancy Versions for Bit Coverage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current rate matching algorithms in wireless communications systems face challenges such as high bit dropout rates and decreased decoding performance due to difficulties in interpreting headers and inefficient data distribution across redundancy versions.
Innovation Solution
A rate matcher system that employs a Turbo encoder and decoder, using redundancy versions generated through puncturing algorithms and puncturing logic to distribute systematic and parity bits across multiple redundancy versions, ensuring high decoding performance across various operating scenarios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If known rate matching algorithms are used to transmit encoded messages across redundancy versions, then transmission can be performed with standard protocols, but a high percentage of bits are not selected for transmission within a reasonable number of transmissions
Solution Approach 1:
The encoded message is segmented into systematic bits and parity bits, which are then distributed across multiple redundancy versions. The rate matcher selectively transmits different segments (systematic bits in some versions, parity bits in others) to ensure comprehensive bit coverage across transmissions, resolving the issue of bits not being selected within a reasonable number of transmissions.
Solution Approach 2:
The rate matcher performs preliminary analysis of the encoded message structure before transmission, identifying which bits need to be transmitted and in which redundancy versions. This preliminary action ensures that all bits are accounted for and scheduled across the appropriate redundancy versions, preventing bit dropout and improving transmission efficiency.
2Adaptability or versatility
If known rate matching algorithms are used for transmission, then standard protocols can be maintained, but decoding performance decreases drastically if the receiving station cannot interpret the header
Solution Approach 1:
The patent applies different transmission strategies to different parts of the message based on their importance. Systematic bits (containing essential message information) are transmitted with higher priority and in specific redundancy versions, while parity bits are distributed differently. This local quality approach ensures that even if header interpretation fails, the most critical message components can still be decoded successfully.
Solution Approach 2:
The rate matcher prepares multiple redundancy versions with different bit compositions in advance, cushioning against the possibility of header interpretation failure. By distributing systematic and parity bits across different versions, the system ensures that alternative decoding paths are available if the primary header interpretation fails, maintaining decoding performance under adverse conditions.
3Reliability
If bits are distributed across multiple redundancy versions, then data integrity can be maintained, but the complexity of the rate matching algorithm increases
Solution Approach 1:
The rate matcher uses parameter changes (swapping between different transmission modes and bit selection patterns) to manage complexity while maintaining data integrity. By systematically varying which bits are transmitted in which redundancy versions based on predefined rules and parameters, the algorithm achieves comprehensive bit coverage without requiring overly complex decision-making processes.
Data Source
AI summary
Apparatuses and methods are provided for generating a plurality of redundancy versions using various rate matching algorithms. In some embodiments, a rate matcher is provided that allocates systematic and parity bits to the redundancy versions in a manner that allows all, of these bits to be transmitted in at least one redundancy version. In some embodiments, the rate matcher uses a first puncturing algorithm to generate both a first redundancy version and a third redundancy version, but allocates a different proportion of the systematic bits to these redundancy versions. In these embodiments, the second redundancy version may include only bits that were not transmitted in the first redundancy version.


