# US 12,113,569 B2 · Method of assigning a bandwidth for radio communication

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,113,569 B2
- Document ID: US12113569B2
- Status: Granted
- Kind: B2
- Application number: 17/613,434
- Filed: 2020-05-22
- Published: 2022-09-29
- Granted: 2024-10-08
- Earliest claimed: 2019-05-24
- Assignees: Airbus Defence and Space GmbH
- Applicants: Airbus Defence and Space Limited
- Inventors: Terence Dodgson
- Web page: https://patentgrep.com/patent/US12113569B2

## CPC

- H04B 1/7143: Arrangements for generation of hop patterns
- H04L 5/0012: {Hopping in multicarrier systems}
- H04L 5/003: {Arrangements for allocating sub-channels of the transmission path}
- H04L 5/001: {the frequencies being arranged in component carriers}
- H04L 5/026: {using code division (code allocation applied as frequency-domain sequences H04L5/0021)}
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

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.

## Claims

### Claim 1

A method of assigning use of a bandwidth for radio communication, the method comprising the following steps:
a. generating an initial frame, the initial frame comprising a series of allocations;
b. generating a further frame, the further frame comprising a series of allocations;
c. repeating step b. to generate a matrix of allocations;
d. shuffling at least two columns or at least two rows within the matrix;
e. selecting one or more columns or rows in the matrix, wherein each selected column or row represents a selected sequence;
f. assigning use of the bandwidth according to the one or more selected sequences; and
g. transmitting one or more data streams on the assigned bandwidth
wherein the step of generating the initial frame comprises pseudo-random generation using a shuffle algorithm, and wherein the pseudo-random generation comprises using an external random number generator to generate a pseudo-random number based on time of day.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the method is a method of generating one or more frequency-hopping sequences for frequency-hopping spread spectrum transmission, and wherein the bandwidth comprises a plurality of sub-bands, and wherein the allocations are hops, each hop representing a different sub-band.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the method is a method of generating one or more time-hopping sequences for time-hopping transmission, and wherein the allocations are time-slots.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the method is a method of radio resource allocation, and the allocations are frequency channels.

### Claim 5 (depends on 1)

The method according to claim 1, wherein shuffling at least two columns or at least two rows comprises pseudo-random shuffling using a shuffle algorithm.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the shuffle algorithm is a Fisher-Yates, Knuth or Sattolo algorithm.

### Claim 7 (depends on 1)

The method according to claim 1 further comprising the step of:
h. repeating steps a-d of the method, thereby generating one or more additional matrices with shuffled columns or rows.

### Claim 8 (depends on 1)

The method according to claim 1 further comprising the step of:
i. before step d, repeating steps a-c M times.

### Claim 9 (depends on 8)

The method according to claim 8 further comprising the step of:
j. performing step d between the M matrices such that the net result of the shuffling is that there is at least one column or row shuffled in every matrix.

### Claim 10 (depends on 9)

The method according to claim 9 further comprising the steps of:
k. before step d, combining the M matrices; and
l. After step d, splitting out the matrices into M separate matrices.

### Claim 11 (depends on 2)

A communications terminal comprising a transmitter, the transmitter comprising a sequence generation module configured to perform steps a-e of the method of claim 2, and the transmitter configured to assign use of a bandwidth according to the one or more selected sequences, and to transmit one or more data streams on the assigned bandwidth in accordance with the one or more selected sequences.

### Claim 12 (depends on 11)

The communications terminal according to claim 11 further comprising a receiver, the receiver comprising a sequence generation module configured to perform steps a-e of the method, and the receiver configured to receive one or more data streams and extract information from the one or more data streams using the one or more selected sequences.

### Claim 13 (depends on 11)

A modem configured for use in the communications terminal according to claim 11 wherein the modem is a software-defined radio satellite modem.

### Claim 14 (depends on 1)

A computer program configured to execute the steps of the method according to claim 1.

### Claim 15

A method of generating one or more frequency-hopping sequences for frequency-hopping spread spectrum transmission over a bandwidth comprising a plurality of sub-bands, the method comprising the following steps:
a. generating an initial frame, the initial frame comprising a series of hops wherein each hop represents a different sub-band;
b. generating a further frame, the further frame comprising a series of hops wherein each hop represents a different sub-band;
c. repeating step b. to generate a matrix of hops;
d. shuffling at least two columns or at least two rows within the matrix wherein the step of generating the initial frame comprises pseudo-random generation using a shuffle algorithm, and wherein the pseudo-random generation comprises using an external random number generator to generate a pseudo-random number based on time of day, and wherein the method further comprises:
l. Generating one or more frequency-hopping sequences using steps a. to d.; and
m. transmitting one or more data streams on the bandwidth, in accordance with the one or more frequency-hopping sequences.

### Claim 16 (depends on 15)

The method of generating one or more frequency-hopping sequences according to claim 15, further comprising the step of:
e. selecting one or more columns or rows in the matrix, wherein each selected column or row represents a frequency-hopping sequence.

### Claim 17 (depends on 2)

The method of extracting information from one or more data streams transmitted according to the method of claim 2, the method comprising the following steps:
n. generating an initial frame, the initial frame comprising a series of allocations;
o. generating a further frame, the further frame comprising a series of allocations;
p. repeating step b. to generate a matrix of allocations;
q. shuffling at least two columns or at least two rows within the matrix;
r. selecting one or more columns or rows in the matrix, wherein each selected column or row represents a sequence;
s. receiving the one or more transmitted data streams; and
t. extracting information from the one or more transmitted data streams using the selected sequences.