Methods and apparatus for flexible hopping in a multiple-access communication network

• US 8,098,711 B2
• Filed: 11/16/2010
• Issued: 01/17/2012
• Est. Priority Date: 12/22/2004
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Palanki, Ravi, Khandekar, Aamod
• Primary Examiner(s): LUGO, DAVID B
• Application Number:
  US12/947,547
• Publication Number:
  US 20110064121A1
• Time in Patent Office: 427 Days
• Field of Search: 375/132, 375/133, 375/135, 375/136
• US Class Current: 375/132
• CPC Class Codes: H04B 1/7143 Arrangements for generation of hop patterns
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 2209/80 Wireless
• CPC Class Codes: H04L 5/0007 the frequencies being orthogonal, e.g. OFDM(A), DMT
• CPC Class Codes: H04L 5/0021 in which codes are applied as a frequency-domain sequences, e.g. MC-CDMA
• CPC Class Codes: H04L 5/0048 Allocation of pilot signals, i.e. of signals known to the receiver
• CPC Class Codes: H04L 9/0625 with splitting of the data block into left and right halves, e.g. Feistel based algorithms, DES, FEAL, IDEA or KASUMI

Abstract

Techniques for efficiently designing random hopping patterns in a communications system are disclosed. The disclosed embodiments provide for methods and systems for generating random hopping patterns, updating the patterns frequently, generating different patterns for different cells/sectors, and generating patterns of nearby sub-carriers for block hopping.

Claims

1. A method for generating random hopping patterns for a plurality of hop ports with at least one processor, comprising:

swapping at least one pair of hop port entities of the plurality at the lower layer of a channel tree if at least a first condition is met for a corresponding pair, thereby generating a higher layer of swapped pairs of hop port entities in the channel tree;

swapping the swapped pairs of hop port entities at the higher layer if at least a second condition is met; and

repeating the previous acts, thereby generating a random hopping pattern.

2. The method of claim 1, wherein the hop port entities comprise at least one block of contiguous hop ports.

3. At least one processor programmed to implement a method for generating random hopping patterns for a plurality of hop ports, the method comprising:

swapping at least one pair of hop port entities of the plurality at the lower layer of a channel tree if at least a first condition is met for a corresponding pair, thereby generating a higher layer of swapped pairs of hop port entities in the channel tree;

swapping the swapped pairs of hop port entities at the higher layer if at least a second condition is met; and

repeating the previous acts, thereby generating a random hopping pattern.

4. The at least one processor of claim 3, wherein the hop port entities comprise at least one block of contiguous hop ports.

5. An apparatus for generating random hopping patterns for a plurality of hop ports, the apparatus comprising:

means for swapping at least one pair of hop port entities of the plurality at the lower layer of a channel tree if at least a first condition is met for a corresponding pair, thereby generating a higher layer of swapped pairs of hop port entities in the channel tree;

means for swapping the swapped pairs of hop port entities at the higher layer if at least a second condition is met; and

means for repeating the previous acts, thereby generating a random hopping pattern.

6. The apparatus of claim 5, wherein the hop port entities comprise at least one block of contiguous hop ports.

7. A non-transitory computer-readable medium embodying means for implementing a method for generating random hopping patterns for a plurality of hop ports, the method comprising:

swapping at least one pair of hop port entities of the plurality at the lower layer of a channel tree if at least a first condition is met for a corresponding pair, thereby generating a higher layer of swapped pairs of hop port entities in the channel tree;

swapping the swapped pairs of hop port entities at the higher layer if at least a second condition is met; and

repeating the previous acts, thereby generating a random hopping pattern.