Polar Encoding With Special Nodes for Lower-Complexity Codewords

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing polar coding techniques require a significant number of computations and consume excessive power, limiting their practical implementation and efficiency in data transmission systems.

Innovation Solution

The use of special nodes in the encoding process, such as rate 0, rate 1, REP, SPC, Type I, and Type II nodes, allows for reduced computational operations by directly determining the values of these nodes without traversing through the entire binary tree, thereby optimizing the encoding process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional polar code encoding is used, then channel capacity is achieved, but power consumption increases significantly

Engineering Contradiction:

Improvechannel capacity achievementVSAvoidpower consumption

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The encoding process is segmented by identifying special nodes (rate 0, rate 1, REP, SPC, Type I, Type II) in the binary tree structure, where each node type has specific patterns of information bits and frozen bits. This segmentation allows the encoder to treat different node types differently, skipping computations for nodes that can be determined directly from their patterns, thereby reducing overall computational complexity and power consumption while maintaining channel capacity achievement

Inventive Principle:

Principle #1Segmentation

2Reliability

If traditional polar code encoding is used, then reliable communication is achieved, but computational complexity increases

Engineering Contradiction:

Improveerror correction capabilityVSAvoidcomputational complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The binary tree encoding structure is segmented into distinct node types based on patterns of information and frozen bits. Special nodes (rate 0, rate 1, REP, SPC, Type I, Type II) are identified and handled separately from regular nodes, allowing the encoder to skip unnecessary computations for special nodes while maintaining the same error correction capability through their predetermined value assignments

Inventive Principle:

Principle #1Segmentation

3Manufacturing precision

If full binary tree traversal is used, then accurate encoding is achieved, but processing time increases

Engineering Contradiction:

Improveencoding accuracyVSAvoidprocessing time

Core Design Contradiction:

Manufacturing precisionVSLoss of time

Solution Approach 1:

The encoder performs preliminary identification of special nodes before full traversal. By recognizing node patterns (rate 0, rate 1, REP, SPC, Type I, Type II) in advance, the encoder can directly assign values to these nodes without traversing their entire subtrees, thereby reducing processing time while maintaining encoding accuracy through the predetermined value assignments for each node type

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentEP4437654B1Systems and methods for using special nodes for polar encoding in polar codes

Publication Date: 2026.01.28 HUAWEI TECH CO LTD

Figure 1~2
Figure 3~4
Figure 5

AI summary

Methods and encoders for encoding information bits to generate codewords for transmission across a communication channel are described. The method includes receiving input data comprising bits of information bits and frozen bits. Each bit has a value. Further, the method identifies at least one special arrangement in a subset of input data depending on locations of the information bits and the frozen bits. This subset of input data is of length L. The subset of input data has at least one special arrangement that enables direct computations instead of a series of computations to determine a preliminary output. The method generates a codeword for the input data from the preliminary output.