CA2076006C - Cdma subtractive demodulation - Google Patents

Cdma subtractive demodulation Download PDF

Info

Publication number
CA2076006C
CA2076006C CA002076006A CA2076006A CA2076006C CA 2076006 C CA2076006 C CA 2076006C CA 002076006 A CA002076006 A CA 002076006A CA 2076006 A CA2076006 A CA 2076006A CA 2076006 C CA2076006 C CA 2076006C
Authority
CA
Canada
Prior art keywords
signal
signals
composite signal
code
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
CA002076006A
Other languages
French (fr)
Other versions
CA2076006A1 (en
Inventor
Paul W. Dent
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ericsson Inc
Original Assignee
Ericsson GE Mobile Communications Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ericsson GE Mobile Communications Inc filed Critical Ericsson GE Mobile Communications Inc
Publication of CA2076006A1 publication Critical patent/CA2076006A1/en
Application granted granted Critical
Publication of CA2076006C publication Critical patent/CA2076006C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7107Subtractive interference cancellation
    • H04B1/71072Successive interference cancellation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7107Subtractive interference cancellation
    • H04B2001/71077Partial interference cancellation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/70703Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation using multiple or variable rates

Abstract

Subtractive CDMA demodulation optimally decodes a coded information signal embedded in many other overlapping signals making up a received, composite signal. A radio receiver correlates a unique code corresponding to the desired signal to be decoded with the composite signal. As a result, subsequent correlations are performed with greater accuracy. Subtractive CDMA demodulation is enhance by decoding the composite signal in the order of the strongest to weakest signal strength. Interference caused by the presence of the strongest information signal and the composite signal during the decoding of weaker signals is removed. The individual information signals are assigned a unique block error correction code (44) which is correlated with the composite signal using Fast Walsh transforms. Correlated signals are recoded using inverted Fast Walsh transforms (46) and removed from the composite signal.

Description

CDMA SUBTRACTIVE DEMODULATION
FIELD OF THE INVENTION
The present invention relates to the use of Code Division Multiple Access (CDMA) communications techniques in cellular radio telephone communication systems, and more particularly, to an enhanced CDMA demodulation scheme based on successive signal subtractions of multiple CDMA signals in signal strength order.
EACKGROUND OF THE INVENTION
The cellular telephone industry has made phenomenal strides in commercial operations in the United States as well as the rest of the world. Growth in major metropolitan areas has far exceeded expectations and is outstripping system capacity. If this trend continues, the effects of rapid growth will soon reach even the smallest markets. Innovative solutions are required to meet these increasing capacity needs as well as maintain high quality service and avoid rising prices.
Throughout the world, one important step in cellular systems is to change from analog to digital transmission.
Equally important is the choice of an effective digital transmission scheme for implementing the next generation of cellular technology. Furthenaore, it is widely believed that the first generation of Personal Communication Networks (PCN), (employing low cost, pocket- size, cordless telephones that can be carried comfortably and used to make or receive calls in the home, office, street, car, etc.), would be~provided by the cellular carriers using the next generation digital cellular system infrastructure and the cellular frequencies.
The key feature demanded in these new systems is increased traffic capacity.
- 2 -Currently, channel access is achieved using Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) methods. As illustrated in Fig. 1(a), in FDMA, a communication channel is a single radio frequency band into which a signal's transmission power is concentrated.
Interference with adjacent channels is limited by the use of band pass filters which only pass signal energy within the specified frequency band. Thus, with each channel being assigned a different frequency, system capacity is limited by the available frequencies as well as by limitations imposed by channel reuse.
In TDMA systems, as shown in Fig. 1(b), a channel consists of a time slot in a periodic train of time intervals over the same frequency. Each period of time slots is called a frame. A given signal's energy is confined to one of these time slots. Adjacent channel interference is limited by the use of a time gate or other synchronization element that only passes signal energy received at the proper time. Thus, the problem ~of interference from different relative signal strength levels is reduced.
Capacity in a TDMA system is increased by compressing the transmission signal into a shorter time slot.
As a result, the information must be transmitted at a correspondingly faster burst rate which increases the amount of occupied spectrum proportionally.
With FDMA or TDMA systems or hybrid FDMA/TDMA
systems, the goal is to insure that two potentially interfering signals do not occupy the same frequency at the same time. In contrast, Code Division Multiple Access (CDMA) allows signals to overlap in both time and frequency, as illustrated in Fig. 1(c). Thus, all CDMA signals share the same frequency spectrum. In either the frequency or the time domain, the multiple access signals appear to be on top of .,
- 3 -each other. In principal, the informational data stream to be transmitted is impressed upon a much higher bit rate data stream generated by a pseudo-random code generator. The informational data stream and the high bit rate data stream are combined by multiplying the two bit streams together.
This combination of the higher bit rate signal with the lower bit rate data stream is called coding or spreading the informational data stream signal. Each informational data stream or channel is allocated a unique spreading code. A
to plurality of coded information signals are transmitted on radio frequency carrier waves and jointly received as a composite signal at a receiver. Each of the coded signals overlaps all of the other coded signals, as well as noise-related signals, in both frequency and time. By correlating the composite, signal with one of the unique codes, the corresponding information signal is isolated and decoded.
There are a number of advantages associated with CDMA communication techniques. The capacity limits of CDMA
based cellular systems are projected to be up to twenty times that of existing analog technology as a result of the properties of a wide band CDMA system, such as improved coding gain/modulation density, voice activity gating, sectorization and reuse of the same spectrum in every cell. CDM~ is virtually immune to multi-path interference, and eliminates fading and static to enhance performance in urban areas. CDMA
transmission of voice by a high bit rate decoder insures superior, realistic voice quality. CDMA also provides for variable data rates allowing many different grades of voice quality to be offered. The scrambled signal format of CDMA
completely eliminates cross talk and makes it very difficult and costly to eavesdrop or track calls, insuring greater privacy for callers and greater immunity from air time fraud.

