Polar Coding Sequence Selection for Lower Storage Overhead

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing polar code coding solutions require high storage overheads due to the need to store numerous mother code sequences for various code lengths and bit rates, which is inefficient and costly.

Innovation Solution

A method that reduces storage overheads by storing only the maximum mother code sequence, allowing for polar coding to be performed by reading the required sequence from this maximum sequence, and using it to determine the target polar code through rate matching and puncturing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If multiple mother code sequences are stored for various code lengths and bit rates, then polar coding can be performed for different configurations, but storage overheads become extremely high

Engineering Contradiction:
Improvepolar coding configuration flexibilityVSAvoidstorage overhead
Core Design Contradiction:
Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

The patent applies universality by designing a single maximum mother code sequence that can serve multiple polar coding configurations. Instead of storing separate mother code sequences for different code lengths and bit rates, the system uses one universal maximum sequence from which all required sequences can be derived through selection and rate matching, making the storage system multi-functional

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent applies extraction by obtaining required mother code sequences from the maximum mother code sequence. The system extracts the specific sequence needed for a given code length and bit rate by selecting appropriate portions of the maximum sequence and applying rate matching, rather than storing each possible sequence separately

Inventive Principle:
Principle #2Taking out (Extraction)

2Ease of manufacture

If offline calculation and storage of relationship tables are used to determine information bit set A, then coding can be performed, but a large quantity of mother code sequences need to be stored

Engineering Contradiction:
Improvecoding implementationVSAvoidstored data volume
Core Design Contradiction:
Ease of manufactureVSQuantity of substance

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing only the maximum mother code sequence offline, which contains all the information needed to generate any required mother code sequence. This preliminary preparation eliminates the need to pre-store multiple sequences, as the maximum sequence serves as a comprehensive source for all future coding operations

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent applies copying by generating required mother code sequences as copies or derivatives of the maximum mother code sequence. Instead of storing independent copies of each sequence, the system creates the needed sequences by copying and processing portions of the single maximum sequence through rate matching and selection operations

Inventive Principle:
Principle #26Copying

Data Source

PatentUS12489556B2Polar coding method, apparatus, and device
Publication Date: 2025.12.02 HUAWEI TECH CO LTD
  • US12489556B2 patent drawing
  • US12489556B2 patent drawing
  • US12489556B2 patent drawing

AI summary

Embodiments of this application disclose a polar coding method, apparatus, and device, so as to reduce storage overheads of a system. A sequence for polar coding is obtained based on a length M of a target polar code, wherein the sequence comprises L sequence numbers, ordering of the L sequence numbers in the sequence is the same as ordering of the L sequence numbers in a maximum mother code sequence, wherein the maximum mother code sequence is obtained by sorting N sequence numbers of N polarized channels in ascending order or descending order of reliability metrics, wherein L and N are integer power of 2, M is smaller than or equal to L, L is smaller than or equal to N.