US 7,751,854 B2Grant
Null deepening for an adaptive antenna based communication station
Issue Date:2010-07-06
•29 Claims
•7 Drawing Sheets
Abstract
A method and apparatus is described for modifying a smart antenna processing strategy determined from a set of signals received at an array of antenna elements of a wireless station, such as a set of weights for processing received antenna signals or forming a set of antenna signals for transmission. The method and apparatus uses the signatures of one or more interferers to produce a modified processing strategy that improves the nulling to the one or more interferers in that, when the modified strategy is applied on the downlink, the transmit signal strength in the direction of the one or more interferers is decreased, and, when the modified strategy is applied on the uplink, the sensitivity to signals from the direction of the one or more interferers is decreased.
Metadata
Assignee
- Intel Corporation
Inventors
- Mark C. Leifer
- Tibor Boros
- Mitchell D. Trott
- Louis C. Yun
Application Information
Application Number:US 11/523,971
Filing Date:2006-09-19
Priority Date:1999-06-21
Art Unit:2618
Classifications
IPC:
H04M1/00
Patent Drawings (7 sheets)
Description
[0001] The present application is a continuation of U.S. patent application Ser. No. 09/336,933 filed Jun. 21, 1999, now U.S. Pat. No. 7,139,592 entitled “NULL DEPENDING FOR AN ADAPTIVE ANTENNA BASED COMMUNICATION STATION”, which is incorporated herein by reference.
FIELD OF INVENTION
[0002] This invention relates to the field of wireless communication systems, and more specifically, to a method and apparatus for decreasing the transmitted power aimed at an interferer during transmission or the sensitivity to signals transmitted from the interferer during reception in order for a communications station to communicate to or from one or more remote subscriber units, the communication station having an adaptive antenna array and adaptive smart antenna processing.
BACKGROUND TO THE INVENTION
[0003] Adaptive smart antenna processing may be used in a communication station (e.g., a base station) equipped with multiple antennas to either reject interference when communicating from a subscriber unit to the communication station (i.e., on the uplink) or to deliver power in a spatially or spatio-temporally selective manner when communicating from the communication station to a subscriber unit (i.e., on the downlink). With smart antenna communication systems that use linear spatial processing for the adaptive smart antenna processing, during uplink communications, one applies amplitude and phase adjustments, typically but not necessarily in baseband to each of the signals received at the antenna array elements to select (i.e., preferentially receive) the signals of interest while minimizing any signals or noise not of interest—that is, the interference. Such baseband amplitude and phase adjustment can be described by a complex valued weight, the receive weight, and the receive weights for all elements of the array can be described by a complex valued vector, the receive weight vector. Similarly, the downlink signal is processed by adjusting the amplitude and phase of the baseband signals that are transmitted by each of the antennas of the antenna array. Such amplitude and phase control can be described by a complex valued weight, the transmit weight, and the weights for all elements of the array by a complex valued vector, the transmit weight vector. In some systems, the receive (and/or transmit) weights include temporal processing, and in such cases, the receive (and/or transmit) weights may be functions of frequency and applied in the frequency domain or, equivalently, functions of time applied as convolution kernels. Alternatively, each convolution kernel, if for sampled signals, may itself be described by a set of complex numbers, so that the vector of convolution kernels may be re-written as a complex values weight vector, which, for the case of there being M antennas and each kernel having K entries, would be a vector of KM entries.
[0004] Many methods are known for performing interference rejection or selective power delivery. Examples include least-squares beamforming and zero-forcing beamforming. Selective power delivery must balance competing goals. In general, the power delivered to one remote user cannot be simultaneously maximized while the power delivered to another remote user is minimized. More generally, if several remote users require power minimization (i.e., nulling), the relative power delivered to each must be traded off. This tradeoff can be based on a number of factors. For example, for a given interferer (which might be a co-channel user), a deeper null (i.e., decreased transmitted power aimed at an interferer during transmission or decreased sensitivity to signals transmitted from the interferer during reception) may be requited for a remote user co-participating in the spatial channel established at the base station than for a remote user communicating with a different base station.
[0005] A disadvantage of known methods, such as least-squares and zero-forcing, is their inability to flexibly perform this tradeoff. Zero-forcing methods attempt to direct perfect nulls towards all interferers, regardless of the power delivered to the desired remote user. Least-squares methods minimize a cost function which, when the uplink strategies are used to determine downlink strategies, on the downlink directs strongest nulls to remote users who were received most strongly on the uplink. Neither zero-forcing nor least-squares behavior may be appropriate for some systems.
[0006] A particular case where least-squares nulling behavior is undesirable occurs when subscriber units are subject to the “near/far problem.” In the near/far problem, one subscriber unit, say one denoted SU1, is far from the base station while a second subscriber unit, say one denoted SU2, is close. When the downlink weight vector, denoted w1, is computed for SU1, signals from SU2 are seen as interference and a null is formed towards SU2. The depth of the null in the direction of SU2 is limited by noise and other factors, including the possibility that the transmitted powers of subscriber units are adjusted such that equal power levels are received by the base station. If high power is used to reach SU1 during base station transmit, then excessive signal levels leaking “through” in the imperfect null can disturb SU2. A deeper null towards SU2 is therefore desirable.
[0007] A disadvantage of zero-forcing methods is the need for the base station to have complete knowledge of all remote user and interferer spatial signatures (or spatio-temporal signatures). The receive spatial signature and the receive spatio-temporal signature characterizes how the base station array receives signals from a particular subscriber unit in the absence of any interference or other subscriber units. The transmit spatial signature and the transinit spatio-temporal signature of a particular remote user characterizes how the remote user receives signals from the base station in the absence of any interference. See U.S. Pat. No. 5,592,490 entitled SPECTRALLY EFFICIENT HIGH CAPACITY WIRELESS COMMUNICATION SYSTEMS, to Barratt et al., assigned to the assignee of the present invention and incorporated herein by reference, and U.S. Pat. No. 5,828,658 entitled SPECTRALLY EFFICIENT HIGH CAPACITY WIRELESS COMMUNICATION SYSTEMS WITH SPATIO-TEMPORAL PROCESSING, to Ottersten et al., also assigned to the assignee of the present invention and incorporated herein by reference, for spatial processing and spatio-temporal processing methods that use spatial and spatio-temporal signatures. Note that because a signature may be a spatial signature or a spatio-temporal signature, depending on whether the smart antenna processing is spatial or spatio-temporal, the term signature will be used herein, and whether the signature is spatial or spatio-temporal will depend on whether the processing is spatial or spatio-temporal, and whether the signature is a transmit or a receive signature will depend on the context, and which signature will be clear to those of ordinary skill in the art from the context.
[0008] Determining all spatial signatures of all remote users and all interferers may often be impossible to carry out accurately if any of the interferers are weak or have a signal structure that is a priori unknown, or because of computational power limitations.
[0009] In the uplink direction, increasing the depth of a null (i.e, decreasing sensitivity to signals received from a particular interferer) is desirable when the uplink strategy, for example the uplink weight vector, computed from a previous burst is used in predictive mode, e.g., for new data. When uplink remote users are executing power control, for example to control received power at the base station or to reduce transmit power during periods of voice or data inactivity, their uplink power may vary widely from burst to burst. Similar effects occur in fading environments. Thus, if a least-squares approach is used, the null depth obtained from a strategy computed for the previous burst may be inappropriate for the current burst.
[0010] Thus there is a need in the art for a flexible method for directing precise and deep nulls on the uplink or downlink direction. There also is a need in the art for a method and apparatus for estimating one or more signatures in the direction of one or more interferers to use, for example, for such null deepening. There also is a need for a method for using a signature estimate of an interferer for directing precise and deep nulls in the direction of the interferer. There also is a need in the art for a method for directing precise and deep nulls in the direction of one or more interferers while substantially maintaining the other nulling and gain-patterns of a provided adaptive smart antenna processing strategy.
SUMMARY
[0011] An advantage of the present invention is that it provides a flexible method for directing precise and deep nulls (i.e., decreasing the transmitted power aimed at an interferer during transmission or decreasing the sensitivity to signals transmitted from the interferer during reception) on the uplink or downlink direction.
[0012] Another advantage of the present invention is that it provides a method and apparatus for estimating one or more signatures in the direction of one or more interferers.
[0013] Another advantage of the present invention is that it provides a method for using a signature estimate of an interferer for directing precise and deep nulls in the direction of the interferer.
[0014] Another advantage of the present invention is that it provides a method for directing precise and deep nulls in the direction of one or more interferers while substantially maintaining the other nulling and gain patterns of a provided adaptive smart antenna processing strategy.
[0015] Another advantage of the present invention is that it provides a null deepening method that essentially requires only an estimate signature of any interferer to deepen the null to that interferer, without needing a full set of signatures, and in particular, without needing the signature of the desired remote user.
[0016] One aspect of the invention is a method for determining, in a communication station using multiple antennas, improved uplink or downlink processing strategies, for example in the form of uplink or downlink weights for linear mart antenna processing, for which one or more nulls have a controlled depth. The method can be applied as a modification to a variety of known techniques for uplink and downlink strategy computation. The method needs as side information only the signatures of those remote users to which controlled nulls are to be directed. Other nulls in the array pattern, for which no signature estimates may be available, are substantially preserved. Another aspect of the invention includes estimating the required signatures. Another aspect of the invention modifies existing uplink and downing strategy computation methods by injecting into the received signal sequence a synthetic signal whose signature equals that of the estimated remote user direction, and whose power is proportional to the desired null depth.
[0017] To overcome the limitations on null depth imposed by having a limited number of array samples, in an improved version of the invention, the signatures in the directions to be nulled are estimated by combining measurements over several bursts. An aspect of the invention identifies a particular type of signature estimation technique that combines favorably with the synthetic signal-injection method.
BRIEF DESCRIPTION OF THE DRAWINGS
[0018] The present invention will be more fully understood from the description of the preferred embodiments of the invention, which, however, should not be taken to limit the invention to any specific embodiment but are for purposes of explanation and to provide a better understanding of the inventive apparatus and method. The preferred embodiments may be better understood with reference to the following figures:
[0019] FIG. 1 is a functional block diagram of a multi-antenna transceiver system which includes elements suitable for implementing the method of the present invention;
[0020] FIG. 2 is a more detailed block diagram of a transceiver that includes a signal processor capable of executing a set of instructions for implementing the method of the present invention;
[0021] FIG. 3 is a block diagram showing a strategy computation method and apparatus having as input a set of input signal data and a reference signal for the set of input data;
[0022] FIG. 4 is a block diagram illustrating a reference signal generator that may be used in any of the embodiments of the invention;
[0023] FIG. 5 is a block diagram illustrating a strategy computation method and apparatus that uses estimates of one or more characteristic features of a set of signal data;
[0024] FIG. 6 is a block diagram illustrating some of the signal processing operations applied to received data when implementing an embodiment of the inventive method using the strategy computation of FIG. 3 ;
[0025] FIG. 7 is a block diagram illustrating some of the signal processing operations applied to received data when implementing an embodiment of the inventive method for is deepening more than one null;
[0026] FIG. 8 is a block diagram illustrating some of the signal processing operations applied to received data when implementing an embodiment of the inventive method using the strategy computation of FIG. 5 with the characteristic feature being the covariance;
[0027] FIG. 9 is a block diagram illustrating some of the signal processing operations applied to received data when implementing yet another embodiment of the inventive method using a noise-plus-interference covariance estimator;
[0028] FIG. 10 is a block diagram showing the signal injection based embodiment of the inventive method applied to a non-linear processing strategy;
[0029] FIG. 11 is a block diagram showing generalized combining method with the signal injection embodiment of the inventive method applied to a processing strategy;
[0030] FIG. 12 is a block diagram showing using a signal injection embodiment of the inventive method applied to a processing strategy generator to generate parameters that are then used to process downlink data;
[0031] FIG. 13 is a block diagram showing a covariance modification embodiment of the of the inventive method applied to a covariance based processing strategy generator which uses a reference signal, primary data, and a covariance estimator;
[0032] FIG. 14 is a block diagram showing an alternate embodiment of the combining of the input signal covariance estimate and interferer signature covariance estimate;
[0033] FIG. 15 is a block diagram showing a covariance modification embodiment of the of the inventive method applied to a covariance based processing strategy generator which uses a reference signal, primary data, and a noise-plus-interference covariance estimator; and
[0034] FIG. 16 is a plot of the performance obtained by using aspects of the invention in a simulated environment.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Adaptive Smart-Antenna Processing
[0035] The invention is directed to a processing method for altering the transmit or receive weights used by a communication station to define a transmitted signal or to process a received signal in order to deepen or otherwise manipulate the depth of a null formed to mitigate the effects of one or more known interferers. The interferer may or may not be another remote user sharing the same communication channel with the same base station. The invention may be implemented in a communication station that includes a receiver, an array of antennas and means for adaptive smart antenna processing of received signals. The invention may also be implemented in a communication station that includes a transmitter, an array of antennas, and means for adaptive smart antenna processing of transmitted signals. In a preferred embodiment, the communication station includes a transceiver and the capability of implementing both uplink and downlink adaptive smart antenna processing.
[0036] When receiving a signal from a subscriber (remote) unit, the signals received by each of the antenna array elements are combined by the adaptive smart antenna processing elements to provide an estimate of a signal received from that subscriber unit. In the preferred embodiment, the smart antenna processing comprises linear spatial processing, wherein each of the complex-valued (i.e., including in-phase I and quadrature Q components) signals received from the antenna elements is weighted in amplitude and phase by a weighting factor and the weighted signals are then summed to provide the signal estimate. The adaptive smart antenna processing scheme (i.e., the strategy) can then be described by a set of complex valued weights, one for each of the antenna elements. These complex valued weights can be described as a single complex valued vector of M elements, where M is the number of antenna elements. Thus, in the linear case, the smart antenna processing is designed to determine a set of weights such that the sum of the products of the weights times the antenna element signals provides an estimate of the remote user's transmitted signal which satisfies some prescribed “estimation quality” measure.
[0037] This representation of the adaptive smart antenna processing can be extended to include spatio-temporal processing, where the signal at each antenna element, rather than being weighted in amplitude and phase, is filtered by a complex valued filter, typically for purposes of time equalization. In such a method, each filter can be described by a complex-valued transfer function or convolving function. The adaptive smart antenna processing of all elements can then be described by a complex valued M-vector of M complex valued convolving functions.
[0038] Several methods are known for determining the weighting vectors to be applied when processing received signals. These include methods that determine the directions of arrival of signals from subscriber units, and methods that use the spatial or spatio-temporal characteristics of subscriber units, for example, the spatial or spatio-temporal signatures. See for example U.S. Pat. Nos. 5,515,378 and 5,642,353, entitled “SPATIAL DIVISION MULTIPLE ACCESS WIRELESS COMMUNICATION SYSTEMS”, to Roy, et al., assigned to the assignee of the present invention and the contents of which are incorporated herein by reference, for methods that use directions of arrival. See also the above-referenced U.S. Pat. Nos. 5,592,490 and 5,828,658 for methods that use spatial and spatio-temporal signatures.
[0039] “Blind” methods determine the weights from the signals themselves, but without resorting to a priori knowledge such as training signals or silent periods, that is, without determining what weights can best estimate a known symbol sequence (or in the case of the period silence, the absence of a known sequence). Such blind methods typically use some known characteristic of the signal transmitted by the subscriber unit to determine the best receive weights to use by constraining the estimated signal to have this property, and hence are sometimes referred to as property restoral methods.
[0040] Property restoral methods in turn can be classified into two groups. Simple property restoral methods restore one or more properties of the signal without completely reconstructing the modulated received signal, for example by demodulating and then re-modulating. More complex restoral methods typically rely upon reconstruction of the received signal.
[0041] Property restoral methods determine a signal (a “reference signal”) that is constrained to the required property and then determine a set of weights corresponding to the reference signal, such that if the reference signal was transmitted by a remote user, the signals at the antenna elements of the receiving array would be acceptably “close” to the signals actually received. One example of a simple restoral method is the constant modulus (CM) method, which is applicable to communication systems that use a modulation scheme having a constant modulus, including, for example phase modulation (PM), frequency modulation (FM), phase shift keying (PSK) and frequency shift keying (FSK). The CM method has also been shown to be applicable to non-CM signals. Other partial property restoral techniques include techniques that restore the spectral properties of the signal, such as the signal's spectral self-coherence.
[0042] “Decision directed” (DD) methods construct a reference signal by making symbol decisions (e.g., demodulating) the received signal. Such decision directed methods use the fact that the modulation scheme of the transmitted subscriber unit signal is known, and then determine a signal (a “reference signal”) that is constrained to have the characteristics of the required modulation scheme. In such a case, the reference signal production process includes making symbol decisions. Weights are determined that produce a reference signal, that if transmitted by a remote user, would produce signals at the antenna elements of the array that are acceptably “close” to the signals actually received. See, for example, U.S. patent application Ser. No. 08/729,390, entitled “METHOD & APPARATUS FOR DECISION DIRECTED DEMODULATION USING ANTENNA ARRAYS & SPATIAL PROCESSING” to Barratt, et al., and Ser. No. 09/153,110, entitled “METHOD FOR REFERENCE SIGNAL GENERATION IN THE PRESENCE OF FREQUENCY OFFSETS IN A COMMUNICATION STATION WITH SPATIAL PROCESSING” to Petrus, et al., both of which are assigned to the assignee of the present invention and the contents of which are incorporated herein by reference, for descriptions of systems that use decision directed weight determination methods.
[0043] As previously mentioned, weight determining schemes also are known that use training data, that is, data whose symbols are known a priori. The training data (possibly with a timing offset or frequency offset, or both applied) is then used as a reference signal to determine the smart antenna processing strategy (e.g., the weights). Therefore, reference signal based methods include the case in which the reference signal includes training data, the case in which the reference signal includes a signal constrained to have some property of the transmitted signal, and the case in which the reference signal includes constructing a signal based on making symbol decisions.
[0044] Non-linear uplink and downlink processing strategies also are known. In the uplink direction, such methods typically include demodulation and act to determine an estimate of the symbols transmitted by a desired remote user from the set of signals received at the antenna elements of the communication station. One known example of such a processing scheme is based on a Viterbi algorithm using branch metrics. In this regard, it is noted that the present invention is not limited to linear spatial and spatio-temporal processing methods that include weight determining, but also is equally applicable to non-linear methods such as those based on Viterbi algorithms and branch metrics, which may not necessarily include determining weights.
[0045] In theory, adaptive smart antenna processing permits more than one communication link to exist in a single “conventional” communication channel so long as the subscriber units that share the conventional channel can be spatially (or spatio-temporally) resolved. A conventional channel includes a frequency channel in a frequency division multiple access (FDMA) system, a time slot in a time division multiple access (TDMA) system (which usually also includes FDMA, so the conventional channel is a time and frequency slot), and a code in a code division multiple access (CDMA) system. The conventional channel is then said to be divided into one or more “spatial” channels, and when more than one spatial channel exists per conventional channel, the multiplexing is called space division multiple access (SDMA). SDMA is used herein to include the possibility of adaptive smart antenna processing, both with one and with more than one spatial channel per conventional channel.
Base Station Architecture
[0046] The preferred embodiment of the inventive method and apparatus is implemented in a communication receiver, in particular, a Personal Handyphone System (PHS)-based antenna-array communication station (transceiver) such as that shown in FIG. 1 , with M antenna elements in the antenna array. The PHS standard is described, for example, in the Association of Radio Industries and Businesses (ARIB, Japan) Preliminary Standard, Version 2, RCR STD-28 and variations are described in Technical Standards of the PHS Memorandum of Understanding Group (PHS MoU—see http://www.phsmou.or.jp). The preferred embodiments of the present invention may be implemented in two versions of the communication station of FIG. 1 , one aimed at low-mobility PHS system, with M=4, and another, aimed at a wireless local loop (WLL) system, with a variable number, with typically M=12.
[0047] While systems having some elements similar to that shown in FIG. 1 may be prior art, a system such as that of FIG. 1 with elements 131 and 133 capable of implementing the inventive method is not prior art. Note that the present invention is in no way restricted to using the PHS air interface or to TDMA systems, but may be utilized as part of any communication receiver that includes adaptive smart antenna processing means, including CDMA systems using the IS-95 air interface and systems that use the common GSM air interface.
[0048] In the system of FIG. 1 , a transmit/receive (“TR”) switch 107 is connected between an M-antenna array 103 and both transmit electronics 113 (including one or more transmit signal processors 119 and M transmitters 120), and receive electronics 121 (including M receivers 122 and one or more receive signal processors 123). Switch 107 is used to selectively connect one or more elements of antenna array 103 to the transmit electronics 113 when in the transmit mode and to receive electronics 121 when in the receive mode. Two possible implementations of switch 107 are as a frequency duplexer in a frequency division duplex (FDD) system, and as a time switch in a time division duplex (TDD) system.
[0049] The PHS form of the preferred embodiment of the present invention uses TDD. The transmitters 120 and receivers 122 may be implemented using analog electronics, digital electronics, or a combination of the two. The preferred embodiment of receivers 122 generate digitized signals that are fed to signal processor or processors 123. Signal processors 119 and 123 incorporate software and/or hardware for implementing the inventive method and may be static (always the same processing stages), dynamic (changing processing depending on desired directivity), or smart (changing processing depending on received signals). In the preferred embodiments of the invention, processors 119 and 123 are adaptive. Signal processors 119 and 123 may be the same DSP device or DSP devices with different programming for the reception and transmission, or different DSP devices, or different devices for some functions, and the same for others. Elements 131 and 133 are for implementing the method of the present invention for downlink and uplink processing, respectively, in this embodiment, and include programming instructions for implementing the processing methods.
[0050] Note that while FIG. 1 shows a transceiver in which the same antenna elements are used for both reception and transmission, it should be clear that separate antennas for receiving and transmitting may also be used, and that antennas capable of only receiving or only transmitting or both receiving and transmitting may be used with adaptive smart antenna processing.
[0051] The PHS system is an 8 slot time division multiple access (TDMA) system with true time division duplex (TDD). Thus, the 8 timeslots are divided into 4 transmit (TX) timeslots and 4 receive (RX) timeslots. This implies that for any particular channel, the receive frequency is the same as the transmit frequency. It also implies reciprocity, i.e., the propagation path for both the downlink (from base station to users' remote terminals) and the uplink (from users' remote terminals to base station) is identical, assuming minimal motion of the subscriber unit between receive timeslots and transmit timeslots. The frequency band of the PHS system used in the preferred embodiment is 1895-1918.1 MHz. Each of the 8 timeslots is 625 microseconds long. The PHS system includes a dedicated frequency and timeslot for a control channel on which call initialization takes place. Once a link is established, the call is handed to a service channel for regular communications. Communication occurs in any channel at the rate of 32 kbits per second (kbps), a rate termed the “full rate”. Less than full fate communication is also possible, and the details of how to modify the embodiments described herein to incorporate less than full rate communication would be clear to those of ordinary skill in the art.
[0052] In the PHS used in the preferred embodiment, a burst is defined as the finite duration RF signal that is transmitted or received over the air during a single timeslot. A group is defined as one set of 4 TX and 4 RX timeslots. A group always begins with the first TX timeslot, and its time duration is 8×0.625=5 msec.
[0053] The PHS system uses (π/4 differential quaternary (or quadrature) phase shift keying (π/4 DQPSK) modulation for the baseband signal. The baud rate is 192 kbaud. There are thus 192,000 symbols per second.
[0054] FIG. 2 is a more detailed block diagram of a transceiver that includes a signal processor capable of executing a set of instructions for implementing the method of the present invention. This is the version of the FIG. 1 system suitable for use in a low-mobility PHS system. In FIG. 2 , a plurality of M antennas 103 are used, where M=4. More or fewer antenna elements may be used. The outputs of the antennas are connected to a duplexer switch 107, which in this TDD system is a time switch. When receiving, the antenna outputs are connected via switch 107 to a receiver 205, and are mixed down in analog by RF receiver modules 205 from the carrier frequency (around 1.9 GHz) to an intermediate frequency (“IF”). This signal is then digitized (sampled) by analog to digital converters (“ADCs”) 209. The result is then down converted digitally by digital downconverter 213 to produce a four-times oversampled complex valued (in phase I and quadrature Q) sampled signal. Thus, elements 205, 209 and 213 correspond to elements that might be found in receiver 122 of FIG. 1 . For each of the M receive timeslots, the M downconverted outputs from the M antennas are fed to a digital signal processor (DSP) device 217 (hereinafter “timeslot processor”) for further processing. In the preferred embodiment, commercial DSP devices are used as timeslot processors, one per receive timeslot per spatial channel.
[0055] The timeslot processors 217 perform several functions, which may include the following: received signal power monitoring, frequency offset estimation/correction and timing offset estimation/correction, smart antenna processing (including determining receive weights for each antenna element to determine a signal from a particular remote user, in accordance with the present invention), and demodulation of the determined signal. The version of the uplink processing method of the invention as implemented in each timeslot processor 217 in the embodiment of FIG. 2 is shown as block-241.
[0056] The output of the timeslot processor 217 is a demodulated data burst for each of the M receive timeslots. This data is sent to host DSP processor 231 whose main function is to control all elements of the system and interface with the higher level processing (i.e., processing which deals with what signals are required for communications in the different control and service communication channels defined in the PHS communication protocol). In the preferred embodiment, host DSP 231 is a commercial DSP device. In one implementation of the present invention, timeslot processors 217 send the determined receive weights to host DSP 231. Note that if desired, the receive weights may also be determined by software specifically implemented in host DSP 231.
[0057] RF controller 233 interfaces with the RF transmit elements, shown as block 245 and also produces a number of timing signals that are used by both the transmit elements and the modem. RF controller 233 receives its timing parameters and other settings for each burst from host DSP 231.
[0058] Transmit controller/modulator 237 receives transmit data from host DSP 231. Transmit controller 237 uses this data to produce analog IF outputs which are sent to RF transmitter (TX) modules 245. The specific operations performed by transmit controller/modulator 237 include: converting data bits into a complex valued (π/4 DQPSK) modulated signal; up-converting to an intermediate frequency (IF); weighting by complex valued transmit weights obtained from host DSP 231; and, converting the signals to be transmitted using digital to analog converters (“DACs”) to form analog transmit waveforms which are provided to transmit modules 245.
[0059] The downlink processing method of the invention is implemented in the embodiment of FIG. 2 in host DSP 231, and is shown as block 243. In alternate versions, the downlink processing method is implemented in the timeslot processors 217 and in another version, it is implemented in transmit controller/modulator 237.
[0060] Transmit modules 245 upconvert the signals to the transmission frequency and amplify the signals. The amplified transmission signal outputs are coupled to the M antennas 103 via duplexer/time switch 107.
[0061] In describing the inventive methods, the following notation is used. Given M antenna elements (M=4 in one implementation, and 12 in another embodiment), let z1(t), z2(t), . . . , zM(t) be the complex valued responses (that is, with in-phase I and quadrature Q components) of the first, second, . . . , M'th antenna elements, respectively, after down-conversion, that is, in baseband, and after sampling (four-times oversampling in the preferred embodiment). In the above notation, but not necessarily required for the present invention, t is discrete. These M time-sampled quantities can be represented by a single M-vector z(t) with the i'th row of z(t) being zi(t). For each burst, a finite number of samples, say N, is collected, so that z1(t), z2(t), . . . , zM(t) can each be represented as a N-row vector and z(t) can be represented by a M by N matrix Z. In much of the detailed description presented hereinafter, such details of incorporating a finite number of samples are assumed known, and how to include these details would be clear to those of ordinary skill in the art.
[0062] Assume signals are transmitted to the base station from Ns remote users all operating on the same (conventional) channel. In particular, assume that one of these, a particular subscriber unit of interest, transmits a signal s(t). Linear adaptive smart antenna processing, which is used in the preferred embodiment of the invention, includes taking a particular combination of the I values and the Q values of the received antenna element signals z1(t), z2(t), . . . , zM(t) in order to extract an estimate of the transmitted signal s(t). Such complex valued weights may be represented by the receive weight vector for this particular subscriber unit, denoted by a complex valued weight vector wr, with ith element wri. The estimate of the transmitted signal from the remote unit may then be represented as:
[0063]
where w′ri is the complex conjugate of wri and wrH is the Hermitian transpose (that is, the transpose and complex conjugate) of receive weight vector wr. Eq. 1 is called a copy signal operation, and the signal estimate s(t) thus obtained is called a copy signal.
where w′ri is the complex conjugate of wri and wrH is the Hermitian transpose (that is, the transpose and complex conjugate) of receive weight vector wr. Eq. 1 is called a copy signal operation, and the signal estimate s(t) thus obtained is called a copy signal.
[0064] The spatial processing described by Eq. 1 may be re-written in vector form for the case of N samples of M-vector signals z(t) and N samples of the transmitted signal s(t) being estimated. In such a case, let s be a (1 by N) row vector of the N samples of s(t). The copy signal operation of Eq. 1 may then be re-written as s=wrHZ.
[0065] In embodiments which include spatio-temporal processing, each element in the receive weight vector is a function of time, so that the weight vector may be denoted as wr(t), with ith element wri(t). The estimate of the signal may then be expressed as:
[0066]
where the operator “*” represents the convolution operation. Spatio-temporal processing may combine time equalization with spatial processing, and is particularly useful for wideband signals. Forming the estimate of the signal using spatio-temporal processing may equivalently be carried out in the frequency (Fourier transform) domain. Denoting the frequency domain representations of s(t), zi(t), and wri(t) by S(k), Zi(k), and Wi(k), respectively, where k is the discrete frequency value:
where the operator “*” represents the convolution operation. Spatio-temporal processing may combine time equalization with spatial processing, and is particularly useful for wideband signals. Forming the estimate of the signal using spatio-temporal processing may equivalently be carried out in the frequency (Fourier transform) domain. Denoting the frequency domain representations of s(t), zi(t), and wri(t) by S(k), Zi(k), and Wi(k), respectively, where k is the discrete frequency value:
[0067]
[0068] With spatio temporal processing, the convolution operation of Equation (2) is usually finite and when performed on sampled data, equivalent to combining the spatial processing with time equalization using a time-domain equalizer with a finite number of equalizer taps. That is, each of the wri(t) has a finite number of values of t and equivalently, in the frequency domain, each of the Wi(k) has a finite number of k values. If the length of the convolving functions wri(t) is K, then rather than determining a complex valued M-weight vector wr, one determines a complex valued M by K matrix Wr whose columns are the K values of wr(t).
[0069] Alternatively, a spatial weight determining method can be modified for spatio-temporal processing according to a weight matrix by re-expressing the problem in terms of matrices and vectors of different sizes. As throughout this description, let M be the number of antenna elements, and N be the number of samples. Let K be the number of time equalizer taps per antenna element. Each row vector of N samples of the (M by N) received signal matrix Z can be rewritten as K rows of shifted versions of the first row to produce a received signal matrix Z of size (MK by N), which when pre-multiplied by the Hermitian transpose of a weight vector of size (MK by 1), produces an estimated received signal row vector of N samples. The spatio-temporal problem can thus be re-expressed as a weight vector determining problem.
[0070] For example, for covariance based methods, the weight vector is a “long” weight vector of size (MK by 1), the covariance matrix Rzz=ZZH is a matrix of size (MK by MK), and the correlation of the antenna signals Z with some signal represented by a (1 by N) row vector s is rzs=ZsH, a long vector of size (MK by 1). Rearranging terms in the “long” weight vector provides the required (M by K) weight matrix.
[0071] A downlink (i.e., transmit) processing strategy using adaptive smart antenna processing includes transmitting a signal, denoted in the finite sampled case by a (1 by N) vector s, from the communication station to a particular remote user by forming a set of antenna signals (typically, but not necessarily in baseband). Linear smart antenna processing determines the antenna signals as:
Z=wts,
where wt is the downlink (or transmit) weight vector. When SDMA is used to transmit to several remote users on the same (conventional) channel, the sum of wti for different signals si aimed at different remote users is formed, to be transmitted by the M antenna elements.
Z=wts,
where wt is the downlink (or transmit) weight vector. When SDMA is used to transmit to several remote users on the same (conventional) channel, the sum of wti for different signals si aimed at different remote users is formed, to be transmitted by the M antenna elements.
[0072] Note that a downlink strategy, for example including determining the downlink weights wt, may be implemented by basing it on an uplink strategy, for example uplink weights, together with calibration data. In this situation, the calibration accounts for differences in the receive and transmit electronic paths for the different antenna elements. The downlink strategy may also be found from the uplink strategy by using the transmit spatial signatures of the remote users, or by other known methods. Again, the weight vector formulation may be used for both linear spatial processing and linear spatio-temporal processing.
[0073] Consider a communications station communicating with Ns remote users on any channel. On the uplink, for an M antenna system, the M received signals at the base station can be stacked into an (M by 1) received signal vector z(t) which may be modeled as
[0074]
where t is time, which in the preferred embodiment is discrete, si(t), i=1, . . . , Ns, denotes the signal (preferably in baseband) at time t transmitted by the ith of Ns remote users, ai is the spatial (or spatio-temporal) signature (a complex valued M-vector) of the ith remote co-channel user, and v(t) denotes additive noise (which may include other interfering signals, viewed as noise for any remote user). Note that the signature of any user is the signal received at the M antenna elements in the absence of noise and the absence of any other interfering users when the user transmits a unit impulse signal (see above referenced above-referenced U.S. Pat. Nos. 5,592,490 and 5,828,658). In matrix form the above signal model can be represented as
z(t)=As(t)+v(t). (5)
where
A=[a1a2 . . . aNs], and s1(t)=[s1(t)s2(t) . . . sNs(t)]T. (6)
with the superscript T denoting the matrix transpose.
Processing Strategy Computation Methods
where t is time, which in the preferred embodiment is discrete, si(t), i=1, . . . , Ns, denotes the signal (preferably in baseband) at time t transmitted by the ith of Ns remote users, ai is the spatial (or spatio-temporal) signature (a complex valued M-vector) of the ith remote co-channel user, and v(t) denotes additive noise (which may include other interfering signals, viewed as noise for any remote user). Note that the signature of any user is the signal received at the M antenna elements in the absence of noise and the absence of any other interfering users when the user transmits a unit impulse signal (see above referenced above-referenced U.S. Pat. Nos. 5,592,490 and 5,828,658). In matrix form the above signal model can be represented as
z(t)=As(t)+v(t). (5)
where
A=[a1a2 . . . aNs], and s1(t)=[s1(t)s2(t) . . . sNs(t)]T. (6)
with the superscript T denoting the matrix transpose.
Processing Strategy Computation Methods
[0075] The preferred embodiment of the invention improves a method for computing an uplink or downlink processing strategy that uses as inputs the received antenna signal data and typically a reference signal, and that takes into account the interference environment present in the received antenna signal data for interference mitigation. The improvement is to deepen or otherwise modify the null depth the strategy provides for mitigating the effects of any one or more known interferers. As would be known to those in the art, interference mitigating strategy determining methods explicitly or implicitly use one or more characteristic features of the received antenna data. Depending on the known strategy computation method, the input signal data may be explicitly reduced to one or more particular characteristic feature that the known method explicitly uses for its computation. For example, for methods that use the spatial or spatio-temporal covariance matrix of the input, the data may be reduced to the spatial or spatio-temporal covariance matrix of the data. Other methods may be based on other properties and in such cases the input signal data may be reduced to the particular feature or property which the known strategy method utilizes. Yet other methods, while implicitly dependent on some property (e.g., spatio-temporal covariance) of the received signal, do not require explicit estimation of the property such as the covariance.
[0076] Since some of the discussion below applies for both receive and transmit strategy, the “r” or “t” subscripts are omitted in such quantities as the weight vectors w. Such subscripts may be used explicitly to identify uplink or downlink processing, and their addition will be clear from the context to those of ordinary skill in the art.
[0077] Let Z be the matrix of received antenna array signals, preferably but not necessarily in baseband. Let s1 be a (1 by N1) reference signal vector of N1 samples. A reference signal s1, may be a known training sequence, or, in decision directed methods, a signal constructed to have the same known modulation structure as the signal transmitted by the subscriber unit, or for property restoral methods, a signal that is constrained to have the required property.
[0078] The invention may be applied to deepen the nulls resulting from uplink or downlink strategies determined with any strategy computation method. Thus, in all of the embodiments of the invention to be described herein, a known strategy (e.g., weight) determining process is used that computes an uplink or a downlink strategy based on received signal inputs Z from the antenna array elements. Many such methods also use reference signal, denoted s1 determined for the remote user signal of interest from the received signal data Z. Such a strategy determining method is shown in FIG. 3 , which is marked prior-art, but is only prior art without the modifications described herein. The reference signal is typically extracted from a set Z of received data as shown in FIG. 4 . FIG. 5 is one case of the system of FIG. 3 wherein the method explicitly uses as an input at least one of the characteristic features of the set of received signal data Z, so in FIG. 5 , the set of input data is further operated upon to obtain one or more characteristic features (e.g., the covariance, the principal components of the covariance matrix, a particular feature of the data, etc.) of the data, which is then explicitly used in the known strategy (e.g., weight) determining-method.
[0079] One example of a weight determining method that has the structure shown in FIG. 5 is the well known least squares (MSE) technique computes the uplink or downlink weights by solving the minimization problem:
w=argminw∥wHZ−s1∥2=(Rzz)−1rzs=(ZZH)−1Zs1H, (7A)
where Rzz=ZZH is the spatial (or spatio-temporal) covariance matrix of the antenna signals, ∥ ∥ denotes the vector norm, and rzs=Zs1H is the cross correlation between the antenna signals and the reference signal. The method of Eq. (7A) is called the minimum mean squared error (MMSE) method herein, and uses the covariance Rzz of the input signal data as the characteristic feature for weight determining. Thus, calculation of the weights according to Eq. (7A) requires having data corresponding to the signals received at the antenna elements and a reference signal. In practice, this typically entails identifying the reference signal data and extracting it from a data burst, forming the covariance matrix for the received signals in the data burst, forming the cross correlation term, and solving for the weights.
w=argminw∥wHZ−s1∥2=(Rzz)−1rzs=(ZZH)−1Zs1H, (7A)
where Rzz=ZZH is the spatial (or spatio-temporal) covariance matrix of the antenna signals, ∥ ∥ denotes the vector norm, and rzs=Zs1H is the cross correlation between the antenna signals and the reference signal. The method of Eq. (7A) is called the minimum mean squared error (MMSE) method herein, and uses the covariance Rzz of the input signal data as the characteristic feature for weight determining. Thus, calculation of the weights according to Eq. (7A) requires having data corresponding to the signals received at the antenna elements and a reference signal. In practice, this typically entails identifying the reference signal data and extracting it from a data burst, forming the covariance matrix for the received signals in the data burst, forming the cross correlation term, and solving for the weights.
[0080] In practice, for example in a mobile PHS, because of limited computational power, only a small number of the 960 samples making up a received signal burst are used to determine Rzz−1. In addition, the samples are determined at the baud points rather than being oversampled. Using only a small number of samples to determine weights may cause what is called “overtraining” herein: the weights performing well on the data containing the reference signal but not on new data, i.e., while the weights extract the desired signal energy and reject interference, the weights may perform poorly on new data. An improvement to the least squares technique which can assist in this situation, includes a process termed “diagonal loading” (see, for example, B. L. Carlson: “Covariance matrix estimation errors and diagonal loading in adaptive arrays,” IEEE Transactions on Aerospace and Electronic Systems, vol. 24, no. 4, Jul. 1988), by which a diagonal adjustment is added as follows:
w=(ZZH+γI)−1Zs1H, (7B)
where γ is a small adjustable factor used to improve the performance of the least squares solution by reducing sensitivity to statistical fluctuations in Z.
w=(ZZH+γI)−1Zs1H, (7B)
where γ is a small adjustable factor used to improve the performance of the least squares solution by reducing sensitivity to statistical fluctuations in Z.
[0081] The methods described by Eq. (7B) also is of the structure shown in FIG. 5 , again with the characteristic feature being the spatial (or spatio-temporal) covariance Rzz=ZZH. Other uplink processing methods are known that use the noise-plus-interference covariance matrix, denoted Rvv, rather than the noise-plus-interference-plus-signal covariance matrix Rzz. Such methods include some noise plus interference covariance estimator which uses the received data (containing the signal plus interference plus noise) and the reference signal for the desired user to determine Rvv.
[0082] The invention includes two main aspects: (i) modifying the uplink or downlink strategy to realize an improved null, and (ii) accurately estimating the signature in the direction where a modified (e.g., deeper) null is desired followed by null deepening based on the estimate.
[0083] Null depth is generally limited by two effects. The first effect is the “natural” null depth of the uplink or downlink strategy. For example, when the signatures of the remote user and interferer are highly correlated, when the interferer power is not too strong, and when the signal-to-noise ratio (SNR) is modest, an uplink strategy based on maximizing the signal-to-interference-plus-noise ratio (SINR) will not direct particularly deep nulls towards the interferer. One aim of the present invention is to deepen the nulls formed under these conditions.
[0084] While a preferred embodiment is described in detail for deepening a null based on known or estimated signatures towards which the nulls are to be deepened, various embodiments are possible. They include using: synthetic signal injection, synthetic signal injection only for the “noise plus interference” estimation block, low-rank update of the noise plus interference estimate, and strategy orthogonalization. In the latter case, the uplink weights for two remote users that share a spatial channel are combined to construct weights with improved nulling performance, while again substantially preserving the rest of the null and gain pattern. These embodiments are detailed hereinunder.
[0085] The described methods for null deepening use a known or estimated signature. Known signature estimation methods such as simple (e.g., maximum likelihood) signature estimation of the interfering remote user may not produce a sufficiently accurate signature estimate for effective null deepening in the direction of the interfering remote user. This is because the estimate may suffer from contamination by the signal of the remote user to which delivered power is maximized. In the preferred embodiment, the method used includes joint signature estimation using the reference signals of both the remote user and any interferer(s). Geometric methods based, for example, on angle of arrival, may alternatively be used to estimate signatures which then are used for null deepening according to any of the signature-based null deepening embodiments described herein.
[0086] Another effect that limits null depth is the accuracy to which signatures or covariance matrices are estimated, which in turn is limited by the number of samples, the SNR of the remote user whose signature is to be estimated, and the power of other remote co-channel users. An additional aspect of the present invention is improving the signature estimate by combining data gathered over several bursts with reference signals of multiple remote users computed over the same bursts. This aspect of the invention is motivated by the recognition that the signature estimate of the interfering remote user must be accurate to a degree. To improve the null depth of a least-squares solution over a single burst, for example, the signature estimate typically may need be based on estimates derived from several bursts.
Null Deepening
[0087] Using the invention can deepen null towards one remote user or more than one users based on knowledge of the signatures of the one or more users. The signatures may be known or estimated, and one aspect of the invention is a method for estimating the signatures applicable to null deepening. For best performance, the signature estimate should be substantially free of contamination from signals to which beams are directed. The invention uses the signature (known or estimated) of one or more known interferers to modify a known strategy or known strategy determining method to produce a modified strategy with improved null deepening. The knowledge of the signatures may be, for example, from historical signature records.
[0088] For the description below, the desired remote user is denoted SUi, and the weight vector for communicating with SUi is denoted by wi. When communicating with SUi, all is other users, denoted SUj where j is not i, are interferers, and the signature for such interferers are denoted aj, where j is not i.
The Signal Injection Method
[0089] A first embodiment of the invention applicable to one null-deepening based on the known or estimated signature of one interferer denoted SUj with signature (estimate) aj is shown in FIG. 6 . A signal formed from the estimated or known interferer signal is scaled and added to the received signal data Z before determining the strategy, that is, modified received signals described by
{circumflex over (Z)}=Z+αjâjssynth,
with αj a tunable scale factor for any interferer j. ssynth is any signal that has the same temporal structure as a typical communication waveform used in the system, or preferably, a temporal structure that would be identified by the particular strategy computation method as not that of the user. For example, for a constant modulus property restoral method, using a non-constant modulus structure for ssynth ensures that the strategy computation method recognizes this as an interferer. In the preferred embodiment, however, ssynth comprises N random noise samples. In another embodiment, this is a constant signal, that is, the signal [1 1 . . . 1]. The scale factor αj for any interferer j can be set to a large fixed, value to force a deep accurate null towards that undesired subscriber unit signature. The modified input signal {circumflex over (Z)} is then applied to any strategy determining scheme, including the ones shown inFIG. 3 and FIG. 5 .
{circumflex over (Z)}=Z+αjâjssynth,
with αj a tunable scale factor for any interferer j. ssynth is any signal that has the same temporal structure as a typical communication waveform used in the system, or preferably, a temporal structure that would be identified by the particular strategy computation method as not that of the user. For example, for a constant modulus property restoral method, using a non-constant modulus structure for ssynth ensures that the strategy computation method recognizes this as an interferer. In the preferred embodiment, however, ssynth comprises N random noise samples. In another embodiment, this is a constant signal, that is, the signal [1 1 . . . 1]. The scale factor αj for any interferer j can be set to a large fixed, value to force a deep accurate null towards that undesired subscriber unit signature. The modified input signal {circumflex over (Z)} is then applied to any strategy determining scheme, including the ones shown in
[0090] A generalization of this embodiment, called “signal injection” herein is illustrated in FIG. 7 . Here, nulls are directed to several interferers denoted SUj where j is not i. Signals are formed from the estimated (or known) signatures of the undesired subscriber units, then are scaled and added to received signal data Z before determining the strategy, that is, modified received signals described by:
[0091]
with αj a tunable scale factor for any interferer j, are used in place of Z and applied to the strategy determining method, say that ofFIG. 3 or that of FIG. 5 . for processing SUi signals. The scale factor αj for any interferer j can be set to a large fixed value to force a deep accurate null towards each undesired subscriber unit signature. Each of the Ssynth— j is any signal that has the same temporal structure as a typical communication waveform used in the system and that would be recognized a non signal of interest, and Ssynth— j for any interferer j must be non-collinear with any Ssynth— j for any other interferer j′. Again, in the preferred embodiment, each Ssynth— j is a set of random samples, with the sets for two distinct interferers being statistically independent.
with αj a tunable scale factor for any interferer j, are used in place of Z and applied to the strategy determining method, say that of
[0092] An improved embodiment makes αj a function of the relative power levels: transmitted to SUi and jth subscriber units, or to any similar measure derived from received signal strengths, thus forming deep nulls in a controlled way only where needed. That is, the nulls are strong where strong nulls are needed and weak where such strong nulls are not needed. Thus forming weak nulls where allowable would reserve degrees of freedom for use elsewhere, for example to null additional noise sources.
[0093] The parameter setting method is described in more detail later in this document.
[0094] FIG. 8 shows an embodiment of the signal injection method for the case of null-deepening for one interferer for a covariance based strategy determining method. FIG. 9 shows an embodiment of the signal injection method for the case of null-deepening for one interferer for an interference-plus-noise covariance based strategy determining method.
[0095] FIG. 10 is a block diagram showing an embodiment of the inventive method applied to a non-linear strategy generator, where the strategy generator includes a demodulation stage. This may be a Viterbi-algorithm-based decoder which operates based on branch metrics, for example. The invention is shown supplying a modified noise-plus-interference covariance to a demodulator, with the modification based on the signal injection method. The resulting strategy is then applied to some new input data. The demodulator, in this case, may be a Viterbi-algorithm based demodulator in which covariance information is, used to “whiten” (i.e., decorrelate) the input data, in this case the new input data. In an alternative, the reference data might also be used to estimate the channel, and provided in the form needed for the Viterbi-method in the demodulator.
[0096] Note that while the signal injection methods preferably involve adding a fraction of the “synthetic” signal generated from the one or more known or estimated interferer signatures, other, non-additive, methods of combining also are within the scope of the present invention. This is shown in FIG. 11 . For example, one method for combining includes performing a matrix factorization of the input data and the synthetic data into factors, and then combining the resulting factors to form a combined signal. The factorization may be a generalized singular value decomposition.
[0097] FIG. 12 is a block diagram showing a general application of the inventive method as used to process data in the downlink data. As shown in FIG. 12 , an uplink strategy generator (e.g., a weight determining method) is based on a reference signal (obtained from the primary data) and a set of data. In accordance with the present invention, the data input to the strategy generator is a combination of the input data and a signal generated from one or more known or estimated interferer signatures. The output of the strategy generator is a set of parameters which is used in the processing of the downlink data. In the linear spatial processing case, the parameters may be a set of weights. Note that the parameters produced by the strategy generator may be combined with calibration data to produce the required downlink strategy parameters for processing of downlink data.
Strategy Orthogonalization Method.
[0098] According to this implementation, for the ith remote user, a strategy (e.g., a weight vector ŵi) is determined that is orthogonal to the to estimated (or known) interferer signature(s) aj. Moreover, the strategy is determined from the strategy (e.g., a weight vector wi) for the desired user-SUi and the strategy (e.g., a weight vector wj) used to communicate with the interferer j. The strategies for the user and interferer, respectively, for example weight vectors wi and wj, respectively, may be obtained using some known strategy determining method, for example that of FIG. 3 or FIG. 5 (including using Eq. (7A) or Eq. (7B)).
[0099] In the linear strategy case, assume a linear strategy wi (spatial or spatio-temporal) exists for receiving from or transmitting to a desired remote user, say the ith, and another linear strategy wj for receiving from or transmitting to an interferer, say the jth users, where j≠i, where wi and wj have substantially the same null and gain patterns, except of course that wi nulls the interferer and wj nulls the desired remote user i because when communicating with the interferer, the remote user is an interferer. According to this embodiment of the invention, the improved strategy is
ŵi=wiαjwj, (9)
where the scalar tunable factor αj is chosen to make ŵi orthogonal to the interferer signature aj. That is, αj is chosen so that ajHwi=0. This is obtained with
ŵi=wiαjwj, (9)
where the scalar tunable factor αj is chosen to make ŵi orthogonal to the interferer signature aj. That is, αj is chosen so that ajHwi=0. This is obtained with
[0100]
[0101] A generalization when one has a number of interferers to which nulls are to be deepened is, given a strategy wi to a desired user i, and several weight vectors wj, j≠i for interferers, then the strategy (i.e., weight vector) to use is
[0102]
where the αj are chosen to ensure that the modified strategy ŵi is orthogonal to the interferer signatures aj, j≠i.
where the αj are chosen to ensure that the modified strategy ŵi is orthogonal to the interferer signatures aj, j≠i.
[0103] Another particular orthogonalization implementation that modifies the strategy wi to be orthogonal to all known interferer signatures is,
[0104]
where factor γj is chosen to make ŵi orthogonal to all the interferer signatures aj, j≠i. The factors γj may be computed using Gram-Schmidt orthogonalization, which in the case of a single interferer j leads to
where factor γj is chosen to make ŵi orthogonal to all the interferer signatures aj, j≠i. The factors γj may be computed using Gram-Schmidt orthogonalization, which in the case of a single interferer j leads to
[0105]
A disadvantage of the this forced signature orthogonalization method, however, is that it may disturb nulls which were formed towards “coherent” noise sources (e.g., from neighboring cells in a cellular system) or towards other incoherent interferers, and may have an effect on the “main lobe” towards the desired SU. Therefore, the preferred strategy orthogonalization method is that of Eq. (9) or its extension to multiple interferers.
Covariance Modification
A disadvantage of the this forced signature orthogonalization method, however, is that it may disturb nulls which were formed towards “coherent” noise sources (e.g., from neighboring cells in a cellular system) or towards other incoherent interferers, and may have an effect on the “main lobe” towards the desired SU. Therefore, the preferred strategy orthogonalization method is that of Eq. (9) or its extension to multiple interferers.
Covariance Modification
[0106] A third embodiment is applicable to strategy determining methods that use an estimate of the spatial or spatio-temporal covariance (including the interference-plus-noise covariance) determined from the input signal (and possible a reference signal) to determine the strategy. The methods of Eqs. (7A) and (7B) so use the covariance to determine a weight vector. One embodiment of the invention adds some information from the interferer signatures to data used by the covariance estimator of the known weight determining method. For example, if the known weight computation method of Eq. (7B) is used, according to this embodiment of the invention, the weights to use are determined as:
[0107]
where Z is the received data, and αj again a tunable scale factor for any interferer j, set as described above for the signal injection method.
where Z is the received data, and αj again a tunable scale factor for any interferer j, set as described above for the signal injection method.
[0108] Many modifications are possible within the scope of the invention. In general, any uplink (i.e., receive) processing method which takes as input a spatial covariance matrix Rzz=ZH computed from input data Z can be modified by altering the spatial covariance matrix Rzz to incorporate the effects of the interferers towards which the nulls are desired to be deepened, the modification being:
[0109]
Note that in the preferred embodiment, the weight determining method to which the invention is applied takes as input a spatial covariance matrix Rzz and a reference signal cross correlation rzs=ZsiH.
Note that in the preferred embodiment, the weight determining method to which the invention is applied takes as input a spatial covariance matrix Rzz and a reference signal cross correlation rzs=ZsiH.
[0110] FIG. 13 shows one version of this embodiment. The weight strategy computation method is one that uses covariances to determine spatial (or spatio-temporal) weights. These weights might be uplink weights, or may be downlink weights. The known scheme is modified using an aspect of the present invention to determine weights that include interference mitigation based on signature data on known interferers. The computation required includes estimating the known interferer spatial signatures when such spatial signature estimates are unavailable, and also estimating the covariarnce of those signature estimates and adding a tunable fraction of these interferer covariances to the covariance estimate determined from the received data.
[0111] Other covariance matrix modifications also are possible within the scope of the invention. In yet another alternative shown in FIG. 14 , rather than the combining of the interferer data being by adding part of the interferer covariance matrix to the input signal covariance matrix, other methods of combining could be used. For example, the method for combining may includes performing a matrix factorization of the input data and of the signatures into factors, and then combining the resulting factors by one of several methods to form a combined covariance matrix.
[0112] This embodiment can also be applied to processing methods that use the noise-plus-interference covariance matrix, denoted Rvv, rather than the noise-plus-interference-plus-signal covariance matrix Rzz. Such methods include some noise plus interference covariance estimator which uses the received data (containing the signal plus interference plus noise) and the reference signal for the desired user to determine Rvv. An embodiment of the invention used in such a method is shown in FIG. 15 , which shows one embodiment of the method of the invention applied to such Rvv-based techniques, with Rvv substituted for Rzz. That is, for Rvv obtained from the signal data, a modification
[0113]
is made, where again the parameters αj are tunable, and preferable determined from power control as described hereinbelow.
Setting the Tunable Parameters
is made, where again the parameters αj are tunable, and preferable determined from power control as described hereinbelow.
Setting the Tunable Parameters
[0114] Many strategies for selecting the parameters αj are possible within the scope of the invention, and some possible strategies are now described.
Strategy 1 (Applied, for Example, to Signal Injection)
[0115] Recalling that according to the signal injection embodiment, after obtaining precise signature estimates âj (or knowing the signatures) of the interferers, given a strategy computation method for determining the strategy for user i from the received signal Z (and possible a reference signal for user i), from the received signal Z is modified to
{circumflex over (Z)}=Z+Σj≠iαjâjssynth— j
where ssynth— j is an artificially synthesized signal for the jth interferer. According to a first parameter determining strategy, the parameter αj is a large constant chosen to be sufficiently large to ensure that the carrier to interference ratio (CIR) in the modified received signal {circumflex over (Z)} is small. In this case, the base station is forced to place a deep null towards the jth subscriber unit, where j≠i, for a strategy to the ith user. The carrier to interference ratio is easily estimated as the ratio of what is indicated by the received signal strength indicator (RSSI) typically available at a receiver to the interferer power, which is being controlled by a large value of the parameter.
{circumflex over (Z)}=Z+Σj≠iαjâjssynth
where ssynth
[0116] It is interesting to note that for an interference mitigating strategy computation method that uses a reference signal for interference mitigating, such as those of Eq. (7A) and (7B), in the limit when αj→∞, the transmit weight for the ith user is orthogonal to âj.
[0117] For the covariance modification method, note that the covariance of an input signal includes terms from each of the constituent signals in the input received signal Z. A practical covariance estimate may include cross terms, so approximately includes terms from each of the constituent signals in the input received. The covariance modification changes the interference constituents reflected in the covariance estimate. According to this strategy 1 when applied to the covariance modification method, the adjustable parameter for any interferer is selected to be a number sufficiently large to ensure that the carrier to interference ratio reflected by the modified covariance estimate is small.
Strategy 2 (Applied, for Example, to Signal Injection)
[0118] This strategy uses some knowledge of the transmitted power towards or from each subscriber unit. On the downlink, this information is usually readily available in a typical base station in the downlink power control unit. According to this parameter tuning strategy; the parameters αj are chosen in such a way that the power distribution of the constituent signals in {circumflex over (Z)} is inversely proportional to the distribution of the downlink power that the base station transmits towards the subscriber units.
[0119] In order to find exact formulas for αj, one notes that the received signal Z may be modeled as
Z=aisi+Σj≠iajsj+v, (13)
where v is (non-co-channel) interference plus noise, ai and si are the signature of and transmitted signal from the remote user of interest, and the aj and sj are the signatures of and transmitted signals, respectively, of the interferers, where j≠i. Recalling that according to the signal injection embodiment, after obtaining precise signature estimates âj (or knowing the signatures) of the interferers, the received signal Z is modified to
{circumflex over (Z)}+Z+Σj≠iαjâjssynth— j
where ssynth— j is an artificially synthesized signal for the jth interferer. Combining the model of Eq. (13) with the signal injection to give the following equation for the is modified received signal:
{circumflex over (Z)}=aisi+Σj≠i(ajsj+αjâjssynth— j)+n.
Assuming that the signals sj and ssynth— j are uncorrelated, the average powers of the constituent signals in {circumflex over (Z)} due to the desired user i and the jth interferer, j≠i, are given by ∥ai∥2σi2 and {∥aj∥2σj2+|αj|2∥âj∥2σ2synth— j}, respectively, where σj2 denotes the average power of signal sj and σ2synth— j denotes the average power of the synthesized signal. Note that the constituent due to the jth interferer is a function of tunable parameter αj.
Z=aisi+Σj≠iajsj+v, (13)
where v is (non-co-channel) interference plus noise, ai and si are the signature of and transmitted signal from the remote user of interest, and the aj and sj are the signatures of and transmitted signals, respectively, of the interferers, where j≠i. Recalling that according to the signal injection embodiment, after obtaining precise signature estimates âj (or knowing the signatures) of the interferers, the received signal Z is modified to
{circumflex over (Z)}+Z+Σj≠iαjâjssynth
where ssynth
{circumflex over (Z)}=aisi+Σj≠i(ajsj+αjâjssynth
Assuming that the signals sj and ssynth
[0120] Denote by Pj the power of the downlink signal that the base station transmits towards the jth remote user. The design objective of strategy can be expressed as follows:
[0121] Choose the tunable parameters αj so that the ratio of the average powers of the remote user i and each co-channel interferer j is the same as the ratio of the powers used to transmit to the interferer j and the remote user i. By using the approximation ∥aj∥≈∥âj∥,
[0122]
By adding the constraint that αj must be a positive real number, it follows that, when Pi∥âi∥2σi2>Pj∥âj∥2σj2,
By adding the constraint that αj must be a positive real number, it follows that, when Pi∥âi∥2σi2>Pj∥âj∥2σj2,
[0123]
When Pi∥âi∥2σi2≦Pj∥âj∥2σj2, then there is no need for null deepening, and therefore a value of zero is used for αj.
When Pi∥âi∥2σi2≦Pj∥âj∥2σj2, then there is no need for null deepening, and therefore a value of zero is used for αj.
[0124] In many systems, the remote user signals have approximately the same average power (σi=σj=σsynth), so that a simplified power based strategy sets the tunable parameters αj as a functions of the ratio of the power used to transmit to the remote user to the power for transmission to the remote user, and the ratio of the square of the vector norms of the remote user and the interferer. Mathematically, when Pi∥âi∥2>Pj∥âj∥2,
[0125]
Again, when Pi∥âi∥2≦Pj∥âj∥2, there is no need for null deepening, which is equivalent to a value of zero being used for αj.
Again, when Pi∥âi∥2≦Pj∥âj∥2, there is no need for null deepening, which is equivalent to a value of zero being used for αj.
[0126] Note that when applied to the covariance modification method, according to this strategy 2, the adjustable parameter for any interferer is selected to approximately maintain the same ratio of interferer power to remote user signal power reflected in the constituent parts of the modified covariance as the ratio of respective interferer power to remote user transmit power used to transmit to the respective interferer and the remote user, respectively.
Strategy 3 (Applied, for Example, to Covariance Modification)
[0127] In addition to the tunable parameter setting method described above using the signal injection method as an illustrative example, another feature of the invention is determining exactly the parameter setting for an amount of null depth required in null deepening when using the any of the inventive null deepening methods.
[0128] For sake of simplicity of notation, we'll consider the case where there are two dominant co-channel users (e.g., two spatial channels), users i and j. The method can be easily extended to more users. The covariance modification method and the strategy orthogonalization method will be considered as examples.
[0129] In the linear strategy case, assume a modified linear strategy ŵi (spatial or spatio-temporal) exists for receiving from or transmitting to a desired remote user, say the ith, with an interferer j and using parameter αj to obtain the “null deepened” strategy ŵi. Similarly, assume that another modified linear strategy ŵj exists for receiving from or transmitting to an interferer, say the jth user, where j≠i, the modification using parameter αj, with ŵi and ŵj have substantially the same null and gain patterns, except of course that wi nulls the interferer and wj nulls the desired remote user i because when communicating with the interferer, the remote user is an interferer.
[0130] According to this third strategy, applicable to the case of the strategy applied in the downlink, the parameters αi and αj are chosen to minimize total transmit power, subject to the constraints that the signal quality experienced by each co-channel user (e.g., i and j) in the set including the particular remote user of interest and at least one of the one or more interferers present, meets or exceeds some prescribed quality of service. Several measures of signal quality may be used, and the signal-to-interference-plus-noise ratio (SINR) is preferably used. Using the model of Eq. (13) that
Z=aisi+ajsj+v,
where v is the interference (other than user j) and noise, and assuming a modified linear strategy ŵi and ŵj for remote users i and j, respectively, estimates of the SINR of the two co-channel users are
Z=aisi+ajsj+v,
where v is the interference (other than user j) and noise, and assuming a modified linear strategy ŵi and ŵj for remote users i and j, respectively, estimates of the SINR of the two co-channel users are
[0131]
Therefore, determining the parameters αi and αj that minimize the total transmit power subject to the SINR being above some threshold SINRthresh is solving
arg min{αi , αj }{∥ŵi∥2+∥ŵj∥2}
subject to
SINRi≧SINRthresh and SINRj≧SINRthresh,
where ŵi and ŵj are the strategies for user i and j respectively after applying null deepening with parameters αi and αj using any of the inventive null deepening method embodiments.
Therefore, determining the parameters αi and αj that minimize the total transmit power subject to the SINR being above some threshold SINRthresh is solving
arg min{α
subject to
SINRi≧SINRthresh and SINRj≧SINRthresh,
where ŵi and ŵj are the strategies for user i and j respectively after applying null deepening with parameters αi and αj using any of the inventive null deepening method embodiments.
[0132] As an example, consider the covariance modification embodiment decribed by Eq. (11) applied to the weight computation method described by Eq. (7A). To determine the parameter αi, we first apply the well known matrix inversion lemma to the combination of Eq. (7A) and Eq. (11) to obtain an expression for wi in terms of the quantities Rzz−1, rzsi=ZsiH, αi, αj, ai, and aj. In particular,
[0133]
Note that except for αi, and αj, all of the quantities in this expression and in the constraint expressions for SINRi and SINRj can either be readily estimated (σi2, σj2 ai, and aj.) or else are already computed (Rzz−1, rzsi, and rzsj). Hence, the SINRi and SINRj constraint equations can be written as
Note that except for αi, and αj, all of the quantities in this expression and in the constraint expressions for SINRi and SINRj can either be readily estimated (σi2, σj2 ai, and aj.) or else are already computed (Rzz−1, rzsi, and rzsj). Hence, the SINRi and SINRj constraint equations can be written as
[0134]
where the constants icl,m are defined in terms of σi2, σj2 ai, aj, Rzz−1, rzsi, rzsj, and SINRthresh.
where the constants icl,m are defined in terms of σi2, σj2 ai, aj, Rzz−1, rzsi, rzsj, and SINRthresh.
[0135] Similarly, the total power cost function P={∥{tilde over (w)}i∥2+∥{tilde over (w)}j∥2} can be expressed as
[0136]
Eqs. (14A) and (14B) constitute a constrained nonlinear optimization problem in αi2 and αj2, and can be solved numerically using any of many known nonlinear constrained optimization techniques, as would be clear to one of ordinary skill in the art. In practice, one interferer tends to dominate among co-channel users, namely the user farthest away. Applying null-deepening to this dominant interferer alone accrues most of the gains. In this case, the optimization problem is considerably simplified, since there is then only a single variable, αj2 over which the solution needs to be optimized. The constraints are then quadratic in αj2.
Eqs. (14A) and (14B) constitute a constrained nonlinear optimization problem in αi2 and αj2, and can be solved numerically using any of many known nonlinear constrained optimization techniques, as would be clear to one of ordinary skill in the art. In practice, one interferer tends to dominate among co-channel users, namely the user farthest away. Applying null-deepening to this dominant interferer alone accrues most of the gains. In this case, the optimization problem is considerably simplified, since there is then only a single variable, αj2 over which the solution needs to be optimized. The constraints are then quadratic in αj2.
[0137] Note the above description of parameter setting methods is not meant to be limiting. It would be clear to those in the art that many other alternate parameter setting strategies are possible for the invention.
Improved Signature Estimation
[0138] The interferer signatures to use in any of the above embodiments may be known signatures, for example, from known records. If the signatures are not known, the signatures maybe estimated using any method, including those now described.
[0139] Consider two subscriber units, denoted SUi and SUj, respectively. When communicating with SUi, for example, SUj is an interferer. The null deepening methods described above all require known or estimated signatures of the known interferers. An improved method for estimating signatures applicable to null deepening is now described.
[0140] When the received signals are sampled, say with N samples, the base station computes the weight for the ith remote user. Many-methods are possible for the weight computation, including by the methods described by Eqs. (7A) and (7B). That is, the weight to use for the ith remote may be determined by
wi=argminw∥wHZ−si∥2=(Rzz)−1rzsi=(ZZH)−1ZsiH,
or in an improved version, by
wi=(ZZH+γI)−1ZsiH,
where si is an estimate, for example the reference signal for the ith transmitted signal, and i=1, 2, . . . , Ns, the number of co-channel users. Note that the quantity rzsi=ZsiH is computed at the base station for each remote user i in order to form weights to determine each of the signal estimates si. This observation motivates one known method of estimating the signature of the ith remote user, which under the assumption of white noise, gives the maximum-likelihood (MLE) estimate when there is only a single subscriber unit. That estimate is
ãi=ZsiH(sisiH)−1, (15)
where si is the reference signal for the ith remote user. The (sisiH)−1 term is a scalar factor used for normalizing the signature.
wi=argminw∥wHZ−si∥2=(Rzz)−1rzsi=(ZZH)−1ZsiH,
or in an improved version, by
wi=(ZZH+γI)−1ZsiH,
where si is an estimate, for example the reference signal for the ith transmitted signal, and i=1, 2, . . . , Ns, the number of co-channel users. Note that the quantity rzsi=ZsiH is computed at the base station for each remote user i in order to form weights to determine each of the signal estimates si. This observation motivates one known method of estimating the signature of the ith remote user, which under the assumption of white noise, gives the maximum-likelihood (MLE) estimate when there is only a single subscriber unit. That estimate is
ãi=ZsiH(sisiH)−1, (15)
where si is the reference signal for the ith remote user. The (sisiH)−1 term is a scalar factor used for normalizing the signature.
[0141] When other remote users share the same channel, the spatial signature estimate of Eq. (15) is contaminated by cross correlations between signatures. This may be seen by combining the model of Eq. (4) with Eq. (15), to obtain
[0142]
The second term of Eq. (16) is implicitly assumed to be zero in the prior-art signature estimation method described by Eq. (15), but this assumption is inaccurate for short data sequences as encountered in practical systems, such as in the wireless local loop (WLL) system base station and the mobile PHS base station in which the method of present invention is implemented.
The second term of Eq. (16) is implicitly assumed to be zero in the prior-art signature estimation method described by Eq. (15), but this assumption is inaccurate for short data sequences as encountered in practical systems, such as in the wireless local loop (WLL) system base station and the mobile PHS base station in which the method of present invention is implemented.
[0143] Another method for signature estimation takes these cross-correlation terms into account. Let S is the matrix with the Ns reference signals as the rows. That is,
[0144]
Let A be a matrix having the Ns signature values as columns. That is, A=[a1 a2 . . . aNs]. Then the MLE solution is
Let A be a matrix having the Ns signature values as columns. That is, A=[a1 a2 . . . aNs]. Then the MLE solution is
[0145]
where  is the matrix having the signatures estimates as columns,
Â=[â1 â2 . . . âNs]. (18)
See for example, A. Lee Swindlehurst, S. Daas, J. Yang: “Analysis of a Decision Directed Beamformer, IEEE Trans. on Sig. Proc. Vol. 43, No. 12, pp. 29202927, December, 1995.
where  is the matrix having the signatures estimates as columns,
Â=[â1 â2 . . . âNs]. (18)
See for example, A. Lee Swindlehurst, S. Daas, J. Yang: “Analysis of a Decision Directed Beamformer, IEEE Trans. on Sig. Proc. Vol. 43, No. 12, pp. 29202927, December, 1995.
[0146] For Ns=2 remote users, the estimates of Eq. (17) can be expressed as
[0147]
respectively.
respectively.
[0148] While the estimator of Eq. (17) gives an accurate signature estimate, it is computationally complex. The third signature estimation method described herein is an iterative method which is computationally simpler than that of Eq. (17) but provides for a more accurate estimate than that of Eq. (15).
[0149] The method is first described for the case that the base station is (or is assumed to be) handling two spatial channels (i.e., two remote users communicating with the base station on the same carrier and in the same time slot), or that there is one spatial channel and a known interferer. The signature estimate for the second remote user (the interferer) can then be computed as follows:
-
- [0150] Step 1: Compute the an estimate (if a1 using any known method, for example, that of Eq. (15):
ã1=Zs1H(s1s1H)−1 (21) - [0151] where s1 is the reference signal for SU1.
- [0152] Step 2: Subtract from the received signal an estimate of the contribution of the first remote user:
{tilde over (Z)}=A−ã1s1, (22) - [0153] Step 3: Compute the improved estimate of a2 using the received signal with the first user estimated contribution removed:
â2{tilde over (Z)}s2H(s2s2H)−1, (23) - [0154] where s2 is a reference signal obtained for the second remote user. That is, one needs to have a reference signal for the interferer towards which one is directing the null.
- [0150] Step 1: Compute the an estimate (if a1 using any known method, for example, that of Eq. (15):
[0155] Since the correction term subtracted from Z in Eq. (22) is itself an approximation, iteratively repeating Eqs. (22) and (23) may improve the estimate further. For the case in which Eq. (15) is used in step 1 above, substituting Eqs. (21) and (22) into Eq. (23), one obtains
[0156]
Eqs. (24) and (20) differ only by a constant, so the recursive method in this case converges to the MLE solution (within a scale factor) in one iteration.
Eqs. (24) and (20) differ only by a constant, so the recursive method in this case converges to the MLE solution (within a scale factor) in one iteration.
[0157] This recursive method can be extended to incorporate an arbitrary number of remote users. A method for Ns=3 is as follows. To estimate the signature for some additional remote user, denoted SU3, with three remote users Ns=3:
-
- [0158] Step 1: Compute ã2 using any known method, for example the method of Eq. (21) (applied however to SU2).
- [0159] Step 2: Form the decorrelated estimate which removes the SU2 contribution
ã2={tilde over (Z)}s2H(s2s2H)−1, (25), - [0160] where {tilde over (Z)} is given in Eq. (22), but applied for SU2.
- [0161] Step 3: Iterate the estimate of a1 with the value of ã2 just found,
ã11=(Z−ã2s2)s1H(s1s1H)−1. (26) - [0162] Step 4: Compute the estimate of the desired SU3 signature,
â3=(Z−ã11s1−ã2s2)s3H(s3s3H)−1, (27) - [0163] where s3 is a reference signal for the user SU3.
[0164] Estimation of signatures for two remote users, SU1 and SU2, with Ns=3 results from appropriately changing the indices in this procedure.
[0165] A generalization of the iterative method is as follows for the general case of Ns signatures to be estimated:
-
- [0166] Step 1: Assume some initial estimates. For example, assume the starting values are those given by Eq. (15), i.e., ãi=ZsiH(sisiH) for i=1, . . . , Ns.
- [0167] Step 2: Obtain an estimate for each signature, while keeping the values of the remaining Ns−1 signatures to be the most recently determined estimate values, each of these fixed most recently determined estimate values initially being the initial value from step 1, and later being either the values determined when this Step 2 was previously applies to another signature in the same iteration, or, for those signatures for which no estimate has yet been obtained during the current iteration, the estimate from the most recent previous iteration. Denoting the jth user's estimate by âj, this jth signature estimate is obtained as the solution to
[0168]
-
- [0169] while the other Ns−1 values are so fixed, where again A=[a1 a2: . . . aNs]. Repeat this procedure for all j=1, 2, . . . , Ns, replacing the value at which any signature estimate is fixed to be the most recently obtained estimate value.
- [0170] Step 3: Repeat Step 2 iteratively until convergence is reached.
[0171] To further improve signature estimation, in another aspect of this invention, each desired signature estimate âj is singular value decomposition-averaged (SVD-averaged) over successive signal streams (i.e., bursts) to reduce the contribution of the noise-related error term in Eq. (15). One method of performing SVD averaging comprises stacking up the signatures to be combined as the columns of a matrix, then performing the SVD of the resulting matrix. The SVD averaged value is then taken as the left singular vector corresponding to the largest principal value. An alternate SVD-averaging embodiment uses a weighted moving window (last few signatures) SVD average which favors recent data. Other combining methods also may be used.
[0172] To see how having a better signature estimate improves the null deepening, consider the case of two users, user SUi and user SUj, with SUi being the desired user and SUj the interferer, and let
âj=aj+μai+ε
be the estimate of the interference signature aj, where ε is the estimation error orthogonal to ai, the signature of user SUi, and (μ ai) is the estimation error in the direction of ai.
âj=aj+μai+ε
be the estimate of the interference signature aj, where ε is the estimation error orthogonal to ai, the signature of user SUi, and (μ ai) is the estimation error in the direction of ai.
[0173] The null deepening methods described herein direct a null in the direction of âj and a gain in the direction of ai. Thus, if we want a good null in the direction of aj, we must have both μ very small, and a good null in the direction of ε (even if ε is comparatively large). One case for which the term μ may be undesirably large occurs when the desired remote user signal is present in the received data and when the signature aj is estimated using Eq. (15), i.e., using cross-correlation with the reference signal sj. A smaller value of μ allows a deep null to be directed in the direction of ai. The term μ can be greatly reduced by estimating the interferer signature âj using Eq. (17) for joint maximum likelihood estimation on the reference signals corresponding to both the remote user and the interferer, or by using the iterative method. In each case, a deep null may then be directed in the direction of âj.
Results of Simulations
[0174] To see how having a better signature estimate-improves the null deepening, consider the case of two users, user SUi and user SUj, with SUi being the desired user and SUj the interferer, and let
âj=aj+e
be the estimate of the interference signature aj, where e is the estimation error.
âj=aj+e
be the estimate of the interference signature aj, where e is the estimation error.
[0175] Assume also that for the purpose of this performance analysis, the received signal may be modeled as
Z=aisi+ajsj+v,
where v represents temporally white noise and interference.
Z=aisi+ajsj+v,
where v represents temporally white noise and interference.
[0176] For the signature estimation method described in Eq. (15) and for the improved method described in Eq. (17), the signature error covariance E[e eH] is, up to a constant of proportionality, approximately equal to E[v vH]+μ ai aiH, where for the method of Eq. (15), μ is proportional to the SNR of SUi and for the method of Eq. (17), μ is nearly zero.
[0177] In one embodiment of the invention, a weight {tilde over (w)}i is computed that is close to the MMSE weight wi such that {tilde over (w)}i is nearly orthogonal to âj. Thus,
0={tilde over (w)}iHâj={tilde over (w)}iH{tilde over (w)}iaj+{tilde over (w)}iHe.
If we choose to measure null depth by the expected squared dot product
ND=E[|{tilde over (w)}iHaj|2],
then the null depth approaches zero (the depth of a perfect null) if
0={tilde over (w)}iHâj={tilde over (w)}iH{tilde over (w)}iaj+{tilde over (w)}iHe.
If we choose to measure null depth by the expected squared dot product
ND=E[|{tilde over (w)}iHaj|2],
then the null depth approaches zero (the depth of a perfect null) if
[0178]
also approaches zero. The term E[{tilde over (w)}iH E[v vH] {tilde over (w)}i] n the right hand side of the above equation tends to be small for any interference-mitigating weight {tilde over (w)}i (e.g., for a weight determined using a reference signal of the desired user signal, such as the methods of Eq. (7A) or Eq. (7B)). The μE[{tilde over (w)}iHai aiH{tilde over (w)}i] term, however, is small only if μ is small, because the weight {tilde over (w)}i delivers power towards the signature ai of the desired user SUi. Thus the method of Eq. (17) for signature estimation—which has μ close to zero—will often yield improved null depth compared to the method of Eq. (15).
also approaches zero. The term E[{tilde over (w)}iH E[v vH] {tilde over (w)}i] n the right hand side of the above equation tends to be small for any interference-mitigating weight {tilde over (w)}i (e.g., for a weight determined using a reference signal of the desired user signal, such as the methods of Eq. (7A) or Eq. (7B)). The μE[{tilde over (w)}iHai aiH{tilde over (w)}i] term, however, is small only if μ is small, because the weight {tilde over (w)}i delivers power towards the signature ai of the desired user SUi. Thus the method of Eq. (17) for signature estimation—which has μ close to zero—will often yield improved null depth compared to the method of Eq. (15).
[0179] Simulations were used to evaluate the performance of several embodiments of the present invention.
[0180] The uplink signal was formed by adding three equal-power simulated subscriber unit signals, each consisting of 50 symbol-spaced samples of a randomly generated π/4 DQPSK baseband waveform. The simulation used a 12-element antenna array for both transmission and reception. Uplink spatial signatures were drawn randomly and uniformly from the complex 12-sphere; uplink and downlink signatures were assumed equal. Additive white Gaussian noise was added to the uplink signal to set the received SNR equal to 12 dB, where SNR is measured at the output of an ideal interference-free linear beamformer.
[0181] Performance was computed by Monte-Carlo averaging over 1000 independent to runs.
[0182] Signature estimation was performed using both the single-user maximum-likelihood method of Eq. (15) and the two-user maximum-likelihood method of Eq. (17). Signatures were averaged using SVD averaging over Navgs=1, 2, 4, 8, and 16 bursts. The accuracy of signature estimation was evaluated using the dot product
[0183]
[0184] Three nulling strategies were computed: the baseline MMSE strategy of Eq. (7A), a null-deepened strategy computed using signal injection method with αj=1000, and a null deepening strategy using weight orthogonalization. Null depth was measured by the expected dot product
[0185]
The simulated received data used to compute the signature estimate was reused to compute the null-deepened strategy.
The simulated received data used to compute the signature estimate was reused to compute the null-deepened strategy.
[0186] The null depth NDMMSE of the baseline prior-art MMSE method was compared to the null depths NDsig— inj and NDsig— inj of the inventive signal injection and inventive orthogonalization methods, respectively, using the quantities
dBsig— inj=20 log10(NDMMSE/NDsig— inj),
and
dBorthog=20 log10(NDMMSE/NDorthog),
respectively. Median results over 1000 nuns are tabulated below.
dBsig
and
dBorthog=20 log10(NDMMSE/NDorthog),
respectively. Median results over 1000 nuns are tabulated below.
[0187]
| Navgs | c (eq 15) | c (eq 17) | dBsig_inj | dBorthog |
|---|---|---|---|---|
| 1 | 0.9792 | 0.9869 | 0.86 dB | 0.78 dB |
| 2 | 0.9896 | 0.9930 | 3.80 dB | 3.94 dB |
| 4 | 0.9942 | 0.9965 | 6.76 dB | 6.75 dB |
| 8 | 0.9971 | 0.9984 | 9.94 dB | 9.93 dB |
| 16 | 0.9987 | 0.9992 | 12.5 dB | 12.6 dB |
[0188] As can be seen from the table, the results were almost identical for the two embodiments of the invention. Also, as can be seen from the table and from FIG. 16 , doubling the number of bursts over which the signature estimate is averaged increases the null depth improvement by roughly 3 dB.
[0189] The simulations also confirmed that the depth of the null directed towards the second interferer (i.e., the interferer towards which no deepening was performed and no signature estimation carried out) was not significantly affected by the signal injection method or orthogonalization embodiments of the inventive method.
Other Embodiments
[0190] In another embodiment, an explicit signature estimate is not needed, and instead the uplink weights for two co-spatial remote users are combined to construct weights with improved nulling performance, while again substantially preserving the rest of the null and gain pattern.
[0191] Note that the apparatus and method of the present invention does not need to explicitly identify any new interferer waveforms. Note also that the various embodiments of the invention can be used for smart antenna processing on the downlink, or for smart antenna processing on the uplink. That is, the embodiments can be used on the downlink for smart antenna processing signals that are received at the antenna elements of an antenna array which is part of a wireless receiver, or on the uplink for smart antenna processing a signal to be transmitted to form signals for transmission by the antenna elements of an antenna array which is part of a wireless transmitter. In general, the term “wireless station” therefore may be used for: (i) a receiver having an array of antenna elements; (ii) a transmitter having an array of antenna elements; or (iii) a transceiver having an array of antenna elements for both reception and transmission.
[0192] Several aspects of the invention described herein were described implemented as programs run on one or more DSP devices. Given sufficient economic incentive, DSP functionality, including DSP programs, may be incorporated into special purpose hardware, for example as part of an application specific integrated circuit (ASIC) or as part of a very large scale integrated circuit (VLSI). DSP functionality may also be met by other processors, for example a general purpose microprocessor. In addition, a DSP device running a program may be converted into a special purpose piece of hardware. Thus, the terms processor, digital signal processor, DSP, and DSP device as used herein include these equivalent alternatives.
[0193] The terms and expressions which have been used herein are used as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding equivalents of the features shown and described, or portions thereof, it being recognized that various modifications are possible within the scope of the invention claimed.
Claims
What is claimed is:
1. A subscriber device comprising:
a processor of the subscriber device to compute an antenna processing strategy for a remote unit, the computation based at least in part on received signal data; and
circuitry of the subscriber device coupled with the processor, the circuitry to incorporate interferer signature data relating to one or more interferers with the received signal data to modify the processing strategy by reducing one or both of antenna transmit signal strength in, and sensitivity of the antenna to signals from, one or more interferers.
2. The subscriber device of claim 1, further comprising electronics to communicate with the remote unit using a communication channel selected from frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA).
3. The subscriber device of claim 1, further comprising electronics to communicate with the remote unit using one or more conventional communication channels, wherein at least one of the one or more conventional communication channels includes one or more spatial channels.
4. The subscriber device of claim 1, wherein the circuitry to incorporate the interferer signature data relating to each interferer further comprises a combiner coupled with the processor to provide a combination of the received signal data and the signature data, the processor to compute a modified antenna processing strategy based, at least in part, on the combination.
5. The subscriber device of claim 4, wherein to provide a combination of the received signal data and the signature data further comprises the circuitry to modify one or more characteristic features of the received signal data with an estimate of the one or more characteristic features in the signature data.
6. The subscriber device of claim 4, wherein the signature data comprises a known signature for the one or more interferers.
7. The subscriber device of claim 4, wherein to incorporate interferer signature data further comprises:
a signature estimator circuit coupled with the circuitry to estimate the signature of one or more of the interferers; and
the processor to modify the antenna processing strategy by incorporating the estimate as the interferer signature data.
8. The subscriber device of claim 4, wherein to compute an antenna processing strategy comprises the processor to generate a set of weights to apply during processing for the remote unit, and wherein to modify the processing strategy comprises the circuitry to adjust the set of weights.
9. A subscriber device comprising:
a processor of the subscriber device to compute an antenna processing strategy from a set of signals received by an antenna array to apply to received signals to determine an estimate of a signal transmitted by a remote unit, or to apply to transmit a signal for transmission to the remote unit with the antenna array; and
a mechanism of the subscriber device to modify the computed antenna processing strategy by incorporating interferer signature data for each of one or more interferers, each interferer characterized by a signature, the interferer signature data related to the signature of each of the interferers, wherein the modified antenna processing strategy, if a downlink strategy, decreases a transmit signal strength in a direction of the one or more interferers, and, if an uplink strategy, decreases a sensitivity to signals from a direction of the one or more interferers.
10. The subscriber device of claim 9, further comprising electronics to communicate with the remote unit using a communication channel selected from frequency division multiple access (FDMA), time division multiple access (TDMA) and code division multiple access (CDMA).
11. The subscriber device of claim 9, further comprising electronics to communicate with the remote unit using one or more conventional communication channels, wherein at least one of the one or more conventional communication channels includes one or more spatial channels.
12. The subscriber device of claim 9, further comprising a signature estimation processor to estimate the signature of at least one of the one or more interferers to form the interferer signature data for the respective interferer.
13. The subscriber device of claim 9, wherein the interferer signature data for at least one of the one or more interferers includes a known signature for the respective interferer.
14. The subscriber device of claim 9, wherein the processor is to determine a linear antenna strategy by a set of weights, and wherein the mechanism modifies the set of weights.
15. A method comprising:
computing an antenna processing strategy for a remote unit, based at least in part on a received signal data; and
modifying the antenna processing strategy by incorporating signature data relating to one or more interferers with the received signal data to reduce one or both of antenna transmit signal strength in, and sensitivity of the antenna to signals from, the one or more interferers.
16. The method of claim 15, performed by a subscriber device.
17. The method of claim 15, further comprising communicating with the remote unit using a communication channel selected from frequency division multiple access (FDMA), time division multiple access (TDMA), and code division multiple access (CDMA).
18. The method of claim 15, further comprising communicating with the remote unit using one or more conventional communication channels, wherein at least one of the one or more conventional communication channels includes one or more spatial channels.
19. The method of claim 15, wherein incorporating signature data relating to one or more interferers comprises:
combining the received signal data and the signature data; and
computing a modified processing strategy based, at least in part, on the combination.
20. The method of claim 19, wherein combining the received signal data and the signature data further comprises modifying one or more characteristic features of the received signal data with an estimate of the one or more characteristic features in the signature data.
21. The method of claim 20, wherein the estimate includes a selectable parameter.
22. The method of claim 20, wherein the estimate of the one or more characteristic features of the received signal data comprises an estimate of the covariance of the received signal data.
23. The method of claim 15, wherein the signature data comprises a known signature for the one or more interferers.
24. The method of claim 15, wherein modifying the antenna processing strategy by incorporating signature data further comprises:
estimating the signature of one or more of the interferers; and
modifying the antenna processing strategy by incorporating the estimate as the interferer signature data.
25. The method of claim 15, wherein computing and modifying an antenna processing strategy comprises generating and modifying a set of weights to apply during processing for the remote unit.
26. An article comprising a machine-accessible medium to provide content to cause one or more subscriber devices to:
compute an antenna processing strategy for a remote unit, based at least in part on received signal data; and
modify the antenna processing strategy by incorporating signature data relating to one or more interferers with the received signal data to reduce one or both of antenna transmit signal strength in, and sensitivity of the antenna to signals from, one or more interferers.
27. The article of claim 26, wherein incorporating signature data relating to each of one or more interferers comprises the one or more electronic systems to:
combine the received signal data and the signature data; and
compute a modified processing strategy based, at least in part, on the combination.
28. The article of claim 26, wherein to modify the antenna processing strategy by incorporating signature data further comprises the one or more electronic systems to:
estimate the signature of one or more of the interferers; and
modify the antenna processing strategy by incorporating the estimate as the interferer signature data.
29. The article of claim 26, wherein to compute and to modify an antenna processing strategy comprises the one or more electronic systems to generate and to adjust a set of weights to apply during processing for the remote unit.
Patent Citations (188)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3704465(A) | 1972-11-01 | Masak et al. | Applicant |
| US3774209(A) | 1973-11-01 | Fleming et al. | Applicant |
| US3798645(A) | 1974-03-01 | Baurle et al. | Applicant |
| US3852749(A) | 1974-12-01 | Kohler | Applicant |
| US3946385(A) | 1976-03-01 | Ewen | Applicant |
| US4005379(A) | 1977-01-01 | Lerner | Applicant |
| US4035746(A) | 1977-07-01 | Covington, Jr. | Applicant |
| US4085319(A) | 1978-04-01 | Deitz et al. | Applicant |
| US4128740(A) | 1978-12-01 | Graziano | Applicant |
| US4263568(A) | 1981-04-01 | Nemit | Applicant |
| US4316191(A) | 1982-02-01 | Sawatari et al. | Applicant |
| US4375622(A) | 1983-03-01 | Hollingsworth | Applicant |
| US4434505(A) | 1984-02-01 | Gutleber | Applicant |
| US4475010(A) | 1984-10-01 | Huensch et al. | Applicant |
| US4626859(A) | 1986-12-01 | Stansfield | Applicant |
| US4639732(A) | 1987-01-01 | Acoraci et al. | Applicant |
| US4639914(A) | 1987-01-01 | Winters | Applicant |
| US4658096(A) | 1987-04-01 | West, Jr. et al. | Applicant |
| US4737794(A) | 1988-04-01 | Jones | Applicant |
| US4737975(A) | 1988-04-01 | Shafer | Applicant |
| US4742356(A) | 1988-05-01 | Kuipers | Applicant |
| US4750147(A) | 1988-06-01 | Roy, III et al. | Applicant |
| US4775997(A) | 1988-10-01 | West, Jr. et al. | Applicant |
| US4796291(A) | 1989-01-01 | Makino | Applicant |
| US4827395(A) | 1989-05-01 | Anders et al. | Applicant |
| US4829554(A) | 1989-05-01 | Barnes et al. | Applicant |
| US4837800(A) | 1989-06-01 | Freeburg et al. | Applicant |
| US4855748(A) | 1989-08-01 | Brandao et al. | Applicant |
| US4910794(A) | 1990-03-01 | Mahany | Applicant |
| US4922517(A) | 1990-05-01 | West, Jr. et al. | Applicant |
| US4926186(A) | 1990-05-01 | Kelly et al. | Applicant |
| US4940963(A) | 1990-07-01 | Gutman et al. | Applicant |
| US4947452(A) | 1990-08-01 | Hattori et al. | Applicant |
| US4955082(A) | 1990-09-01 | Hattori et al. | Applicant |
| US4965732(A) | 1990-10-01 | Roy, III et al. | Applicant |
| US4965849(A) | 1990-10-01 | Kunihiro | Applicant |
| US4965850(A) | 1990-10-01 | Schloemer | Applicant |
| US4972151(A) | 1990-11-01 | Rosen | Applicant |
| US4989204(A) | 1991-01-01 | Shimizu et al. | Applicant |
| US5041833(A) | 1991-08-01 | Weinberg | Applicant |
| US5052799(A) | 1991-10-01 | Sasser et al. | Applicant |
| US5093924(A) | 1992-03-01 | Toshiyuki et al. | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5109535(A) | 1992-04-01 | Kume et al. | Applicant |
| US5124697(A) | 1992-06-01 | Moore | Applicant |
| US5142253(A) | 1992-08-01 | Mallavarpu et al. | Applicant |
| US5159593(A) | 1992-10-01 | D'Amico et al. | Applicant |
| US5255210(A) | 1993-10-01 | Gardner et al. | Applicant |
| US5260968(A) | 1993-11-01 | Gardner et al. | Applicant |
| US5262789(A) | 1993-11-01 | Silverstein | Applicant |
| US5274844(A) | 1993-12-01 | Harrison et al. | Applicant |
| US5276907(A) | 1994-01-01 | Meidan | Applicant |
| US5283540(A) | 1994-02-01 | Myer | Applicant |
| US5299148(A) | 1994-03-01 | Gardner et al. | Applicant |
| US5335249(A) | 1994-08-01 | Krueger et al. | Applicant |
| US5345596(A) | 1994-09-01 | Buchenhorner et al. | Applicant |
| US5361303(A) | 1994-11-01 | Eatwell | Applicant |
| US5367559(A) | 1994-11-01 | Kay et al. | Applicant |
| US5379320(A) | 1995-01-01 | Fernandes et al. | Applicant |
| US5387915(A) | 1995-02-01 | Moussa et al. | Applicant |
| US5423072(A) | 1995-06-01 | Iwashita et al. | Applicant |
| US5430760(A) | 1995-07-01 | Dent | Applicant |
| US5440281(A) | 1995-08-01 | Wey et al. | Applicant |
| US5448621(A) | 1995-09-01 | Knudsen | Applicant |
| US5457812(A) | 1995-10-01 | Slira et al. | Applicant |
| US5465399(A) | 1995-11-01 | Oberholtzer et al. | Applicant |
| US5471647(A) | 1995-11-01 | Gerlach et al. | Applicant |
| US5475864(A) | 1995-12-01 | Hamabe | Applicant |
| US5475868(A) | 1995-12-01 | Duque-Anton et al. | Applicant |
| US5497505(A) | 1996-03-01 | Koohgoli et al. | Applicant |
| US5507035(A) | 1996-04-01 | Bantz et al. | Examiner |
| US5515378(A) | 1996-05-01 | Roy, III et al. | Applicant |
| US5530449(A) | 1996-06-01 | Wachs et al. | Applicant |
| US5530917(A) | 1996-06-01 | Andersson et al. | Applicant |
| US5532706(A) | 1996-07-01 | Reinhardt et al. | Applicant |
| US5537438(A) | 1996-07-01 | Mourot et al. | Applicant |
| US5543801(A) | 1996-08-01 | Shawyer | Applicant |
| US5546090(A) | 1996-08-01 | Roy, III et al. | Applicant |
| US5548813(A) | 1996-08-01 | Charas et al. | Applicant |
| US5553074(A) | 1996-09-01 | Acampora | Applicant |
| US5555445(A) | 1996-09-01 | Booth | Applicant |
| US5557657(A) | 1996-09-01 | Barnett | Applicant |
| US5565873(A) | 1996-10-01 | Dean | Applicant |
| US5566209(A) | 1996-10-01 | Forssen et al. | Applicant |
| US5574977(A) | 1996-11-01 | Joseph et al. | Applicant |
| US5576717(A) | 1996-11-01 | Searle et al. | Applicant |
| US5592490(A) | 1997-01-01 | Barratt et al. | Examiner |
| US5596625(A) | 1997-01-01 | LeBlanc | Applicant |
| US5603082(A) | 1997-02-01 | Hamabe | Applicant |
| US5603089(A) | 1997-02-01 | Searle et al. | Applicant |
| US5606729(A) | 1997-02-01 | D'Amico et al. | Applicant |
| US5615409(A) | 1997-03-01 | Forssen et al. | Applicant |
| US5619503(A) | 1997-04-01 | Dent | Applicant |
| US5621752(A) | 1997-04-01 | Antonio | Applicant |
| US5625880(A) | 1997-04-01 | Goldburg et al. | Applicant |
| US5625885(A) | 1997-04-01 | Nakazawa et al. | Applicant |
| US5638375(A) | 1997-06-01 | Dettro et al. | Applicant |
| US5642353(A) | 1997-06-01 | Roy, III et al. | Applicant |
| US5649287(A) | 1997-07-01 | Forssen et al. | Applicant |
| US5673291(A) | 1997-09-01 | Dent | Applicant |
| US5675581(A) | 1997-10-01 | Soliman | Applicant |
| US5678188(A) | 1997-10-01 | Hisamura | Applicant |
| US5684794(A) | 1997-11-01 | Lopez et al. | Applicant |
| US5684836(A) | 1997-11-01 | Nagayasu et al. | Applicant |
| US5689219(A) | 1997-11-01 | Piirainen | Applicant |
| US5689502(A) | 1997-11-01 | Scott | Applicant |
| US5694416(A) | 1997-12-01 | Johnson | Applicant |
| US5697066(A) | 1997-12-01 | Acampora | Applicant |
| US5708971(A) | 1998-01-01 | Dent | Applicant |
| US5726978(A) | 1998-03-01 | Frodigh et al. | Applicant |
| US5732076(A) | 1998-03-01 | Ketseoglou et al. | Applicant |
| US5742904(A) | 1998-04-01 | Pinder et al. | Applicant |
| US5745858(A) | 1998-04-01 | Sato et al. | Applicant |
| US5748676(A) | 1998-05-01 | Mahany | Applicant |
| US5752165(A) | 1998-05-01 | Hokkanen | Applicant |
| US5774461(A) | 1998-06-01 | Hyden et al. | Applicant |
| US5809009(A) | 1998-09-01 | Matsuoka et al. | Applicant |
| US5809019(A) | 1998-09-01 | Ichihara et al. | Applicant |
| US5812090(A) | 1998-09-01 | Chevalier et al. | Applicant |
| US5818918(A) | 1998-10-01 | Fujii | Applicant |
| US5819182(A) | 1998-10-01 | Gardner et al. | Applicant |
| US5825762(A) | 1998-10-01 | Kamin, Jr. et al. | Applicant |
| US5828658(A) | 1998-10-01 | Ottersten et al. | Examiner |
| US5845212(A) | 1998-12-01 | Tanaka | Applicant |
| US5864548(A) | 1999-01-01 | Liu | Examiner |
| US5867123(A) | 1999-02-01 | Geyh et al. | Applicant |
| US5870393(A) | 1999-02-01 | Yano et al. | Applicant |
| US5884148(A) | 1999-03-01 | Bilgic et al. | Applicant |
| US5884178(A) | 1999-03-01 | Ericsson et al. | Applicant |
| US5887038(A) | 1999-03-01 | Golden | Applicant |
| US5905721(A) | 1999-05-01 | Liu | Applicant |
| US5909470(A) | 1999-06-01 | Barratt et al. | Applicant |
| US5914946(A) | 1999-06-01 | Avidor et al. | Applicant |
| US5930243(A) | 1999-07-01 | Parish et al. | Applicant |
| US5933421(A) | 1999-08-01 | Alamouti et al. | Applicant |
| US5955992(A) | 1999-09-01 | Shattil | Applicant |
| US5970394(A) | 1999-10-01 | Arpee et al. | Applicant |
| US5973638(A) | 1999-10-01 | Robbins et al. | Applicant |
| US5999826(A) | 1999-12-01 | Whinnett | Applicant |
| US6005854(A) | 1999-12-01 | Xu et al. | Applicant |
| US6009124(A) | 1999-12-01 | Smith et al. | Applicant |
| US6018317(A) | 2000-01-01 | Dogan et al. | Applicant |
| US6018555(A) | 2000-01-01 | Mahany | Applicant |
| US6018643(A) | 2000-01-01 | Golemon et al. | Applicant |
| US6023203(A) | 2000-02-01 | Parish | Applicant |
| US6037898(A) | 2000-03-01 | Parish et al. | Applicant |
| US6061553(A) | 2000-05-01 | Matsuoka et al. | Applicant |
| US6064865(A) | 2000-05-01 | Kuo et al. | Applicant |
| US6067324(A) | 2000-05-01 | Harrison | Applicant |
| US6108565(A) | 2000-08-01 | Scherzer | Applicant |
| US6122260(A) | 2000-09-01 | Liu et al. | Examiner |
| US6131016(A) | 2000-10-01 | Greenstein et al. | Applicant |
| US6141567(A) | 2000-10-01 | Youssefmir et al. | Applicant |
| US6185412(B1) | 2001-02-01 | Pentikainen et al. | Applicant |
| US6219561(B1) | 2001-04-01 | Raleigh | Applicant |
| US6236839(B1) | 2001-05-01 | Gu et al. | Applicant |
| US6292664(B1) | 2001-09-01 | Ostrup et al. | Applicant |
| US6337985(B1) | 2002-01-01 | Roux et al. | Applicant |
| US6351499(B1) | 2002-02-01 | Paulraj et al. | Examiner |
| US6385181(B1) | 2002-05-01 | Tsutsui et al. | Applicant |
| US6426973(B1) | 2002-07-01 | Madhow et al. | Applicant |
| US6459409(B1) | 2002-10-01 | Kohno et al. | Examiner |
| US6690747(B2) | 2004-02-01 | Petrus et al. | Applicant |
| US7031679(B2) | 2006-04-01 | Persson et al. | Examiner |
| US7075906(B2) | 2006-07-01 | Douglas et al. | Examiner |
| US7145971(B2) | 2006-12-01 | Raleigh et al. | Examiner |
| US7483675(B2) | 2009-01-01 | Kent et al. | Examiner |
| US7492743(B2) | 2009-02-01 | Uhlik | Examiner |
| EP639035 | 1995-02-01 | Applicant | |
| EP665665 | 1995-08-01 | Applicant | |
| EP713261 | 1996-05-01 | Applicant | |
| EP777400 | 1997-06-01 | Applicant | |
| EP788914 | 1997-07-01 | Applicant | |
| EP841827 | 1998-05-01 | Applicant | |
| GB2237706 | 1991-05-01 | Applicant | |
| GB2295524 | 1996-05-01 | Applicant | |
| GB2313261 | 1997-11-01 | Applicant | |
| JP7170548 | 1995-07-01 | Applicant | |
| WO-9534103 | 1995-12-01 | Applicant | |
| WO-9622642 | 1996-07-01 | Applicant | |
| WO-9622647 | 1996-07-01 | Applicant | |
| WO9702262 | 1997-01-01 | Applicant | |
| WO-9708849 | 1997-03-01 | Applicant | |
| WO-9801963 | 1998-01-01 | Applicant | |
| WO-9817037 | 1998-04-01 | Applicant | |
| WO-9817071 | 1998-07-01 | Applicant | |
| WO-9828864 | 1998-07-01 | Applicant | |
| WO-9833346 | 1998-07-01 | Applicant |
Non-Patent Literature (31)
- Acampora, et al., “A New Adaptive MAC Layer Protocol for Wireless ATM Networks in Harsh Fading and Interference Environments”, 1997 IEEE, (1997),410-415.Applicant
- Agee, et al., “Blind Seperation and Capture of Communication Signals Using a Multitarget Constant Modulus Beaniformer”, Proc. IEEE Military Communications Conference, vol. 2, (Oct. 7, 1998),1-12.Applicant
- Aschied, et al., “An All Digital Receiver Architecture for Bandwidth Efficient Transmission at High Data Rates”, IEEE Transactions on Communications, vol. 37, No. 8, (1989),804-813.Applicant
- Farsakh, et al., “A Real Time Downlink Channel Allocation Scheme for an SDMA Mobile Radio System”, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 3,(Oct. 18, 1996),1215-1220.Applicant
- Farsakh, et al., “Channel Allocation and Downlink Beamforming in an SDMA Mobile Radio System”, PIMRC '95, Wireless: Merging onto the Information Superhighway, 6th IEEE International Symposium, Toronto, Ont. Canada, (Sep. 27-29, 1995),687-691.Applicant
- Franks, “Synchronization Subsystems: Analysis and Design”, Digital Communications Satellite/Earth Station Engineering, (1981),294-335.Applicant
- Friedlander, et al., “Direction Finding for Wideband Signals Using an Interpolated Array”, IEEE Publication, (1991),583-587.Applicant
- Friedlander, “Direction Finding Using an Interpolated Array”, International Conference on Acoustics, Speech and Signal Processing, vol. 5,(Apr. 3, 1990),2951-2954.Applicant
- Ganz, et al., “A Data-Derived Reference Signal Technique for Adaptive Arrays”, IEEE Transactions on Communications, vol. 37, No. 9, (Sep. 1989),975-983.Applicant
- Gerlach, et al., “Base Station Transmitter Antenna Arrays with Mobile to Base Feedback”, IEEE Asilomar Conference on Signals, Systems & Computers, (1993),1432-1436.Applicant
- Iltis, et al., “A Digital DS Spread-Spectrum Receiver With Joint Channel and Doppler Shift Estimation”, IEEE Transactions on Communications, vol. 39, No, 8,(Aug. 1991),1255-1267.Applicant
- Krishnamurthy, et al., “Polling Based Media Access Protocols for Use With Smart Adaptive Array Antennas”, IEEE, (1998),337-344.Applicant
- Lee, et al., “Decision Directed Carrier Recovery—Chapter 16: Carrier Recovery”, Digital Communications, 2nd Edition, Kluwer Academic Pub., (1994),725-764.Applicant
- Lee, et al., “Decision Directed Carrier Recovery—Chapter 17: Timing Recovery”, Digital Communications, 2nd Edition, Kluwer Academic Pub., (1994),737-764.Applicant
- Lundell, et al., “Applications of the Constant Modulus Adaptive Beamformer to Constant and Non-Constant Modulus Signals”, Proceedings. 1998 Asilomar Conference on Signals, Systems, and Computers (ACSSC-1988), (1988),432-436.Applicant
- Muhamed, et al., “Direction of Arrival Estimation Using Antenna Arrays”, The Bradley Dept. of Electrical Engineering, Mobile and Portable Radio Research Group, Section 3.8,(1996),64-71.Applicant
- Ottersten, B. , “Array Processing for Wireless Communications”, Proc. 8th IEEE Signal Processing Workshop on Statistical Signal and Array Proc., (Jun. 1996),466-473.Applicant
- Papadias, et al., “A Space-Time Constant Modulus Algorithm for SDMA Systems”, Proceedings, IEEE 46th Vehicular Technology Conference, (1996),86-90.Applicant
- Rashid-Farrokhi, F. , et al., “Downlink and Uplink Capacity Enhancement in Power Controlled Cellular Systems”, Proceedings, 1997 IEEE 47th Vehicular Technology Conference, vol. 2, May 4-7, 1997, New York, NY IEEE,(1997),647-651.Applicant
- Rashid-Farrokhi, F.. “Downlink Power Control and Base Station Assignment”, IEEE Communications Letters, vol. 1, No. 4,(Jul. 1997),102-104.Applicant
- Rashid-Farrokhi, P. , et al., “Joint Power Control and Beamforming for Capacity Improvement in Wireless Networks with Antenna Arrays”, Conference Record, IEEE Globecom, vol. 1, New York, NY IEEE,(1996),555-559.Applicant
- Rashid-Farrokhi, F. , et al., “Transmit Diversity and Equalizatio9n for Power Controlled Wireless Networks”, Conference Record. 31st Asilomar Conference on Signals, Systems and Computers, vol. 1, Conference Date Nov. 2-5, 1997, New York, NY IEEE,(1997),620-624.Applicant
- Rashid-Farrokhi, F. , et al., “Transmitting Beamforming for Cellular Wireless Communications”, Conference on Information Sciences and Systems (CISS-07), (Mar. 1997).Applicant
- Swidlehurst, et al., “Analysis of a Decision Directed Beamformer”, IEEE Transactions on Signal Processing, vol. 43, No. 12,(Dec. 1925),2920-2927.Applicant
- Talwar, et al., “Blind Estimation of Multiple Co-Channel Digital Signals Arriving at an Antenna Array”, 1993, Proc. 27th Asilomar Conference on Signals, Systems and Computers, vol. 1,(1993),349-342.Applicant
- Talwar, et al., “Recursive Algorithms for Estimating Multiple Co-Channel Digital Signals Received at an Antenna Array”, Proceedings of the Fifth Annual IEEE Dual Use Technologies and Applications Conference.Applicant
- Vander Veen, et al., “A Constant Modulus Factorization Technique for Smart Antenna Applications in Mobile Communications”, Advanced Signal Processing Algorithms, Architecturs, and Implementations V, SPIE, vol. 2296,(1994),230-241.Applicant
- Xu, et al., “Throughput Multiplication of Wireless LANs for Multimedia Services: SDMA Protocol Design”, IEEE (1994),1326-1332.Applicant
- Zhang, et al., “Performance of a Modified Polling Strategy for Broadband Wireless LANs in a Harsh Fading Environment”, Globecom, (1991),1141-1146.Applicant
- TS 25.214 V1.0.0 (Apr. 1999), Utra FDD; Physical layer procedures, 31 pages.Applicant
- 802.16e™, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Statements, Feb. 28, 2006, Sections 6, 7, and 8, pp. 17-650. See in particular subchapters 6.1, 6A, 7.1, 7.2, 8.4 and 8.4.8.Applicant