Pulse or digital communications – Spread spectrum – Direct sequence
Reexamination Certificate
2000-05-24
2004-11-09
Bayard, Emmanuel (Department: 2631)
Pulse or digital communications
Spread spectrum
Direct sequence
C375S144000, C370S335000
Reexamination Certificate
active
06816541
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention relates to digital communications, and more particularly to spread spectrum communications and related systems and methods.
2. Background
Spread spectrum wireless communications utilize a radio frequency bandwidth greater than the minimum bandwidth required for the transmitted data rate, but many users may simultaneously occupy the bandwidth. Each of the users has a pseudo-random code for “spreading” information to encode it and for “despreading” (by correlation) the spread spectrum signal for recovery of the corresponding information.
FIG. 2
shows a system block diagram, and
FIGS. 3
a
-
3
b
illustrates pseudo-random code plus a QPSK encoder. This multiple access is typically called code division multiple access (CDMA). The pseudo-random code may be an orthogonal (Walsh) code, a pseudo-noise (PN) code, a Gold code, or combinations (modulo-2 additions) of such codes. After despreading the received signal at the correct time instant, the user recovers the corresponding information while the remaining interfering signals appear noise-like. For example, the interim standard IS-95 for such CDMA communications employs channels of 1.25 MHz bandwidth and a code pulse interval (chip) T
c
of 0.8138 microsecond with a transmitted symbol (bit) lasting 64 chips. The recent wideband CDMA (WCDMA) proposal employs a 3.84 MHz bandwidth and the CDMA code length applied to each information symbol may vary from 4 chips to 256 chips. The CDMA code for each user is typically produced as the modulo-2 addition of a Walsh code with a pseudo-random code (two pseudo-random codes for QPSK modulation) to improve the noise-like nature of the resulting signal. A cellular system as illustrated in
FIG. 4
could employ IS-95 or WCDMA for the air interface between the base station and the mobile user station.
A receiver synchronizes with the transmitter in two steps: code acquisition and code tracking. Code acquisition is an initial search to bring the phase of the receiver's local code generator to within typically a half chip of the transmitter's, and code tracking maintains fine alignment of chip boundaries of the incoming and locally generated codes. Conventional code tracking utilizes a delay-lock loop (DLL) or a tau-dither loop (TDL), both of which are based on the well-known early-late gate principle.
In a multipath situation a RAKE receiver has individual demodulators (fingers) tracking separate paths and combines the results to improve signal-to-noise ratio (SNR) according to a method such as maximal ratio combining (MRC) in which the individual detected signals are synchronized and weighted according to their signal strengths. Thus a RAKE receiver typically has a DLL or TDL code tracking loop for each finger together with control circuitry for assigning tracking units to received paths.
A base station detecting many mobile users, each with multipath signals, can improve upon the RAKE detection of each mobile user separately by a joint maximum likelihood detection of all mobile users; this provides optimal detection. However, the computational complexity of the joint maximum likelihood detector precludes practical implementation for situations of more than a few users. Similarly, decorrelating detectors are optimal linear detectors but require large matrix inversions for the case of many users and thus impractical computational complexity.
Interference cancellation attempts to emulate joint maximum likelihood detection with lower computational complexity. In particular, a base station with a RAKE receiver for each mobile user can use estimates of interfering detected other mobile users' signals to cancel them out from its estimation and thereby increase accuracy of the estimates. The interference cancellation can be sequential or in parallel with iterative estimation. Divsalar et al, Improved Parallel Interference Cancellation for CDMA, 46 IEEE Trans. Comm. 258 (1998) describes a parallel interference cancellation method using partial parallel cancellation at each stage of the iterative estimation.
SUMMARY OF THE INVENTION
The present invention provides a spread spectrum system with interference cancellation employing a hybrid of sequential and parallel interference cancellation.
This has advantages including lower computational complexity than comparable parallel cancellation.
REFERENCES:
patent: 5719899 (1998-02-01), Thielecke et al.
patent: 6175587 (2001-01-01), Madhow et al.
patent: 6473415 (2002-10-01), Kim et al.
patent: 6501788 (2002-12-01), Wang et al.
patent: 6519477 (2003-02-01), Baier et al.
patent: 6532254 (2003-03-01), Jokinen
patent: 6600729 (2003-07-01), Suzuki
K lein A., Data detection algorithms specially designed for the downlink of CDMA mobile radio systems, □□ Vehicular Technology Conference, 1997 IEEE 47th, vol.: 1, May 4-7, 1997.
Bayard Emmanuel
Brady W. James
Ghulamali Qutbuddin
Hoel Carlton H.
Telecky , Jr. Frederick J.
LandOfFree
Spread spectrum interference cancellation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Spread spectrum interference cancellation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spread spectrum interference cancellation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3342148