Pulse or digital communications – Spread spectrum – Direct sequence
Reexamination Certificate
2000-08-04
2003-09-09
Tse, Young T. (Department: 2634)
Pulse or digital communications
Spread spectrum
Direct sequence
C375S144000
Reexamination Certificate
active
06618433
ABSTRACT:
BACKGROUND OF THE PRESENT INVENTION
In code division, multiple access (CDMA) cellular telephony, a mobile telephone communicates with a base station where each user and each base station has its own “spreading code” used for modulation of the transmitted signal and for separating the different signals corresponding to different users/subscribers. Typically, a receiver picks up many echoes (multipath reflections) of a transmitted signal, each having different and randomly varying delays and amplitudes. In such a scenario, the spreading codes that were originally designed to be orthogonal among the different users are no longer orthogonal and the users are no longer separated. Consequently, a mobile unit, when attempting to detect only a single user, regards all other channel users (including signals from other base stations) as creators of interference. One exemplary single-user multipath detector is a rake receiver that combines the different channel paths into a single replica of the transmitted signal.
The rake receiver detects the signal of interest while treating the interference from other users as background noise. A multiple-user detection (MUD) scheme, on the other hand, incorporates various levels of a-priori information on the interference and may significantly outperform the rake receiver (or any other single-user receiver). The maximal level of a-priori information occurs when the interfering signal is completely known to the receiver, as is the case in U.S. Pat. No. 6,034,986. In the past two decades, numerous methods for multi-user detection were developed based on different levels of utilization of a-priori information and leading to different levels of receiver complexity.
Unfortunately, multi-user detection schemes are significantly more complex than single-user ones. Not only does multi-user detection require (either explicitly or implicitly) processing the received signal with a bank of despreaders (with each despreader being matched to a distinct user), the outputs of this despreader bank must further be processed according to some a priori criterion, such as the maximum likelihood criterion, whose complexity is exponential in the number of users.
Exponential complexity is intolerable unless the number of users is extremely small, which is not the case in cellular communications. Therefore, suboptimal, linear MUD schemes were developed, among them are the decorrelator and/or the minimum mean squared error (MMSE) receiver. Still, linear MUDs require that a signature cross-correlation matrix, or a rescaled version of which, be inverted with each new symbol/block that arrives. This is computationally too heavy to be performed by the mobile unit. Numerous methods for approximating matrix inversion were suggested recently, such as Verdu's first order approximation (O(K) operations per symbol per user).
Another weakness of existing MUD schemes for long code DS-CDMA (where the spreading code spans more than one symbol) is that there is no simple approach to turn them into the more desirable form of adaptive algorithms, since a symbol rate adaptive algorithm cannot track the symbol rate variations of the cross-correlation matrix. In fact, the problem of adaptive algorithms for long code DS-CDMA is regarded an open problem in the scientific literature.
U.S. Patent Publication WO 00/18030, assigned to the common assignee of the present invention, recognizes that the spreading codes are cyclic and describes a method of processing received signals by dividing the cyclic spreading codes into a plurality of sections. Each section is assigned a different cost function and a respective set of receiver parameters that are used to minimize the associated cost function. Portions of the received signal which were spread by the same section of code are jointly processed, so as to dynamically update the associated set of receiver parameters.
REFERENCES:
patent: 6034986 (2000-03-01), Yellin
patent: 6058138 (2000-05-01), Fukumasa et al.
patent: 6118806 (2000-09-01), Niida et al.
patent: 6125137 (2000-09-01), Wang et al.
patent: 6208683 (2001-03-01), Mizuguchi et al.
patent: 6208684 (2001-03-01), Yellin et al.
patent: 6215814 (2001-04-01), Ylitalo et al.
patent: 6249251 (2001-06-01), Chang et al.
patent: 6301293 (2001-10-01), Huang et al.
patent: WO 00/18030 (2000-03-01), None
A. J. Viterbi, “CDMA Principals of Spread Spectrum Communication”, Addison-Wesley Publishing Company, 1995.
S. Verdu, “Multi-user Detection”, Cambridge University Press, 1998.
J.G. Proakis, “Digital Communications”, Third Edition McGraw Hill Series in Electrical and Computer Engineering, 1995.
Eitan, Pearl, Latzer & Cohen Zedek LLP.
Intel Corporation
Tse Young T.
LandOfFree
Family of linear multi-user detectors (MUDs) does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Family of linear multi-user detectors (MUDs), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Family of linear multi-user detectors (MUDs) will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3109630