20'76006
- 4 -Despite the numerous advantages afforded by CDMA, the capacity of conventional CDMA systems is limited by the decoding process. Because so many different user communications overlap in time and frequency, the task of correlating the correct information signal with the appropriate user is complex. In practical implementations of CDMA, capacity is limited by the signal-to-noise ratio (S/Nj, which is essentially a measure of the interference.caused by other overlapping signals as well as background noise. The problem to be solved, therefore, is how to increase system capacity and still be able to maintain a reasonable signal-to-noise ratio so that signal decoding can be carried out efficiently and accurately.
SUN~LARY OF THE INVENTION
The present invention resolves the above-mentioned problems using a subtractive CDMA demodulation technique. In order to optimally decode a coded information signal embedded in many other overlapping signals making up a received composite signal, a radio receiver correlates a unique code corresponding to the signal to be decoded with the composite signal. After each information signal is decoded, it is recoded and removed from the composite signal. As a result, subsequent correlations of other information signals in the received composite signal can be perfor~aed with less interference and, therefore, with greater accuracy.
The subtractive demodulation technique is enhanced by decoding the composite signal in an order of the information signals from strongest to weakest signal strength.
In other words, the strongest signal is correlated and removed first. Interference caused by the presence of the strongest information signal in the composite signal during the decoding/correlation of weaker signals is thereby removed.

,.-..
,, _2076006
- 5 -Thus, the chances of accurately decoding even the weakest signal is greatly improved.
In a preferred embodiment of the invention, the encoding of the individual information signals is carried out by assigning each signal a unique, block-error correction code which may be readily correlated using a Fast Walsh Transformation circuit. Correlated signals are recoded by repeating the Fast Walsh Transformation a second time so they may be removed from the composite signal.
BRIEF DESCRIPTION OF TFIE DRAWINGS
The present invention will now be described in more detail with reference to preferred embodiments of the invention, given only by way of example, and illustrated in the accompanying drawings, in which:
Figs. 1(a)-1(c) are plots of access channels using different multiple access techniques:
Fig. 2 shows a series of graphs illustrating how CDMA signals are generated:
Figs. 3 and 4 show a series of graphs for illustrating how CDMA signals are decoded:
Fig. 5 shows a series of graphs illustrating CDMA
subtractive demodulation according to the present invention:
Fig. 6 is a functional schematic of a CDMA
transmitter and receiver:
Fig. 7 is a functional schematic of a CDMA
subtractive demodulator according to the present invention;
Fig 8 is a functional schematic of the signal strength processor illustrated in Fig. 7:
Fig. 9 is a graph comparing the signal-to-noise ratio of conventional CDMA with that of subtractive CDMA
according to the present invention: and
6 PCT/US91/09174 Fig. 10 is a functional schematic of a further embodiment of the CDMA subtractive demodulator according to the present invention:
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
While the following description is in the context of cellular communications systems involving portable or mobile radio telephones and/or personal communication networks, it will be understood by those skilled in the art that the present invention may be applied to other communications applications.
The present invention will now be described in conjunction with the signal graphs shown in Figs. 2-4 which set forth example wavefonas in the coding and decoding processes involved in traditional CDMA systems. Using these same wave form examples from Figs. 2-4, the improved performance of the present invention over conventional CDMA is illustrated in Fig. 5.
Two different data streams, shown in Fig. 2 as signal graphs.(a) and (d), represent digitized information to be communicated over two separate communication channels.
Signal 1 is modulated using a high bit rate, digital code unique to signal 1 as shown in signal graph (b). For purposes of the present invention, the term "bit" refers to one digit of the infonaation signal. The term "bit period" refers to the time period between the start and the finish of the bit signal. The term "chip" refers to one digit of the high rate coding signal. Accordingly, the chip period refers to the time period between the start and the finish of the chip signal. Naturally, the bit period is much greater than the chip period. The result of this modulation, which is essentially the product of the two signal waveforms, is shown in the signal graph (c). In Boolean notation, the modulation 2p.~ 6ppp r~..

_ 7 _ of two binary waveforms is essentially an exclusive-OR
operation. A similar series of operations is carried out for signal 2 as shown in signal graphs (d)-(f). In practice, of course, many more than two, coded information signals are spread across the frequency spectrum available for cellular telephone communications.
Each coded signal is used to modulate a RF carrier using any one of a number of modulation techniques, such as Quadrature Phase Shift Keying (QPSK). Each modulated carrier io is transmitted over an air interface. At a radio receiver, such as a cellular base station, all of the signals that overlap in the allocated frequency bandwidth are received together. The individually coded signals are added, as represented in the signal graphs (a)-(c) of Fig. 3,~to form a composite signal waveform.
After demodulation of the received signal to the appropriate baseband frequency, the decoding of the composite signal takes place. Signal 1 may be decoded or despread by multiplying the received composite signal in the signal graph (c) with the unique code used originally to modulate signal 1, as shown in the signal graph (d). The resulting-signal is analyzed to decide the polarity (high or l,ow; +1 or -1, "1" or "0") of each information bit period of the signal.
These decisions may be made by taking an average or majority vote of the chip polarities during one bit period.
Such "hard decision" making processes are acceptable as long as there is no signal ambiguity. For example, during the first bit period in the signal graph ( f ) , the average chip value is +1.00 which readily indicates a bit polarity +1.
Similarly, during the third bit period, the average chip value is +0.75. As a result, the bit po~.arity was most likely a +1.
However, in the second bit period, the average is zero, 2U'~60~6 _ g and the majority vote or averaging test fails to provide an acceptable polarity value.
In ambiguous situations, a "soft decision" making process must be used to determine the bit polarity. For example, an analog voltage proportional to the received signal after despreading may be integrated over the number of chip periods corresponding to a single information bit. The sign or polarity of the net integration result indicates that the bit value is a +1 or -1.
The decoding of signal 2, similar to that of signal 1, is illustrated in the signal graphs (a)-(d) of Fig. 4.
However, after decoding, there are no ambiguous, bit polarity situations.
. Theoretically, this decoding scheme can be used to decode every signal that makes up the composite signal.
Ideally, the contribution of unwanted, interfering signals is minimized if the digital spreading codes are orthogonal to the unwanted signals. Two codes are orthogonal if exactly one half of their bits are different. Unfortunately, only a certain number of orthogonal codes exist for a finite word length. Another problem is that orthogonality_ can be maintained only when the relative time alignment between two ~~ signals is strictly maintained. In communications environments where portable radio units are moving constantly, such as in cellular systems, time alignment is difficult to achieve.
When code orthogonality cannot be guaranteed, noise-based signals may interfere with the actual bit sequences produced by different code generators, e.g. the mobile telephone. In comparison with the originally coded signal energies, however, the energy of the noise signals is usually small. The term "processing gain" is often used to compare relative signal energies. Processing gain is defined as the 20'6006 _ g ratio of the spreading or coding bit rate to the underlying infonaation bit rate. Thus, the processing gain is essentially the spreading ratio. The higher the coding bit rate, the wider the information is spread and the greater the spreading ratio. For example, a one kilobit per second information rate used to modulate a one megabit per second coding signal has processing gain of 1000:1.
Large processing gains reduce the chance 'of decoding noise signals modulated using uncorrelated codes. ~ F o r l0 example, processing gain is used in military contexts to measure the suppression of hostile jamming signals. In other environments, such as cellular systems, processing gain refers to suppressing other, friendly signals that are present on the same communications channel With an uncorrelated code. In the context of the present invention, noise includes both hostile and friendly signals. In fact, noise is defined as any other signals other than the signal of interest, i.e., the signal to be decoded. Expanding the example described above, if a signal-to-interference ratio of 10:1 is required, and the processing gain is 1000:1, conventional CDMA systems have the capacity to allow up to 101 signals to share the same channel.
During decoding, 100 of the 101 signals are suppressed to 1/1000th of their original interfering power. The total interference energy is thus 100/1000 or 1/10 as compared to the desired information energy of one (1). With the information signal energy ten times greater than the interference energy, the infonaation signal may be correlated accurately.
Together with the required signal-to-interference ratio, the processing gain determines the number of allowed overlapping signals in the same channel. That this is still the conventional view of the capacity limits of CDMA systems may be gleaned by reading, for example, "On the Capacity of a 2o~rsoo~

Cellular CDMA System," by Gilhousen, Jacobs, Viterbi, Weaver and Wheatley, Trans. IEEE on Vehicular Technology, November 1990.
In contrast to the conventional view, an important aspect of the present invention is the recognition that the suppression of friendly CDMA signals is not limited by the processing gain of the spread spectrum demodulator-as is the case with the suppression of military type jammingvsignals.
A large percentage of the other signals included in a l0 received, composite signal are not unknown jamming signals or environmental noise that cannot be correlated. Instead, most of the noise, as defined above, is known and is used to facilitate decoding the signal of interest. The fact that most of these noise signals are known, as are their corresponding codes, is used in the present invention to improve system capacity and the accuracy of the signal decoding process.
Rather than simply decode each information signal from the composite signal, the present invention also removes each information signal from the composite signal after it has been decoded. Those signals that remain are decoded only from the residual of the composite signal. Consequently, the existence of signal transmissions in the communications channel from the already decoded signals do not interfere with the decoding of other signals. For example, in Fig. 5, if signal 2 has already been decoded as shown in the signal graph (a), the coded form of signal 2 can be reconstructed as shown in the signal graphs (b) and (c) and subtracted from the composite signal in the signal graph (d) to leave coded signal 1 in the signal graph (e). Signal 1 is recaptured easily by multiplying the coded signal 1 with code 1 to reconstruct signal 1. It is significant that while the conventional CDMA
decoding method was unable to determine whether the polarity 207~00~

of the information bit in the second bit period of signal 1 was a +1 or a -1 in the signal graph (f) of Fig. 3, the decoding method of the present invention effectively resolves that ambiguity simply by removing signal 2 from the composite signal.
Fig. 6 illustrates a conventional CDMA system.
Digital information 1 to be transmitted over an RF
communications channel is coded in a CDMA encoder 20. The coded signal is used to modulate an RF carrier in a.mixer 22.
to The modulated carrier is transmitted over the air interface via a transmitting antenna 24. Other digital information from other transmitters (2...Nj may be transmitted in a similar fashion. A receiving antenna 26 of a radio receiver 25 receives a composite, RF signal and demodulates the composite signal using another mixer 28. The desired signal is extracted from the composite signal by multiplying the corresponding code used to originally code the desired signal in the CDMA encoder 20 with the composite signal. In theory, only the appropriate signal is correlated and reconstructed in a decoder 34.
A detailed embodiment of the decoder 34 will now be described in conjunction with Fig. 7. A multiplicity of coded signals overlapping in the same communications channel is received at the antenna 26 as a composite, RF signal. The demodulator 28 converts the received RF signal to a convenient frequency for processing. Such a convenient frequency may, for example, lie around zero frequency (DC), and the composite signal may consist of complex factor components having real and imaginary or I and Q components. A first digital processing block 40 includes a first code generator- 32 set to match the code of the first signal to be demodulated. While the specific code to be set by the code generator 32 in the first data processing block 40 may be selected arbitrarily, in 2o7soo~

the preferred embodiment of the present invention, the order in which the codes are generated is based on signal strength.
A signal strength processor 29 monitors the relative signal strengths of each of the signals that make up the composite signal. In the context of cellular systems, if mobile switching center (MSC) or the base stations (BS) monitors the probable or actual signal strengths of each mobile telephone communication, either the MSC or the BS may perform the tasks of the signal strength processor 29.
It will be appreciated that signal strength can be detected by-the signal strength processor 29, or it can be predicted based upon historical models of signal strength.
A function block diagram depicting a hardware implementation for performing the functions of the signal strength processor 29 will now be described in conjunction with Fig. 8. It will be appreciated by those skilled in the art that these functions could also be implemented using a suitably programmed microprocessor. The total composite signal received by the antenna 26 is squared in multiplier 100, and integrated in an integrator 106 over the number of chip periods in a bit period. A bit clock signal determines the integration interval. A square root circuit la7 determines the root mean square (RMS) value of the composite signal over the bit period.
At the same time, the residual signal is received in a multiplier 102. The residual signal comprises the total composite signal minus any prior decoded signals. The residual signal is multiplied by a spreading code generated by a local code generator 104 of the signal to be decoded. The correlated output signal from the multiplier 102 is. also integrated over the same bit period in an integrator 108, as controlled by the bit clock signal. As described, for example, with respect to the signal graphs (e) and (f) in Fig.

207600fi 3 , the average or integrated voltage value over the integrated time period may have a positive or a negative polarity. Thus, a bit polarity decision device 110 detects the signal polarity and transmits a signal to an absolute value device 114 which insures that the sign of the integrator 108 output signal, delayed by a delay 112, is always positive. The absolute value device 114 may be, for example, an inverter. controlled by the bit polarity decision device 110.
The absolute value of the average correlation signal (B) is divided in a divider 116 by the square root of the RMS
value of the total composite signal squared (AZ) for the same bit period to generate a normalized value. In other Words, the correlation strength of the decoded signal B is normalized by dividing it by the total composite strength of the signal for that bit period. The normalized correlation of the decoded signal is accumulated in a signal averager 118 over a number of bit periods to generate a relative mean strength for that decoded signal. Due to multipath fading of the signal, the actual number of bit periods should probably be on the order of about ten in order to determine an accurate average signal strength of the demodulated signal. Each local code is stored in a memory 120 along with its associated average strength value. A sorter 122 compares each of these average signal strength values and sorts them from strongest to weakest. At that point, the sorter 122 transmits the local spreading code of the strongest signal to the local code generator 104 so that the strongest signal is always demodulated and extracted at the next data bit period. Lesser strength signals are demodulated in order of signal strength as determined by the sorter 122. The sorter 122 functions may be readily implemented by a microprocessor using a software sorting program.

w ~o7soo~

Because the signal strengths of the multiple mobile stations in a cell are constantly varying, a further embodiment of the present invention utilizes linear predictive analysis (LPA) to reorder the signal strength priority. In general terms, a historical model of the relative signal strengths is stored in a memory and used to extrapolate which signal is most likely to have the greatest strength at the next instant in time. LPA postulates that the next value of a waveform will be a weighted sum of previous.values with the weight coefficients to be determined. The known Kalman filter algorithm may be used to implement this analysis. In this manner, the strongest signal may be predicted effectively without having to actually perform another sequence of signal decoding and measurements.
If the signal strength processor 29 determines that the actual results of the decoding of the composite signal and signal strength priority sequence is in error because of an inaccurate prediction or because system conditions have changed, the signal strength processor 29 reorders the code sequence to reflect the actual signal strength order.
Subsequently, the demodulation process may be repeated to insure that the individually coded signals of the composite signal are decoded in the order of greatest to least signal strength. The repeated process does not result in any loss of data or interruption in traffic because the composite signal is stored in a delay 50 in the processing block 40. The delay 50 may be simply a memory device. Consequently, the composite signal may be retrospectively reprocessed once the optimum order of decoding is determined.
By correlating the output signal of the first code generator 32 with the composite signal received at the correlator 30, an individual signal corresponding to the first code is extracted from the composite signal. The correlated signal is filtered in a low pass filter 42 in order to reject interference generated by noise and unrelated signals.
Instead of the low pass filter 42, a majority vote circuit or an integrate and dump circuit may be used to reduce or despread the bandwidth or bit rate of the correlated signal.
The output signal generated by the low pass filter 42 is processed further in an error correction decoder=44 which finally reduces the signal bandwidth or bit rats to the underlying digital information. The decoded, information l0 signal may undergo additional signal processing before it reaches its final destination.
The error corrected output signal is also applied to a recoder/remodulator 46 to reconstruct the.waveform of the signal just decoded. The purpose for reconstructing/recoding the decoded signal is to remove it from the composite signal in a subtractor 48. A delay memory 50 stores the composite signal for the processing time required to first decode and then reconstruct the first decoded signal.
The residual composite signal, from which the first signal has been decoded and subtracted, is passed from the subtractor 20 to the input of a second digital processing block 40' similar to the first block 40. The only difference between the two digital processing blocks 40 and 40' is that the code generator 32' is programmed to match the code corresponding to a second signal to be demodulated. In the preferred embodiment of the invention, the second signal to be demodulated is the signal having the next greatest signal strength. Those skilled in the art will recognize that the second signal processing block 40' may be implemented by recursive use of the first signal processing block 40 in order to avoid duplicating hardware. The second signal processing block 40' produces a second, decoded signal from the error correction decoder 44' and subtracts a reconstructed, second 2o~soo~

signal from the delayed composite signal in a subtractor 48'.
The residual, composite signal, with two signals now removed, is passed to a third stage of signal processing and so on.
It will be appreciated that a key element of the present invention is that the sequence of demodulation and extraction of individual information signals is in the order of highest signal strength to lowest signal strength.
Initially, when the composite signal includes many~signals, the signal most likely to be detected accurately is the signal l0 having the greatest signal strength. Weaker signals are less likely to interfere with stranger signals. Once the strongest signal is removed from the composite signal, the next strongest signal may be readily detected without having to account for the interference of the strongest signal. In this fashion, even the weakest signal may be accurately decoded.
Because of this enhanced decoding capability, the present invention performs satisfactorily even with a significant increase in the number of users typically handled in conventional CDMA systems. Thus, increased capacity is achieved.
By increasing the number of mobile accesses over the same communications channel, a steady-state level of activity is achieved in which the signal strength processor 29 continuously determines the relative instantaneous levels of all information signals being processed. The ultimate capacity limit of this system is reached when the power of a signal is exceeded by the sum of the powers of all lower power signals by more than the available processing gain (less any desired signal-to-noise ratio). This limit, however, is considerably more favorable than the conventional_limit which is reached when the sum of the power of all the stronger signals exceeds the power of the weakest signal by more than the available processing gain.

.., 2o7soo~

In estimating the capacity gain, the Rayleigh distribution is used as a representative signal level distribution in a cellular telephone environment. Assuming use of feedback power control, the long-term mean strength of all signals is unity. Consequently, the signal strength power exhibits the distribution function:
P(A)dA = 2A exp(-A2)dA V
l0 where A is the signal amplitude. The total power P of a large number N of such signals is simply N. If the processing gain or spreading ratio is R, the signal-to-interference ratio after despreading would be approximately S/I = AZ R/N
for a conventional CDMA system. If S/I equals 1, signals of amplitude less than SQRT(N/R) would therefore not reach zero dB (equal power ratio) with respect to the interference after demodulation. If this is the threshold for acceptable decoding, a certain number of signals 1 - ec-Nia) will not be decodable, and a certain number of signals ec-NiR~
will be decodable. Thus, the maximwn number of signals that can be decoded is N e~'NiR~
When N is chosen to be equal to R, the number of decodable signals becomes N/e. Thus, the loss due to the signal strength distribution is a factor e. In practice, it is doubtful that this capacity could be reached while providing an adequate quality of service in a cellular system, as those signals that were decodable at one instant would belong to one set of mobiles and to another set of mobiles at another instant. To ensure that every mobile information signal is decodable 95% of the time, for example, would entail a substantial loss in capacity. This further loss is the margin that must be built in to the system capacity to allow for signal fading.
In the case of the present invention, however, each signal suffers from interference only from those having less than or equal amplitude. Those signals having a higher signal strength or amplitude have been demodulated first and removed.
The integral of all interference I up to an amplitude A is given by 1- ( 1+A2 ) exp ( -A2 ) .
The signal-to-interference ratio S/I after despreading a signal of amplitude A is thus S - R AZ / (1-(A2 +1)exp(-AZ) ) .
I N
Figure 9 is a plot of the function AZ / (1-(AZ + 1)exp(-AZ) ) .
showing that it is never less than 5.8 dB (3.8:1 power ratio), with the minimum occurring at A2 = 1.79. The S/I
improves for signals having an amplitude larger than (1.79)~h due to their greater power. In contrast with conventional CDMA systems, the S/I in the present invention, also improves for signals having an amplitude smaller than (1.79) because fewer unsubtracted, interfering signals remain below this signal level.
Consequently, all signals are decodable provided that R/N > 1/3.8 that is N < 3.8R
Compared to the conventional CDMA demodulator capacity limit of N < R/e (without fading margin) 2o~sooo WO 92/11716 PCf/US91/09174 the invention has a capacity advantage of 3.87e which is more than a tenfold increase. In addition, conventional systems have a significant fading margin. In the present invention, even the weakest, faded signals (at least with regard to interference with other signals and neglecting other noise sources), may be decoded accurately. Accounting for the fading margin, the capacity increase of the present invention is approximately 100 times greater than.-conventional CDMA systems.
l0 It should be noted that the system capacity is limited only because of the possibility that the first signals being processed may be the weaker rather than the stronger signals. However, by taking advantage of the storage of the composite signal in the delay memory 50 and the ability to reprocess the composite signal retrospectively, a multiple-pass demodulation procedure may be applied to the composite signal. Of course, this procedure would only make a difference if the first pass demodulation produced errors in the decoded signals.
Accordingly, redundant coding is preferably used~t~ indicate the confidence in a decoded signal result. Based on that confidence code, the processing block 40 decides whether further passes will yield an improvement. One well known redundant coding procedure for assigning a confidence value to a particular decoding result is the majority vote technique. For example, if five redundant signals are compared and 4 or 5 have the same value, then a high confidence value is assigned to the result. The fewer signals that agree, the lower the confidence values If the 3o confidence value is high, no further demodulation passes are necessary. Conversely, a low confidence value dictates that the signals be resorted, and any signals having a greater strength be removed.

20'6005 While the principles of continuous spreading codes were described initially in conjunction with Figs. 3-5, superior methods of spreading the spectrum of an information signal may be achieved using error correction coding. When a single binary information bit at a time is bandwidth expanded by a spreading ratio R to become a pseudo-random sequence of R bits, the bandwidth is spread without>any error correction coding gain. As such, this technique may be tensed simple spreading. On the other hand, spreading a block of M information bits at a time, where M > 1, to a pseudo-random sequence of M x R bits provides error correction coding gain within the same spreading factor.
This latter technique is termed intelligent spreading.
Simple spreading may be regarded as converting an information signal as one of two possible coordinates (-1) or (+1) in a one dimensional space, e.g., on a line, into a signal that needs R dimensions to display it. A coordinate in any R dimensions may have only two possible values -1 or +1 (in Boolean notation 0 or 1). Such spaces are known as Galois fields. Correlating a signal with a code-.may-be equated to finding its projection on a vector from the origin through a point whose coordinates are given by the bits of the code. Maximum correlation or projection of the signal is achieved if the end point of the signal vector and the code vector coincide. Coincidence occurs when no angle exists between the signal vector and the code vector. When a signal consists of a sum of signals, one of which coincides with the code, the others being at right angles to that code, correlation of the signal with that code yields a complex, correlation product corresponding to the desired signal demodulated. The other signals do not contribute to the resulting magnitude of the correlation product because they have zero projection on the correlation line I+jQ.

2076~~~

More generally, a sum of randomiy coded signals may include one signal which coincides with a correlation code, the others having random projections on the code correlation line or vector. If the total length squared of any one of these other signals is, by Pythagoras, a12 + a22 + a32. . . . .where al, a2, a3. . . . are the projections on a number of different vectors or axes, then on average 1/R of the total squared length (oz.power) appears in any one dimension. Upon correlating with the first signal's code and subtracting a corresponding amount of the code vector, the residual signal has a zero projection along the code vector. Essentially, the signal has been projected onto a plane or subspace of R-1 dimensions, with 1/R of its power lying along the code correlation line having disappeared.
This loss of the total power along the code correlation line is termed the 'correlative loss" of power of the remaining signals which occurs when a first signal is correlated with its own code and that first signal is subtracted from the total or composite signal. If -the signals were all orthogonal, no such loss would occur.
Otherwise, an average loss of 1/R, where the spreading ratio R is essentially the number of chips in the correlation of each remaining signal's power, occurs upon extraction of a prior, demodulated signal. An attempt to demodulate and extract R or more signals, with their respective codes spanning the whole R-dimensional space, would result in all vector components in all dimensions being removed after extraction of the Rth signal. No signal would be left to demodulate. The present invention allows more than R
overlapping signals to be demodulated by reducing the correlation loss.

20'6006 The magnitude of a demodulated signal to be subtracted from the composite signal may be based either on the signal amplitude after correlative despreading of the current information bit or on the signal amplitude of the previous information bit. The previous bit error is based on the values of the other signals that made up the composite signal when the previous bit was demodulated and removed. The present invention estimates the optimum amount of a decoded signal to be subtracted by employing at least l0 several past amplitude measurements in a sequential estimation technique, such as a Kalman filter, which can be adapted to follow the fading pattern of a signal.
In another preferred embodiment of the present invention, signals are evaluated using "intelligent spreading" based on orthogonal or bi-.orthogonal block coding of the information to be transmitted. In orthogonal block coding, a number M of bits to be transmitted are converted to one of 2" available 2"-bit orthogonal codewords. A set of codewords can be constructed as follows:
The trivial case M=1 produces two, 2-bit.. words which is regarded as a 2x2 bit matrix The case for M=2 may be constructed by farming a 4x4 bit matrix M2 by means of the following recursion relation:
M2 - M1 M1 and in general M(itl) - ~ Mi Mi Mi Mi 20'6006 These matrices are known as Walsh-Iiadamard matrices.
Decoding these orthogonal codes involves correlation with all members of the set of code words. The binary index of the codeword giving the highest correlation yields the desired information. For example, if a correlation of 16, 16-bit codewords numbered O to 15 produces the highest correlation on the tenth 16-bit codeword, the underlying signal information is the -4-bit binary word 1010 (10 in binary). Such a code is also termed a [16,4] orthogonal block code and has a spreading ratio R
equal to 16/4 = 4.
If the Waish-Hadamard matrices are augmented using the complementary code words, (all 16 bits are inverted), one further bit of information may be conveyed per codeword.
Thus, 5 bits of information are conveyed by transmitting one of 16 code words or one of their 16 complements, providing a total choice of 32. This type of coding is known as bi-orthogonal coding. For higher spreading ratios, a [128,8] bi-orthogonal block code may be used, having a 16:1 spreading ratio. Indeed, [256,9], [512,10], ......
[32768,16]... etc. bi-orthogonal block codes may be used.
Using modulo-two addition, a scrambling code may be added to the block code to insure that the coding is different for each signal. The scrambling code may even change randomly from block to block. Modulo-2 addition of a scrambling code corresponds, in a Galois field, to applying an axis rotation. The scrambling code may be descrambled by modulo-2 adding the correct scrambling code a second time at the receiver to align the axes once more with the codewords of the Walsh-Hadamard matrix.
A significant feature of the present invention is that simultaneous correlation with all the orthogonal block 20'~G00~

code words in a set may be performed efficiently by means of the Fast Walsh Transform. In the case of a [128,7] code for example, 128 input signal samples are transformed into a 128-point Walsh spectrum in which each point represents the value of the correlation of the composite signal with one codeword. Such a transform process will now be described.
With reference to Fig. 10, a serial signal sample collector 60 takes a number of samples in series from the receiver equal to the number of bits in the coded word, e.g., 128, and stores them in an internal, buffer memory, and converts them to parallel format. A descrambler 62 removes a scrambling code by either inverting a signal sample or not according to the corresponding bit polarity of the scrambling code. The samples are transferred in parallel to the Fast Walsh Transform Block Decoder.64 which generates the Walsh spectrum. In other words, a number of values are generated representing the degree of correlation between the composite signal received and each of the orthogonal code words. The signal whose axes were correctly aligned in the Galois field by the descrambling operation yields one dominant component in the Walsh spectrum whose index and sign convey 7 bits of information. Other components of the spectrum are caused by noise and differently scrambled signals.
A comparison processor 66 determines which correlation has the largest magnitude and sets that signal to zero by opening the corresponding switch 67. In this manner, the demodulated signal is subtracted effectively from the composite signal. The remaining spectrum with one .-.
component removed is processed in an inverse Fast Walsh Transform Block Recoding Circuit 68 and re-scrambled with the same scrambling code in a rescrambler 70 to reconstruct the original 128 signal samples minus the just-decoded 207~~~~
WO 92/11716 PCf/US91/09174 signal. The magnitude of the correlated signal is representative of signal strength and is stored in a sorting processor 69 along with its corresponding scrambling code.
The processor 69 orders the scrambling codes from greatest to weakest correlated signal magnitudes. The code with the greatest magnitude is then transmitted to the descrambler 62 for the next signal demodulation.
The residual, composite signal, with a first decoded signal removed according to the subtractive principle of the invention, is descrambled again using the descrambling code of a second signal to be decoded and submitted to a second Fast Walsh Transform operation for decoding, and so on. As described previously, the order in which signals are decoded and subtracted by the above means is governed by the order of use of the.descrambling codes, which in the preferred embodiment are in descending order of the predicted strengths of their corresponding information signals. This process is repeated a number of times to decode a number of signals.
While only one fast Walsh Transform block-decoder 64 has been shown, two fast Walsh Transform block decoders are in fact used in parallel to process the real and imaginary correlation magnitudes of the descrambled signal.
Accordingly, the comparison processor 66 detects 128 real and 128 imaginary correlations and determines 128 complex correlation magnitudes by calculating the square root of the sum of the squares of the real and imaginary components.
The comparison processor 66 then determines which complex correlation has the greatest magnitude. The real and imaginary components of the selected correlation arm analyzed in the complex plane to determine if the phase is changed, e.g. a phase difference of 180° from the previous time that signal was decoded. Two phase possibilities, for ~o~soQ~

example 0' and 180', allow for one additional bit of information to be transmitted with each 128 code, e.g. in-phase corresponding to a "1" and 180' out-of-phase corresponding to a "0". By taking advantage of this phase difference, biorthogonal coding ji28, 8] is achieved. As will be recognized by those skilled in the art, additional information bits may be transmitted by taking. advantage of smaller phase differences, e.g. 90', 45', etc. As described earlier, a Kalman filtering algorithm may be used to track the real and imaginary components of each correlated signal to extract phase information.
The correlative loss involved in the above-described process is as follows. At each stage, the Walsh spectrum component having the greatest correlation, as determined by the comparator 66, is set to zero, effectively removing the signal just decoded. Thus, on average 1/128 of the power is removed from the composite signal. It is recalled that the spreading ratio is 128/8 = 16. Therefore, the correlative loss is only 1/128 of the total power (0.04dB) per decoded signal, compared to 1/16 of the total power for "dumb spreading" of the same spreading ratio. By the use of block coding or a similar form of intelligent spreading, the subtractive demodulation according to the present invention may be employed to decode and extract from a composite signal a number of information-bearing signals that exceed the bandwidth expansion ratio of the code, without encountering excessive correlative loss.
In the context of mobile radio telephones in cellular systems, different signals originate from different transmission mobile stations or portable radio telephones located at different distances from a base station: As a result, multiple bursts of codewords relating to one signal are not necessarily time-aligned at the receiver. This ~_ 20~000~

disparity in time-alignment may be overcome if after each decoding stage, the residual signals in the composite signal are converted back to a serial stream of samples. Prior to processing a new, next signal, that serial stream of samples is combined with the new signal sample and converted into parallel format using the block timing appropriate to the next signal. These tasks may be performed entirely by appropriate address and data manipulations within a buffer memory included in the digital signal processing block.
to A typical propagation path between mobile radio telephones and a base station receiver consists not only of a shortest, line-of-sight path but also a number of delayed paths or echoes due to reflection from mountains, tall buildings etc. In many dense urban environments, the propagation path may consist only of such echoes. Any direct path, if present, may be too difficult to identify.
If the total delay between propagation paths is small compared to the reciprocal bandwidth of the signal, fading results because of the multiple paths adding sometimes constructively and sometimes destructively. However, the signal may be successfully demodulated by assuming that only a single wave exists. On the other hand, a signal having path delays that are large compared with the reciprocal bandwidth (1/bandwidth in hertz) must be treated as having primary and secondary waves. It is usually possible, however, to express the total signal as the sum of a finite number of paths delayed by multiples of the bit period. Each path may be effected by independent amplitude fading and phase rotation due to fractional bit-period delays. In this situation, the present invention employs a type of a conventional decoder known as a RAKE receiver to integrate information from bit-period delayed paths. The RAKE
receiver correlates the despreading code with the current 2076~~~

signal samples as well as the signal samples delayed by one bit period, the signal samples delayed by two bit periods, etc., and combines the correlation results before determining the information content of the signal.
Delayed versions of the input signal are processed in the Fast Walsh Transform decoder 64 and the Walsh spectra are added before determining the largest Walsh component.
The Walsh spectra may be added either non-coherently, with or without weighting, or coherently with an appropriate relative phase rotation and weighting. In either case, Fast Walsh Transforms are performed on both the real and imaginary vector components of the signal, as described previously, yielding real and imaginary components of the Walsh spectra. In non-coherent addition, only the.magnitude of corresponding complex Walsh spectral components are added and weighted before determining the largest components. In coherent addition, prior knowledge of the relative phase shift between the signal paths is used to phase-align corresponding Walsh components before addition.
Phase-alignment is accomplished by means of a complex multiplication that can simultaneously include an amplitude weighting. If the path phase shift is known by initially transmitting a known signal, for example, that phase shift may be used to rotate corresponding Walsh 'components until they align on a single axis, and the Walsh component having the largest value on this axis is determined. This technique reduces the effect of non-coherent interference signals by 3dB, on average, giving a 2:1 extra capacity increase. Moreover, because only that component (real or imaginary) of the complex Walsh spectrum ascribed to the decoded signal is removed after decoding, the correlative loss experienced by other signals is also reduced. For example, the absolute phase shift of the 2Q7~~~~

signal paths may be tracked by processing_~he actual phase shifts of the Walsh components ascribed to the desired signal in a digital phase tracking loop.
In the same way that energy arising on different signal paths may be utilized by combining the results of multiple despreading correlations, the signals arriving on different antennas may be combined to form a diversity receiving system. If an array of antennas is connected to an array of correlating receivers through a beam-forming l0 network, preference may be given in a particular receiver to signals arising from a particular range of directions. For example, in one of a bank of receivers, a signal S1 from a northerly direction may have the greatest signal strength because~the antenna beam formed to that receiver points north. In a receiver associated with a southerly pointing beam, the strength of the signal Sl is~reduced and a second signal S2 appears greatest. Consequently, the order of demodulation and extraction of signals may differ in two or more receivers and the,same signal may be demodulated at a different point in the signal-strength prioritized sequence and with different remaining interference signals present.
It is clear that the results of such multiple diversity demodulations can be combined in a variety of ways that will be apparent to those skilled in the art in order to obtain further advantages.
While a particular embodiment of the present invention has been described and illustrated, it should be understood that the invention is not limited thereto since modifications may be made by persons skilled in the art.
The present application contemplates any and all modifications that fall within the spirit and scope of the underlying invention disclosed and claimed herein.

Claims (35)

THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising:
transmission means for spreading an information signal with a corresponding spreading code and for transmitting a spread-coded signal, and receiving means for receiving a composite signal of plural, overlapping spread-coded signals, including:
code ordering means for ordering individual spreading codes in an order according to the relative signal strengths of said information signals;
decoding means for recursively decoding said composite signal with a first ordered spreading code received from said code ordering means to generate a series of decoded signals;
recoiling means for successively recoiling said decoded signals using corresponding spreading codes to generate a series of recoiled signals;
signal removal means far successively removing said recoiled signals from said composite signal;
and code selection means for successively selecting a next, ordered code from said code ordering means.
2. The system according to claim 1, wherein said order of relative signal strength is from greatest to weakest strength.
3. The system according to claim 1, wherein said order of information signals is varied depending on changing system conditions.
4. The system according to claim 3, wherein said decoding means repeatedly decodes said composite signal for each variation in said order to determine an actual signal strength order and wherein said decoding means finally decodes said composite signal based on said actual signal strength order.
5. The system according to claim 1, wherein said receiving means includes a memory for storing said composite signal received by said receiver, and said signal removal means includes a subtractor for subtracting said decoded signal from said composite signal stored in said memory.
6. The system according to claim 5, wherein said code ordering means includes:
signal strength detecting means for detecting an actual signal strength of each of said information signals, reordering means for reordering said spreading codes based on said detected signal strengths, and wherein said decoding means retrospectively decodes said composite signal stored in said memory based on ara order of spreading codes received from said reordering means.
7. A system according to claim 1, wherein said transmission means includes modulation means for modulating a radio frequency carrier wave with said spread coded information signal and said receiving means includes demodulation means for demodulating said composite signal and transmitting a demodulated, composite signal to said decoding means.
8. A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising:
a transmitter including:
means for spreading an information signal with a corresponding, spreading code;
a scrambling means for adding a scrambling bit sequence to said spread information; and means for transmitting said scrambled, spread-coded information signal; and receiving means for receiving a composite signal of overlapping, transmitted signals including:
descrambling means for descrambling said composite signal using a scrambling bit sequence: and decoding means for recursively decoding said composite signal by correlating spreading codes to generate a series of decoded signals.
9. The system according to claim 8, said receiving means further comprising:
recoding means for successively recoding said decoded signals using corresponding spreading codes to generate a series of recoiled signals;
rescrambling means for rescrambling said recoded signals using said scrambling bit sequence:

signal removal means for successively removing said rescrambled signals from sand composite signal: and code selection means for successively selecting a next spreading code.
10. The system according to claim 9, wherein said scrambling means and rescrambling means include a modulo-2 adder for adding a scrambling bit sequence to said spread information.
11. The system according to claim 10, wherein said descrambling means adds said modulo-2 scrambling bit sequence to said composite signal to perform said descrambling.
12. A multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, each station comprising:
a transmitter including:
coding means for coding blocks of bit sequences of an information signal, and means for transmitting said block-coded information signal; and receiving means for receiving a composite signal of overlapping, transmitted signals, including:
correlation means for recursively correlating said composite signal with block codes corresponding to said information signals;
comparison means for determining a block code that generates a greatest correlation and for producing a correlated signal;

signal removal means for successively removing said correlated signal from said composite signal:
and inverse correlation means for recoding a residual portion of said correlated, composite signal using said corresponding block codes to generate a series of recoiled signals.
13. The system according to claim 12, wherein said block codes are formed using Walsh-Hadamard matrices.
14. The system according to claim 12, wherein said block codes are orthogonal block codes.
15. The system according to claim 12, wherein said block codes are bi-orthogonal block codes.
16. The system according to claim 12, wherein said transmitter further includes:
scrambling means for adding a scrambling bit sequence to said block-coded information; and said receiving means further includes:
descrambling means for descrambling said composite signal using a selected scrambling code corresponding to one of said information signals; and rescrambling means for rescrambling said residual portion of said composite signal using said selected scrambling code.
11. The system according to claim 16, further comprising:
code selection means for ordering individual scrambling codes according to the relative signal strengths of said information signals and selecting a scrambling code having a greatest signal strength.
18. The system according to claim 12, said receiving means further comprising:
sampling means for generating N samples of said composite signal.
19. The system according to claim 18, wherein said correlation means is a Fast Walsh Transformation circuit for transforming N signal samples into a N-point Walsh spectrum where each point represents a correlation value corresponding to a single one of said block codes.
20. The system according to claim 19, wherein said signal removal means includes means for setting a point with a greatest magnitude to zero,
21. The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a complex number having a greatest magnitude.
22. The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a complex number having a greatest projection on a line at a particular angle and a sign of said projection relative to a particular direction along said line.
23. The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a point having a correlation with a greatest projection on a line at a particular angle and a sign of said projection relative to a particular direction along said line.
24. The system according to claim 20, wherein each point is a complex number having a real and an imaginary vector component and said comparison means includes means for determining a point having a correlation with a greatest real component and a greatest imaginary component.
25. The system according to claim 12, wherein said inverse correlation means is a Fast Walsh Transformation circuit.
26. The system according to claim 12, wherein said correlation means and said inverse correlation means include identical transformation circuits.
27. A system according to claim 12, wherein said receiving means further comprises:
bit shifting means for generating bit-shifted versions of said block codes and means for detecting delayed echos and pre-ethos of said composite signal.
28. A communications system according to claim 27, wherein said correlation means correlates said composite signal correlation with said bit-shifted codes to determine a codeword with a greatest probability of having been transmitted.
29. A system according to claim 28, wherein echos of a previously decoded signal are subtracted from said composite signal.
30. In a multiple access, spread spectrum communications system for communicating information signals between plural stations using code division spread spectrum communications signals, a method comprising:
spreading individual information signals from said stations using a corresponding, pseudo-random spreading code, wherein different information signals from different stations may have a same spreading codes scrambling each said spread-coded information signal using a unique, selected scrambling bit sequence corresponding to one of said stations;
transmitting said scrambled, spread-coded signals from each station;
receiving a composite signal of overlapping, transmitted signals:
descrambling said composite signal using one of said unique scrambling bit sequences to distinguish spread-coded information signals from a selected station from other signals in said composite signal; and recursively decoding said composite signals by correlating selected spreading codes to generate a series of decoded signals.
31. The method of claim 30, further comprising:

selecting a decoded signal having a greatest correlation, said decoded signal corresponding to one of said individual information signals.
32. The method of claim 30, further comprising:
successively recoding said selected decoded signal using said corresponding spreading codes to generate a recoiled signal;
rescrambling said recoiled signal using said selected scrambling bit sequence:
successively removing said rescrambled signal from said composite signal; and selectively selecting a next spreading code.
33. The method of claim 32, wherein said spreading codes are selected in an order from greatest spread-coded signal strength to weakest spread-coded signal strength.
34. The method of claim 30, wherein said spreading codes are orthogonal block codes.
35. The method of claim 32, wherein said decoding corresponds to a Walsh transformation and said recoding corresponds to an inverse Walsh transformation.
CA002076006A 1990-12-17 1991-12-17 Cdma subtractive demodulation Expired - Lifetime CA2076006C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US628,359 1984-07-06
US07/628,359 US5151919A (en) 1990-12-17 1990-12-17 Cdma subtractive demodulation
PCT/US1991/009174 WO1992011716A1 (en) 1990-12-17 1991-12-17 Cdma subtractive demodulation

Publications (2)

Publication Number Publication Date
CA2076006A1 CA2076006A1 (en) 1992-06-18
CA2076006C true CA2076006C (en) 2001-08-07

Family

ID=24518547

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002076006A Expired - Lifetime CA2076006C (en) 1990-12-17 1991-12-17 Cdma subtractive demodulation

Country Status (19)

Country Link
US (1) US5151919A (en)
EP (1) EP0491668B1 (en)
JP (1) JP3081642B2 (en)
AT (1) ATE163336T1 (en)
AU (1) AU645646B2 (en)
BR (1) BR9106226A (en)
CA (1) CA2076006C (en)
DE (1) DE69128927T2 (en)
DK (1) DK0491668T3 (en)
ES (1) ES2113876T3 (en)
FI (1) FI108589B (en)
GR (1) GR3026244T3 (en)
HK (1) HK1009366A1 (en)
MX (1) MX9102562A (en)
MY (1) MY107860A (en)
RU (1) RU2104615C1 (en)
SG (1) SG49656A1 (en)
UA (1) UA41256C2 (en)
WO (1) WO1992011716A1 (en)

Families Citing this family (214)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5218619A (en) * 1990-12-17 1993-06-08 Ericsson Ge Mobile Communications Holding, Inc. CDMA subtractive demodulation
US5258995A (en) * 1991-11-08 1993-11-02 Teknekron Communications Systems, Inc. Wireless communication system
US5282222A (en) * 1992-03-31 1994-01-25 Michel Fattouche Method and apparatus for multiple access between transceivers in wireless communications using OFDM spread spectrum
USRE37802E1 (en) 1992-03-31 2002-07-23 Wi-Lan Inc. Multicode direct sequence spread spectrum
US5550809A (en) * 1992-04-10 1996-08-27 Ericsson Ge Mobile Communications, Inc. Multiple access coding using bent sequences for mobile radio communications
US5353352A (en) * 1992-04-10 1994-10-04 Ericsson Ge Mobile Communications Inc. Multiple access coding for radio communications
SG50659A1 (en) * 1992-04-10 1998-07-20 Ericsson Ge Mobile Inc Random access in mobile telephone system
US5295153A (en) * 1992-04-13 1994-03-15 Telefonaktiebolaget L M Ericsson CDMA frequency allocation
TW214620B (en) * 1992-04-13 1993-10-11 Ericsson Ge Mobile Communicat Calling channel in CDMA communications system
EP0917308A1 (en) * 1992-04-17 1999-05-19 TELEFONAKTIEBOLAGET L M ERICSSON (publ) Mobile assisted handover using CDMA
US5579338A (en) * 1992-06-29 1996-11-26 Mitsubishi Denki Kabushiki Kaisha Spread spectrum receiver using partial correlations
US5341395A (en) * 1992-11-24 1994-08-23 At&T Bell Laboratories Data recovery technique for asynchronous CDMA systems
US5345468A (en) * 1992-12-16 1994-09-06 At&T Bell Laboratories Despreading technique for CDMA systems
JP3143247B2 (en) * 1993-01-11 2001-03-07 沖電気工業株式会社 Code division multiple access demodulator
US5323418A (en) * 1993-01-13 1994-06-21 Motorola, Inc. Code division multiple access (CDMA) inbound messaging system utilizing interference cancellation to recover inbound messages
US5553062A (en) * 1993-04-22 1996-09-03 Interdigital Communication Corporation Spread spectrum CDMA interference canceler system and method
US5363403A (en) * 1993-04-22 1994-11-08 Interdigital Technology Corporation Spread spectrum CDMA subtractive interference canceler and method
US5305349A (en) * 1993-04-29 1994-04-19 Ericsson Ge Mobile Communications Inc. Quantized coherent rake receiver
US5351016A (en) * 1993-05-28 1994-09-27 Ericsson Ge Mobile Communications Inc. Adaptively self-correcting modulation system and method
FI932605A (en) * 1993-06-07 1994-12-08 Nokia Telecommunications Oy Receiver device for base station
JP3296822B2 (en) * 1993-06-14 2002-07-02 テレフオンアクチーボラゲツト エル エム エリクソン Time alignment of transmission in downlink of CDMA system
TW306102B (en) * 1993-06-14 1997-05-21 Ericsson Telefon Ab L M
US5404374A (en) * 1993-07-12 1995-04-04 Apple Computer, Inc. Method and apparatus for transmitting and receiving encoded data using multiple frequency coding
US5404376A (en) * 1993-09-09 1995-04-04 Ericsson-Ge Mobile Communications Inc. Navigation assistance for call handling in mobile telephone systems
US5442660A (en) * 1994-01-10 1995-08-15 Industrial Technology Research Institute Frequency hopping sequence using galois field
US5708971A (en) * 1994-01-11 1998-01-13 Ericsson Inc. Two-way paging system and apparatus
US6195555B1 (en) 1994-01-11 2001-02-27 Ericsson Inc. Method of directing a call to a mobile telephone in a dual mode cellular satellite communication network
US5907809A (en) * 1994-01-11 1999-05-25 Ericsson Inc. Position determination using multiple base station signals
EP0662758B1 (en) 1994-01-11 2000-11-29 Ericsson Inc. Position registration for cellular satellite communication systems
US6868270B2 (en) 1994-01-11 2005-03-15 Telefonaktiebolaget L.M. Ericsson Dual-mode methods, systems, and terminals providing reduced mobile terminal registrations
US5454009A (en) * 1994-01-13 1995-09-26 Scientific-Atlanta, Inc. Method and apparatus for providing energy dispersal using frequency diversity in a satellite communications system
SG52170A1 (en) 1994-02-17 1998-09-28 Micrilor Inc A high-data-rate wireless local-area network
KR950035142A (en) * 1994-03-10 1995-12-30 가나미야지 준 Receiver, Base Station Receiver and Mobile Station Receiver
US6463406B1 (en) * 1994-03-25 2002-10-08 Texas Instruments Incorporated Fractional pitch method
ES2118050B1 (en) * 1994-06-06 1999-04-16 Ericsson Ge Mobile Inc SELF-ADJUSTABLE MODULATOR AND SELF-ADJUSTABLE MODULATION METHOD
US5537397A (en) * 1994-06-07 1996-07-16 Aloha Networks, Inc. Spread aloha CDMA data communications
FI943196A (en) * 1994-07-04 1996-01-05 Nokia Telecommunications Oy Reception procedure and recipients
WO1996005706A1 (en) * 1994-08-15 1996-02-22 Ken Bailey Cellular telephone credit card billing system
FI110731B (en) * 1994-09-12 2003-03-14 Nokia Corp Procedure for estimating a channel and receiver
FI944739A (en) * 1994-10-07 1996-04-08 Nokia Telecommunications Oy Interference cancellation method and receiver
US5568473A (en) * 1994-12-08 1996-10-22 Comsat Corporation Method and apparatus for simple and efficient interference cancellation for chip synchronized CDMA
AU706242B2 (en) * 1994-12-12 1999-06-10 Ericsson Inc. Diversity-oriented channel allocation in a mobile communications system
US5604806A (en) * 1995-01-20 1997-02-18 Ericsson Inc. Apparatus and method for secure radio communication
KR0152366B1 (en) * 1995-03-07 1998-11-02 김주용 Vocoder
KR100212306B1 (en) * 1995-06-13 1999-08-02 다치카와 게이지 Cdma demodulating apparatus
US5745485A (en) * 1995-06-19 1998-04-28 Aloha Networks, Inc. Dual code multiple access for wireless data networks
ZA965340B (en) 1995-06-30 1997-01-27 Interdigital Tech Corp Code division multiple access (cdma) communication system
US5615209A (en) * 1995-07-26 1997-03-25 Ericsson Inc. Method and apparatus for CDMA signal orthogonalization
US5978413A (en) * 1995-08-28 1999-11-02 Bender; Paul E. Method and system for processing a plurality of multiple access transmissions
US5909460A (en) * 1995-12-07 1999-06-01 Ericsson, Inc. Efficient apparatus for simultaneous modulation and digital beamforming for an antenna array
US5862173A (en) * 1995-12-11 1999-01-19 Ericsson Inc. Re-orthogonalization of wideband CDMA signals
JP3476987B2 (en) * 1996-01-12 2003-12-10 株式会社日立国際電気 Multi-user demodulation method and apparatus
JP3269959B2 (en) * 1996-01-16 2002-04-02 株式会社日立国際電気 Correlation filter and CDMA receiver
JP3780551B2 (en) 1996-01-29 2006-05-31 ソニー株式会社 Signal transmission method and apparatus by multiple access
US5751762A (en) * 1996-02-15 1998-05-12 Ericsson Inc. Multichannel receiver using analysis by synthesis
US5790549A (en) * 1996-02-29 1998-08-04 Ericsson Inc. Subtractive multicarrier CDMA access methods and systems
US5894473A (en) * 1996-02-29 1999-04-13 Ericsson Inc. Multiple access communications system and method using code and time division
US6233272B1 (en) * 1996-03-19 2001-05-15 Yrp Mobile Telecommunications Key Technology Research Laboratories Co., Ltd. Spread spectrum communication receiver
US5764646A (en) * 1996-04-02 1998-06-09 Ericsson Inc. Packet data transmission with clash subtraction
US6134215A (en) * 1996-04-02 2000-10-17 Qualcomm Incorpoated Using orthogonal waveforms to enable multiple transmitters to share a single CDM channel
US5745578A (en) * 1996-06-17 1998-04-28 Ericsson Inc. Apparatus and method for secure communication based on channel characteristics
US6067446A (en) * 1996-07-11 2000-05-23 Telefonaktiebolaget Lm Ericsson Power presetting in a radio communication system
JP3323067B2 (en) 1996-07-12 2002-09-09 沖電気工業株式会社 CDMA receiver
US6452958B1 (en) 1996-07-30 2002-09-17 Agere Systems Guardian Corp Digital modulation system using extended code set
US5862182A (en) * 1996-07-30 1999-01-19 Lucent Technologies Inc. OFDM digital communications system using complementary codes
US6404732B1 (en) 1996-07-30 2002-06-11 Agere Systems Guardian Corp. Digital modulation system using modified orthogonal codes to reduce autocorrelation
US6813261B1 (en) 1996-08-07 2004-11-02 Hitachi, Ltd. Method of mobile communication and apparatus therefor
JP3220644B2 (en) * 1996-08-07 2001-10-22 株式会社日立製作所 Mobile communication method and device for implementing the method
US6430216B1 (en) 1997-08-22 2002-08-06 Data Fusion Corporation Rake receiver for spread spectrum signal demodulation
GB2331436B (en) * 1996-08-23 2001-01-10 Data Fusion Corp Rake receiver for spread spectrum signal demodulation
US5831977A (en) * 1996-09-04 1998-11-03 Ericsson Inc. Subtractive CDMA system with simultaneous subtraction in code space and direction-of-arrival space
FI102577B1 (en) 1996-09-05 1998-12-31 Nokia Telecommunications Oy Transmission and reception procedure and radio system
US5768307A (en) * 1996-09-13 1998-06-16 Telefonaktiebolaget Lm Ericsson Coherent demodulation with decision-directed channel estimation for digital communication
CA2185847A1 (en) * 1996-09-18 1998-03-19 Jean-Paul Chaib Method and apparatus for encoding and decoding digital signals
US6192068B1 (en) 1996-10-03 2001-02-20 Wi-Lan Inc. Multicode spread spectrum communications system
US5903550A (en) * 1997-01-02 1999-05-11 Motorola, Inc. Method and system for parallel demodulation of multiple chips of a CDMA signal
JP3006679B2 (en) 1997-01-16 2000-02-07 日本電気株式会社 Cellular mobile phone system
US6052599A (en) * 1997-01-30 2000-04-18 At & T Corp. Cellular communication system with multiple same frequency broadcasts in a cell
FI102866B (en) 1997-04-09 1999-02-26 Nokia Telecommunications Oy Reduction of interference in the mobile communication system
US6151313A (en) * 1997-06-06 2000-11-21 Aloha Networks, Inc. Baseband phase estimation technique for demodulation of overlapping packets
US6215762B1 (en) 1997-07-22 2001-04-10 Ericsson Inc. Communication system and method with orthogonal block encoding
US6925127B1 (en) 1997-07-22 2005-08-02 Ericsson Inc. Method and apparatus for subtracting multiple rays of multiple interfering received signals
WO1999009650A1 (en) 1997-08-21 1999-02-25 Data Fusion Corporation Method and apparatus for acquiring wide-band pseudorandom noise encoded waveforms
FR2770058B1 (en) * 1997-10-22 1999-11-19 Commissariat Energie Atomique METHOD FOR PROCESSING AN INFORMATION TRANSMISSION SIGNAL BY SPECTRUM SPREAD AND CORRESPONDING RECEIVER
FR2770060B1 (en) * 1997-10-22 1999-11-19 Commissariat Energie Atomique DIFFERENTIAL DIRECT SEQUENCE SPREAD SPECTRUM RECEIVER WITH MIXED INTERFERENCE SIGNAL FORMATION MEANS
FR2770059B1 (en) * 1997-10-22 1999-11-19 Commissariat Energie Atomique CIRCUIT FOR SPREAD SPECTRUM DIGITAL TRANSMISSION BY DIRECT SEQUENCE WITH GENERATION OF AN INTERFERENCE SIGNAL
US6134261A (en) * 1998-03-05 2000-10-17 At&T Wireless Svcs. Inc FDD forward link beamforming method for a FDD communications system
US6643281B1 (en) 1998-03-05 2003-11-04 At&T Wireless Services, Inc. Synchronization preamble method for OFDM waveforms in a communications system
SE517271C2 (en) 1998-03-20 2002-05-21 Ericsson Telefon Ab L M Method in radio communication system and communication device for carrying out the method
US6317466B1 (en) 1998-04-15 2001-11-13 Lucent Technologies Inc. Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver
US6625204B1 (en) 1998-04-24 2003-09-23 Aloha Networks, Inc. Synchronization and bit detection in a single spreading sequence SAMA receiver
US6724741B1 (en) 1998-06-29 2004-04-20 L-3 Communications Corporation PN code selection for synchronous CDMA
US6091760A (en) * 1998-06-29 2000-07-18 L-3 Communications Corporation Non-recursively generated orthogonal PN codes for variable rate CDMA
US6947473B1 (en) * 1998-08-28 2005-09-20 Siemens Ag Receiver and method of recovering data from radio signals
GB2341757B (en) * 1998-09-21 2003-07-02 Fujitsu Ltd Code-division multiple access mobile comunications networks
US6426978B1 (en) 1998-10-01 2002-07-30 Ericsson Inc. Digital communication systems and methods for differential and/or amplitude encoding and decoding secondary symbols
EP0994575A1 (en) * 1998-10-12 2000-04-19 Hewlett-Packard Company Extraction of primary and co-channel signals using propagation path metrics
EP0996234B1 (en) * 1998-10-23 2006-06-28 Sony Deutschland GmbH Receiver architecture for a multi scrambling code transmission CDMA technique
EP1125369B1 (en) * 1998-10-27 2004-03-24 Roke Manor Research Limited Method and apparatus for improved signal extraction in cdma systems
US6567475B1 (en) 1998-12-29 2003-05-20 Ericsson Inc. Method and system for the transmission, reception and processing of 4-level and 8-level signaling symbols
US6507602B1 (en) 1999-01-07 2003-01-14 Ericsson, Inc. Smoothing receiver channel estimates using spectral estimation
US6556634B1 (en) 1999-02-10 2003-04-29 Ericsson, Inc. Maximum likelihood rake receiver for use in a code division, multiple access wireless communication system
US7952511B1 (en) 1999-04-07 2011-05-31 Geer James L Method and apparatus for the detection of objects using electromagnetic wave attenuation patterns
US6442154B1 (en) 1999-04-15 2002-08-27 Ericsson Inc. Method and apparatus for successive cancellation using multiple signal timings
US6574235B1 (en) * 1999-08-12 2003-06-03 Ericsson Inc. Methods of receiving co-channel signals by channel separation and successive cancellation and related receivers
CA2385082C (en) * 1999-09-21 2008-04-08 Interdigital Technology Corporation Multiuser detector for variable spreading factors
US6714527B2 (en) * 1999-09-21 2004-03-30 Interdigital Techology Corporation Multiuser detector for variable spreading factors
US6430391B1 (en) * 1999-11-29 2002-08-06 Ericsson Inc. Duplex satellite communication using a single frequency or pair
DE19958383A1 (en) 1999-12-03 2001-06-07 Bosch Gmbh Robert Method for regulating the transmission power of a transmitting station and receiving station for carrying out the method
FR2806158B1 (en) * 2000-03-07 2002-05-17 Commissariat Energie Atomique METHOD FOR DETERMINING THE POSITION OR ORIENTATION OF AN OBJECT USING A MAGNETIC FIELD AND CORRESPONDING DEVICE
US6952454B1 (en) 2000-03-22 2005-10-04 Qualcomm, Incorporated Multiplexing of real time services and non-real time services for OFDM systems
DE10026615B4 (en) * 2000-05-19 2004-12-23 Systemonic Ag Method and arrangement for receiving CDMA signals
US7120657B2 (en) * 2000-08-29 2006-10-10 Science Applications International Corporation System and method for adaptive filtering
US7443826B1 (en) 2000-10-04 2008-10-28 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for automatic frequency control in a CDMA receiver
DE60122353D1 (en) * 2000-10-06 2006-09-28 Ericsson Inc METHOD AND DEVICE FOR SUBTRACTING MULTIPLE PATHS OF RECEIVED INTERFERENCE SIGNALS
US6934317B1 (en) 2000-10-11 2005-08-23 Ericsson Inc. Systems and methods for communicating spread spectrum signals using variable signal constellations
AU2002211881A1 (en) * 2000-10-13 2002-04-22 Science Applications International Corporation System and method for linear prediction
US7035354B2 (en) * 2000-12-08 2006-04-25 International Business Machine Corporation CDMA multi-user detection with a real symbol constellation
US7423987B2 (en) 2001-04-27 2008-09-09 The Directv Group, Inc. Feeder link configurations to support layered modulation for digital signals
US7471735B2 (en) 2001-04-27 2008-12-30 The Directv Group, Inc. Maximizing power and spectral efficiencies for layered and conventional modulations
US8005035B2 (en) 2001-04-27 2011-08-23 The Directv Group, Inc. Online output multiplexer filter measurement
US7583728B2 (en) 2002-10-25 2009-09-01 The Directv Group, Inc. Equalizers for layered modulated and other signals
US7440489B2 (en) * 2001-08-07 2008-10-21 Ericsson Inc. Method and apparatus for selective demodulation and decoding of communications signals
WO2003023444A1 (en) 2001-09-12 2003-03-20 Data Fusion Corporation Gps near-far resistant receiver
US7158559B2 (en) * 2002-01-15 2007-01-02 Tensor Comm, Inc. Serial cancellation receiver design for a coded signal processing engine
US8085889B1 (en) 2005-04-11 2011-12-27 Rambus Inc. Methods for managing alignment and latency in interference cancellation
US7218906B2 (en) * 2001-10-04 2007-05-15 Wisconsin Alumni Research Foundation Layered space time processing in a multiple antenna system
US7430253B2 (en) * 2002-10-15 2008-09-30 Tensorcomm, Inc Method and apparatus for interference suppression with efficient matrix inversion in a DS-CDMA system
US7260506B2 (en) * 2001-11-19 2007-08-21 Tensorcomm, Inc. Orthogonalization and directional filtering
US20030128777A1 (en) * 2001-12-04 2003-07-10 Linsky Stuart T. Decision directed phase locked loops (DD-PLL) with multiple initial phase and/or frequency estimates in digital communication systems
US7164734B2 (en) * 2001-12-04 2007-01-16 Northrop Grumman Corporation Decision directed phase locked loops (DD-PLL) with excess processing power in digital communication systems
US20030123595A1 (en) * 2001-12-04 2003-07-03 Linsky Stuart T. Multi-pass phase tracking loop with rewind of future waveform in digital communication systems
JP2005518720A (en) * 2002-02-20 2005-06-23 エクストリームスペクトラム,インコーポレイテッド M-ary orthogonal coded communication method and system
US8082286B1 (en) 2002-04-22 2011-12-20 Science Applications International Corporation Method and system for soft-weighting a reiterative adaptive signal processor
ES2604453T3 (en) 2002-07-03 2017-03-07 The Directv Group, Inc. Method and apparatus for layered modulation
US7463609B2 (en) * 2005-07-29 2008-12-09 Tensorcomm, Inc Interference cancellation within wireless transceivers
US7876810B2 (en) 2005-04-07 2011-01-25 Rambus Inc. Soft weighted interference cancellation for CDMA systems
US7787572B2 (en) 2005-04-07 2010-08-31 Rambus Inc. Advanced signal processors for interference cancellation in baseband receivers
US7808937B2 (en) 2005-04-07 2010-10-05 Rambus, Inc. Variable interference cancellation technology for CDMA systems
US20050180364A1 (en) * 2002-09-20 2005-08-18 Vijay Nagarajan Construction of projection operators for interference cancellation
US7577186B2 (en) * 2002-09-20 2009-08-18 Tensorcomm, Inc Interference matrix construction
US8761321B2 (en) 2005-04-07 2014-06-24 Iii Holdings 1, Llc Optimal feedback weighting for soft-decision cancellers
JP4444832B2 (en) * 2002-09-23 2010-03-31 テンソルコム インコーポレイテッド Method and apparatus for selectively utilizing interference cancellation in a spread spectrum system
US8005128B1 (en) 2003-09-23 2011-08-23 Rambus Inc. Methods for estimation and interference cancellation for signal processing
US8179946B2 (en) 2003-09-23 2012-05-15 Rambus Inc. Systems and methods for control of advanced receivers
US20050123080A1 (en) * 2002-11-15 2005-06-09 Narayan Anand P. Systems and methods for serial cancellation
US7653028B2 (en) * 2002-10-03 2010-01-26 Qualcomm Incorporated Scheduling techniques for a packet-access network
AU2003282942A1 (en) * 2002-10-15 2004-05-04 Tensorcomm Inc. Method and apparatus for channel amplitude estimation and interference vector construction
CA2503530C (en) 2002-10-25 2009-12-22 The Directv Group, Inc. Lower complexity layered modulation signal processor
WO2004040779A2 (en) 2002-10-25 2004-05-13 Science Applications International Corporation Adaptive filtering in the presence of multipath
WO2004073159A2 (en) * 2002-11-15 2004-08-26 Tensorcomm, Incorporated Systems and methods for parallel signal cancellation
GB0320993D0 (en) * 2003-09-09 2003-10-08 Koninkl Philips Electronics Nv A method of acquiring a received spread spectrum signal
US20050059406A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Wireless LAN measurement feedback
US20050059405A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Simulation driven wireless LAN planning
JP2005130256A (en) * 2003-10-24 2005-05-19 Ntt Docomo Inc Mobile station apparatus, base station apparatus, radio communications system, and radio communication method
US7461313B2 (en) * 2003-12-30 2008-12-02 Qualcomm Incorporated Test pattern generation
US20050169354A1 (en) * 2004-01-23 2005-08-04 Olson Eric S. Systems and methods for searching interference canceled data
US7477710B2 (en) * 2004-01-23 2009-01-13 Tensorcomm, Inc Systems and methods for analog to digital conversion with a signal cancellation system of a receiver
US7221927B2 (en) * 2004-02-13 2007-05-22 Trapeze Networks, Inc. Station mobility between access points
EP1763933B1 (en) * 2004-07-06 2018-03-14 Telefonaktiebolaget LM Ericsson (publ) Different orthogonal code sets with members in common
US8243864B2 (en) * 2004-11-19 2012-08-14 Qualcomm, Incorporated Noise reduction filtering in a wireless communication system
SE0402963D0 (en) * 2004-12-03 2004-12-03 Ericsson Telefon Ab L M Method and apparatus for allocating radio resources in a mobile radio network
EP1829309B1 (en) * 2004-12-13 2008-08-20 Koninklijke Philips Electronics N.V. Reception of a signal transmitted over a transmission link comprising coded channels
DE102005006893B4 (en) * 2005-02-15 2011-11-24 Siemens Ag Radio station and method for transmitting data
GB2438347B8 (en) * 2005-02-25 2009-04-08 Data Fusion Corp Mitigating interference in a signal
EP1867094A2 (en) 2005-03-15 2007-12-19 Trapeze Networks, Inc. System and method for distributing keys in a wireless network
US7826516B2 (en) 2005-11-15 2010-11-02 Rambus Inc. Iterative interference canceller for wireless multiple-access systems with multiple receive antennas
KR100724949B1 (en) 2005-05-03 2007-06-04 삼성전자주식회사 Method and Apparatus for multiplexing data and control information in wireless communication systems based on frequency division multiple access
KR100713356B1 (en) * 2005-05-06 2007-05-04 삼성전자주식회사 Apparatus and method for receving data in mobile communication system
US7724703B2 (en) 2005-10-13 2010-05-25 Belden, Inc. System and method for wireless network monitoring
US8638762B2 (en) 2005-10-13 2014-01-28 Trapeze Networks, Inc. System and method for network integrity
US7551619B2 (en) 2005-10-13 2009-06-23 Trapeze Networks, Inc. Identity-based networking
US7573859B2 (en) 2005-10-13 2009-08-11 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
WO2007044986A2 (en) 2005-10-13 2007-04-19 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US20070106778A1 (en) * 2005-10-27 2007-05-10 Zeldin Paul E Information and status and statistics messaging method and system for inter-process communication
US8250587B2 (en) 2005-10-27 2012-08-21 Trapeze Networks, Inc. Non-persistent and persistent information setting method and system for inter-process communication
ATE451757T1 (en) 2005-10-28 2009-12-15 Nokia Siemens Networks Gmbh METHOD AND TELECOMMUNICATIONS DEVICE FOR SELECTING A NUMBER OF CODE CHANNELS AND AN ASSOCIATED SPREADING FACTOR FOR CDMA TRANSMISSION
WO2007088752A1 (en) * 2006-02-01 2007-08-09 Sharp Kabushiki Kaisha Signal separating device, communication device and signal separating method
US7558266B2 (en) 2006-05-03 2009-07-07 Trapeze Networks, Inc. System and method for restricting network access using forwarding databases
US8966018B2 (en) 2006-05-19 2015-02-24 Trapeze Networks, Inc. Automated network device configuration and network deployment
US7577453B2 (en) 2006-06-01 2009-08-18 Trapeze Networks, Inc. Wireless load balancing across bands
US8818322B2 (en) 2006-06-09 2014-08-26 Trapeze Networks, Inc. Untethered access point mesh system and method
US7912982B2 (en) 2006-06-09 2011-03-22 Trapeze Networks, Inc. Wireless routing selection system and method
US9258702B2 (en) 2006-06-09 2016-02-09 Trapeze Networks, Inc. AP-local dynamic switching
US9191799B2 (en) 2006-06-09 2015-11-17 Juniper Networks, Inc. Sharing data between wireless switches system and method
US7844298B2 (en) 2006-06-12 2010-11-30 Belden Inc. Tuned directional antennas
US7724704B2 (en) 2006-07-17 2010-05-25 Beiden Inc. Wireless VLAN system and method
US8400998B2 (en) 2006-08-23 2013-03-19 Motorola Mobility Llc Downlink control channel signaling in wireless communication systems
US8340110B2 (en) 2006-09-15 2012-12-25 Trapeze Networks, Inc. Quality of service provisioning for wireless networks
US20080084853A1 (en) 2006-10-04 2008-04-10 Motorola, Inc. Radio resource assignment in control channel in wireless communication systems
US8072952B2 (en) 2006-10-16 2011-12-06 Juniper Networks, Inc. Load balancing
CN101536570B (en) 2006-11-03 2016-08-03 谷歌技术控股有限责任公司 Scheduling remote units in a wireless communication system
US7873061B2 (en) 2006-12-28 2011-01-18 Trapeze Networks, Inc. System and method for aggregation and queuing in a wireless network
US7865713B2 (en) 2006-12-28 2011-01-04 Trapeze Networks, Inc. Application-aware wireless network system and method
CA2692339C (en) * 2007-06-29 2013-03-26 Lg Electronics Inc. Broadcast receiving system and method for processing broadcast signals
KR20090001402A (en) * 2007-06-29 2009-01-08 엘지전자 주식회사 Telematics terminal capable of receiving broadcast and method of processing broadcast signal
US8902904B2 (en) 2007-09-07 2014-12-02 Trapeze Networks, Inc. Network assignment based on priority
US8509128B2 (en) 2007-09-18 2013-08-13 Trapeze Networks, Inc. High level instruction convergence function
US8238942B2 (en) 2007-11-21 2012-08-07 Trapeze Networks, Inc. Wireless station location detection
DE102007062333B3 (en) * 2007-12-21 2009-04-30 Robert Bosch Gmbh Method for transmitting multiturn modulo master axis data
FR2927748B1 (en) * 2008-02-19 2015-10-16 Thales Sa METHOD OF PROCESSING A FIRST AND A SECOND SIGNAL OVERLOADED WITHIN A INCIDENT COMPOSITE SIGNAL, AND CORRESPONDING DEVICE
US8150357B2 (en) 2008-03-28 2012-04-03 Trapeze Networks, Inc. Smoothing filter for irregular update intervals
US7929593B2 (en) * 2008-04-15 2011-04-19 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for successive interference subtraction with covariance root processing
US8474023B2 (en) 2008-05-30 2013-06-25 Juniper Networks, Inc. Proactive credential caching
US8978105B2 (en) 2008-07-25 2015-03-10 Trapeze Networks, Inc. Affirming network relationships and resource access via related networks
US8238298B2 (en) 2008-08-29 2012-08-07 Trapeze Networks, Inc. Picking an optimal channel for an access point in a wireless network
US9571142B2 (en) * 2008-10-24 2017-02-14 Anritsu Company Apparatus to detect interference in wireless signals
EP2348661B1 (en) * 2008-11-14 2020-02-26 Sun Patent Trust Wireless communication terminal apparatus, and cluster constellation setting method
KR101498066B1 (en) * 2009-04-14 2015-03-03 엘지전자 주식회사 Method of transmitting receiving a data in a wireless communication system
US8331495B2 (en) * 2009-08-17 2012-12-11 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for an improved wireless communication receiver
GB2487904B (en) * 2011-02-04 2019-05-08 Qualcomm Technologies Int Ltd Coherent interference detection
RU2660629C1 (en) * 2017-06-22 2018-07-06 Закрытое акционерное общество Научно-технический центр "Модуль" Method of quick decoding of signal information elements
USD905059S1 (en) 2018-07-25 2020-12-15 Square, Inc. Card reader device
RU2693272C1 (en) * 2018-12-18 2019-07-02 Открытое акционерное общество Омское производственное объединение "Радиозавод им. А.С. Попова" (РЕЛЕРО) Device for high-order quadrature amplitude shift keying signal demodulator recovery

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4134071A (en) * 1971-07-19 1979-01-09 Licentia Patent-Verwaltungs-G.M.B.H. SSMA Data transmission system
US4293953A (en) * 1979-12-28 1981-10-06 The United States Of America As Represented By The Secretary Of The Army Bi-orthogonal PCM communications system employing multiplexed noise codes
US4644560A (en) * 1982-08-13 1987-02-17 Hazeltine Corporation Intranetwork code division multiple access communication system
US4901307A (en) * 1986-10-17 1990-02-13 Qualcomm, Inc. Spread spectrum multiple access communication system using satellite or terrestrial repeaters
SU1605254A1 (en) * 1988-07-07 1990-11-07 Институт кибернетики им.В.М.Глушкова Device for performing fast walsh-adamar transform
CH676179A5 (en) * 1988-09-29 1990-12-14 Ascom Zelcom Ag
US4930140A (en) * 1989-01-13 1990-05-29 Agilis Corporation Code division multiplex system using selectable length spreading code sequences
US4930139A (en) * 1989-05-31 1990-05-29 O'neill Communications, Inc. Spread spectrum communication system
US5022049A (en) * 1989-11-21 1991-06-04 Unisys Corp. Multiple access code acquisition system

Also Published As

Publication number Publication date
AU645646B2 (en) 1994-01-20
FI923678A0 (en) 1992-08-17
RU2104615C1 (en) 1998-02-10
DK0491668T3 (en) 1998-09-23
ES2113876T3 (en) 1998-05-16
FI108589B (en) 2002-02-15
GR3026244T3 (en) 1998-05-29
WO1992011716A1 (en) 1992-07-09
JPH05507397A (en) 1993-10-21
EP0491668A2 (en) 1992-06-24
MY107860A (en) 1996-06-29
JP3081642B2 (en) 2000-08-28
US5151919A (en) 1992-09-29
BR9106226A (en) 1993-03-30
AU9136691A (en) 1992-07-22
CA2076006A1 (en) 1992-06-18
HK1009366A1 (en) 1999-05-28
DE69128927D1 (en) 1998-03-26
EP0491668A3 (en) 1992-12-30
FI923678A (en) 1992-08-17
EP0491668B1 (en) 1998-02-18
ATE163336T1 (en) 1998-03-15
DE69128927T2 (en) 1998-06-04
SG49656A1 (en) 1998-06-15
UA41256C2 (en) 2001-09-17
MX9102562A (en) 1992-06-01

Similar Documents

Publication Publication Date Title
CA2076006C (en) Cdma subtractive demodulation
US5218619A (en) CDMA subtractive demodulation
US5237586A (en) Rake receiver with selective ray combining
JP3786422B2 (en) Method and apparatus for identifying encoded communication signals
US5978413A (en) Method and system for processing a plurality of multiple access transmissions
US5987076A (en) Coherent signal processing for CDMA communication system
US5881058A (en) Method for performing a signal search in a wireless communication system
AU710354B2 (en) Method and apparatus for spread-spectrum channel estimation
CA2239232C (en) Re-orthogonalization of wideband cdma signals
WO1998057452A1 (en) Method and apparatus for canceling signals in a spread-spectrum communication system
JP2003510883A (en) Interference cancellation method and apparatus using complex interference orthogonal technology
Ewerbring et al. CDMA with interference cancellation: A technique for high capacity wireless systems
WO1996027251A1 (en) Method and receiver for demodulating a received signal
Huang et al. DS-CDMA with power control error using weighted despreading sequences over a multipath Rayleigh fading channel

Legal Events

Date Code Title Description
EEER Examination request
MKEX Expiry
MKEX Expiry

Effective date: 20111217