Systems and methods for parallel signal cancellation

Information

  • Patent Grant
  • 9544044
  • Patent Number
    9,544,044
  • Date Filed
    Monday, December 13, 2010
    13 years ago
  • Date Issued
    Tuesday, January 10, 2017
    7 years ago
Abstract
The present invention provides systems and methods for parallel interference suppression. In one embodiment of the invention, a processing engine is used to substantially cancel a plurality of interfering signals within a received signal. The processing engine includes a plurality of matrix generators that are used to generate matrices, each matrix comprising elements of a unique interfering signal selected for cancellation. The processing engine also includes one or more processors that use the matrices to generate cancellation operators. A plurality of applicators applies the cancellation operators to parallel but not necessarily unique input signals to substantially cancel the interfering signals from the input signals. These input signals may include received signals, interference cancelled signals and/or PN codes.
Description
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. patent application Ser. No. 12/871,776, entitled “Advanced Signal Processors for Interference Cancellation in Baseband Receivers,” and filed Aug. 30, 2010; which claims priority to U.S. patent application Ser. No. 11/204,606, entitled “Advanced Signal Processors for Interference Cancellation in Baseband Receivers,” filed Aug. 15, 2005, and issued as U.S. Pat. No. 7,787,572; which claims priority to (1) U.S. patent application Ser. No. 11/192,763, entitled “Interference Cancellation Within Wireless Transceivers,” filed Jul. 29, 2005, and issued as U.S. Pat. No. 7,463,609 and (2) U.S. patent application Ser. No. 11/100,935, entitled “Construction of Projection Operators for Interference Cancellation,” filed Apr. 7, 2005, and published as U.S. Patent Application Publication Number 2005-0180364 A1, which claims priority to (a) U.S. patent application Ser. No. 10/773,777, entitled “Systems and Methods for Parallel Signal Cancellation,” filed Feb. 6, 2004, and issued as U.S. Pat. No. 7,394,879, which is a continuation-in-part of U.S. application Ser. No. 10/763,346 filed Jan. 23, 2004, and issued as U.S. Pat. No. 7,039,136 on May 2, 2006; (b) U.S. patent application Ser. No. 10/686,359, entitled “System and Method for Adjusting Phase,” filed Oct. 15, 2003, and issued as U.S. Pat. No. 7,068,706; (c) U.S. patent application Ser. No. 10/686,829, entitled “Method and Apparatus for Channel Amplitude Estimation and Interference Vector Construction,” filed Oct. 15, 2003, and issued as U.S. Pat. No. 7,580,448; (d) U.S. patent application Ser. No. 10/294,834, entitled “Construction of an Interference Matrix for a Coded Signal Processing Engine,” filed Nov. 15, 2002, and issued as U.S. Pat. No. 7,200,183; and (e) U.S. patent application Ser. No. 10/247,836, entitled “Serial Cancellation Receiver Design for a Coded Signal Processing Engine,” filed Sep. 20, 2002, and issued as U.S. Pat. No. 7,158,559. The entirety of each of the foregoing patents, patent applications, and patent application publications is incorporated by reference herein.


BACKGROUND

1. Field of the Invention


The invention generally relates to the field of communications. More specifically the invention is related to interference suppression for use in coded signal communications, such as Code Division Multiple Access (“CDMA”) communications.


2. Discussion of the Related Art


Interference in communications obstructs the intended reception of a signal and is a persistent problem. Interference may exist in many forms. In CDMA communications, for example, interference is typically the result of receiving one or more unwanted signals simultaneously with a selected signal. These unwanted signals may disrupt the reception of the selected signal because of mutual interference. This disruption of the selected signal is typical in CDMA telephony systems and may corrupt data retrieval processes of a selected signal.


In CDMA telephony, a communications system typically includes a plurality of “base stations” providing a coverage area within a geographic region. These base stations communicate with mobile telephones and/or other CDMA devices operating within the coverage area. To illustrate, a base station provides a coverage “cell” within the overall communication coverage area maintained by the communications system. While within a particular cell, a mobile telephone, or “handset”, can communicate with the base station providing the coverage for that cell. As the mobile telephone moves to the cell of another base station, communications between the mobile telephone and the base station providing the initial cell coverage can be transferred via a “hand off” to the other base station.


Each base station within a CDMA telephony system uses coded signals to communicate with mobile telephones. For example, typical CDMA telephony systems use pseudorandom number (PN) spreading codes, sometimes referred to as “short codes,” to encode data signals. These encoded data signals are transmitted to and from mobile telephones to convey digitized voice and/or other forms of communication. PN codes are known to those skilled in the art. The terms coded signals and encoded signals are interchangeably used herein.


To encode the data signals, the base station applies a PN code to the data at a rate faster than that of the data. For example, the PN code is applied to the data such that there are multiple “chips” of the code for any given element of data. Such an application of the PN code is commonly referred to as direct sequence spreading of the data. Chips and their associated chip rates are known to those skilled in the art.


Sometimes, each base station is assigned a particular timing offset of the short code to differentiate between base stations. Mobile telephones may therefore determine the identity of a particular base station based on the timing offset of the short code. Additionally, the data signals are often further encoded with a unique “covering” code. Such covering codes provide “channelization” for a signal that increases the number of unique communication channels. For example, data encoded with a covering code can further differentiate signals thereby improving detection and subsequent processing of a selected signal.


These covering codes are often used in CDMA telephony systems and typically include families of codes that are orthogonal (e.g., Walsh codes) or codes that are substantially orthogonal (e.g. quasi-orthogonal functions (“QOF”)). Orthogonal covering codes and QOF covering codes have properties that allow for the differentiation of unwanted signals and are known to those skilled in the art. Walsh codes are also known to those skilled in the art.


Both the short codes and the covering codes assist in the detection of a selected signal. However, interference caused by other signals may still degrade data extraction capabilities of the selected signal. For example, as a mobile telephone communicates with a particular base station within that base station's coverage cell, signals from other base stations can interfere with the mobile telephone communication. Since cells often overlap one another to ensure that all desired geographic regions are included in the communication system's coverage area, one or more signals from one base station may interfere with the communication link, or “channel,” between the mobile telephone and another base station. This effect is commonly referred to as cross-channel interference.


Cross-channel interference may also occur because some overhead channels are broadcast to all mobile telephones within the cell. These channels can “bleed” over into other cells and overpower a selected signal, thereby corrupting conveyed data. Examples of such channels include pilot channels, which are often broadcast at greater power levels and convey reference information and can be used to coherently demodulate other channels. Other potentially interfering channels may convey paging channels that alert a particular mobile telephone to an incoming call and synchronization channels that provides synchronization between a mobile telephone and a base station. Still other potentially interfering channels may include traffic channels bearing user traffic such as data and voice.


Still, other forms of interference may occur from “multipath” copies of a selected signal. Multipath can create interference because of the reception of copies of a selected signal at differing times. Multipath typically occurs because of obstructions, such as buildings, trees, et cetera, that create multiple transmission paths for a selected signal. These separate transmission paths may have unique distances that cause the signal to arrive at a receiver at differing times and is commonly referred to as co-channel interference. Additionally, these separate paths may bleed over into other cells to cause cross-channel interference.


Multipath creates co-channel interference because, among other reasons, the orthogonality of the covering code for a received signal is essentially lost due to timing offsets associated with the multipath. For example, a multipath signal having a covering code and arriving at a receiver at differing times causes a misalignment of the covering code. Such a misalignment can result in a high cross-correlation in the covering codes and a general inability to correctly retrieve conveyed data.


“Rake” receivers, such as those used in CDMA telephony systems, combine multipath signals to increase available signal strength. For example, a rake receiver may have a plurality of “fingers,” wherein each finger of the rake receiver independently estimates channel gain and other signal characteristics (e.g., phase) of the selected signal to more accurately demodulate data of the selected signal and subsequently retrieve the data. Each finger is assigned a particular “path” of the selected signal (i.e., one of the paths of the multipath signal or a signal from another base station). These paths may be combined to increase signal strength. Additionally, as signal characteristics change, the fingers may be assigned or de-assigned to other “paths” of the signal to improve data retrieval.


Rake receivers can improve data retrieval of a received signal. However, present rake receivers do not substantially reduce cross-channel interference and/or co-channel interference. These interferers may still corrupt data as long as they exist in any substantial form.


SUMMARY

The present invention provides systems and methods for parallel interference suppression. In one embodiment of the invention, a processing engine is used to substantially cancel a plurality of interfering components within a received signal. The processing engine includes a plurality of matrix generators that are used to generate matrices, each matrix comprising elements of a unique component selected for cancellation. The processing engine also includes one or more processors that use the matrices to generate cancellation operators. A plurality of applicators applies the cancellation operators to parallel but not necessarily unique input signals to substantially cancel the interfering components from the input signals. These input signals may include received signals, interference cancelled signals and/or PN codes. The embodiments disclosed herein may be particularly advantageous to systems employing CDMA (e.g., such as cdmaOne and cdma2000), Wideband CDMA, Broadband CDMA and Global Positioning System (“GPS”) signals. Such systems are known to those skilled in the art.


