Polar Code Sequence Generation from a Maximum Mother Sequence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing polar coding solutions require storing a large number of mother code sequences to support various code lengths and bit rates, leading to high storage overheads in communication systems.
Innovation Solution
The method involves storing only the maximum mother code sequence, which can be used to generate required code sequences through puncturing and rate matching, reducing the number of sequences that need to be stored.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a large quantity of mother code sequences are stored to support all combinations of code lengths and bit rates, then the system can support various coding requirements, but the storage overheads of the system become extremely high
Solution Approach 1:
The patent applies universality by designing a single maximum mother code sequence that can serve multiple functions. This single sequence can be punctured or rate-matched to generate different code sequences for various code lengths and bit rates, replacing the need for storing multiple dedicated mother code sequences. The maximum mother code sequence thus becomes a universal resource that adapts to different coding requirements through processing operations.
Solution Approach 2:
The patent extracts only the essential maximum mother code sequence from the set of all possible mother code sequences. Instead of storing the complete set, the system extracts and stores just the maximum one, which contains all necessary information. The required code sequences are then obtained by puncturing or rate-matching this extracted sequence, significantly reducing storage requirements while maintaining coding capability.
2Adaptability or versatility
If multiple mother code sequences are stored for different code lengths, then all code length requirements can be met, but the storage complexity increases
Solution Approach 1:
The patent makes the maximum mother code sequence universal by enabling it to support all code length requirements through puncturing and rate-matching operations. This single sequence replaces multiple length-specific sequences, reducing storage complexity while maintaining the ability to generate codes of any required length up to the maximum supported length.
Solution Approach 2:
The patent performs preliminary action by pre-calculating and storing only the maximum mother code sequence, which is the most comprehensive sequence. All other required sequences can be derived from this pre-stored sequence through systematic puncturing or rate-matching operations, eliminating the need for pre-storing multiple sequences for different lengths.
3Quantity of substance
If a maximum mother code sequence is stored and used to generate required code sequences through puncturing and rate matching, then storage overheads are reduced, but the system must perform additional processing operations
Solution Approach 1:
The patent uses copying in the sense that the maximum mother code sequence serves as a template or master copy from which all required code sequences are generated. Instead of storing multiple copies of different mother code sequences, the system stores one master copy and creates necessary copies through puncturing or rate-matching operations during the coding process, reducing overall storage requirements.
Data Source
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.