Modifying hopping sequences in wireless networks

• US 7,366,223 B1
• Filed: 06/06/2002
• Issued: 04/29/2008
• Est. Priority Date: 06/06/2002
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: ArrayComm LLC (Ygomi LLC)
• Inventors: Chen, John Sze-Chi, Schein, Brett Eric
• Primary Examiner(s): Ahn, Sam K.
• Application Number:
  US10/164,977
• Time in Patent Office: 2,154 Days
• Field of Search: 375/132, 375/133, 375/134, 375/137, 455/447, 455/526, 455/62, 455/63.3, 455/71, 455/113, 455/150.1, 370/302, 370/330, 370/343, 370/436, 370/478, 370/480, 370/481
• US Class Current: 375/132
• CPC Class Codes: H04B 1/7143 Arrangements for generation of hop patterns

Abstract

The present invention can be used to modify hopping sequences and families of hopping sequences. In one embodiment the present invention includes modifying a family of hopping sequences by eliminating a resource from a plurality of resources used by the family of hopping sequences, eliminating a hopping sequence from the family of hopping sequences, and creating a new family of hopping sequences by replacing the eliminated resource in each remaining hopping sequence using the eliminated hopping sequence. Embodiments of the present invention may further include repeating eliminating a resource, eliminating a hopping sequence, and creating a new family of hopping sequences, until the new family of hopping sequences uses a desired number of resources.

Claims

1. A method comprising:

selected a hopping sequence from among a stored family of hopping sequences, the selected hopping sequence indicating a sequence of carrier frequencies for communications in a logical channel of a wireless radio communications network over time;

eliminating a carrier frequency from the hopping of carrier frequencies indicated by the selected hopping sequence;

selecting a replacement hopping sequence from the family of hopping sequences, wherein the replacement hopping sequence indicates a sequence of replacement carrier frequencies over time;

eliminating the replacement hopping sequence from the family of hopping sequences; and

replacing an occurrence of the eliminated carrier frequency in the sequence of carrier frequencies indicated by the selected hopping sequence with a corresponding replacement carrier frequency in the sequence of replacement carrier frequencies indicated by the replacement hopping sequence.

2. The method of claim 1, further comprising

replacing each occurrence of the eliminated carrier frequency in each sequence of carrier frequencies indicated by the each hopping sequence in the family of hopping sequences with another corresponding replacement carrier frequency in the sequence of replacement carrier frequencies indicated by the replacement hopping sequence.

3. A method comprising:

eliminating a resource from a plurality of resources for wireless communications according to a first hopping sequence, the first hopping sequence belonging to a family of hopping sequences;

replacing the eliminated resource in the first hopping sequence with an alternate resource from a second hopping sequence in the family of hopping sequences; and

eliminating the second hopping sequence from the family of hopping sequences.

4. The method of claim 3, further comprising:

receiving a list indicating a number of available resources;

repeating

eliminating a resource from the plurality of resources in the first hopping sequence, and

replacing the eliminated resource in the first hopping sequence,

until the first hopping sequence includes no more than the indicated number of available resources.

5. The method of claim 3, further comprising transmitting a signal on a logical channel after replacing the eliminated resource, the transmitting according to a sequence of resources indicated by the first hopping sequence.

6. The method of claim 3, wherein the plurality of resources comprise a plurality of carrier frequencies, and wherein the first hopping sequence indicates a sequence of carrier frequencies from the plurality of carrier frequencies for wireless communications by a logical channel over time.

7. The method of claim 3, wherein the family of hopping sequences comprises a plurality of hopping sequences generated using Orthogonal Latin Squares.

8. The method of claim 3, wherein replacing the eliminated resource in the first hopping sequence with the alternate resource comprises replacing each occurrence of the eliminated resource in the first hopping sequence with a corresponding resource in the second hopping sequence.

9. The method of claim 8, wherein the corresponding resource in the second hopping sequence comprises the resource indicated by the second hopping sequence at the same time that the first hopping sequence indicates the eliminated resource.

10. The method of claim 8, wherein the corresponding resource in the second hopping sequence comprises the resource mapped to by a second hopping function defining the second hopping sequence when the second hopping function is given a time input that results in a first hopping function defining the first hopping sequence mapping to the eliminated resource.

11. The method of claim 3, wherein the plurality of resources comprise a plurality of time slots on a time division multiple access (TDMA) frame, and wherein the first hopping sequence indicates a sequence of time slots from the plurality of time slots for wireless communications by a logical channel over time.

12. The method of claim 3, wherein the plurality of resources comprise a plurality of code division multiple access (CDMA) codes, and wherein the first hopping sequence indicates a sequence of CDMA codes from the plurality of CDMA codes for wireless communications by a logical channel over time.

13. A method comprising:

eliminating a resource from a plurality of resources of a family of hopping sequences;

eliminating a hopping sequence from the family of hopping sequences; and

creating a new family of hopping sequences for wireless communications by replacing the eliminated resource in each remaining hopping sequence with a resource from the eliminated hopping sequence.

14. The method of claim 13, further comprising

repeating

eliminating a resource,

eliminating a hopping sequence, and

creating a new family of hopping sequences,

until the new family of hopping sequences include no more than a desired number of resources.

15. The method of claim 13, further comprising receiving a list indicating a number of available resources, and wherein the desired number of resources is the indicated number of available resources.

16. The method of claim 13, further comprising transmitting a signal on a logical channel, the transmitting according to a sequence of resources indicated by a hopping sequence from the new family of hopping sequences.

17. The method of claim 13, wherein the plurality of resources comprise a plurality of carrier frequencies, and wherein the family of hopping sequences indicates a sequence of carrier frequencies from the plurality of carrier frequencies for wireless communications by a logical channel over time.