In one embodiment of the invention, a processing engine comprises:


a plurality of matrix generators, wherein each matrix generator is configured for generating a matrix comprising elements of an interfering signal selected for cancellation;


a processor communicatively coupled to the matrix generators and configured for generating a cancellation operator from each matrix; and


a plurality of applicators, wherein each applicator is communicatively coupled to the processor and configured for applying one of the cancellation operators to an input signal to substantially cancel one of the interfering signals.


In another embodiment of the invention, the processing engine is configurable with a receiver and wherein the processing engine further comprises a connection element configured for receiving output signals from the applicators and for selecting received said output signals as inputs to processing fingers of the receiver.


In another embodiment of the invention, the connection element comprises a plurality of selectors wherein each selector is configured for receiving one of the output signals and for selecting said one of the output signals as one of the inputs to one of the processing fingers.


In another embodiment of the invention, each selector is further configured for receiving a digitized radio signal comprising one or more Code Division Multiple Access signals as one of the inputs to one of the processing fingers.


In another embodiment of the invention, each selector is further configured for receiving a digitized radio signal comprising one or more Wideband Code Division Multiple Access signals as one of the inputs to one of the processing fingers.


In another embodiment of the invention, each selector is further configured for receiving a digitized radio signal comprising one or more Global Positioning System signals as one of the inputs to one of the processing fingers.


In another embodiment of the invention, the output signals are interference cancelled signals.


In another embodiment of the invention, each cancellation operator is a projection operator configured for projecting a selected signal substantially orthogonal to one of the interfering signals.


In another embodiment of the invention, the projection operator comprises the form:

Ps=I−S(STS)−1ST,

where Ps is the projection operator, I is an identity matrix, S is one of the matrices and ST is a transpose of said one of the matrices.


In another embodiment of the invention, each of the cancellation operators comprises the form:

y′=y−S(STS)−1STy,

where y′ is an output cancelled signal, y is a received signal, S is one of the matrices and ST is a transpose of said one of the matrices.


In another embodiment of the invention, the processing engine further comprises an interference selector configured for selecting the interfering signals as inputs to the matrix generators.


In another embodiment of the invention, the interference selector is further configured for providing on-time interfering PN codes of the interfering signals to the matrix generators.


In another embodiment of the invention, the interference selector selects the interfering signals based on a pre-determined criteria selected from a group consisting of amplitude, timing offset, phase and code sequence.


In one embodiment of the invention, a method of canceling interference comprises:


generating a plurality of matrices, each matrix comprising elements of an interference signal selected for cancellation;


generating a cancellation operator from each of the matrices; and


applying each cancellation operator in parallel to an input signal to substantially cancel one of the interference signals.


In another embodiment of the invention, generating the cancellation operator comprises generating a projection operator having a form:

Ps=I−S(STS)−1ST,

where Ps is the projection operator, I is an identity matrix, S is one of the matrices and ST is a transpose of said one of the matrices.


In another embodiment of the invention, applying comprises substantially canceling said one of the interfering signals according to the form:

y′=y−S(STS)−1STy,

where y′ is an output cancelled signal, y is a received signal, S is one of the matrices and ST is a transpose of said one of the matrices.


In another embodiment of the invention, the method further comprises selecting the interference signals for input to the matrices.


In another embodiment of the invention, the method further comprises providing on-time interfering PN codes of the interfering signals to the matrices in response to selecting.


In another embodiment of the invention, the method further comprises selecting output signals generated in response to applying, for assignment of the output signals to processing fingers of a receiver.


In another embodiment of the invention, the method further comprises transferring the output signals to the processing fingers in response to selecting said output signals as input signals to the processing fingers.


In another embodiment of the invention, the output signals are interference cancelled signals.


In another embodiment of the invention, the method further comprises receiving a Code Division Multiple Access signal.


In another embodiment of the invention, the method further comprises receiving a Wideband Code Division Multiple Access signal.


In another embodiment of the invention, the method further comprises receiving a Global Positioning System signal.


In one embodiment of the invention, a mobile handset comprises:


a receiver configured for receiving a radio signal; and


a processing engine communicatively coupled to the receiver and comprising


a plurality of matrix generators, wherein each matrix generator is configured for generating a matrix comprising elements of an interfering signal selected for cancellation,


a processor communicatively coupled to the matrix generators and configured for generating a cancellation operator from each matrix, and


a plurality of applicators, wherein each applicator is communicatively coupled to the processor and configured for applying one of the cancellation operators to an input signal to substantially cancel one of the interfering signals.


In another embodiment of the invention, the radio signal comprises a Code Division Multiple Access signal.


In another embodiment of the invention, the radio signal comprises a Wideband Code Division Multiple Access signal.


In another embodiment of the invention, the radio signal comprises a Global Positioning System signal.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of an exemplary coded signal processing engine in one embodiment of the invention.



FIG. 2 is a block diagram of the exemplary coded signal processing engine configurable with a receiver in one embodiment of the invention.



FIG. 3 is a block diagram of exemplary receiver circuitry.



FIG. 4 is another block diagram of exemplary receiver circuitry.



FIG. 5 is a flow chart illustrating one exemplary methodical embodiment of the invention.





DETAILED DESCRIPTION OF THE DRAWINGS

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof have been shown by way of example in the drawings and are herein described in detail. It should be understood, however, that it is not intended to limit the invention to the particular form disclosed, but rather, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the claims.



FIG. 1 is a block diagram of exemplary coded signal processing engine 100 in one embodiment of the invention. Coded signal processing engine (“CSPE”) 100 is used to substantially cancel interfering components from signals. Examples of such interfering components include co-channel interference and cross-channel interference typical of CDMA telephony. CSPE 100 substantially cancels selected interfering components by applying a cancellation operator to either a received signal y or selected coded reference signals. CSPE 100 thereby generates a plurality of output cancelled signals (i.e., labeled Output Cancelled Signals1 . . . N, where “N” is an integer greater than one), wherein the selected interfering components are substantially removed from the received signal y/coded reference signals. The coded reference signals may be “on-time” PN codes of signals used to decode signals selected for demodulation. On-time as used herein refers to a particular timing alignment for a PN code. Such a timing alignment may be relevant to extracting data from a signal being tracked within a receiver.


In this embodiment, CSPE 100 includes interference selector 101 for selecting interfering components and for providing selected “on-time” interfering PN codes to matrix generators 102 of CSPE 100. The interference selector may select the interfering signals based on pre-determined criteria, such as amplitude, timing offset, phase and/or code sequence. Matrix generators 102 are configured for using selected interfering codes and phase estimates (labeled φ1 . . . N Est.) corresponding to those codes to generate matrices 103 (labeled matrices 1031 . . . N). Each matrix 103 comprises one or more vectors 104 (labeled matrices 1041 . . . N). Further, the vectors 104 comprise elements representing components of the interfering codes (e.g., such as those elements described in the '346 and the '360 applications). For example, each vector may include elements representing a unique code of an interfering signal (e.g., co-channel interference or cross-channel interference). The codes are typically Walsh covering codes and on-time PN codes of selected interferers. Each interference vector is multiplied by a phase estimate of a corresponding selected interferer. Phase estimation is exemplified in the '346 application.


As multiple vectors 104 may be used to represent multiple interfering signals, each matrix 103 may be representative of a unique plurality of interfering signals. For example, matrix 1031 may include a single vector representing one interfering signal A1 (not shown), whereas matrix 1032 may include a single vector representing another interfering signal A2 (not shown). The invention, however, is not intended to be limited to the exemplary embodiment shown herein.


CSPE 100 uses each matrix 103 to generate unique cancellation operators for selective cancellation of the interfering components. Accordingly, CSPE 100 includes processor 105 configured for processing matrices 103 to generate the cancellation operators. The cancellation operators may be projection operators that are used to project selected coded signals substantially orthogonal to the interference (e.g., the interference represented by the matrices 103) so as to substantially cancel or remove the interference from the selected coded signals. In a projection operator embodiment, processor 105 uses matrices 103 to generate the projection operators according to the following form:

Ps=I−S(STS)−1ST,  (Eq. 1)


where Ps is the projection operator, I is an identity matrix, S is an interference matrix 103 and ST is a transpose of the matrix 103. Such projection operators and their associated constructions are described in the '346, the '360, the '829, the '219 and the '834 applications.


CSPE 100 applies the cancellation operator to selected input signals (labeled “Input Signal”). Each applicator 106 (labeled 1061 . . . N) applies one of the cancellation operators to an input signal. Each application of a cancellation operator typically provides a unique output cancelled signal which is the input signal with the selected interfering signal substantially removed. For example, using the same signal notations of “A” as described above, applicator 1061 may apply a projection operator Ps A1 to an input signal. The projection operator Ps A1, in this example, is generated from a matrix 103 comprising an interfering component of signal A1. Once applied to the received signal y as the input signal, applicator 1061 produces an Output Cancelled Signal1 that corresponds to yA1′=Ps A1y, where yA1′ is the received signal with the interfering component A1 substantially removed.


