Multiple-access code generation

• US 7,587,660 B2
• Filed: 04/22/2005
• Issued: 09/08/2009
• Est. Priority Date: 04/22/2005
• Status: Expired due to Fees

• Current Assignee: Kansas State University Research Foundation
• Original Assignee: Kansas State University Research Foundation
• Inventors: Natarajan, Balasubramaniam, Dyer, Justin S.
• Primary Examiner(s): Abraham, Esaw T
• Assistant Examiner(s): Alphonse, Fritz
• Application Number:
  US11/112,249
• Publication Number:
  US 20060239371A1
• Time in Patent Office: 1,600 Days
• Field of Search: 714/795, 714/792, 714/786, 714/799, 714/779, 714/784, 714/794
• US Class Current: 714/795
• CPC Class Codes: H03M 13/41 using the Viterbi algorithm or Viterbi processors
• CPC Class Codes: H04J 13/10 Code generation
• CPC Class Codes: H04L 5/026 using code division

Abstract

Multiple-access codes are generated using an asymptotically optimal decoding algorithm, such as the Viterbi algorithm. A trellis may be constructed using a number of desired users, at least one code length, and a number of code-chip parameters. A fitness function is derived from a mathematical relationship between the multiple-access codes, and may include some measure of correlation of the codes. The multiple-access codes correspond to paths having optimal path metrics derived from the fitness function. Multiple iterations through the trellis may be performed to refine a selection of multiple-access codes.

Claims

1. A method for generating at least one multiple-access code wherein a transmitter is configured for performing the steps of;

constructing a trellis having;

a plurality K×

N of state transition points,

each of the K×

N state transition points including L nodes, wherein

K is a number of multiple-access codes,

N is a code length, and

L is a number of a plurality of code-chip parameters;

constructing a fitness function that is computable for each of the plurality of state transition points;

appending at least one of the plurality of code-chip parameters to each multiple-access code corresponding to a winning path terminating at each of a plurality of nodes of a previous state transition point;

computing the fitness function for each multiple-access code; and

determining a winning path terminating at each node of a current state transition point.

2. The method recited in claim 1, wherein constructing the trellis includes providing for a code set ordered as a by-element variant topology or a by-user variant topology.

3. The method recited in claim 1, wherein constructing the fitness function further comprises providing for an approximation to the fitness function by employing only a portion of a total K×

N code-set matrix.

4. The method recited in claim 1, wherein the plurality of code-chip parameters includes at least one of a set of code-chip parameters comprising, a plurality of phases uniformly distributed in a phase space, a plurality of non-uniformly distributed phases, and a plurality of amplitudes.

5. The method recited in claim 1, wherein constructing the fitness function includes constructing at least one of an average mean-square aperiodic cross-correlation function for a resulting code set, a maximum-square aperiodic cross-correlation for a resulting code set, a spectral correlation function, an aperiodic autocorrelation configured for reducing peak-to-average-power ratio, or a Fourier transform of an aperiodic autocorrelation.

6. The method recited in claim 1, wherein constructing the trellis includes employing a plurality of values of N.

7. The method recited in claim 1, wherein K<

N, K=N, or K>

N.

8. The method recited in claim 1, wherein computing the fitness function includes updating a fitness function calculated for the previous state transition point.

9. The method recited in claim 1, wherein constructing the fitness function includes providing for multi-objective versions of an asymptotically optimal decoding algorithm.

10. A digital computer system configured to perform the method recited in claim 1.

11. A computer-readable storage medium encoded with a computer program configured to perform the method recited in claim 1.

12. The method recited in claim 1, wherein computing the fitness function for each multiple-access code produces a plurality of fitness function parameters, and determining the winning path comprises processing the fitness function parameters with respect to at least one predetermined criteria, wherein the at least one predetermined criteria includes a maximum of the plurality of fitness function parameters, a minimum of the plurality of fitness function parameters, and being closest to a target fitness function parameter.

13. The method recited in claim 1, wherein an initial multiple-access code set is produced upon completing a first pass through the trellis, the method further comprising initializing the trellis with the initial multiple-access code set.

14. A multiple-access coder, comprising:

a first module configured for calculating branch metrics based on at least one fitness function for possible state transitions between two successive states; and

a second module configured for calculating, as a function of said branch metrics, path metrics for possible paths constituted by successive state transitions and ending in each of said states, wherein the second module is further configured for appending at least one of a plurality of code-chip parameters to each multiple-access code corresponding to a winning path terminating at each of a plurality of nodes of a previous state transition point, computing the fitness function for each multiple-access code, and determining a winning path terminating at each node of a current state transition point.