Forward Link Hopping Permutation for Low-Overhead Subcarrier Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless communication systems face challenges in maintaining older network systems to fully exploit new device capabilities, particularly in managing transmission resources efficiently as mobile device processing power increases, leading to difficulties in reducing signaling overhead, improving throughput, and enhancing robustness.
Innovation Solution
A method for generating a permutation for forward link hopping is introduced, involving the initialization of permutation constants, use of a pseudo-noise register to generate pseudorandom numbers, and swapping elements in an array to map hop-ports to sub-carriers, thereby optimizing resource allocation and transmission efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional resource allocation methods are used in older wireless network systems, then system compatibility is maintained, but signaling overhead increases and throughput decreases
Solution Approach 1:
The patent changes the parameters of resource allocation by introducing permutation-based indexing and pseudo-random hopping sequences. Instead of traditional resource assignment methods, the system uses permutation constants and pseudo-random number generation to dynamically allocate resources, reducing signaling overhead while maintaining compatibility with existing CDMA2000 1xEV-DO Rev. A infrastructure
Solution Approach 2:
The patent replaces traditional mechanical resource allocation mechanisms with a mathematical substitution system using permutation functions and pseudo-random sequences. The resource allocation is determined through mathematical operations on permutation constants rather than through complex signaling protocols, thereby reducing overhead and improving throughput
2Productivity
If resource allocation is optimized for new device capabilities, then throughput improves, but system compatibility with older networks deteriorates
Solution Approach 1:
The patent achieves universality by designing a resource allocation method that functions across multiple system versions. The permutation-based approach and pseudo-random hopping sequences can be implemented in both older CDMA2000 1xEV-DO Rev. A systems and newer 1xEV-DO Rev. B systems, allowing the same mechanism to serve multiple generations of wireless technology with different capability sets
Solution Approach 2:
The patent applies preliminary action by pre-defining permutation constants and generating pseudo-random sequences in advance. These pre-computed resources are then allocated without requiring real-time negotiation or complex signaling during data transmission, enabling both old and new devices to operate efficiently with reduced overhead
3Productivity
If complex resource management schemes are implemented, then throughput increases, but system complexity increases
Solution Approach 1:
The patent extracts the complex resource management logic from the time-domain signaling process and relocates it to the frequency-domain permutation structure. By separating the resource allocation function into distinct permutation constants and hopping sequences, the system achieves high throughput without proportionally increasing overall system complexity
Solution Approach 2:
The patent uses copying by generating multiple pseudo-random sequences that replicate the same statistical properties and allocation patterns. These copied sequences are used across different time slots and frequency channels, allowing complex resource management to be achieved through simple repetition of proven allocation patterns rather than designing new complex schemes for each scenario
4Reliability
If frequency hopping is used for robustness, then transmission reliability improves, but signaling overhead increases
Solution Approach 1:
The patent merges the frequency hopping mechanism with the resource allocation permutation structure. The same permutation constants and pseudo-random sequences that determine resource assignment also determine hopping patterns, combining two functions into one unified mechanism that provides robustness without additional signaling overhead
Solution Approach 2:
The patent implements self-service by designing a system where the permutation-based resource allocation automatically provides frequency hopping benefits. The pseudo-random sequences generated from permutation constants inherently create frequency diversity and robustness without requiring separate control signaling, allowing the system to serve its own robustness needs through its core allocation mechanism
Data Source
AI summary
A method and apparatus for generating a permutation for forward link hopping is provided, comprising initializing permutation constants, determining a value for p such that i is less than 2p wherein i is a first counter, initializing a second counter j to ‘0’, setting x to i+1 wherein x is index of elements of an array A, clocking a Pseudo-noise (PN) register n times to generate a pseudorandom number, setting x to p Least Significant Bits (LSB) of the pseudorandom number, incrementing j by 1, determining if x is greater than i, setting x equal to x−i, if x is greater than i, swapping the ith and xth element in the array A, decrementing counter i by 1, and mapping a set of hop-ports to a set of sub-carriers based upon the generated hop-permutation.