RADIO COMMUNICATION SYSTEM

• US 20070291822A1
• Filed: 06/07/2007
• Published: 12/20/2007
• Est. Priority Date: 06/19/2006
• Status: Abandoned Application

• Current Assignee: Trisquare Communications Incorporated
• Original Assignee: Trisquare Communications Incorporated
• Inventors: Pingel, Leslie R., Staley, W. Gary, Gray, Benjamin J., May, E. Dale, Parks, Franklin B., Staley, Philip A., Zerbs, Rick A., Leonard, Christopher H.
• Application Number:
  US11/759,306
• Publication Number:
  US 20070291822A1
• Time in Patent Office: Days
• US Class Current: 375/132
• CPC Class Codes: H04B 1/7143 Arrangements for generation of hop patterns

Abstract

A radio communication system operable to efficiently generate a frequency hopping sequence for radio communication and/or accurately provide system synchronization using a cyclic code. The radio communication system may employ a frequency hopping method that generally comprises acquiring a seed value, identifying a channel number matrix position utilizing at least a portion of the seed value, identifying a radio channel corresponding to the matrix position, and transmitting or receiving a signal at a frequency corresponding to the identified radio channel.

Claims

1. A frequency hopping radio communication method comprising:

(a) selecting a cyclic code;

(b) receiving a signal at a frequency corresponding to a radio channel; and

(c) authenticating the received signal utilizing the selected cyclic code.

2. The method of claim 1, further including—

(d) synchronizing with a transmitting radio utilizing the received signal and the selected cyclic code.

3. The method of claim 2, wherein the received signal is embodied as a frame and (d) includes identifying a position within the frame utilizing the selected cyclic code.

4. The method of claim 2, wherein (d) includes utilizing the cyclic code to identify a time at which to receive another signal at another frequency corresponding to another radio channel.

5. The method of claim 1, wherein the cyclic code is a (23, 12) Golay code.

6. The method of claim 1, wherein the received signal includes a sub-audible representation of at least a portion of the selected cyclic code and the received signal is authenticated by comparing the cyclic code selected in (a) to the cyclic code represented by the received signal.

7. The method of claim 1, further including processing at least a portion of the received signal to identify a repeating request, and if the received signal includes the repeating request, retransmitting information corresponding to the received signal.

8. The method of claim 1, further including acquiring a seed value and selecting the cyclic code utilizing at least a portion of the seed value.

9. The method of claim 8, further including identifying a matrix position utilizing at least a portion of the seed value and identifying the radio channel based on the matrix position.

10. The method of claim 9, wherein the matrix position corresponds to a channel number matrix having a plurality of columns and rows and the matrix position is identified by—

