Search Images Maps Play YouTube News Gmail Drive More »
Advanced Patent Search | Web History | Sign in

Patents

The present invention provides a method for generating preamble sequences in a code division multiple access system. The method includes forming an outer code in a mobile station. The mobile station forms an inner code. The mobile station multiplies the outer code to the inner code to generate the preamble sequence.

InventorTyler Brown
Original AssigneeMotorola, Inc.
Primary Examiner: Ken Vanderpuye
Current U.S. Classification370/335; 370/208
International Classification: H04J 1300

View patent at USPTO
Search USPTO Assignment Database

Citations

Cited PatentFiling dateIssue dateOriginal AssigneeTitle
US5260976Mar 9, 1992Nov 9, 1993International Business Machines CorporationPreamble recognition and synchronization detection in partial-response systems
US5457704May 21, 1993Oct 10, 1995AT&T IPM Corp.Post processing method and apparatus for symbol reliability generation
US5790537May 15, 1996Aug 4, 1998McGill UniversityInterference suppression in DS-CDMA systems

Referenced by

Citing PatentFiling dateIssue dateOriginal AssigneeTitle
US7215725Nov 8, 2002May 8, 2007Broadcom CorporationEnhanced channel parameter estimation in the presence of preamble erasures

Claims

1. A method for generating preamble sequences in a CDMA system, the method comprising the steps of:

forming an outer code in a mobile station, wherein the outer code is formed from a generator from the group consisting of a maximum length sequence generator, a Kasami sequence generator, and a Gold sequence generator;
forming an inner code in the mobile station; and multiplying the outer code by the inner code to generate a preamble sequence.

2. A method for generating preamble sequences in a CDMA system in accordance with claim 1, wherein the period of the outer code comprises k symbols, wherein k is a positive integer.

3. A method for generating preamble sequences in a CDMA system in accordance with claim 1, wherein the inner codes are formed as a series of M orthogonal code words having a length P, wherein M and P are positive integers.

4. A method for generating preamble sequences in a CDMA system in accordance with claim 1, wherein the inner codes comprise a set of Hadamard code words.

5. A method for generating preamble sequences in a CDMA system, the method comprising the steps of:

forming an outer code in a mobile station;
forming an inner code in the mobile station utilizing the following equation: ##EQU5##
where s.sub.j, j=0,1, . . . ,M-1 are a set of orthogonal codewords of length P, where M and P are positive integers; and
multiplying the outer code by the inner code to generate a preamble sequence.

6. A method for generating preamble sequences in a CDMA system, the method comprising the steps of:

forming an outer code in a mobile station, the outer code comprising a 3840 symbol segment of an m-sequence of length 33554431;
forming an inner code in the mobile station, the inner code being of the form: ##EQU6##
where w.sub.j, j=0,1, . . . ,M-1 are a set of Hadamard codewords of length 16, M=256, and P=16.

7. A method for estimating the difference between the carrier frequency of the received signal and the receiver oscillator frequencies comprising:

multiplying a received preamble by an outer code;
correlating the resulting signal with the series of M orthogonal signals;
multiplying consecutive symbols with the first symbol of each pair being complex conjugated;
averaging (M-1) results;
calculating the phase of the resulting complex number;
multiplying the phase by the symbol period; and
dividing by (2.pi.) to get the difference between the carrier frequency of the received signal and the receiver oscillator frequency.

8. A method for generating preamble sequences in a CDMA system, the method comprising the steps of:

forming an outer code in a mobile station, the outer code comprising a 3840 symbol segment of a Gold-sequence of length 33554431;
forming an inner code in the mobile station, the inner code being of the form: ##EQU7##
where w.sub.j, j=0,1, . . . ,M-1 are a set of Hadamard codewords of length 16, M=256, and P=16.