18. The method of claim 13, wherein the plurality of resources comprise a plurality of time slots on a time division multiple access (TDMA) frame, and wherein the first hopping sequence indicates a sequence of time slots from the plurality of time slots for wireless communications by a logical channel over time.

19. The method of claim 13, wherein the family of hopping sequences comprises a plurality of hopping sequences generated using Orthogonal Latin Squares.

20. The method of claim 13, wherein replacing the eliminated resource in each remaining hopping sequence with the alternate resource comprises replacing each occurrence of the eliminated resource in each hopping sequence that was not eliminated from the family of hopping sequences with a corresponding resource in the eliminated hopping sequence.

21. The method of claim 20, wherein the corresponding resource in the eliminated hopping sequence comprises the resource indicated by the eliminated hopping sequence at the same times that the remaining hopping sequences indicate the eliminated resource.

22. The method of claim 20, wherein the corresponding resource in the eliminated hopping sequence comprises the resource mapped to by a hopping function defining the eliminated hopping sequence when the hopping function is given time inputs that result in a plurality of hopping functions each defining one of the remaining hopping sequences mapping to the eliminated resource.

23. The method of claim 20, further comprising

repeating

eliminating a resource,

eliminating a hopping sequence, and

creating a new family of hopping sequences,

until the new family of hopping sequences includes no more than a desired number of resources.

24. The method of claim 23, wherein if the corresponding resource in the eliminated hopping sequence has been eliminated due to a repeated elimination of resources, then the corresponding resource comprises a corresponding resource in a second eliminated hopping sequence, the second eliminated hopping sequence eliminated due to repeated elimination of hopping sequences.

25. A communications device comprising:

a transceiver for radio communications on at least one logical channel;

a memory for storing a family of hopping sequences; and

a processor communicatively coupled to the memory, the processor to;

eliminate a resource from a plurality of resources for wireless communications according to a first hopping sequence belonging to the family of hopping sequences,

replace the eliminated resource in the first hopping sequence with an alternate resource using a second hopping sequence in the family of hopping sequences, and

eliminate the second hopping sequence from the family of hopping sequences.

26. The communications device of claim 25, wherein the plurality of resources comprise a plurality of carrier frequencies, and wherein the first hopping sequence indicates a sequence of carrier frequencies from the plurality of carrier frequencies for wireless communications by a logical channel over time.

27. The communications device of claim 25, wherein replacing the eliminated resource in the first hopping sequence with the alternate resource comprises replacing each occurrence of the eliminated resource in the first hopping sequence with a corresponding resource in the second hopping sequence.

28. The communications device of claim 27, wherein the corresponding resource in the second hopping sequence comprises the resource indicated by the second hopping sequence at the same time that the first hopping sequence indicates the eliminated resource.

29. The communications device of claim 27, wherein the corresponding resource in the second hopping sequence comprises the resource mapped to by a second hopping function defining the second hopping sequence when the second hopping function is given a time input that results in a first hopping function defining the first hopping sequence mapping to the eliminated resource.

30. The communications device of claim 27, wherein the communications device comprises a base station in a wireless radio network.

31. The communications device of claim 25, wherein the communications device comprises a user terminal in a wireless radio network.

32. A modified hopping sequence for wireless communications, the modified hopping sequence generated by:

eliminating a resource from a plurality of resources used by a first hopping sequence to be modified, the first hopping sequence belonging to a family of hopping sequences;

modifying the first hopping sequence by replacing the eliminated resource in the first hopping sequence with an alternate resource from a second hopping sequence in the family of hopping sequences; and

eliminating the second hopping sequence from the family of hopping sequences.

33. The modified hopping sequence of claim 32, wherein the family of hopping sequences comprises a plurality of hopping sequences generated using Orthogonal Latin Squares.

34. The modified hopping sequence of claim 32, wherein replacing the eliminated resource in the first hopping sequence with the alternate resource comprises replacing each occurrence of the eliminated resource in the first hopping sequence with a corresponding resource in the second hopping sequence.

35. The modified hopping sequence of claim 34, wherein the corresponding resource in the second hopping sequence comprises the resource indicated by the second hopping sequence at the same time that the first hopping sequence indicates the eliminated resource.

36. The modified hopping sequence of claim 34, wherein the corresponding resource in the second hopping sequence comprises the resource mapped to by a second hopping function defining the second hopping sequence when the second hopping function is given a time input that results in a first hopping function defining the first hopping sequence mapping to the eliminated resource.

37. A method comprising:

transmitting a signal on a logical channel according to a modified hopping sequence, the modified hopping sequence generated by;

eliminating a resource from a plurality of resources of a first hopping sequence to be modified, the first hopping sequence belonging to a family of hopping sequences;

modifying the first hopping sequence by replacing the eliminated resource in the first hopping sequence with an alternate resource from a second hopping sequence in the family of hopping sequences; and

eliminating the second hopping sequence from the family of hopping sequences.

38. The method of claim 37, further comprising:

receiving a designated number of resources available on the logical channel; and

repeating

eliminating a resource from the plurality of resources used by the first hopping sequence and

modifying the first hopping sequence

until the first hopping sequence includes no more than the designated number of resources.

39. The method of claim 37, wherein replacing the eliminated resource in the first hopping sequence with the alternate resource comprises replacing each occurrence of the eliminated resource in the first hopping sequence with a corresponding resource in the second hopping sequence.

40. The method of claim 39, wherein the corresponding resource in the second hopping sequence comprises the resource indicated by the second hopping sequence at the same time that the first hopping sequence indicates the eliminated resource.

41. The method of claim 39, wherein the corresponding resource in the second hopping sequence comprises the resource mapped to by a second hopping function defining the second hopping sequence when the second hopping function is given a time input that results in a first hopping function defining the first hopping sequence mapping to the eliminated resource.