Similarly, applicators 1062 and 106N may apply projection operators in parallel with applicator 1061 to produce the respective unique signals Output Cancelled Signal2 and Output Cancelled SignalN. For example, applicator 1062 may apply a projection operator Ps A2 such that the applicator produces an Output Cancelled Signal2 corresponding to yA2′=Ps A2y, where yA2′ is the received signal with the interfering component A2 substantially removed. Parallel as used herein implies the substantially simultaneous generations of unique cancellation operators and the subsequent applications of the cancellation operators to independent input signals.


In an alternative embodiment, cancellation may be performed by applying a construction of the matrices as follows:

y′=y−S(STS)−1STy.  (Eq. 2)

In such an embodiment, the received signal y is multiplied by the interference matrix construction of Eq. 1. However, that product is subtracted from the received signal y to produce an output cancelled signal y′, such as yA1′ and yA21′. Those skilled in the art should readily recognize that the two approaches produce substantially the same result.


While one exemplary embodiment has been shown in detail, the invention is not intended to be limited to the examples described and illustrated herein. For example, applicators 106 may apply other cancellation operators to other input signals to produce a variety of output cancelled signals. One example of another input signal is an on-time reference PN code, such as that described below in FIG. 4. Examples of other methods for the production of cancellation operators include subtractive methods, decorrelators and decision feedback.


Additionally, the invention is not intended to be limited to the number of applicators 106, input signals, output cancelled signals, matrix generators 102 and processors 105. For example, processor 105 may be either a single processor configured for generating a plurality of cancellation operators or processor 105 may represent a plurality of processors each of which is similarly configured for generating a unique cancellation operator. Examples of such processors include general purpose processors and Application Specific Integrated Circuits (“ASIC”). Accordingly, the processor may be operably controlled via software and/or firmware instructions to generate the cancellation operators. Those skilled in the art are familiar with processors, ASICs, software, firmware and the various combinations thereof which may be used in such implementations.


Moreover, those skilled in the art should readily recognize that CSPE 100 in general as described herein may be implemented through software, firmware, hardware and/or various combinations thereof. For example, the generations of the cancellation operators and the subsequent cancellations of interfering signals may be computed through the use of software instructions (e.g., firmware) operable within a processor or specified in hardware architecture.



FIG. 2 is a block diagram of the exemplary CSPE 100 of FIG. 1 configurable with receiver 204 in one embodiment of the invention. In this embodiment, receiver 204 receives a radio frequency (“RF”) signal through antenna 201 and subsequently converts that signal to a digital received signal y using Analog-to-Digital (“A/D”) converter 202. A/D converter 202 transfers the digital signal to receiver circuitry 203 for signal processing. Those skilled in the art should readily recognize that the processing of CDMA signals typically includes both In-phase (“I”) and Quadrature (“Q”) components. As such, the digital received signal y may include both I and Q components as well.


In this embodiment, receiver circuitry 203 is configured for transferring the digitized received signal y to CSPE 100 for cancellation of interfering signals. CSPE 100 receives the signal y as well as known codes from the interfering signals. For example, the interfering signals may be cross channel and/or co-channel interfering signals comprising known codes of CDMA telephony systems. Such codes may be input to CSPE 100 on an as needed basis or stored within a memory (not shown) local to the CSPE 100. Alternatively, the codes may be generated by processor 105 on an as needed basis.


Operable characteristics of CSPE 100 are the same as those described in FIG. 1. However, again using the same signal notations of “A” as described above, in this preferred receiver embodiment, CSPE 100 uses applicators 1061 . . . N to apply cancellation operators to the input signals in the following manner:


Applicator 1061 produces an Output Cancelled Signal1 that corresponds to yA1′=Ps A1y, where again yA1′ is the received signal with the interfering component A1 substantially removed;


Applicator 1062 produces an Output Cancelled Signal2 corresponding to yA2′=Ps A2y; and where again yA2′ is the received signal with the interfering component A2 substantially removed.


These Output Cancelled Signal1 . . . N are transferred to connection element 206 via “N” channel connection 205. For example, “N” channel connection 205 may be a communicative connection such as a data bus that allows for the transfer of “N” number of channels to connection element 206. Consequently, connection element 206 may be configurable to receive such an “N” channel connection.


Connection element 206 is configured for selectively transferring Output Cancelled Signal1 . . . N to receiver circuitry 203 of receiver 204 via “M” channel connection 207. For example, connection element 206 may be a switching device, multiplexer, a plurality of multiplexers or another similar communication device that selectively transfers “N” number of signals to “M” number of channels, where “M” is also a number greater than one. As such, “M” channel connection 207 is similar to “N” channel connection 205.


The control for connection element 206 may be applied independently of cancellation processing. Consequently, connection element 206 may or may not be configured within the CSPE 100. For example, should the selection of Output Cancelled Signal1 . . . N be received by receiver circuitry 203 be decided by receiver 204, then connection element 206 may reside outside of the embodied CSPE 100. In a preferred embodiment, however, CSPE 100 includes the control functionality for connection element 206 that determines which of the Output Cancelled Signal1 . . . N are transferred to receiver circuitry 203. Accordingly, the invention should not be limited to the preferred embodiment described and shown herein.



FIG. 3 is a block diagram of exemplary receiver circuitry 203. In this embodiment, receiver circuitry 203 is configured with CSPE 100 via connection element 206 for selectively tracking signals through receiver fingers f1, f2 and f3 (labeled 302f1, 302f2 and 302f3). For example, connection element 206 may allow the receiver circuitry 203 to track and subsequently demodulate a selected combination of Output Cancelled Signal1 . . . N and the received signal y through the receiver fingers f1, f2 and f3.


In a preferred embodiment, a first receiver finger f1 receives the signal y via a corresponding selector (the selectors are labeled 301f1 . . . f3). The phase estimate φf1 and the PN codef1 outputs of the first receiver finger flare transferred from the finger to CSPE 100 for producing the output cancelled signal yA1′ described in FIGS. 1 and 2. A second receiver finger f2 selectively receives either y or yA1′ via a corresponding selector for tracking of a second assigned signal. If y is transferred to the second receiver finger f2, the phase estimate φf2 and the PN code outputs of that second receiver finger are transferred to CSPE 100 to produce the output cancelled signal yA2′ also described in FIGS. 1 and 2. Consequently, a third receiver fingers f3 has a selection of signals y and output cancelled signals yA1′ and yA2′ to track and demodulate a third assigned signal.


In many instances, tracking, demodulation and cancellation of the signals described and shown herein the preferred embodiment is all that is necessary in CDMA telephony because there are typically only one or two signals (e.g., A1 and A2) that degrade reception beyond the point of intended data recovery. Accordingly, selective cancellation of only one or two signals may decrease processor consumption requirements and thereby improve overall processing performance of the system. As such, the embodiment should not be limited to the number of receiver fingers shown and described. More receiver fingers than those illustrated in this exemplary embodiment may be used to selectively track and demodulate signals according to the principles described herein.



FIG. 4 is another block diagram of exemplary receiver circuitry 203. In this alternative embodiment, the received signal y is transferred to receiver fingers f1, f2 and f3 (labeled 405f1 . . . f3) and CSPE 100. Time tracking and phase estimation of the received signal y may be performed for each finger in corresponding elements 401f1 . . . f3. Such tracking and phase estimation is used to generate on-time reference PN codes (PN codef1 . . . f3) and is described in greater detail in the '346 application. Elements 401f1 . . . f3 transfer the on-time reference PN codes as well as the phase estimates (labeled φf1 . . . f3) to CSPE 100 and to corresponding selectors 402f1 . . . f3. CSPE 100 uses these on-time PN codes and phase estimates to generate cancellation operators that remove interfering signals from the received signal y.


Differing from the embodiment of FIG. 3, CSPE 100 uses the applicators 106 of FIGS. 1 and 2 to apply cancellation operators to the on-time PN codes to produce output cancelled versions of the codes (labeled output reference codes). Such an embodiment may conform to a cancellation of the form Psx, where x is an on-time reference PN code. These output cancelled reference codes are selectively transferred to demodulators 403f1 . . . f2 via selectors 402f1 . . . f2 of connection element 206. These codes are used by the demodulators 403f1 . . . f2 to demodulate the received signal y. Such demodulation may be performed with a correlation of a reference code and a received signal over a period of a symbol and is well known to those skilled in the art.


In a preferred embodiment, a first receiver finger f1 receives the on-time reference PN code xf1 via a first selector 402f1 and produces the phase estimate φf1 and the PN codef1 outputs. The first finger f1 then demodulates the received signal y using the code xf1. These phase estimate φf1, and the PN codef1 outputs of that first receiver finger f1 may be transferred from the finger f1 to CSPE 100 for producing the output cancelled signal xA1′, where xA1′ is the on-time reference PN code of the signal selected for demodulation without the interfering effects of the signal A1. A second receiver finger f2 selectively receives either x or xA1′ via corresponding selector 402f2. If x is transferred to the second receiver finger 12, the phase estimate φf2 and the PN code outputs of receiver finger f2 are transferred to CSPE 100 to produce the output cancelled signal xA2′, where xA2′ is the on-time reference PN code of the signal selected for demodulation without the interfering effects of the signal A2. Consequently, a third receiver finger f3 has a selection of signals xf3 and output cancelled on-time reference PN codes xA1′ and xA2′ which can be used to track and demodulate the received signal y.


