Pulse or digital communications – Spread spectrum – Direct sequence
Reexamination Certificate
1998-12-29
2001-01-09
Marcelo, Melvin (Department: 2732)
Pulse or digital communications
Spread spectrum
Direct sequence
C375S152000, C375S343000
Reexamination Certificate
active
06173009
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to code division multiple access (CDMA) for a communication system and more particularly to a state generator circuit for generating a state vector having an arbitrary offset from an initial state.
BACKGROUND OF THE INVENTION
Present code division multiple access (CDMA) systems are characterized by simultaneous transmission of different data signals over a common channel by assigning each signal a unique code. This unique code is matched with a code of a selected receiver to determine the proper recipient of a data signal. Base stations in adjacent cells or transmit areas also have a unique pseudorandom noise (PN) code associated with transmitted data. This PN code is typically generated by a Linear Feedback Shift Register (LFSR), also known as a Linear Sequence Shift Register, and enables mobile stations within the cell to distinguish between intended signals and interference signals from other base stations. Identification of a PN code requires the mobile station to correctly identify an arbitrary part of the received PN sequence. The identification is frequently accomplished by a sliding window comparison of a locally generated PN sequence with the received part of the PN sequence. The sliding window algorithm often requires the mobile station to efficiently calculate multiple offsets from the LFSR to match the received sequence.
In another application of an LFSR (FIG.
1
), the mobile unit typically generates a PN sequence by a combination of one or more LFSRs
100
,
122
as in FIG.
1
. This PN sequence is used for quadrature phase shift keyed (QPSK) reverse link transmission. This transmission requires that the PN sequence be arbitrarily shifted by the number of chips equivalent to 250 microseconds for transmitting the in-phase component and the quadrature component. This arbitrary shift may vary with data rate.
Another application of an arbitrary offset LFSR arises for spreading and despreading transmitted signals as disclosed in U.S. Pat. No. 5,228,054 by Timothy I. Rueth and incorporated herein by reference. Rueth discloses an advantage of modulating each data bit at a constant chip rate for various transmit data rates. For example, a constant chip rate produces 128 chips for each bit at 9600 bits per second and 256 chips for each bit at 4800 bits per second. Thus, the chip rate may remain constant while the transmitted data rate may vary in response to rate information from a base station. Rueth further teaches that synchronization of base and mobile stations is simplified by inserting a zero in the PN sequence, thereby increasing the number of states from 2
N
−1 to 2
N
. Synchronization is further simplified by including an arbitrary offset circuit for the LFSR. Rueth teaches a mask circuit
30
in combination with an N-bit LFSR
10
(
FIG. 2
) for producing a PN offset with respect to the LFSR state. The mask circuit
30
produces the desired offset in response to a mask signal MASK on bus
32
. Rueth gives a specific example of a particular mask signal for a 10-chip offset for an exemplary 4-bit LFSR (col. 7, lines 37-40). Rueth, however, fails to teach or suggest how the mask signal is generated for this specific case or how the mask signal might be generated for an LFSR of arbitrary length. Rueth states that “it would be simplest to implement if the paired values of OFFSET and MASK were pre-computed and stored in a Read Only memory (ROM) not shown.” (col. 8, lines 63-66). For a 15-bit LFSR, however, this would require 2
N
−2 (32,722) 15-bit masks. A particular problem with generation of this mask signal, therefore, is the need for a simple circuit to generate states with an arbitrary offset from an LFSR state. Other problems include the practical memory limitation of mobile handsets, calculation complexity of offset determination and speed and power requirements to generate the offset.
SUMMARY OF THE INVENTION
These problems are resolved by a circuit designed to receive a plurality of index signals. The circuit includes a memory circuit arranged to store a plurality of state vectors. A multiplex circuit is coupled to the memory circuit. The multiplex circuit selectively produces one of the state vectors in response to at least one of the index signals. A matrix generator circuit is arranged to produce a variable matrix in response to at least another of the index signals. A logic circuit is coupled to the multiplex circuit and the matrix generator circuit. The logic circuit is arranged to produce a logical combination of the variable matrix and said one of the state vectors.
The present invention produces a state vector with an arbitrary offset from an initial state vector with minimal power and gate delay. Memory storage requirements for transition matrices are minimized.
REFERENCES:
patent: 4224664 (1980-09-01), Trinchieri
patent: 4748576 (1988-05-01), Beker et al.
patent: 4965881 (1990-10-01), Dilley
patent: 5033048 (1991-07-01), Pierce et al.
patent: 5228054 (1993-07-01), Rueth et al.
patent: 5251238 (1993-10-01), Menk et al.
patent: 5258936 (1993-11-01), Gallup et al.
patent: 5297207 (1994-03-01), Degele
patent: 5383143 (1995-01-01), Crouch et al.
patent: 5446683 (1995-08-01), Mullen et al.
patent: 5566099 (1996-10-01), Shimada
patent: 5910907 (1999-06-01), Chen et al.
patent: 5926070 (1999-06-01), Barron et al.
patent: 5974433 (1999-10-01), Currie
patent: 6064670 (2000-05-01), Athenes et al.
“Report On FPLMTS Radio Transmission Technology Special Group”, (Round 2 Activity Report), Association of Radio Industries and Business (arib), FPLMTS Study Committee, Draft Version E1.1, Jan. 10, 1997, 224 pages.
“Proposed Wideband CDMA (W-CDMA)”, Association of Radio Industries and Businesses (ARIB), Japan, Jan. 1997, 213 pages.
Marcelo Melvin
Nguyen Phuongchau Ba
Rountree Robert N.
Telecky , Jr. Frederick J.
Texas Instruments Incorporated
LandOfFree
State calculation circuit for discrete linear state space model does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with State calculation circuit for discrete linear state space model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State calculation circuit for discrete linear state space model will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2461725