Bandwidth Assignment Using Matrix Shuffling for Orthogonal Sequences
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating frequency-hopping sequences in spread spectrum communication systems are inefficient and prone to interference, requiring manual adjustments to avoid overlaps and lacking predictability for secure transmission.
Innovation Solution
A method involving the generation of an initial frame, subsequent frames, and shuffling of columns or rows within a matrix to create orthogonal sequences for assigning bandwidth, ensuring efficient and secure frequency-hopping or time-hopping sequences without manual adjustments, using pseudo-random generation and shuffling algorithms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual adjustments are used to avoid allocation overlaps, then interference between sequences is reduced, but the complexity and time required for sequence generation increases
Solution Approach 1:
The system automatically generates orthogonal sequences through matrix operations and shuffling algorithms without requiring manual intervention. The transmitter and receiver independently generate identical sequences using shared parameters (bandwidth, number of sub-bands, shuffling seed), enabling self-configuration and eliminating manual adjustment complexity
Solution Approach 2:
The patent transforms the sequence generation problem from manual allocation adjustment to automated parameter-driven matrix operations. By changing parameters such as bandwidth, number of sub-bands, and shuffling seed, the system dynamically generates orthogonal sequences that automatically avoid overlaps without manual intervention
2Productivity
If bandwidth allocation sequences are generated without shuffling, then the generation process is simpler, but interference and overlaps between allocations occur
Solution Approach 1:
The patent performs preliminary shuffling of matrix rows or columns before final sequence extraction. This preliminary randomization ensures that subsequent allocations are orthogonal and non-overlapping, preventing interference before transmission begins while maintaining automated generation
Solution Approach 2:
The system uses periodic matrix generation with repeated frames, where each frame contains allocations that are shuffled to create orthogonal sequences. This periodic structure with shuffling ensures both generation efficiency and allocation reliability across multiple transmission cycles
3Ease of manufacture
If deterministic sequences are used for frequency-hopping, then the system is easier to implement, but security and resistance to eavesdropping is reduced
Solution Approach 1:
The patent introduces dynamic elements into sequence generation through random shuffling of matrix rows or columns using a seed parameter. This creates dynamically varying pseudo-random sequences that are computationally simple to generate but unpredictable to outsiders, balancing implementation ease with security against eavesdropping and jamming
Data Source
AI summary
There is provided a method of assigning use of a bandwidth for radio communication. The method includes the following steps: generating an initial frame, the initial frame including a series of allocations; generating a further frame, the further frame including a series of allocations; repeating the step of generating a further frame to generate a matrix of allocations; shuffling at least two columns or at least two rows within the matrix; selecting one or more columns or rows in the matrix, wherein each selected column or row represents a sequence; assigning use of the bandwidth according to the one or more selected sequences; and transmitting one or more data streams on the assigned bandwidth.