Again, those skilled in the art should readily recognize that the preferred embodiment should not be limited to that which is shown and described herein. More receiver fingers than those illustrated and described herein the exemplary embodiment may be used to selectively track and demodulate signals according to the principles described herein.



FIG. 5 is a flow chart 500 illustrating one exemplary methodical embodiment of the invention. In this embodiment, one or more interference components of a received signal are selected, in element 501. These interference components are used to generate an interference matrix, in element 502. A cancellation operator is generated from the interference matrix, in element 503. The cancellation operator may be a projection operator as described in FIG. 1 that is generated in element 504 to substantially orthogonally project a received signal from interfering components. Such a projection operator may substantially cancel or remove the interfering components from the received signal. The cancellation operator is applied to either the received signal or an on-time reference PN code, in element 505.


Elements 501 through 505 are performed in parallel based on the number of receiver fingers used for tracking and demodulation in a receiver. For example, in a receiver comprising three fingers, such as the receiver circuitry 203 in FIGS. 4 and 5, elements 501 through 505 may be performed three times in a substantially simultaneous fashion. Moreover, control functionality may be configured to only select information of particular fingers. For example, if a signal does not contribute significantly to the interference, it may be selectively excluded from the cancellation process to decrease processing. Such a selection process is described in the '954 application.


The application of the cancellation operators in element 505 produces output cancelled signals such as those described herein. Once those output cancelled signals are produced, the signals are selected for finger assignments, in element 506. Such a selection process may be performed by connection element 206 in FIG. 3. Selected output cancelled signals are transferred to the receiver fingers according to their respective finger assignments, in element 507. Within their respective fingers, the output cancelled signals are either tracked and demodulated as in FIG. 3 or are used to track and demodulate a received signal as in FIG. 4.


The embodiments described herein may substantially reduce interference caused by unwanted signals and improve signal processing. For example, poor signal quality due to interference may deleteriously affect acquisition, tracking and demodulation of selected signals. A reduction of interference may, therefore, result in improved signal processing and error reduction. In regards to such benefits, the embodiments herein may advantageously require use within a CDMA telephony system. Improved processing within a CDMA telephony system may be exploited in terms of increased system capacity, transmit power reduction, system coverage and/or data rates. However, those skilled in the art should readily recognize that the above embodiments should not be limited to any particular method of signaling. For example, the embodiments disclosed herein may also be advantageous to systems employing CDMA (e.g., such as cdmaOne and cdma2000), WCDMA, Broadband CDMA and GPS signals.


Additionally, it should be noted that the above embodiments of the invention may be implemented in a variety of ways. For example, the above embodiments may be implemented from software, firmware, hardware or various combinations thereof. Those skilled in the art are familiar with software, firmware, hardware and their various combinations. To illustrate, those skilled in the art may choose to implement aspects of the invention in hardware using ASIC chips, Digital Signal Processors (“DSP”) and/or other integrated circuitry (e.g., custom designed circuitry and Xilinx chips). Alternatively, aspects of the invention may be implemented through combinations of software using Java, C, C++, Matlab, and/or processor specific machine and assembly languages. Accordingly, those skilled in the art should readily recognize that such implementations are a matter of design choice and that the invention should not be limited to any particular implementation.


While the invention has been illustrated and described in detail in the drawings and foregoing description, such illustration and description is to be considered as exemplary and not restrictive in character. Accordingly, it should be understood that only the preferred embodiment and minor variants thereof have been shown and described and that all changes and modifications that come within the spirit of the invention are desired to be protected.

Claims
  • 1. A processing engine, comprising: a plurality of matrix generators, wherein each of the plurality of matrix generators is configured for generating a matrix comprising elements representing components of a code of a different one of a plurality of interfering signals selected for suppression;a processor communicatively coupled to the plurality of matrix generators and configured for generating a plurality of suppression operators;a plurality of applicators, wherein each applicator is communicatively coupled to the processor and configured for applying at least one of the plurality of suppression operators to an input signal to substantially suppress at least one of the plurality of interfering signals; andan interference selector configured for selecting at least one of the plurality of interfering signals as an input to the plurality of matrix generators, wherein the interference selector selects at least one of the plurality of interfering signals based on a pre-determined criteria including at least one of amplitude, timing offset, phase, or code sequence;wherein the processing engine is in a receiver and wherein the processing engine further comprises a connection element configured for receiving one or more output signals from the plurality of applicators and for selecting one or more of the one or more output signals as inputs to one or more processing fingers of the receiver;wherein the connection element comprises one or more selectors configured for receiving one or more of the output signals and for selecting one or more of the output signals as inputs to one or more of the processing fingers;wherein the output signals are interference suppressed signals; andwherein the plurality of matrix generators are in parallel with each other.
  • 2. The processing engine of claim 1, wherein at least one of the one or more selectors is further configured for receiving a digitized signal comprising one or more Code Division Multiple Access signals as an input to one of the processing fingers.
  • 3. The processing engine of claim 1, wherein at least one of the one or more selectors is further configured for receiving a digitized signal comprising one or more Wideband Code Division Multiple Access signals as an input to one of the processing fingers.
  • 4. The processing engine of claim 1, wherein each of the one or more selectors is further configured for receiving a digitized signal comprising one or more Global Positioning System signals as an input to one of the processing fingers.
  • 5. The processing engine of claim 1, wherein the interference selector is further configured for providing on-time interfering pseudo noise (PN) codes of the interfering signals to the plurality of matrix generators.
  • 6. The processing engine of claim 1, wherein the interference selector selects the at least one of the plurality of interfering signals based on amplitude.
  • 7. The processing engine of claim 1, wherein the interference selector selects the at least one of the plurality of interfering signals based on timing offset.
  • 8. The processing engine of claim 1, wherein the interference selector selects the at least one of the plurality of interfering signals based on phase.
  • 9. The processing engine of claim 1, wherein the interference selector selects the at least one of the plurality of interfering signals based on code sequence.
  • 10. A method of suppressing interference, comprising: generating a plurality of matrices, each of the plurality of matrices comprising elements of a different one of a plurality of interference signals selected for suppression;generating a plurality of suppression operators from the plurality of matrices;applying the plurality of suppression operators in parallel to an input signal to substantially suppress at least one of the interference signals;selecting one or more output signals generated in response to applying, for assignment of the one or more output signals to one or more processing fingers of a receiver;selecting at least one of the plurality of interference signals for input to the plurality of matrices, wherein the at least one of the plurality of interference signals is selected based on a pre-determined criteria including at least one of amplitude, timing offset, phase, or code sequence;wherein the one or more output signals are interference suppressed signals; andwherein the plurality of matrices are in parallel with each other.
  • 11. The method of claim 10, further comprising providing one or more on-time interfering pseudo noise (PN) codes of the interfering signals to the matrices in response to selecting.
  • 12. The method of claim 10, further comprising transferring the one or more output signals to the one or more processing fingers in response to selecting said output signals as input signals to the processing fingers.
  • 13. The method of claim 10, further comprising receiving a Code Division Multiple Access signal.
  • 14. The method of claim 10, further comprising receiving a Wideband Code Division Multiple Access signal.
  • 15. The method of claim 10, further comprising receiving a Global Positioning System signal.
  • 16. The method of claim 10, wherein the at least one of the plurality of interference signals is selected based on amplitude.
  • 17. The method of claim 10, wherein the at least one of the plurality of interference signals is selected based on timing offset.
  • 18. The method of claim 10, wherein the at least one of the plurality of interference signals is selected based on phase.
  • 19. The method of claim 10, wherein the at least one of the plurality of interference signals is selected based on code sequence.
  • 20. A system for suppressing interference, comprising: means for generating a plurality of matrices, each matrix comprising elements of a different one of a plurality of interference signals selected for suppression;means for generating a plurality of suppression operators from the plurality of matrices;means for applying the plurality of suppression operators in parallel to an input signal to substantially suppress at least one of the plurality interference signals to form one or more output signals; andmeans for selecting at least one of the plurality of interfering signals as inputs to the plurality of matrices, wherein the at least one of the plurality of interfering signals is selected based on a pre-determined criteria including at least one of amplitude, timing offset, phase, or code sequence; andwherein the plurality of matrices are in parallel with each other.
  • 21. The system of claim 20, further comprising means for providing on-time interfering pseudo noise (PN) codes of one or more of the plurality of interfering signals to the one or more matrices in response to selecting.
  • 22. The system of claim 21, further comprising means for receiving a Wideband Code Division Multiple Access signal.
  • 23. The system of claim 20, further comprising means for selecting the one or more output signals for assignment of the one or more output signals to one or more processing fingers of a receiver.
  • 24. The system of claim 23, further comprising means for transferring one or more output signals to the one or more processing fingers in response to selecting said output signals.
  • 25. The system of claim 23, wherein the one or more output signals are interference suppressed signals.
  • 26. The system of claim 20, further comprising means for receiving a Code Division Multiple Access signal.
  • 27. The system of claim 20, further comprising means for receiving a Global Positioning System signal.
  • 28. The system of claim 20, wherein the at least one of the plurality of interfering signals is selected based on amplitude.
  • 29. The system of claim 20, wherein the at least one of the plurality of interfering signals is selected based on timing offset.
  • 30. The system of claim 20, wherein the at least one of the plurality of interfering signals is selected based on phase.
  • 31. The system of claim 20, wherein the at least one of the plurality of interfering signals is selected based on code sequence.
  • 32. A mobile handset, comprising: a receiver configured for receiving a signal;a processing engine communicatively coupled to the receiver and comprisinga plurality of matrix generators, wherein each of the plurality of matrix generators is configured for generating a matrix comprising elements of a different one of a plurality of interfering signals selected for suppression;a processor communicatively coupled to the plurality of matrix generators and configured for generating a plurality of suppression operators;a plurality of applicators, wherein each of the plurality of applicators is communicatively coupled to the processor and configured for applying at least one of the plurality of suppression operators to an input signal to substantially suppress at least one of the plurality of interfering signals; andan interference selector configured to select at least one of the plurality of interfering signals as inputs to the plurality of matrix generators, wherein the at least one of the plurality of interfering signals is selected based on a pre-determined criteria including at least one of amplitude, timing offset, phase, or code sequence;wherein the plurality of matrix generators are in parallel with each other.
  • 33. The mobile handset of claim 32, wherein the processing engine further comprises a connection element configured for receiving output signals from the plurality of applicators and for selecting one or more output signals as inputs to one or more processing fingers of the receiver.
  • 34. The mobile handset of claim 33, wherein the connection element comprises one or more selectors configured for receiving one or more output signals and for selecting one or more of the one or more output signals as inputs to one or more of the processing fingers.
  • 35. The mobile handset of claim 34, wherein one or more of the one or more selectors is further configured for receiving a digitized signal comprising one or more Code Division Multiple Access signals as one of the inputs to one of the processing fingers.
  • 36. The mobile handset of claim 34, wherein one or more of the one or more selectors is further configured for receiving a digitized signal comprising one or more Wideband Code Division Multiple Access signals as one of the inputs to one of the processing fingers.
  • 37. The mobile handset of claim 34, wherein one or more of the one or more selectors is further configured for receiving a digitized signal comprising one or more Global Positioning System signals as one of the inputs to one of the processing fingers.
  • 38. The mobile handset of claim 33, wherein the output signals are interference suppressed signals.
  • 39. The mobile handset of claim 32, wherein the interference selector is further configured for providing on-time interfering pseudo noise (PN) codes of the plurality of interfering signals to the plurality of matrix generators.
  • 40. The mobile handset of claim 32, wherein the signal comprises a Code Division Multiple Access signal.
  • 41. The mobile handset of claim 32, wherein the signal comprises a Wideband Code Division Multiple Access signal.
  • 42. The mobile handset of claim 32, wherein the signal comprises a Global Positioning System signal.
  • 43. The mobile handset of claim 32, wherein the at least one of the plurality of interfering signals is selected based on amplitude.
  • 44. The mobile handset of claim 32, wherein the at least one of the plurality of interfering signals is selected based on timing offset.
  • 45. The mobile handset of claim 32, wherein the at least one of the plurality of interfering signals is selected based on phase.
  • 46. The mobile handset of claim 32, wherein the at least one of the plurality of interfering signals is selected based on code sequence.
