Wireless Resource Remapping via Galois Field Permutations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for resource remapping in wireless communication systems, such as the 3GPP LTE system, require storage of remapping tables and are not efficient, particularly for resource combinations in uplink control channels like PUCCH, which complicates interference randomization and resource allocation.
Innovation Solution
A global resource mapping scheme using pseudo-random functions like Galois Field permutations and Pruned Bit Reversal Ordering is established to efficiently remap and regroup transmission resources across time slots and subframes, allowing for cell-specific and subset-specific shifting of cyclic shifts and orthogonal covers, thereby optimizing resource allocation without the need for storage-intensive tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If remapping tables are used for resource remapping, then resource allocation can be achieved, but storage requirements increase and efficiency decreases
Solution Approach 1:
The patent extracts the remapping table storage requirement from the system by replacing it with pseudo-random function-based remapping. Instead of storing large remapping tables in memory, the system uses mathematical functions (Galois Field permutations and PBRO) to generate remapping relationships dynamically, eliminating the storage burden while maintaining resource allocation capability
Solution Approach 2:
The patent replaces the mechanical/table-based remapping approach with a mathematical function-based approach. By substituting the physical storage of remapping tables with computational evaluation of pseudo-random functions, the system achieves more efficient resource remapping without storage requirements
2Quantity of substance
If resource combinations are used for uplink control channels, then transmission capacity is improved, but interference randomization becomes complicated
Solution Approach 1:
The patent introduces dynamic resource remapping between time slots using pseudo-random functions. Resource combinations are not statically assigned but dynamically remapped based on slot index and other parameters, enabling automatic interference randomization while maintaining transmission capacity. The remapping relationships change over time, preventing persistent interference patterns
Solution Approach 2:
The patent changes the remapping parameters (such as the parameter n in the pseudo-random functions) to control interference patterns. By adjusting these parameters, the system can optimize both transmission capacity and interference randomization performance without increasing system complexity
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Methods and apparatus for remapping and regrouping transmission resources in a wireless communication system. First, a set of new permutation algorithms based on Galois field operation is proposed. Then the proposed algorithms and the known Pruned Bit Reversal Ordering (PBRO) algorithm are applied to several of various resource mapping schemes, including slot or symbol level Orthogonal Cover (OC)/Cyclic Shift (CS) mapping, cell-specific slot-level and symbol-level CS hopping patterns, and subframe and slot level base sequence hopping patterns.