Polar Code Construction for Variable Block Sizes Without Bit Vectors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication networks face challenges in efficiently constructing polar codes due to the need for large memory storage for pre-defined vectors representing position sets of information bits, which is impractical for supporting different block sizes and rates, especially in LTE technology.
Innovation Solution
The method involves dynamically generating sorting indices for polar codes 'on the fly' using density evolution or Gaussian approximation, eliminating the need for pre-defined vectors and reducing memory requirements, allowing for efficient construction of polar codes for both traffic and control channels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If pre-defined vectors representing position sets of information bits are stored for different block sizes and rates, then polar code construction can be performed, but large memory storage is required
Solution Approach 1:
The patent pre-calculates and stores sorting indices for different channel conditions and block sizes in lookup tables. During polar code construction, the transmitter and receiver simply query these pre-computed indices based on current channel conditions rather than computing them in real-time, eliminating the need for large memory storage of pre-defined vectors while maintaining fast code construction capability
Solution Approach 2:
The patent changes the approach from storing position sets for all possible block sizes and rates to storing sorting indices parameterized by channel condition and block size. This parameterization allows the system to generate appropriate position sets dynamically based on current conditions, significantly reducing memory requirements while maintaining flexibility
2Quantity of substance
If sorting indices are generated dynamically using density evolution or Gaussian approximation, then memory requirements are reduced, but computational complexity increases
Solution Approach 1:
The patent pre-computes sorting indices for various channel conditions and block sizes and stores them in lookup tables. During actual polar code construction, the system simply queries these pre-computed values rather than performing density evolution or Gaussian approximation calculations in real-time, thus reducing both memory requirements and computational complexity during operation
Solution Approach 2:
The patent implements a dynamic approach where sorting indices are selected based on current channel conditions and block sizes rather than being fixed. The system can adaptively choose from pre-computed indices corresponding to different conditions, providing flexibility without requiring real-time complex calculations or large memory storage
Data Source
AI summary
Methods and apparatus for constructing polar codes are provided. A transmitter determines at least one set of parameters corresponding to data to be transmitted, and a set of sorting indices corresponding to bits of the data to be transmitted based on the set of parameters, the set of sorting indices indicating a position set of the bits to be transmitted. The transmitter polar encodes the data based at least on the set of parameters and the set of sorting indices to generate a coded block of the data, and transmits the coded block of the data.