Frequency Hopping Sequence Selection for Wireless Transmission Robustness
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communications networks, existing methods face challenges in efficiently allocating time and frequency resources to improve robustness against interference, noise, and path loss, especially when signaling capacity is limited and frequency hopping sequences are constrained.
Innovation Solution
A method that computes a figure of merit representing transmission robustness to interference, noise, and path loss, and selects optimal time and frequency resource sequences for individual transmissions over successive frames, using a predefined set of allowable frequency hopping sequences, while dynamically defining these sequences to enhance overall transmission robustness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If frequency hopping sequences are constrained to a predefined subset due to limited signaling capacity, then signaling overhead is reduced, but transmission robustness to interference and noise deteriorates
Solution Approach 1:
The patent changes the parameter of frequency hopping sequence selection by introducing a figure of merit that evaluates sequences based on robustness criteria. Instead of using all possible sequences or a simple predefined subset, the system computes a figure of merit for each sequence that quantifies its robustness to interference and noise, then selects sequences with optimal figures of merit. This transforms the sequence selection from a static constraint-based approach to a dynamic optimization approach that balances signaling overhead with transmission reliability.
2Adaptability or versatility
If all possible time and frequency resources sequences are represented, then transmission flexibility is maximized, but signaling capacity requirements increase beyond available frame field size
Solution Approach 1:
The patent applies partial action by selecting only a subset of frequency hopping sequences that have optimal figures of merit, rather than representing all possible sequences. The system computes figures of merit for sequences and selects those that meet a threshold or top-ranking criteria, thereby providing sufficient resource allocation flexibility for reliable transmissions while keeping the signaled subset size within the limited frame field capacity. This partial selection approach avoids the excessive signaling required to represent the complete sequence space.
3Device complexity
If frequency hopping sequences are fixed and not signaled, then signaling complexity is reduced, but adaptability to varying channel conditions deteriorates
Solution Approach 1:
The patent introduces dynamics into the frequency hopping sequence selection by computing figures of merit based on current channel conditions, interference patterns, and noise characteristics. The system dynamically evaluates sequences and selects those with optimal figures of merit for the present transmission scenario, allowing adaptability to varying channel conditions while maintaining relatively simple signaling. The figure of merit computation incorporates real-time environmental factors, making the sequence selection adaptive without requiring complex signaling of all possible sequences.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
Considering individual sequences T1,..,TK over N successive frames for performing K individual transmissions, one time and frequency resource is allocated to each individual transmission per frame. The time and frequency resources can be represented by a grid with time resources on one dimension and frequency resources on another dimension. A managing device: computes a figure of merit G(A, T1,.., TK) for each possible set of the individual sequences T1,.., TK over the N successive frames on which respective frequency hopping sequences [A1,.., AN] = A apply, the figure of merit G(A,T1,..,TK) being representative of transmission robustness to interference and/or noise and/or path loss, and being determined under a constraint such that the frequency hopping sequences A1,.., AN are defined among a predefined set of allowable frequency hopping sequences which is a subset of all the time and frequency resources sequences made possible by said grid; and selects the set of individual sequences T1,..,TK showing the best figure of merit G(A, T1,.., TK).