Segmented Polar Code Encoding for Lower Storage Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The construction of polar codes requires storing and computing with a nested sequence of length N, leading to high storage overheads and complex online computing processes.
Innovation Solution
The method involves obtaining a basic sequence by sorting polarized channels by reliability, determining M segments of an information bit sequence, and separately encoding these segments using a first encoding scheme, thereby reducing the need to know only N/M polarized channels for storage and computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a nested sequence of length N is stored for polar code construction, then the code performance is optimized, but the storage overhead and online computing complexity increase significantly
Solution Approach 1:
The patent divides the information bit sequence into M segments, where M is determined based on the basic sequence length L1 and maximum encoding length L2. Each segment is encoded separately using a first encoding scheme before polar code encoding. This segmentation reduces the storage requirement from the full nested sequence of length N to only N/M polarized channels, thereby reducing storage overhead and online computing complexity while maintaining code performance.
2Reliability
If the full nested sequence is used for encoding, then optimal code construction is achieved, but the online computing process becomes complex
Solution Approach 1:
The encoding process is segmented into multiple stages: first dividing the information bit sequence into M segments, then encoding each segment separately using a first encoding scheme, and finally performing polar code encoding on the encoded segments. This segmented approach simplifies the online computing process compared to using the full nested sequence, while still achieving optimal code construction through the basic sequence of length L1.
Solution Approach 2:
The patent performs preliminary segmentation and encoding of the information bit sequence before the actual polar code encoding. By pre-dividing the sequence into M segments and encoding them separately, the system prepares the data in advance, which simplifies the subsequent polar code encoding process and reduces online computing complexity.
Data Source
AI summary
A polar code encoding method and apparatus are provided. The method includes: obtaining a basic sequence, where the basic sequence is a sequence obtained by sorting sequence numbers of polarized channels in descending order or ascending order of reliability, and a length of the basic sequence is L1; determining, based on a maximum encoding length L2 supported by a receiving device, a quantity M of segments of an information bit sequence whose length is N after encoding, where a quantity of bits in the information bit sequence before the encoding is K; and performing polar code encoding on the M segments based on the basic sequence. According to the polar code encoding method, during polar code construction, an encoding device needs to know only a reliability order of min(N/M, L1) polarized channels. In this way, storage overheads of a nested sequence can be effectively reduced, and online computing complexity can be reduced.