$\left(x_1,y_1\right)=\left(I_{L<br><br><br><br>4}<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{MSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x₁,y₁) is the matrix position, I_L4 is the least four significant digits of the seed value, N is the number of radio channels, R is the number of rows represented by the channel number matrix, IMSD is the most significant digit of the seed value, and y₀ is an initial row position given by the sum of all digits of the seed value modulo R.

11. The method of claim 9, wherein the radio channel is identified by—

N_x1,y1=((x₁R)+y₁)P mod N,

where N_x1,y1 is the radio channel associated with matrix position (x₁, y₁), R is the number of rows represented by the channel number matrix, N is the number of radio channels, and P is a randomizing value.

12. The method of claim 9, further including—

identifying a plurality of matrix positions by—

$\left(x_K,y_K\right)=\left(\left(x_{K-1}+1\right)<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{KMSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x_k,y_k) is the Kth matrix position and I_KMSD is the Kth most significant digit of the seed value,

identifying radio channels corresponding to the identified matrix positions, and

receiving signals at frequencies corresponding to the radio channels.

13. A radio comprising:

a processing system operable to select a cyclic code; and

a transceiver coupled with the processing system and operable to receive a signal at a frequency corresponding to a radio channel,

the processing system being further operable to authenticate the received signal utilizing the selected cyclic code.

14. The radio of claim 13, the processing system being further operable to synchronize with a transmitting radio utilizing the received signal and the selected cyclic code.

15. The radio of claim 14, wherein the received signal is embodied as a frame and the processing system is operable to identify a position within the frame utilizing the selected cyclic code.

16. The radio of claim 14, wherein the processing system is operable to utilize the cyclic code to identify a time at which to receive another signal at another frequency corresponding to another radio channel.

17. The radio of claim 13, wherein the cyclic code is a (23,12) Golay code.

18. The radio of claim 13, wherein the received signal includes a sub-audible representation of at least a portion of the selected cyclic code and the processing system is operable to authenticate the received signal by comparing the selected cyclic code to the cyclic code represented by the received signal.

19. The radio of claim 13, wherein the processing system is further operable to process at least a portion of the received signal to identify a repeating request, and if the received signal includes the repeating request, prompt the transceiver to retransmit information corresponding to the received signal.

20. The radio of claim 13, wherein the processing system is further operable to acquire a seed value and select the cyclic code utilizing at least a portion of the seed value.

21. The radio of claim 20, wherein the processing system is operable to identify a matrix position utilizing at least a portion of the seed value and identify the radio channel based on the matrix position.

22. The radio of claim 21, wherein the matrix position corresponds to a channel number matrix having a plurality of columns and rows and the matrix position is identified by—

$\left(x_1,y_1\right)=\left(I_{L<br><br><br><br>4}<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{MSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x₁,y₁) is the matrix position, I_L4 is the least four significant digits of the seed value, N is the number of radio channels, R is the number of rows represented by the channel number matrix, I_MSD is the most significant digit of the seed value, and y₀ is an initial row position given by the sum of all digits of the seed value modulo R.

23. The radio of claim 21, wherein the processing system identifies the radio channel by—

N_x1my1=((x₁R)+y₁)P mod N,

where N_x1,y1 is the radio channel associated with matrix position (x₁, y₁), R is the number of rows represented by the channel number matrix, N is the number of radio channels, and P is a randomizing value.

24. The radio of claim 21, wherein the processing system is further operable to identify a plurality of matrix positions by—

$\left(x_K,y_K\right)=\left(\left(x_{K-1}+1\right)<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{KMSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x_k,y_k) is the Kth matrix position and I_KMSD is the Kth most significant digit of the seed value,

the processing system being further operable to identify radio channels corresponding to the identified matrix positions, and

the transceiver being further operable to receive signals at frequencies corresponding to the radio channels.

25. The radio of claim 20, further including a user interface operable to receive an input from a user, the processing system being coupled with the user interface and operable to utilize at least a portion of the user input as the seed value.

26. A radio comprising:

a processing system operable to—

acquire a seed value,

select a cyclic code utilizing at least a portion of the seed value,

identify a matrix position utilizing at least a portion of the seed value, and

identify a radio channel corresponding to the matrix position; and

a transceiver coupled with the processing system and operable to receive a signal at a frequency corresponding to the identified radio channel,

the processing system being further operable to authenticate the received signal utilizing the selected cyclic code and synchronize with a transmitting radio utilizing the received signal and the selected cyclic code.

27. The radio of claim 26, wherein the processing system is further operable to process at least a portion of the received signal to identify a repeating request, and if the received signal includes the repeating request, prompt the transceiver to retransmit information corresponding to the received signal.

28. The radio of claim 26, further including a user interface operable to receive an input from a user, the processing system being coupled with the user interface and operable to utilize at least a portion of the user input as the seed value.

29. The radio of claim 26, wherein the processing system is operable to acquire the seed value from an external device.

30. The radio of claim 26, wherein the matrix position corresponds to a channel number matrix having a plurality of columns and rows and the matrix position is identified by—

$\left(x_1,y_1\right)=\left(I_{L<br><br><br><br>4}<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{MSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x₁,y₁) is the matrix position, I_L4 is the least four significant digits of the seed value, N is the number of radio channels, R is the number of rows represented by the channel number matrix, IMSD is the most significant digit of the seed value, and y₀ is an initial row position given by the sum of all digits of the seed value modulo R.

31. The radio of claim 30, wherein the processing system identifies the radio channel by—

N_x1,y1=((x₁R)+y₁)P mod N,

where N_x1,y1 is the radio channel associated with matrix position (x₁, y₁), R is the number of rows represented by the channel number matrix, N is the number of radio channels, and P is a randomizing value.

32. The radio of claim 30, wherein the processing system is further operable to identify a plurality of matrix positions by—

$\left(x_K,y_K\right)=\left(\left(x_{K-1}+1\right)<br><br>\mathrm{mod}<br><br>\frac{N}{R},\left(y_0+I_{\mathrm{KMSD}}\right)<br><br>\mathrm{mod}<br><br><br><br>R\right),$

where (x_k,y_k) is the Kth matrix position and I_KMSD is the Kth most significant digit of the seed value,

the processing system being further operable to identify radio channels corresponding to the identified matrix positions, and

the transceiver being further operable to receive signals at frequencies corresponding to the radio channels.

33. The radio of claim 26, wherein the cyclic code is a (23,12) Golay code.