Frequency hopping sequence generation

Patent metadata

Field	Value
Publication number	US-9350416-B2
Application number	US-201414558553-A
Country	US
Kind code	B2
Filing date	Dec 2, 2014
Priority date	May 7, 2014
Publication date	May 24, 2016
Grant date	May 24, 2016

Abstract

Techniques for frequency-hopping sequence-generation are described herein. In one example, a sequence of pseudo random numbers may be used to generate a scrambling sequence. The scrambling sequence may be used to map an unscrambled sequence of channels into a scrambled sequence of channels. Channel-repeats may be detected in the scrambled sequence of channels and resolved. Channel whitening may be performed to reduce channel overuse resulting from the channel-repeat resolutions. The scrambled sequence of channels may be provided to a radio to enable the radio to tune to the channels indicated by the scrambled sequence of channels.

First claim

What is claimed is:

1. A method, comprising:
generating a scrambling sequence using a sequence of pseudo random numbers;
mapping an unscrambled sequence of channels, using the scrambling sequence, to create a scrambled sequence of channels, wherein mapping the unscrambled sequence of channels to create the scrambled sequence of channels comprises selecting an element from the unscrambled sequence of channels indicated by a magnitude of an element of the scrambling sequence; and
operating a radio according to the scrambled sequence of channels.

2. The method of claim 1 , wherein:
a first integer number of timeslots fills a 24-hour day, each timeslot being assigned a channel of the scrambled sequence of channels; and
a second integer number of repetitions of the scrambling sequence is used to derive a channel for each timeslot of the first integer number of timeslots.

3. The method of claim 1 , wherein the scrambled sequence of channels is repeated in each of a plurality of days.

4. The method of claim 1 , additionally comprising:
detecting, in the scrambled sequence of channels, two adjacent timeslots using a same channel; and
replacing a channel used by one of the two adjacent timeslots, so that the two adjacent timeslots do not use the same channel, and so that a further instance of two adjacent timeslots using a same channel is not created by the replacing.

5. The method of claim 1 , additionally comprising:
checking a timeslot for a channel-repeat, wherein first and second adjacent timeslots, associated with either a same channel or two adjacent channels, are a channel-repeat; and
replacing a channel in the first or second timeslot with a channel that is not used by, and that is not adjacent to, a channel used by either of the first and second adjacent timeslots.

6. The method of claim 1 , additionally comprising:
checking the scrambled sequence of channels for a channel-repeat; and
replacing a channel to remove the channel-repeat.

7. The method of claim 1 , additionally comprising:
checking every other timeslot in the scrambled sequence of channels for a channel-repeat; and
replacing a channel that is repeated in the scrambled sequence of channels with a pseudo random selection from among channels that would not result in a further instance of two adjacent timeslots using a same channel.

8. The method of claim 1 , additionally comprising:
generating the scrambling sequence, for use in a first network, using a first primitive element and a Galois field; and
generating a second scrambling sequence, for use in a second network, using a second primitive element and the Galois field.

9. The method of claim 1 , additionally comprising:
applying a circular shift to the scrambling sequence to obtain a shifted scrambling sequence, wherein the scrambling sequence was used in a first network; and
utilizing the shifted scrambling sequence in a second network.

10. A node in a network, the node comprising:
a processing unit;
a hopping sequence generator, operable by the processing unit, to generate a hopping sequence by operations comprising:
generating a sequence of pseudo random numbers to create a scrambling sequence;
mapping an unscrambled sequence of channels, using the scrambling sequence, to create a scrambled sequence of channels;
recognizing a channel-repeat; and
changing a channel used by a timeslot in the scrambled sequence of channels to remove the channel-repeat; and

a radio to tune channels according to the scrambled sequence of channels.

11. The node as recited in claim 10 , wherein the hopping sequence generator is also configured to perform operations comprising:
calculating a timeslot and associated channel based on time information obtained from a clock of the node; and
tuning the radio to the calculated channel.

12. The node as recited in claim 10 , wherein the hopping sequence generator is also configured to whiten the scrambled sequence of channels by modifying the unscrambled sequence of channels at intervals.

13. The node as recited in claim 10 , wherein the scrambling sequence comprises a greater number of terms than there are available channels in the network.

14. The node as recited in claim 10 , wherein:
the scrambled sequence of channels indicates a channel used in each of a plurality of timeslots of uniform length; and
there is an integer number of the timeslots in one day.

15. A method, comprising:
generating a scrambling sequence using a sequence of pseudo random numbers;
mapping an unscrambled sequence of channels, using the scrambling sequence, to create a scrambled sequence of channels;
detecting, in the scrambled sequence of channels, two adjacent timeslots using a same channel;
replacing a channel used by one of the two adjacent timeslots, so that the two adjacent timeslots do not use the same channel, and so that a further instance of two adjacent timeslots using a same channel is not created by the replacing; and
operating a radio according to the scrambled sequence of channels.

16. The method of claim 15 , wherein:
a first integer number of timeslots fills a 24-hour day, each timeslot being assigned a channel of the scrambled sequence of channels; and
a second integer number of repetitions of the scrambling sequence is used to derive a channel for each timeslot of the first integer number of timeslots.

17. The method of claim 15 , wherein the scrambled sequence of channels is repeated in each of a plurality of days.

18. The method of claim 15 , wherein mapping the unscrambled sequence of channels to create the scrambled sequence of channels comprises:
selecting an element from the unscrambled sequence of channels indicated by a magnitude of an element of the scrambling sequence.

19. The method of claim 15 , additionally comprising:
generating the scrambling sequence, for use in a first network, using a first primitive element and a Galois field; and
generating a second scrambling sequence, for use in a second network, using a second primitive element and the Galois field.

20. The method of claim 15 , additionally comprising:
applying a circular shift to the scrambling sequence to obtain a shifted scrambling sequence, wherein the scrambling sequence was used in a first network; and
utilizing the shifted scrambling sequence in a second network.

Assignees

• Itron Inc
• Itron France

Inventors

• Picard Gilles

Classifications

• H04B1/7143 Primary

  Arrangements for generation of hop patterns · CPC title

• H04B1/7156

  Arrangements for sequence synchronisation · CPC title