Polar Code Decoding Using Future Constraints for Better Bit Estimation

The patent applies preliminary action by pre-calculating and storing transition probabilities that incorporate future constraints (frozen bits and parity bits) before the actual decoding process. The decoder pre-processes the polar code structure to identify all future constraints and computes their impact on current bit decisions, so that when decoding occurs, these constraints are already integrated into the decision-making process. This allows the system to achieve near-optimal error correction performance without adding significant complexity during the actual decoding operation.

The patent changes the parameter of transition probability calculation to incorporate future constraints. Instead of using standard transition probabilities that only consider past and present bits, the method modifies the transition probability function to include the influence of future frozen bits and parity bits. This parameter change allows the decoder to make more accurate bit estimation decisions by considering the complete code structure, while the computational overhead is managed through efficient algorithms that reuse pre-computed values.

The patent applies preliminary action by pre-computing the impact of future constraints on transition probabilities before the sequential decoding process begins. The decoder identifies all frozen bits and parity bits in advance, calculates their combined effect on each position in the codeword, and stores these pre-computed values. During the actual decoding process, the decoder simply retrieves and applies these pre-computed transition probabilities, which maintains decoding speed while significantly improving reliability through more accurate bit estimation.