Frequency hopping in full-duplex communications
US-2024032001-A1 · Jan 25, 2024 · US
US9614579B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9614579-B2 |
| Application number | US-201514813093-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 29, 2015 |
| Priority date | Sep 10, 2014 |
| Publication date | Apr 4, 2017 |
| Grant date | Apr 4, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A device operated in a network using a channel hopping communication protocol may select a channel for each transmission by first generating and storing a sequence of pseudo-random index numbers. A list of good channels is selected from a plurality of channels. For each channel hop, one of the good channels is selected from the list of good channels for use by a transceiver in the device by using an index number selected from the sequence of pseudo-random index numbers. The list of good channels may be revised periodically and channels may be selected from the list of good channels for use by the transceiver without revising the sequence of pseudo-random index numbers.
Opening claim text (preview).
What is claimed is: 1. A method for operating a device in a network using a channel hopping communication protocol, the method comprising: generating a numerical sequence of values having a length L and storing at least a portion of the numerical sequence of values in storage logic on the device, wherein each of the values of the numerical sequence is associated with a corresponding sequence index value and wherein the values of the numerical sequence do not represent channel numbers of a plurality of channels of the network; receiving a channel offset value for a communication link between the device and a second device in the network; recording a channel status indicating which ones of the plurality of channels are good to use for the channel hopping communication protocol; generating a good channel list having a length N according to the recorded channel status; and selecting a channel from the plurality of channels to use for communication with the second device during each hop by: using the channel offset value to determine a sequence index value; using the determined sequence index value to select a sequence value from the numerical sequence having a sequence index value that matches the determined sequence index value; processing the selected sequence value to determine a channel index value having a value that is less than or equal to N; and using the determined channel index value to select a channel to use from the good channel list. 2. The method of claim 1 , in which generating the numerical sequence of values includes: forming a shuffle array having a length L with values equivalent to an output of a linear feedback shift register with polynomial x 9 +x 5 +1 and a starting seed of 255; forming a sequence array having a length L with a sequence of values that do not represent channel numbers of the plurality of channels; and shuffling each entry of the sequence array with another entry of the sequence array selected by a corresponding entry value of the shuffle array, wherein the shuffled sequence array is the numerical sequence. 3. The method of claim 1 , in which the channel hopping communication protocol uses time slots, and in which determining the sequence index value comprises performing a modulo L operation on the sum of the channel offset value and a current absolute slot number (ASN) value. 4. The method of claim 3 , wherein processing the selected sequence value to determine the channel index value comprises performing a modulo N operation on the selected sequence value. 5. The method of claim 1 , further including detecting channel interference on one or more of the plurality of channels and updating the channel status to indicate which ones of the plurality of channels have channel interference. 6. The method of claim 1 , further including transmitting a data packet to the second device using the selected channel. 7. The method of claim 6 , further including recording a revised channel status and generating a revised good channel list; and wherein selecting a channel from the plurality of channels uses the unrevised stored numerical sequence. 8. The method of claim 7 , further including repeating the steps of recording a revised channel status, generating a revised good channel list, and transmitting a data packet using the selected channel during each hop while using the same unrevised stored numerical sequence for each repetition. 9. The method of claim 1 , further including incrementally generating a sequence value by processing a stored one of the at least a portion of the numerical sequence. 10. A method for operating a device in a network using a channel hopping communication protocol, the method comprising: generating and storing at least a portion of a sequence of length L of pseudo-random numbers, each having a corresponding sequence index value; generating a list of length N of good channels selected from a plurality of channels in accordance with a channel blacklist status; selecting one of the good channels from the list of good channels for use by a transceiver for each hop by using a pseudo-random number selected from the sequence of pseudo-random numbers, in which a next pseudo-random number in the sequence of pseudo-random numbers is selected for each hop, wherein selecting one of the good channels for use by the transceiver comprises: using a channel offset value to determine a sequence index value; using the determined sequence index value to select a pseudo-random number from the stored sequence of pseudo-random numbers, the selected pseudo-random number having a sequence index value that matches the determined sequence index value; processing the selected pseudo-random number to determine a channel index value having a value that is less than or equal to N; and using the determined channel index value to select a channel from the good channel list; and revising the list of good channels in response to obtaining a revised channel blacklist status. 11. The method of claim 10 , in which generating the sequence of pseudo-random numbers includes: forming a shuffle array having a length L with values equivalent to an output of a linear feedback shift register with polynomial x 9 +x 5 +1 and a starting seed of 255; forming a sequence array having a length L with a sequence of values that do not represent channel numbers of the plurality of channels; and shuffling each entry of the sequence array with another entry of the sequence array selected by a corresponding entry value of the shuffle array, wherein the shuffled sequence array is the sequence of pseudo-random numbers. 12. The method of claim 10 , further including detecting channel interference on one or more of the plurality of channels and updating the channel blacklist status to indicate which ones of the plurality of channels have channel interference. 13. The method of claim 10 , in which the channel hopping communication protocol uses time slots, and in which determining the sequence index value comprises performing a modulo L operation on the sum of the channel offset value and a current absolute slot number (ASN) value. 14. The method of claim 13 , in which processing the selected pseudo-random number to determine the channel index value comprises performing a modulo N operation on the selected pseudo-random number. 15. A network node device comprising: a transceiver configured to transmit and receive data with other devices in a network using a frequency hopping communication protocol; a processor controllably coupled to the transceiver; and storage circuitry coupled to the processor, in which instructions are stored that when executed by the processor cause the device to communicate with another node device in the network by: generating a sequence of length L of pseudo-random index numbers and storing at least a portion of the sequence in the storage circuitry, each of the pseudo-random numbers in the sequence having a corresponding sequence index value; generating a list of length N of good channels selected from a plurality of channels in accordance with a channel blacklist status; selecting one of the good channels from the list of good channels for use by the transceiver for each hop by using a pseudo-random number selected from the sequence of pseudo-random numbers, in which a next pseudo-random number in the sequence of pseudo-random index numbers is selected for each hop, wherein selecting one of the good channels for use by the transceiver comprises: using a channel offset value to determine a sequence index value; using the determined sequence index value to sele
with means for preventing interference · CPC title
Interference-related aspects · CPC title
Arrangements for generation of hop patterns · CPC title
using the level of interference · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.