Polar Code Construction for Variable Block Sizes Without Large Lookup Memory
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 to store pre-defined vectors representing position sets for information bits, which is not feasible for varying block sizes and rates, limiting the performance of polar codes in future networks beyond LTE.
Innovation Solution
The method involves dynamically generating sorting indices for polar code construction 'on the fly' using parameters like information block size, coded block size, and construction SNR, eliminating the need for storing pre-defined vectors and enabling efficient construction of polar codes for both traffic and control channels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If pre-defined vectors are stored for polar code construction, then code construction can be performed, but large memory requirements arise
Solution Approach 1:
The patent pre-calculates and stores sorting indices for various block sizes and rates in a lookup table during system initialization. This preliminary action allows the transmitter and receiver to quickly retrieve pre-computed sorting indices without performing complex calculations in real-time, thereby reducing memory requirements during active communication while ensuring reliable polar code construction.
Solution Approach 2:
The patent changes the approach from storing complete pre-defined vectors to storing sorting indices that represent position sets for information bits. By parameterizing the storage requirement from full vectors to compact index representations, the memory footprint is significantly reduced while maintaining the ability to construct polar codes reliably for varying block sizes and rates.
2Quantity of substance
If fixed pre-defined vectors are used, then memory usage is reduced, but adaptability to varying block sizes and rates is limited
Solution Approach 1:
The patent creates a universal lookup table structure that can serve multiple functions for different block sizes and code rates. The sorting indices stored in the lookup table are designed to be applicable across various polar code configurations, allowing the same memory structure to support multiple code construction scenarios without requiring separate pre-defined vectors for each case.
Solution Approach 2:
The patent implements a dynamic retrieval mechanism where the appropriate sorting indices are selected from the lookup table based on the current communication parameters (block size, code rate). This dynamic adaptation allows the system to flexibly respond to varying transmission requirements while using a fixed, compact memory structure, thereby achieving both memory efficiency and versatility.
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.