Polar Code Bit-Tuple Puncturing for Reliable Block Size Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in efficiently adjusting block sizes of encoded data using puncturing and repetition techniques, which can affect communication performance, particularly with Polar codes where the codeword length is a power-of-two, and there is a need for improved puncturing and repetition patterns to enhance decoding performance.
Innovation Solution
The proposed solution involves an apparatus and method for encoding data using puncturing or repetition patterns based on bit tuples, where at most one bit of each tuple is designated as a puncture or repeated bit, ensuring that the output and repetition input of an XOR are not both erased, thereby improving communication reliability by selecting bits with the lowest erasure probabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If puncturing or repetition is used to adjust block size, then block size matching is improved, but communication performance deteriorates
Solution Approach 1:
The codeword bits are divided into bit tuples (groups of bits), and puncturing or repetition is applied selectively to specific bits within each tuple rather than uniformly across the entire codeword. This segmentation allows the system to adjust block size while preserving the integrity of critical bit relationships, thereby maintaining communication performance.
Solution Approach 2:
Different bits within bit tuples are treated differently based on their importance and relationship to XOR operations. The patent applies puncturing or repetition locally to specific bits rather than uniformly, ensuring that critical bits (those involved in XOR operations) are protected while less critical bits can be adjusted to match block size requirements.
2Productivity
If conventional puncturing or repetition is applied, then block size adjustment is achieved, but decoding performance deteriorates due to erasure of critical bits
Solution Approach 1:
The patent identifies and marks specific bits within bit tuples as puncture or repetition candidates before the actual puncturing or repetition operation. This preliminary identification ensures that critical bits (particularly those involved in XOR operations) are protected from erasure, while non-critical bits are selected for adjustment, thereby maintaining decoding performance.
Solution Approach 2:
Bit tuples serve as an intermediary structure between the codeword and the puncturing/repetition operation. By organizing bits into tuples and applying operations at the tuple level rather than the individual bit level, the system can adjust block size while preserving the logical relationships between bits that are essential for accurate decoding.
Data Source
AI summary
The disclosure relates in some aspects to information encoding. Information encoding may involve puncturing bits of a codeword or repeating bits of a codeword. The disclosure relates in some aspects to selecting a puncturing or repetition pattern. In some aspects, a puncture pattern for data encoding is selected based on a criterion that the output and the repetition input of an XOR are not erased. In some aspects, a repetition pattern for data encoding is selected based on a criterion that repetition not be applied for the output and the repetition input of an XOR.