US Referenced Citations (401)
Number Name Date Kind
3742201 Groginsky Jun 1973 A
4088955 Baghdady May 1978 A
4309769 Taylor, Jr. Jan 1982 A
4359738 Lewis Nov 1982 A
4601046 Halpern et al. Jul 1986 A
4665401 Garrard et al. May 1987 A
4670885 Parl et al. Jun 1987 A
4713794 Byington et al. Dec 1987 A
4780885 Paul et al. Oct 1988 A
4856025 Takai Aug 1989 A
4893316 Janc et al. Jan 1990 A
4922506 McCallister et al. May 1990 A
4933639 Barker Jun 1990 A
4965732 Roy, III et al. Oct 1990 A
5017929 Tsuda May 1991 A
5099493 Zeger et al. Mar 1992 A
5101501 Gilhousen et al. Mar 1992 A
5105435 Stilwell Apr 1992 A
5109390 Gilhousen et al. Apr 1992 A
5109528 Uddenfeldt Apr 1992 A
5119401 Tsujimoto Jun 1992 A
5136296 Roettger et al. Aug 1992 A
5151919 Dent Sep 1992 A
5218359 Minamisono Jun 1993 A
5218619 Dent Jun 1993 A
5220687 Ichikawa et al. Jun 1993 A
5224122 Bruckert Jun 1993 A
5226045 Chuang Jul 1993 A
5235632 Raith Aug 1993 A
5237586 Bottomley Aug 1993 A
5260944 Tomabechi Nov 1993 A
5260988 Schellinger et al. Nov 1993 A
5263191 Dickerson Nov 1993 A
5267261 Blakeney, II et al. Nov 1993 A
5280472 Gilhousen et al. Jan 1994 A
5305349 Dent Apr 1994 A
5325394 Bruckert Jun 1994 A
5327578 Breeden et al. Jul 1994 A
5333175 Ariyavisitakul et al. Jul 1994 A
5343493 Karimullah Aug 1994 A
5343496 Honig et al. Aug 1994 A
5347535 Karasawa et al. Sep 1994 A
5353302 Bi Oct 1994 A
5367558 Gillig et al. Nov 1994 A
5377183 Dent Dec 1994 A
5386202 Cochran et al. Jan 1995 A
5390207 Fenton et al. Feb 1995 A
5390233 Jensen et al. Feb 1995 A
5392331 Patsiokas et al. Feb 1995 A
5394110 Mizoguchi Feb 1995 A
5396256 Chiba et al. Mar 1995 A
5406615 Miller, II et al. Apr 1995 A
5428601 Owen Jun 1995 A
5437055 Wheatley, III Jul 1995 A
5440265 Cochran et al. Aug 1995 A
5442680 Schellinger et al. Aug 1995 A
5448600 Lucas Sep 1995 A
5448619 Evans et al. Sep 1995 A
5475677 Arnold et al. Dec 1995 A
5481570 Winters Jan 1996 A
5488649 Schellinger Jan 1996 A
5506865 Weaver, Jr. Apr 1996 A
5507035 Bantz et al. Apr 1996 A
5509052 Chia et al. Apr 1996 A
5513176 Dean et al. Apr 1996 A
5515420 Urasaka et al. May 1996 A
5533011 Dean et al. Jul 1996 A
5533027 Akerberg et al. Jul 1996 A
5553098 Cochran et al. Sep 1996 A
5594782 Zicker et al. Jan 1997 A
5602833 Zehavi Feb 1997 A
5610969 McHenry et al. Mar 1997 A
5634193 Ghisler May 1997 A
5640414 Blakeney, II et al. Jun 1997 A
5644592 Divsalar et al. Jul 1997 A
5659598 Byrne et al. Aug 1997 A
5659878 Uchida et al. Aug 1997 A
5664005 Emery et al. Sep 1997 A
5673307 Holland et al. Sep 1997 A
5675629 Raffel et al. Oct 1997 A
5724658 Hasan Mar 1998 A
5732076 Ketseoglou et al. Mar 1998 A
5736964 Ghosh et al. Apr 1998 A
5745852 Khan et al. Apr 1998 A
5758281 Emery et al. May 1998 A
5787130 Kotzin et al. Jul 1998 A
5796727 Harrison et al. Aug 1998 A
5796729 Greaney et al. Aug 1998 A
5812086 Bertiger et al. Sep 1998 A
5812511 Kawamura et al. Sep 1998 A
5815525 Smith et al. Sep 1998 A
5818820 Anderson et al. Oct 1998 A
5822681 Chang et al. Oct 1998 A
5822767 MacWilliams et al. Oct 1998 A
5825759 Liu Oct 1998 A
5844521 Stephens et al. Dec 1998 A
5852767 Sugita Dec 1998 A
5859613 Otto Jan 1999 A
5862345 Okanoue et al. Jan 1999 A
5870677 Takahashi et al. Feb 1999 A
5872540 Casabona et al. Feb 1999 A
5872776 Yang Feb 1999 A
5887020 Smith et al. Mar 1999 A
5887260 Nakata Mar 1999 A
5890055 Chu et al. Mar 1999 A
5890064 Widergen et al. Mar 1999 A
5894500 Bruckert et al. Apr 1999 A
5903834 Wallstedt et al. May 1999 A
5915224 Jonsson Jun 1999 A
5926760 Khan et al. Jul 1999 A
5926761 Reed et al. Jul 1999 A
5930229 Yoshida et al. Jul 1999 A
5936949 Pasternak et al. Aug 1999 A
5940512 Tomoike Aug 1999 A
5946622 Bojeryd Aug 1999 A
5949773 Bhalla et al. Sep 1999 A
5953369 Suzuki Sep 1999 A
5960341 LeBlanc et al. Sep 1999 A
5960361 Chen Sep 1999 A
5960364 Dent Sep 1999 A
5978413 Bender Nov 1999 A
5987010 Schnizlein Nov 1999 A
5995499 Hottinen et al. Nov 1999 A
5995828 Nishida Nov 1999 A
6002727 Uesugi Dec 1999 A
6014373 Schilling et al. Jan 2000 A
6016318 Tomoike Jan 2000 A
6018317 Dogan et al. Jan 2000 A
6032056 Reudink Feb 2000 A
6035193 Buhrmann et al. Mar 2000 A
6052592 Schellinger et al. Apr 2000 A
6078611 La Rosa et al. Jun 2000 A
6088383 Suzuki et al. Jul 2000 A
6101176 Honkasalo et al. Aug 2000 A
6101385 Monte et al. Aug 2000 A
6104712 Robert et al. Aug 2000 A
6112080 Anderson et al. Aug 2000 A
6112088 Haartsen Aug 2000 A
6115409 Upadhyay et al. Sep 2000 A
6119000 Stephenson et al. Sep 2000 A
6127973 Choi et al. Oct 2000 A
6130886 Ketseoglou et al. Oct 2000 A
6131013 Bergstrom et al. Oct 2000 A
6134227 Magana Oct 2000 A
6137788 Sawahashi et al. Oct 2000 A
6138019 Trompower et al. Oct 2000 A
6141332 Lavean Oct 2000 A
6154443 Huang et al. Nov 2000 A
6157685 Tanaka et al. Dec 2000 A
6157842 Karlsson et al. Dec 2000 A
6157847 Buehrer et al. Dec 2000 A
6163696 Bi et al. Dec 2000 A
6166690 Lin et al. Dec 2000 A
6172969 Kawakami et al. Jan 2001 B1
6173008 Lee Jan 2001 B1
6175587 Madhow et al. Jan 2001 B1
6192067 Toda et al. Feb 2001 B1
6201799 Huang et al. Mar 2001 B1
6215812 Young et al. Apr 2001 B1
6219376 Zhodzishsky et al. Apr 2001 B1
6222828 Ohlson et al. Apr 2001 B1
6226515 Pauli et al. May 2001 B1
6230180 Mohamed May 2001 B1
6233229 Ranta et al. May 2001 B1
6233459 Sullivan et al. May 2001 B1
6236852 Veerasamy et al. May 2001 B1
6240124 Wiedeman et al. May 2001 B1
6243581 Jawanda Jun 2001 B1
6252535 Kober et al. Jun 2001 B1
6256336 Rademacher et al. Jul 2001 B1
6256511 Brown et al. Jul 2001 B1
6259688 Schilling et al. Jul 2001 B1
6263208 Chang et al. Jul 2001 B1
6263211 Brunner et al. Jul 2001 B1
6266529 Chheda Jul 2001 B1
6269075 Tran Jul 2001 B1
6269086 Magana et al. Jul 2001 B1
6275186 Kong Aug 2001 B1
6278726 Mesecher et al. Aug 2001 B1
6282231 Norman et al. Aug 2001 B1
6282233 Yoshida Aug 2001 B1
6285316 Nir et al. Sep 2001 B1
6285319 Rose Sep 2001 B1
6285861 Bonaccorso et al. Sep 2001 B1
6295311 Sun Sep 2001 B1
6301289 Bejjani et al. Oct 2001 B1
6304618 Hafeez et al. Oct 2001 B1
6308072 Labedz et al. Oct 2001 B1
6310704 Dogan et al. Oct 2001 B1
6317453 Chang Nov 2001 B1
6320873 Nevo et al. Nov 2001 B1
6321090 Soliman Nov 2001 B1
6324159 Mennekens et al. Nov 2001 B1
6327470 Ostling Dec 2001 B1
6327471 Song Dec 2001 B1
6330460 Wong et al. Dec 2001 B1
6333947 van Heeswyk et al. Dec 2001 B1
6351235 Stilp Feb 2002 B1
6351642 Corbett et al. Feb 2002 B1
6359872 Mahany et al. Mar 2002 B1
6359874 Dent Mar 2002 B1
6362760 Kober et al. Mar 2002 B2
6363104 Bottomley Mar 2002 B1
6374102 Brachman et al. Apr 2002 B1
6377636 Paulraj et al. Apr 2002 B1
6380879 Kober et al. Apr 2002 B2
6381457 Carlsson et al. Apr 2002 B1
6385264 Terasawa et al. May 2002 B1
6389059 Smith et al. May 2002 B1
6396804 Odenwalder May 2002 B2
6404760 Holtzman et al. Jun 2002 B1
6415158 Kint et al. Jul 2002 B1
6426819 Crimmins et al. Jul 2002 B1
6430216 Kober Aug 2002 B1
6430395 Arazi et al. Aug 2002 B2
6434389 Meskanen et al. Aug 2002 B1
6445921 Bell Sep 2002 B1
6459693 Park et al. Oct 2002 B1
6463307 Larsson et al. Oct 2002 B1
6498934 Muller Dec 2002 B1
6501788 Wang et al. Dec 2002 B1
6515980 Bottomley Feb 2003 B1
6539237 Sayers et al. Mar 2003 B1
6542516 Vialen et al. Apr 2003 B1
6553219 Vilander et al. Apr 2003 B1
6556822 Matsumoto Apr 2003 B1
6556825 Mansfield Apr 2003 B1
6556830 Lenzo Apr 2003 B1
6570909 Kansakoski et al. May 2003 B1
6574266 Haartsen Jun 2003 B1
6574270 Madkour et al. Jun 2003 B1
6580771 Kenney Jun 2003 B2
6584115 Suzuki Jun 2003 B1
6587444 Lenzo et al. Jul 2003 B1
6590888 Ohshima Jul 2003 B1
6633614 Barton et al. Oct 2003 B1
6633761 Singhal et al. Oct 2003 B1
6643512 Ramaswamy Nov 2003 B1
6647426 Mohammed Nov 2003 B2
6658250 Ganesan et al. Dec 2003 B1
6665276 Culbertson et al. Dec 2003 B1
6668011 Li et al. Dec 2003 B1
6675009 Cook Jan 2004 B1
6680727 Butler et al. Jan 2004 B2
6680923 Leon Jan 2004 B1
6711400 Aura Mar 2004 B1
6725025 Schmidl et al. Apr 2004 B1
6766160 Lemilainen et al. Jul 2004 B1
6788656 Smolentzov et al. Sep 2004 B1
6798737 Dabak et al. Sep 2004 B1
6801519 Mangal Oct 2004 B1
6801565 Bottomley et al. Oct 2004 B1
6801772 Townend et al. Oct 2004 B1
6801777 Rusch Oct 2004 B2
6807417 Sallinen et al. Oct 2004 B2
6824048 Itabashi et al. Nov 2004 B1
6826154 Subbiah et al. Nov 2004 B2
6829227 Pitt et al. Dec 2004 B1
6842462 Ramjee et al. Jan 2005 B1
6845095 Krishnarajah et al. Jan 2005 B2
6853851 Rautiola et al. Feb 2005 B1
6882678 Kong et al. Apr 2005 B2
6895255 Bridgelall May 2005 B1
6909705 Lee et al. Jun 2005 B1
6922559 Mohammed Jul 2005 B2
6925074 Vikberg et al. Aug 2005 B1
6937862 Back et al. Aug 2005 B2
6970719 McConnell et al. Nov 2005 B1
6975666 Affes et al. Dec 2005 B2
7009952 Razavilar et al. Mar 2006 B1
7012977 Madkour et al. Mar 2006 B2
7272176 Wei et al. Sep 2007 B2
7272397 Gallagher et al. Sep 2007 B2
7324584 Vigneron et al. Jan 2008 B1
7873015 Gallagher et al. Jan 2011 B2
8270453 Khayrallah et al. Sep 2012 B2
20010003443 Velazquez et al. Jun 2001 A1
20010020912 Naruse et al. Sep 2001 A1
20010021646 Antonucci et al. Sep 2001 A1
20010028677 Wang et al. Oct 2001 A1
20010029186 Canyon et al. Oct 2001 A1
20010031645 Jarrett Oct 2001 A1
20010046266 Rakib et al. Nov 2001 A1
20010046860 Lee Nov 2001 A1
20010049790 Faccin et al. Dec 2001 A1
20020001299 Petch et al. Jan 2002 A1
20020032030 Berglund et al. Mar 2002 A1
20020045459 Morikawa Apr 2002 A1
20020051433 Affes et al. May 2002 A1
20020059516 Turtianinen et al. May 2002 A1
20020066036 Makineni et al. May 2002 A1
20020075844 Hagen Jun 2002 A1
20020080797 Kim Jun 2002 A1
20020082015 Wu Jun 2002 A1
20020085516 Bridgelall Jul 2002 A1
20020102974 Raith Aug 2002 A1
20020118674 Faccin et al. Aug 2002 A1
20020132630 Arazi et al. Sep 2002 A1
20020142761 Wallstedt et al. Oct 2002 A1
20020147008 Kallio Oct 2002 A1
20020147016 Arazi et al. Oct 2002 A1
20020155829 Proctor, Jr. et al. Oct 2002 A1
20020160811 Jannette et al. Oct 2002 A1
20020166068 Kilgore Nov 2002 A1
20020172173 Schilling et al. Nov 2002 A1
20020176488 Kober Nov 2002 A1
20020191575 Kalavade et al. Dec 2002 A1
20020191676 Kenneth Dec 2002 A1
20020196840 Anderson et al. Dec 2002 A1
20020197984 Monin et al. Dec 2002 A1
20030007475 Tsuda et al. Jan 2003 A1
20030031151 Sharma et al. Feb 2003 A1
20030043773 Chang Mar 2003 A1
20030053524 Dent Mar 2003 A1
20030053526 Reznik Mar 2003 A1
20030087653 Leung et al. May 2003 A1
20030092456 Dent May 2003 A1
20030095529 Petre et al. May 2003 A1
20030112789 Heinonen et al. Jun 2003 A1
20030112904 Fuller et al. Jun 2003 A1
20030119480 Mohammed Jun 2003 A1
20030119490 Mohammed Jun 2003 A1
20030119527 Labun et al. Jun 2003 A1
20030119548 Mohammed Jun 2003 A1
20030130008 Rajaniemi et al. Jul 2003 A1
20030139180 McIntosh et al. Jul 2003 A1
20030142673 Patil et al. Jul 2003 A1
20030172264 Dillon Sep 2003 A1
20030176181 Boesjes Sep 2003 A1
20030176186 Mohammed Sep 2003 A1
20030193952 O'Neill Oct 2003 A1
20030202486 Anton, Jr. et al. Oct 2003 A1
20030210199 Sward et al. Nov 2003 A1
20030219022 Dillon et al. Nov 2003 A1
20030219024 Purnadi et al. Nov 2003 A1
20030226017 Palekar et al. Dec 2003 A1
20040008648 Schmidl et al. Jan 2004 A1
20040008649 Wybenga et al. Jan 2004 A1
20040009749 Arazi et al. Jan 2004 A1
20040010620 Salo et al. Jan 2004 A1
20040013099 O'Neill Jan 2004 A1
20040025018 Haas et al. Feb 2004 A1
20040037312 Spear Feb 2004 A1
20040053623 Hoff et al. Mar 2004 A1
20040068571 Ahmavaara Apr 2004 A1
20040068653 Fascenda Apr 2004 A1
20040071197 Lin Apr 2004 A1
20040077346 Krenik et al. Apr 2004 A1
20040077354 Jason et al. Apr 2004 A1
20040077355 Krenik et al. Apr 2004 A1
20040077356 Krenik et al. Apr 2004 A1
20040077374 Terry Apr 2004 A1
20040087307 Ibe et al. May 2004 A1
20040116120 Gallagher et al. Jun 2004 A1
20040136445 Olson et al. Jul 2004 A1
20040147223 Cho Jul 2004 A1
20040171378 Rautila Sep 2004 A1
20040192211 Gallagher et al. Sep 2004 A1
20040202132 Heinonen et al. Oct 2004 A1
20040203346 Myhre et al. Oct 2004 A1
20040203458 Nigra Oct 2004 A1
20040203737 Myhre et al. Oct 2004 A1
20040203800 Myhre et al. Oct 2004 A1
20040203812 Malladi et al. Oct 2004 A1
20040203815 Shoemake et al. Oct 2004 A1
20050063500 Li et al. Mar 2005 A1
20050064896 Rautiola et al. Mar 2005 A1
20050078769 Lo Apr 2005 A1
20050101245 Ahmavaara May 2005 A1
20050101329 Gallagher May 2005 A1
20050181805 Gallagher Aug 2005 A1
20050186948 Gallagher et al. Aug 2005 A1
20050198199 Dowling Sep 2005 A1
20050207395 Mohammed Sep 2005 A1
20050255879 Shi et al. Nov 2005 A1
20050265279 Markovic et al. Dec 2005 A1
20050266853 Gallagher et al. Dec 2005 A1
20050271008 Gallagher et al. Dec 2005 A1
20050272424 Gallagher et al. Dec 2005 A1
20050272449 Gallagher et al. Dec 2005 A1
20060007895 Coralli et al. Jan 2006 A1
20060009201 Gallagher et al. Jan 2006 A1
20060009202 Gallagher et al. Jan 2006 A1
20060019656 Gallagher et al. Jan 2006 A1
20060019657 Gallagher et al. Jan 2006 A1
20060019658 Gallagher et al. Jan 2006 A1
20060025143 Gallagher et al. Feb 2006 A1
20060025144 Gallagher et al. Feb 2006 A1
20060025145 Gallagher et al. Feb 2006 A1
20060025146 Gallagher et al. Feb 2006 A1
20060025147 Gallagher et al. Feb 2006 A1
20060079258 Gallagher et al. Apr 2006 A1
20060079259 Gallagher et al. Apr 2006 A1
20060079273 Gallagher et al. Apr 2006 A1
20060079274 Gallagher et al. Apr 2006 A1
20060098598 Gallagher May 2006 A1
20060153283 Scharf et al. Jul 2006 A1
20060229051 Narayan Oct 2006 A1
20060233224 Lotter et al. Oct 2006 A1
20070121554 Luo et al. May 2007 A1
20080019429 Reznik Jan 2008 A1
Foreign Referenced Citations (31)
Number Date Country
4201439 Jul 1993 DE
4326843 Feb 1995 DE
4343959 Jun 1995 DE
0558910 Jan 1993 EP
0610989 Jan 1994 EP
0936777 Aug 1999 EP
0610989 Jan 2000 EP
1207708 Oct 2004 EP
2280575 Feb 1995 GB
2282735 Apr 1995 GB
2000-13360 Jan 2000 JP
WO 9204796 Mar 1992 WO
WO 9312590 Jun 1993 WO
WO 9724004 Jul 1997 WO
WO 9948312 Sep 1999 WO
WO 9948315 Sep 1999 WO
WO 0028762 May 2000 WO
WO 0051387 Aug 2000 WO
WO 0245456 Jun 2002 WO
WO 03039009 May 2003 WO
WO 03039009 May 2003 WO
WO 03092312 Nov 2003 WO
WO 2004002051 Dec 2003 WO
WO 2004034219 Apr 2004 WO
WO 2004036770 Apr 2004 WO
WO 2004039111 May 2004 WO
WO 2005006597 Jan 2005 WO
WO 2005107169 Nov 2005 WO
WO 2005107297 Nov 2005 WO
PCTUS2005016767 Dec 2005 WO
WO 2005114918 Dec 2005 WO
Non-Patent Literature Citations (50)
Entry
Wang et al., Orthogonal subspace projection-based approaches to classification of MR image sequences, pp. 465-474, 2001.
“Digital cellular telecommunications system (Phase 2+); Universal Mobile Telecommunications System (UMTS); Mobile radio interface Layer 3 specification; Core network protocols; Stage 3 (3GPP TS 24.008 version 5.6.0 Release 5); ETSI TS 124 008,” ETSI Standards Institute, Sophia-Antipo, FR, vol. 3-CN1, No. V5.6.0, Dec. 2002, pp. 293-317, XP014007949, ISSN: 0000-001. 29 pages.
ETSI TS 100 940 V7.19.1 (Apr. 2003), “Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification(3GPP TS 04.08 version 7.19.1 Release 1998),” V7.19.1 Publication, Apr. 2003. 630 pages.
International Search Report and Written Opinion of a Related Application with mail date of Mar. 13, 2006, re PCT/US2005/040689. 12 pages.
Non-published patent application (specification, drawings, claims, abstract) of a related pending U.S. Appl. No. 11/097,866. 68 pages.
Non-published patent application (specification, drawings, claims, abstract) of a related pending U.S. Appl. No. 11/349,024. 110 pages.
Perkins, Charles E., “Simplified Routing for Mobile Computers Using TCP/IP, Wireless LAN Implementation,” IBM T.J. Watson Research Center, 0-8186-2625-9/92 1992 Proceeding, IEEE Conference on Sep. 17-18, 1992, pp. 7-13. 7 pages.
Wu et al., “Intelligent Handoff for Mobile Wireless Internet,” Mobile Networks and Applications 6, 2001 Kluwer Academic Publishers, Manufactured in The Netherlands, 2001, pp. 67-79. 13 pages.
Notice of Allowance and Fee(s) Due with mail date of May 3, 2010 re U.S. Appl. No. 11/204,606. 7 Pages.
Scharf, et al., “Matched Subspace Detectors,” IEEE Transactions on Signal Processing, vol. 42, No. 8, pp. 2146-2157, Aug. 1994.12 pages.
Price, et al., “A Communication Technique for Multipath Channels,” Proceedings of the IRE, vol. 46, The Institute of Radio Engineers, New York, NY, US, pp. 555-570. 1958. 16 pages.
Schlegel, Christian, Alexander, Paul and Roy, Sumit, “Coded Asynchronous CDMA and Its Efficient Detection,” IEEE Transactions on Information Theory, vol. 44, No. 7, Nov. 1998. 11 pages.
Xie, Zhenhua; Short, Robert T. and Rushforth, Craig K., “A Family of Suboptimum Detectors for Coherent Multiuser Communications,” IEEE Journal on Selected Areas in Communications, vol. 8, No. 4, May 1990.pp. 683-690. 8 pages.
Viterbi, Andrew J., “Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels,” IEEE Journal on Selected Areas in Communications, vol. 8, No. 4, May 1990, pp. 641-649. 9 pages.
Verdu, Sergio, “Minimum Probability of Error for Asynchronous Gaussian Multiple-Access Channels,” IEEE Transactions on Information Theory, vol. IT-32, No. 1, Jan. 1986. pp. 85-96 .12 pages.
Behrens, Richard T. and Scharf, Louis I., “Signal Processing Applications of Oblique Projection Operators,” IEEE Transactions on Signal Processing, vol. 42, No. 6, Jun. 1994, pp. 1413-1424. 12 pages.
Alexander, Paul D., Rasmussen, Lars K., and Schlegel, Christian B., “A Linear Receiver for Coded Multiuser CDMA,” IEEE transactions on Communications, vol. 45, No. 5, May 1997. 6 pages.
Schlegel, Christian; Roy, Sumit; Alexander, Paul D.; and Xiang, Zeng-Jun, “Multiuser Projection Receivers,” IEEE Journal on Selected Areas in Communications, vol. 14, No. 8, Oct. 1996. 9 pages.
Halper, Christian; Heiss, Michael; and Brasseur, Georg, “Digital-to-Analog Conversion by Pulse-Count Modulation Methods,” IEEE Transactions on Instrumentation and Measurement, vol. 45, No. 4, Aug. 1996. 10 pages.
Ortega, J.G.; Janer, C.L.; Quero, J.M.; Franquelo, L.G.; Pinilla, J.; and Serrano, J., “Analog to Digital and Digital to Analog Conversion Based on Stochastic Logic,” IEEE 07803-3026-9/95, 1995. 5 pages.
Lin, Kun; Zhao, Kan; Chui, Edmund; Krone, Andrew; and Nohrden, Jim; “Digital Filters for High Performance Audio Delta-sigma Analog-to-Digital and Digital-to-Analog Conversions,” Proceedings of ICSP 1996, Crystal Semiconductor Corporation, Ausitn, TX,US. pp. 59-63. 5 pages.
Schlegel, C.B.; Xiang, Z-J.; and Roy, S., “Projection Receiver: A New Efficient Multi-User Detector,” IEEE 0-7803-2509-5/95, 1995. 5 pages.
Affes, Sofiene; Hansen, Henrik; and Mermelstein, Paul, “Interference Subspace Rejection: A Framework for Multiuser Detection in Wideband CDMA,” IEEE Journal on Selected Areas in Communications, vol. 20, No. 2, Feb. 2002. 16 pages.
Schneider, Kenneth S., “Optimum Detection of Code Division Multiplexed Signals,” IEEE Transactions on Aerospace and Electronic Systems, vol. AES-15, No. 1, Jan. 1979.pp. 181-185. 5 pages.
Mitra, Urbashi, and Poor, H. Vincent, “Adaptive Receiver Algorithms for Near-Far Resistant CDMA,” IEEE Transactions of Communications, vol. 43, No. 2/3/4, Feb./Mar./Apr. 1995. 12 pages.
Lupas, Ruxandra and Verdu, Sergio, “Near-Far Resistance of Multiuser Detectors in Asynchronous Channels,” IEEE transactions on Communications, vol. 38, No. 4, Apr. 1990. 13 pages.
Lupas, Ruxandra and Verdu, Sergio, “Linear Multiuser Detectors for Synchronous Code-Division Multiple-Access Channels,” IEEE Transactions on Information Theory, vol. 35, No. 1, Jan. 1989. 14 pages.
Cheng, Unjeng, Hurd, William J., and Statman, Joseph I., “Spread-Spectrum Code Acquisition in the Presence of Doppler Shift and Data Modulation,” IEEE Transactions on Communications, vol. 38, No. 2, Feb. 1990. 10 pages.
Behrens, Richard T. and Scharf, Louis L., “Parameter Estimation in the Presence of Low Rank Noise,” 22ACSSC-12/88/0341, pp. 341-344, Maple Press, Nov. 1988. Proceeding of the Twenty-second Asilomar Conference on Signals Systems and Computers, Pacific Grove, C.A.4 pages.
Iltis, Ronald A. and Mailaender, Laurence, “Multiuser Detection of Quasisynchronous CDMA Signals Using Linear Decorrelators,” IEEE Transactions on Communications, vol. 44, No. 11, Nov. 1996. 11 pages.
Duel-Hallen, Alexandra, “Decorrelating Decision-Feedback Multiuser Detector for Synchronous Code-Division Multiple-Access Channel,” IEEE Transactions on Communications, vol. 41, No. 2, Feb. 1993, pp. 285-290. 6 pages.
Schlegel, Christian and Xiang, Zengjun, “A New Projection Receiver for Coded Synchronous Multi-User CDMA Systems,” Proceedings, 1995, IEEE International Symposium on Information Theory, p. 318, Sep. 17, 1995. 1 page.
Zheng, Fu-Chun and Barton, Stephen K., “On the Performance of Near-Far Resistant CDMA Detectors in the Presence of Synchronization Errors,” IEEE Transactions on Communications, vol. 43, No. 12 (pp. 3037-3045), Dec. 1995. 9 pages.
Mitra, Urbashi and Poor, H. Vincent, “Adaptive Decorrelating Detectors for CDMA Systems,” Accepted for publication in the Wireless Personal Communications Journal, accepted May 1995. 25 pages.
Frankel et al., “High-performance photonic analogue-digital converter,” Electronic Letters, Dec. 4, 1997, vol. 33, No. 25, pp. 2096-2097. 2 pages.
Stimson, George W., “An Introduction to Airborne Radar,” 2nd Edition, SciTech Publishing Inc., Mendham, NJ,US. 1998, pp. 163-176 and 473-491. 40 pages.
Kaplan, Elliott D., Editor, “Understanding GPS—Principles and Applications,” Artech House, Norwood MA,US. 1996, pp. 152-236. (Provided publication missing pp. 83-151.) 46 pages.
Rappaport, Theodore S., Editor, “Wireless Communications—Principles & Practice,” Prentice Hall, Upper Saddle River, NJ,US, 1996, pp. 518-533. 14 pages.
Best, Roland E., “Phase-Locked Loops—Design, Simulation, and Applications,” 4th edition, McGraw-Hill, 1999. pp. 251-287. 23 pages.
Garg, Vijay K. and Wilkes, Joseph E., “Wireless and Personal Communications Systems,” Prentice Hall PTR, Upper Saddle River, NJ, US. pp. 79-151, 1996. 45 pages.
Kohno, Ryuji, Imaj, Hideki, and Hatori, Mitsutoshi, “Cancellation techniques of Co-Channel Interference in Asynchronous Spread Spectrum Multiple Access Systems,” Electronics and Common. In Japan, May 1983, vol. J 56-A, pp. 20-29, No. 5. 8 pages.
Thomas, John K., “Thesis for the Doctor of Philosophy Degree,” UMI Dissertation Services, Jun. 28, 1996. Ann Arbor, MI, US. 117 pages.
Viterbi, Andrew J., “CDMA—Principles of Spread Spectrum Communication,” Addison-Wesley Publishing Company, Reading, MA,US. 1995, pp. 11-75 and 179-233. 66 pages.
Behrens, Richard T., “Subspace Signal Processing in Structured Noise,” UMI Dissertation Services, Ann Arbor, MI,US.Nov. 30, 1990. 166 pages.
Scharf, Louis L., “Statistical Signal Processing—Detection, Estimation, and Time Series Analysis,” Addison-Wesley Publishing Company, Reading, MA, US. 1991, pp. 23-75 and 103-178. 74 pages.
Preliminary Amendment submitted on Sep. 29, 2010, re U.S. Appl. No. 12/871,776. 8 pages.
Office Action with mail date of Feb. 21, 2007, re U.S. Appl. No. 11/129,131, 22 pages.
Final Office Action with mail date of Aug. 18, 2006, re U.S. Appl. No. 11/226,610, 13 pages.
B. Widrow, S. Sterns, Adaptive Signal Processing, Prentice-Hall Signal Processing Series, 1985. 84 pages.
Non-Final Office Action dated Jul. 31, 2008 for U.S. Appl. No. 11/100,935, 35 pages.
Related Publications (1)
Number Date Country
20110096767 A1 Apr 2011 US
Continuations (2)
Number Date Country
Parent 12871776 Aug 2010 US
Child 12966931 US
Parent 11204606 Aug 2005 US
Child 12871776 US
Continuation in Parts (7)
Number Date Country
Parent 11192763 Jul 2005 US
Child 11204606 US
Parent 11100935 Apr 2005 US
Child 11192763 US
Parent 10773777 Feb 2004 US
Child 11100935 US
Parent 10686359 Oct 2003 US
Child 10773777 US
Parent 10686829 Oct 2003 US
Child 10686359 US
Parent 10294834 Nov 2002 US
Child 10686829 US
Parent 10247836 Sep 2002 US
Child 10294834 US