Systems and methods for intelligently-tuned digital self-interference cancellation

Information

  • Patent Grant
  • 10840968
  • Patent Number
    10,840,968
  • Date Filed
    Wednesday, December 18, 2019
    4 years ago
  • Date Issued
    Tuesday, November 17, 2020
    3 years ago
Abstract
A system for digital self-interference cancellation includes a filter that generates a reduced-noise digital residue signal; a channel estimator that generates a current self-interference channel estimate from a digital transmit signal, the reduced-noise digital residue signal, and past self-interference channel estimates; a controller that dynamically sets the digital transform configuration in response to changes in a controller-sampled digital residue signal; a predictor that modifies output of the channel estimator to compensate for a first time delay incurred in tuning the system for digital self-interference cancellation; and a channel memory that stores the past self-interference channel estimates.
Description
TECHNICAL FIELD

This invention relates generally to the wireless communications field, and more specifically to new and useful systems and methods for intelligently-tuned digital self-interference cancellation.


BACKGROUND

Traditional wireless communication systems are half-duplex; that is, they are not capable of transmitting and receiving signals simultaneously on a single wireless communications channel. Recent work in the wireless communications field has led to advancements in developing full-duplex wireless communications systems; these systems, if implemented successfully, could provide enormous benefit to the wireless communications field. For example, the use of full-duplex communications by cellular networks could cut spectrum needs in half. One major roadblock to successful implementation of full-duplex communications is the problem of self-interference. While progress has been made in this area, many of the solutions intended to address self-interference fall short in performance, especially when tuning digital self-interference cancellation systems. Thus, there is a need in the wireless communications field to create new and useful systems and methods for intelligently-tuned digital self-interference cancellation. This invention provides such new and useful systems and methods.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 is a schematic representation of a full-duplex transceiver;



FIG. 2 is a schematic representation of a system of an invention embodiment;



FIG. 3A is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 3B is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 3C is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 4 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 5 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 6 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 7 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 8 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 9A is a plot representation of a self-interference channel estimate;



FIG. 9B is a plot representation of a predicted self-interference channel estimate;



FIG. 10 is a schematic representation of a predictor of a digital self-interference canceller of a system of an invention embodiment;



FIG. 11 is a schematic representation of a predictor of a digital self-interference canceller of a system of an invention embodiment;



FIG. 12 is a schematic representation of a predictor of a digital self-interference canceller of a system of an invention embodiment;



FIG. 13 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 14 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 15 is a schematic representation of a digital self-interference canceller of a system of an invention embodiment;



FIG. 16A is a plot representation of a predicted self-interference channel estimate;



FIG. 16B is a plot representation of a time-interpolated predicted self-interference channel estimate;



FIG. 17 is a plot representation of self-interference channel magnitude smoothing; and



FIG. 18 is a plot representation of self-interference channel phase smoothing.





DESCRIPTION OF THE INVENTION EMBODIMENTS

The following description of the invention embodiments of the invention is not intended to limit the invention to these invention embodiments, but rather to enable any person skilled in the art to make and use this invention.


1. Full-duplex Wireless Communication Systems


Wireless communications systems have revolutionized the way the world communicates, and the rapid growth of communication using such systems has provided increased economic and educational opportunity across all regions and industries. Unfortunately, the wireless spectrum required for communication is a finite resource, and the rapid growth in wireless communications has also made the availability of this resource ever scarcer. As a result, spectral efficiency has become increasingly important to wireless communications systems.


One promising solution for increasing spectral efficiency is found in full-duplex wireless communications systems; that is, wireless communications systems that are able to transmit and receive wireless signals at the same time on the same wireless channel. This technology allows for a doubling of spectral efficiency compared to standard half-duplex wireless communications systems.


While full-duplex wireless communications systems have substantial value to the wireless communications field, such systems have been known to face challenges due to self-interference; because reception and transmission occur at the same time on the same channel, the received signal at a full-duplex transceiver may include undesired signal components from the signal being transmitted from that transceiver. As a result, full-duplex wireless communications systems often include analog and/or digital self-interference cancellation circuits to reduce self-interference.


Full-duplex transceivers preferably sample transmission output as baseband digital signals, intermediate frequency (IF) analog signals, or as radio-frequency (RF) analog signals, but full-duplex transceivers may additionally or alternatively sample transmission output in any suitable manner. This sampled transmission output may be used by full-duplex transceivers to remove interference from received wireless communications data (e.g., as RF/IF analog signals or baseband digital signals). In many full-duplex transceivers, an analog self-interference cancellation system is paired with a digital self-interference cancellation system. The analog cancellation system removes a first portion of self-interference by summing delayed and scaled versions of the RF transmit signal to create an RF self-interference cancellation signal, which is then subtracted from the RF receive signal. Alternatively, the analog cancellation system may perform similar tasks at an intermediate frequency. After the RF (or IF) receive signal has the RF/IF self-interference cancellation signal subtracted, it passes through an analog-to-digital converter of the receiver (and becomes a digital receive signal). After this stage, a digital self-interference cancellation signal (created by transforming a digital transmit signal) is then subtracted from the digital receive signal.


Full-duplex transceivers often include tuning systems that adjust tunable parameters of the analog self-interference cancellation system in order to adapt the analog self-interference cancellation signal to changing self-interference conditions. Likewise, full-duplex transceivers may similarly include tuning systems that alter the transform configuration of digital self-interference cancellation systems for the same purpose.


Well-tuned digital and analog self-interference cancellation systems are generally effective for reducing interference, but tuning in these systems is often a time-consuming process. This poses a problem: the longer a system takes to retune, the more likely it is that the system will be unable to adapt to rapidly changing self-interference characteristics. Consequently, the usefulness of full-duplex transceivers may be limited.


The systems and methods described herein increase tuning performance of full-duplex transceivers as shown in FIG. 1 (and other applicable systems) by performing digital self-interference canceller tuning, thus allowing for increased effectiveness in self-interference cancellation. Other applicable systems include active sensing systems (e.g., RADAR), wired communications systems, wireless communications systems, and/or any other suitable system, including communications systems where transmit and receive bands are close in frequency, but not overlapping.


2. System for Intelligently-tuned Digital Self-interference Cancellation


As shown in FIG. 2, a system 100 for intelligently-tuned digital self-interference cancellation includes a digital self-interference canceller 140. The system 100 may additionally or alternatively include a receiver 110, a transmitter 120, a signal coupler 130, analog-to-digital converters (ADCs) 150 and 151, a digital-to-analog converter (DAC) 152, and an analog canceller 160.


The system 100 functions to increase the performance of self-interference cancellation by performing digital self-interference canceller tuning intelligently based on both transmit signal input and residue signal input. Transmit signal input is used to identify components of a transmit signal likely to be reflected in received self-interference, while residue signal input is used to determine the effects of self-interference cancellation.


The system 100 is preferably implemented using both digital and analog circuitry. Digital circuitry is preferably implemented using a general-purpose processor, a digital signal processor, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) and/or any suitable processor(s) or circuit(s). Analog circuitry is preferably implemented using analog integrated circuits (ICs) but may additionally or alternatively be implemented using discrete components (e.g., capacitors, resistors, transistors), wires, transmission lines, waveguides, digital components, mixed-signal components, or any other suitable components. The system 100 preferably includes memory to store configuration data, but may additionally or alternatively be configured using externally stored configuration data or in any suitable manner.


The receiver 110 functions to receive analog receive signals transmitted over a communications link (e.g., a wireless channel, a coaxial cable). The receiver no preferably converts analog receive signals into digital receive signals for processing by a communications system, but may additionally or alternatively not convert analog receive signals (passing them through directly without conversion).


The receiver 110 is preferably a radio-frequency (RF) receiver substantially similar to the receiver of U.S. patent application Ser. No. 15/362,289, the entirety of which is incorporated by this reference, but may additionally or alternatively be any suitable receiver.


The transmitter 120 functions to transmit signals of the communications system over a communications link to a second communications system. The transmitter 120 preferably converts digital transmit signals into analog transmit signals.


The transmitter 120 is preferably a radio-frequency (RF) transmitter substantially similar to the transmitter of U.S. patent application Ser. No. 15/362,289, but may additionally or alternatively be any suitable transmitter.


The signal coupler 130 functions to allow signals to be split and/or joined. The signal coupler 130 may be used to provide a sample of the analog transmit signal for the digital canceller 140 and/or analog cancellers 160; that is, the signal coupler 130 may serve as a transmit coupler. The signal coupler 130 may also be used to combine one or more analog self-interference cancellation signals (from analog/digital cancellers) with the analog receive signal; that is, the signal coupler 130 may serve as a receive coupler. Additionally or alternatively, the signal coupler 130 may be used for any other purpose. For example, as shown in FIG. 2, a signal coupler 130 may be used to provide a sample of a residue signal (in this case, an analog receive signal that has already been combined with an analog self-interference cancellation signal) to the digital canceller 140. The signal coupler 130 is preferably substantially similar to the signal coupler of U.S. patent application Ser. No. 15/362,289, but may additionally or alternatively be any suitable signal coupler.


The digital self-interference canceller 140 functions to produce a digital self-interference cancellation signal from a digital transmit signal, as shown in FIG. 3A, FIG. 3B, and FIG. 3C. The digital self-interference cancellation signal is preferably converted to an analog self-interference cancellation signal (by the DAC 152) and combined with one or more analog self-interference cancellation signals to further reduce self-interference present in the RF receive signal at the receiver 110. Additionally or alternatively, the digital self-interference cancellation signal may be combined with a digital receive signal (e.g., after the receiver no, as shown in FIG. 1).


The digital self-interference canceller 140 preferably samples the RF transmit signal of the transmitter 120 using the ADC 150 (additionally or alternatively, the canceller 140 may sample the digital transmit signal or any other suitable transmit signal) and transforms the sampled and converted RF (or IF) transmit signal to a digital self-interference signal based on a digital transform configuration. The digital transform configuration preferably includes settings that dictate how the digital self-interference canceller 140 transforms the digital transmit signal to a digital self-interference signal (e.g. coefficients of a generalized memory polynomial used to transform the transmit signal to a self-interference signal).


Note that the digital self-interference canceller 140 may be coupled to any transmit and/or receive signals (either as input to the canceller or as outputs of the canceller), as described in U.S. patent application Ser. No. 14/569,354, the entirety of which is incorporated by this reference. For example, the digital self-interference canceller may take as input an RF-sourced intermediate frequency (IF) transmit signal (e.g., the transmit signal is converted to RF by the transmitter 120, then downconverted to IF by a downcoverter, then passed through the ADC 150 to the digital canceller 140) or may output at IF (e.g., the digital self-interference cancellation signal is converted to a digitally-sourced IF self-interference cancellation signal, and is then combined with an IF self-interference cancellation signal at IF, before the combined self-interference cancellation signal is converted to RF and combined with an RF receive signal).


The digital self-interference canceller 140 may be implemented using a general-purpose processor, a digital signal processor, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) and/or any suitable processor(s) or circuit(s). The digital self-interference canceller 140 preferably includes memory to store configuration data, but may additionally or alternatively be configured using externally stored configuration data or in any suitable manner.


The digital self-interference canceller 140 preferably includes a filter 142, a channel estimator 143, a controller 144, and channel memory 145, as shown in FIG. 3A, FIG. 3B, and FIG. 3C. The digital self-interference canceller may additionally or alternatively include a transformer 141, a predictor 146, and/or an extender 147.


The transformer 141 functions to transform signals (e.g., a digital transmit signal, an output signal of the canceller 140) into an alternate-basis representation to perform some function (generally, to calculate the self-interference channel before transforming the channel back into the original representation).


For example, in one implementation as shown in FIG. 4, transformers 141 may be used to convert time-domain input signals into the frequency domain (via a Fourier transform). The Fourier-transformed input is used to generate a self-interference cancellation signal, which is then converted back to the time domain by another transformer 141. In this implementation, the Fourier transform may be performed using a Discrete Fourier Transform (DFT) matrix. Likewise, the inverse Fourier transform may be calculated using the pseudo-inverse of the DFT matrix; i.e., an Inverse Discrete Fourier Transform (IDFT) matrix. Calculating the IDFT using the DFT without modification results in the same number of time domain signal components generated (e.g., ‘taps’ of the self-interference cancellation channel) as frequency points in the original DFT.


In many cases, it may be desirable to perform the DFT using a high resolution matrix (i.e., use many frequencies), while receiving a lower-resolution (i.e., fewer number of time domain components) solution. Likewise, it may be desirable to restrict the solution to specific frequencies of interest (or simply lower frequency resolution used to generate the solution). To accomplish this, in one embodiment, a transformer 141 may perform the IFFT using a reduced IDFT matrix calculated by first reducing the number of time and frequency domain components (e.g., zeroing out parts of the matrix, neglecting parts of the matrix) present in the DFT matrix and then calculating the pseudo-inverse of this reduced DFT matrix to generate the reduced IDFT matrix.


Frequency and time domain components may be removed in any manner and to accomplish any goal. For example, time domain components may be removed to match a certain solution size (e.g., 64 taps), and frequency components may be removed if they are not considered frequencies of particular interest (e.g., as determined from a lookup table of which receive frequencies are important, by measuring the accuracy of self-interference cancellation at different frequencies, by measuring the amount of self-interference present at different signals, etc.). Alternatively, DFT matrix reduction may be performed in any way.


While the transformer 141 may perform Fourier (or inverse Fourier) transforms as a basis-changing technique, the transformer 141 may additionally or alternatively perform any suitable basis-changing transformation. For example, many components of the self-interference channel solution may be correlated; this correlation can result in slow convergence of transform configuration parameters. Resultantly, in one implementation of a preferred embodiment, the transformers 141 may orthogonalize (or otherwise decorrelate) input components using a decorrelation matrix. For example, this decorrelation may be performed using a static decorrelation matrix based on a Gaussian input distribution (or other expected signal distribution) for a given transmission power or using a static decorrelation matrix based on subtraction of expected transmission power; e.g.,







[











]

=


[



1


0


0






-
3



σ
2




1


0





(

15


σ
4


)





-
10



σ
2




1



]

*

[




s
1










s
1



2

*

s
1











s
1



4

*

s
1





]







where σ2 is the power of the linear transmit signal s1.


Transformers 141 may alternatively perform decorrelation using any other method, including using singular value decomposition (SVD), a dynamically computed decorrelation matrix, and/or a matrix similar to the above exemplified static matrix, except with expected power computed dynamically.


The filter 142 functions to reduce noise in the signals received at the filter. For example, the filter 142 may receive a transmit signal Tx and a residue signal Rxr (the receive signal Rx after digital self-interference cancellation), as shown in FIG. 3A. Additionally or alternatively, the filter 142 may receive any signals relevant to interference cancellation (e.g., Rx instead of Rxr, or a ratio of signals; e.g., Rxr/Tx). Note that the filter 142 may additionally or alternatively pass signals without filtering. For example, the filter 142 may pass a digital transmit signal without filtering it. Further, if the filter 142 outputs a signal based on the same content to different destinations, the filter 142 may filter the signal differently based on the destination. For example, the filter 142 may output a first filtered digital residue signal to the controller 144 and a second filtered digital residue signal to the channel estimator 143, and the parameters of filtering (and thus the output signals themselves) may be non-identical between the first and second filtered digital residue signals.


Rx may be written as follows: Rx=TxH+Z, where Rx is the receive signal (noting that this receive signal may already have some amount of interference cancellation resulting from analog cancellation), Tx is the transmit signal, H is the self-interference channel, and Z is noise (which includes an actual receive signal if present). Likewise, the residue signal after digital self-interference cancellation may be written as Rxr=Tx(H−Ĥ)+Z, where Ĥ is a self-interference channel estimate and −TxĤ represents the self-interference cancellation signal.


The filter 142 preferably reduces input noise by performing time-averaging of input signals to prepare the signals for self-interference cancellation signal generation. The filter 142 may perform time-averaging in any manner; e.g., block averaging, moving averaging, infinite impulse response (IIR) filtering, etc.


Time averaging functions to reduce the effect of noise in channel estimates (e.g., as Z varies independent of H). As discussed in later sections, the controller 144 preferably dynamically adjusts the number of samples the filter 142 uses to perform averaging (i.e., the averaging window) to improve canceller 140 performance. Larger sampling windows allow for increased immunity to noise, but at the cost of ability to track rapid self-interference channel variation. The controller 144 may additionally or alternatively vary any aspect of filtering.


The filter 142 may additionally or alternatively perform any signal transformation to aid in preparing input signals for self-interference cancellation. For example, the filter 142 may perform sample rate conversion of signals, scaling, shifting, and/or otherwise modifying signals.


In one implementation, the filter 142 modifies sampled digital transmit signals by removing information unlikely to substantially affect the output of the channel estimator 143. This may include, for instance, dropping samples if the samples do not represent a change above some change threshold from previous samples. As another example, if digital transmit signals correspond to a particular amplitude of an output analog signal, only digital signal data corresponding to an amplitude above some amplitude threshold may be passed to the channel estimator 143.


If the filter 142 receives digital transmit signals from more than one source (e.g. from both the digital transmit line before the RF transmitter and the analog transmit line after the RF transmitter via an ADC), the filter 142 may additionally or alternatively combine the signals in any suitable way or may select one signal over another. For instance, the filter 142 may pass the average of the two signals to the estimator 143. As another example, the filter 142 may prefer an RF-sourced digital transmit signal (e.g., from the ADC 150) over the transmit-path digital transmit signal (e.g., sampled before conversion by the transmitter 120) above a certain transmitter power, and vice versa at or below that transmitter power. The selection and combination of the two (or more) signals may be dependent on any suitable condition.


The filter 142 preferably passes both the digital transmit signal and the digital residue (i.e., the digital receive signal after the digital receive signal has been combined with the digital self-interference cancellation signal output by the system 100) but may additionally or alternatively pass any signals (e.g., a combination of transmit and residue, receive signal prior to combination with self-interference cancellation signal, etc.). The digital transmit signal after filtering may be referred to as a reduced-noise digital transmit signal; likewise, if the residue is filtered, it may be referred to as a reduced-noise residue signal.


The channel estimator 143 functions to generate a current self-interference cancellation channel estimate (Ĥ) from the output of the filter 142 or from any other suitable signal source.


The channel estimator 143 preferably generates a channel estimate from a weighted sum of signal components according to mathematical models adapted to model self-interference contributions of the RF transmitter, RF receiver, and/or other sources. Examples of mathematical models that may be used by the channel estimator 143 include generalized memory polynomial (GMP) models, Volterra models, and Wiener-Hammerstein models; the channel estimator 143 may additionally or alternatively use any combination or set of models.


The channel estimator 143 may additionally or alternatively use generated mathematical models for modeling self-interference contributions based on comparisons of sampled digital transmit signals to received signals (from the receive path or any other suitable source). These models may be generated from previously known models or may be created using neural network and/or machine learning techniques.


The channel estimator 143 preferably performs channel estimate generation according to a transform configuration set dynamically by the controller 144 (discussed in more detail in sections covering the controller 144). Additionally or alternatively, the channel estimator 143 may combine signal components in any manner in order to generate a self-interference channel estimate.


The channel estimator 143 preferably generates the self-interference channel estimate from a ratio of residue and transmit signals (e.g., Rxr/Tx) but may additionally or alternatively generate self-interference channel estimates from any signal data.


In addition to generating a self-interference channel estimate, the channel estimator 143 may also generate a self-interference cancellation signal by combining a digital transmit signal and the self-interference channel estimate (e.g., as shown in FIG. 3B). As a first alternative, the channel estimator 143 may pass the self-interference channel estimate along with the transmit signal without combining the two (e.g., as shown in FIG. 3A). As a second alternative, the channel estimator 143 may pass the self-interference channel estimate without passing the transmit signal. As a third alternative, the channel estimator 143 may pass any signal data relevant to self-interference cancellation.


The digital self-interference canceller 140 preferably includes a single channel estimator 143, but may additionally or alternatively include multiple channel estimators 143. For example, the digital self-interference canceller 140 may include one channel estimator 143 for linear self-interference cancellation and one for non-linear self-interference cancellation, as shown in FIG. 5. Signal components may be transmitted to multiple channel estimators 143 in any manner. If the canceller 140 includes multiple channel estimators 143, the output of these filters may be combined in any manner to generate a self-interference cancellation signal.


The controller 144 functions to set the transform configuration of the channel estimator 143. The controller 144 may additionally or alternatively set configuration of the filter 142.


The transform configuration preferably includes the type of model or models used by the channel estimator 143 as well as configuration details pertaining to the models (each individual model is a model type paired with a particular set of configuration details). For example, one transform configuration might set the channel estimator 143 to use a GMP model with a particular set of coefficients. If the model type is static, the transform configuration may simply include model configuration details; for example, if the model is always a GMP model, the transform configuration may include only coefficients for the model, and not data designating the model type.


The transform configuration may additionally or alternatively include other configuration details related to the filter 142 and/or the channel estimator 143. For example, if the channel estimator 143 includes multiple transform paths, the controller 144 may set the number of these transform paths, which model order their respective component generators correspond to, and/or any other suitable details. In general, the transform configuration may include any details relating to the computation or structure of the filter 142 and/or the channel estimator 143.


Transform configurations are preferably selected and/or generated by the controller 144. The controller 144 may set an appropriate transform configuration by selecting from stored static configurations, from generating configurations dynamically, or by any other suitable manner or combination of manners. For example, the controller 144 may choose from three static transform configurations based on their applicability to particular signal and/or environmental conditions (the first is appropriate for low transmitter power, the second for medium transmitter power, and the third for high transmitter power). As another example, the controller 144 may dynamically generate configurations based on signal and/or environmental conditions; the coefficients of a GMP model are set by a formula that takes transmitter power, temperature, and receiver power as input.


The controller 144 preferably sets transform configurations based on a variety of input data (whether transform configurations are selected from a set of static configurations or generated according to a formula or model). Input data used by the controller 144 may include static environmental and system data (e.g. receiver operating characteristics, transmitter operating characteristics, receiver elevation above sea-level), dynamic environmental and system data (e.g. current ambient temperature, current receiver temperature, average transmitter power, ambient humidity), and/or system configuration data (e.g. receiver/transmitter settings), signal data (e.g., digital transmit signal, RF transmit signal, RF receive signal, digital receive signal). The controller 144 may additionally or alternatively generate and/or use models based on this input data to set transform configurations; for example, a transmitter manufacturer may give a model to predict internal temperature of the transmitter based on transmitter power, and the controller 144 may use the output of this model (given transmitter power) as input data for setting transform configurations.


When utilizing digital residue signals, the controller 144 preferably utilizes an un-filtered digital residue signal (as shown in FIGS. 3A and 3B), but may additionally or alternatively utilize a filtered digital residue signal (as shown in FIG. 3C). Likewise, any input signal data used by the controller 144 may be in raw form, in processed form, or in any other form. The digital residue signal used by the controller may be referred to as a controller-sampled digital residue signal.


The controller 144 may set transform configurations at any time, but preferably sets transform configurations in response to either a time threshold or other input data threshold being crossed. For example, the controller 144 may re-set transform configurations every ten seconds according to changed input data values. As another example, the controller 144 may re-set transform configurations whenever transmitter power thresholds are crossed (e.g. whenever transmitter power increases by ten percent since the last transform configuration setting, or whenever transmitter power increases over some static value).


The controller 144 may cooperate with the analog canceller 160 (for instance, setting transform configurations based on data from the analog canceller 160, coordinating transform configuration setting times with the analog canceller 160, disabling or modifying operation of the analog canceller 160) to reduce overall self-interference (or for any other suitable reason).


The controller 144 preferably adapts transform configurations and/or transform-configuration-generating algorithms (i.e., algorithms that dynamically generate transform configurations) to reduce self-interference for a given transmit signal and set of system/environmental conditions. The controller 144 may adapt transform configurations and/or transform-configuration-generating algorithms using analytical methods, online gradient-descent methods (e.g., LMS, RLMS), and/or any other suitable methods. Adapting transform configurations preferably includes changing transform configurations based on learning. In the case of a neural-network model, this might include altering the structure and/or weights of a neural network based on test inputs. In the case of a GMP polynomial model, this might include optimizing GMP polynomial coefficients according to a gradient-descent method.


The controller 144 may adapt transform configurations based on test input scenarios (e.g. scenarios when the signal received by the RF receiver is known), scenarios where there is no input (e.g. the only signal received at the RF receiver is the signal transmitted by the RF transmitter), or scenarios where the received signal is unknown. In cases where the received signal is an unknown signal, the controller 144 may adapt transform configurations based on historical received data (e.g. what the signal looked like ten seconds ago) or any other suitable information. The controller 144 may additionally or alternatively adapt transform configurations based on the content of the transmitted signal; for instance, if the transmitted signal is modulated in a particular way, the controller 144 may look for that same modulation in the self-interference signal; more specifically, the controller 144 may adapt transform configurations such that when the self-interference signal is combined with the digital receive signal the remaining modulation (as an indicator of self-interference) is reduced (compared to a previous transform configuration).


The controller 144 may additionally or alternatively function to set tuning parameters for components outside of the digital self-interference canceller 140, particularly if those parameters are relevant to digital self-interference canceller performance and/or tuning.


In addition to setting the transform configuration, the controller 144 may also be used to change other parameters surrounding digital self-interference cancellation. For example, the controller 144 may be used to modify the size of the averaging window (i.e., number of samples used to perform averaging) of a filter 142 in response to estimated channel characteristics.


In a first implementation of an invention embodiment, the controller 144 modifies the averaging window based on channel power. For example, the controller 144 may modify the averaging window based on the magnitude of







Rx
Tx






or






Rxr
Tx






(as estimates of self-interference channel power). Additionally or alternatively, the controller 144 may use any signal power (e.g., magnitude of Tx) to modify the averaging window. The controller 144 may select averaging windows based on the value of power (e.g., higher power->larger window), the rate of change of power







(


e
.
g
.

,


higher







d

d





t




[

Rxr
Tx

]



->

larger





window



)

,





or in any other manner. For example, rate of change of power may be found using channel update power (e.g., the difference in estimated channel power between channel updates).


While the technique described in the first implementation does enable the digital self-interference canceller 140 to adapt to changing self-interference channel conditions, it is not ideal for differentiating between scenarios where receive signal variation is largely due to variation in the channel and scenarios where receive signal variation is largely due to variation in noise (i.e., Z).


In a second implementation of an invention embodiment, the controller 144 modifies the averaging window based on a channel dynamics estimation η. η is preferably a metric that differentiates between the two aforementioned scenarios (e.g., η≈0 when changes in Z are much larger than changes in H, η≈1 when changes in H are much larger than changes in Z). η may approach a first value as the ratio of dH/dt becomes larger than dZ/dt and a second value in the opposite case (dZ/dt becomes larger than dH/dt). test η may differentiate between these two types of change by looking at correlation across frequency in the power change; while dynamic channel change is correlated across frequency, noise change is generally not.


This channel update change may be written as

{tilde over (H)}i,ki,k−Ĥi-1,ki,k+Ri,k

where i represents time, k represents subcarrier, Δ represents the change in channel update power due to channel dynamics, and R represents the change in channel dynamics due to noise (e.g., an actual receive signal).


In a first example of the second implementation, η is a correlation coefficient written as:






η
=





k
=
1


K
-
1






H
~


i
,

k
-
1


*




H
~


i
,
k








k
=
1


K
-
1








H
~


i
,
k




2








further noting











k
=
1


K
-
1






H
~


i
,

k
-
1


*




H
~


i
,
k








k
=
1


K
-
1








H
~


i
,
k




2










k
=
1


K
-
1





Δ

i
,

k
-
1


*



Δ

i
,
k




+




k
=
1


K
-
1





R

i
,

k
-
1


*



R

i
,
k







K






σ
Rx
2


+




k
=
1


K
-
1







Δ

i
,
k




2










k
=
1


K
-
1





Δ

i
,

k
-
1


*



Δ

i
,
k






K






σ
Rx
2


+




k
=
1


K
-
1







Δ

i
,
k




2








While this example metric operates via identification of frequency correlation, dynamic channel change is also correlated over time. Therefore, an alternative metric may be used:






η
=





k
=
1


K
-
1






H
~


i
,
k

*




H
~



i
+
1

,
k








k
=
1


K
-
1








H
~


i
,
k




2








Any metric measuring correlation across frequency and/or time may be used as an alternative metric for η. As another example,







η


=






Δ

i
,
k




2






Δ

i
,
k




2

+




R

i
,
k




2



=





k
=
1


K
-
1






A
*


H
~


i
,
k










k
=
1


K
-
1





H
~


i
,
k










where A is a smoothing matrix or other filtering operation.


The controller 144 may modify averaging window in any manner based on η. For example, the controller 144 may set a smaller averaging window if η approaches 1 (resulting in faster updates) or a larger averaging window if η approaches 0 (resulting in more immunity to noise).


Note that while the controller 144 preferably uses channel estimates generated by the channel estimator 143 to set averaging windows, the controller 144 may additionally or alternatively use channel estimates (or other self-interference channel information) from any other source. For example, the controller 144 may set averaging windows based on channel estimates received from channel memory, as shown in FIG. 6. In this example, the channel estimate used is less noisy; however, this noise may be colored due to Fourier transforms, which in turn may make the correlation metric less reliable. As a second example, the controller 144 may set averaging windows based on channel estimates received from the total updated channel, as shown in FIG. 7. Here, the channel noise is white and can be easily extended to architectures where the entire channel is re-estimated every update (as opposed to incremental updates); however, the noise variance is higher (and thus adaptive thresholds may be needed). As a third example, the controller 144 may set averaging windows based on channel estimates received from the time-domain (and potentially extended) total updated channel, as shown in FIG. 8. Here, the noise variance is smaller and requires fewer computations; however, the out-of-band channel influences the correlation metric, making it potentially less reliable.


The channel memory 145 functions to hold data relating to past self-interference channel estimates. In some use cases, it may be desired that the filter 142 and channel estimator 143 operate on only a subset of a full communication channel at a time. In many communication schemes, transmission may occur only some subchannels (of an overall full channel) at a given time. Accordingly, it may be possible (or desirable) only to update subchannels for which transmit signal data is available. In these use cases, the channel memory 145 functions to store the last known self-interference channel for each subchannel (or any other representation of the full self-interference channel) which may be combined with an incremental update generated by the channel estimator 143 to create a new full channel estimate. As shown in FIG. 3A, this new full channel estimate is then sent to the channel memory 145, where it may be stored as the most recent self-interference channel estimate.


Note that as shown in FIG. 3A, the channel estimate stored by the channel memory may be transformed before storage; however, additionally or alternatively the channel memory 145 may be updated directly from the combination of the channel memory 145 output and the channel estimator 143 output.


The digital self-interference canceller 140 may combine channel estimates from channel memory 145 with the output of the channel estimator 143 in any manner. For example, the digital self-interference canceller 140 may replace a section (e.g., a sub-band) of a past channel estimate with the output of the channel estimator 143. As a second example, the channel estimator 143 may average the output of the channel estimator 143 and the channel memory 145 within a sub-band of relevance.


The predictor 146 functions to predict a future self-interference cancellation channel estimate from current and/or past self-interference cancellation channel estimates. Because performing cancellation tuning takes time, any tuning on a varying self-interference channel is obsolete as soon as it is complete. The predictor 146 preferably modifies the output of the channel estimator 143 to compensate for some or all of the delay incurred by the tuning process. Additionally or alternatively, the predictor 146 may predict future self-interference cancellation channels in order to increase time in between tuning for the canceler 140.


For example, as shown in FIG. 9A, the estimated channel lags behind actual channel. The predictor 146 may modify the estimated channel based on past channel estimates, leading to a predicted channel, as shown in FIG. 9B. This may result in a significant reduction of error.


The predictor 146 may attempt to compensate for a known or estimated tuning delay (e.g., the delay between sampling a signal and estimating the self-interference channel from that signal), but may additionally or alternatively extrapolate the self-interference channel into the future by any amount of time (e.g., a time less than or greater than the aforementioned delay). Extrapolation may be performed using instantaneous time deltas, but may additionally or alternatively be performed using filtered time deltas (e.g., averaging measured time deltas). For example, using instantaneous time deltas, the predictor 146 may perform extrapolation for a given self-interference channel estimate based on the difference between the time at which the digital transmit signal and residue signal were sampled and the time that a channel estimate was generated. Likewise, using filtered time deltas, the predictor 146 may perform extrapolation based on the average of several such differences (e.g., the most recent three differences).


The predictor 146 preferably predicts self-interference channel data on a per-subcarrier (or per sub-band) basis (i.e., the self-interference channel of each subcarrier is predicted independently). Alternatively, the predictor 146 may jointly predict time and frequency variance of the self-interference channel (discussed in later sections).


The predictor 146 preferably performs linear extrapolation of the channel, but may additionally or alternatively perform any type of extrapolation (e.g., quadratic). The predictor 146 may additionally or alternatively perform signal prediction using any technique (e.g., Weiner filtering, MMSE prediction, adaptive filtering techniques such as LMS and RLS, or neural network/machine learning based techniques).


In one implementation of an invention embodiment, the predictor 146 includes an offset estimator, a differentiator, and a slope estimator, as shown in FIG. 10. In this implementation, the offset estimator and slope estimator are preferably infinite impulse response (IIR) low-pass filters, but additionally or alternatively, the estimators may be any suitable transformers capable of determining the slope and offset (i.e., the linear characteristics) of the self-interference channel. The estimators are preferably controlled by the controller 144 in response to feedback received at the controller, but may additionally or alternatively be controlled in any manner. Note here that the time ΔT represents the amount of extrapolation desired. This concept may be extended to any order; for example a predictor 146 including a 2nd derivative estimator is as shown in FIG. 11.


Further, the predictor 146 may additionally or alternatively predict self-interference channels in non-Cartesian coordinates. For example, the predictor 146 may transform self-interference channel estimates from Cartesian to polar coordinates, perform time extrapolation, and then convert back from polar to Cartesian coordinates.


As previously discussed, the predictor 146 preferably performs prediction on a per sub-carrier basis. In many communication schemes (e.g., LTE), even during periods of activity, not every sub-carrier is scheduled every symbol. There are two primary consequences that pertain to the predictor 146. The first is that if a sub-carrier is not active, prediction may not be useful until that sub-carrier is active again. The second is that if a substantial amount of inactive time passes, the incremental self-interference channel for that sub-carrier is often not accurately represented by an extrapolation of stale data. Further, the presence of stale data may cause new channel estimates to converge slowly.


The predictor 146 preferably addresses these issues by tracking the activity of each subcarrier and managing predictor state (for each sub-carrier) based on this activity. The predictor 146 preferably monitors the most recent times when each sub-carrier was scheduled. In an implementation of an invention embodiment, when a sub-carrier is (or will be) inactive for a substantial time (i.e., a time greater than some threshold), the prediction for that sub-carrier is disabled. This is referred to as the RESET state. Additionally, the memory for that prediction may be cleared (preventing stale data from influencing later prediction). When the sub-carrier is active again, prediction is enabled in the WARMUP state. In this state, prediction begins estimating channel parameters (e.g., slope and offset), but does not yet modify the channel estimate based on these parameters. After satisfaction of the WARMUP state (e.g., by passing a time threshold, by reaching a threshold parameter convergence), prediction is enabled in the NOMINAL state (where prediction operates as normal). Alternatively, prediction output and state many be managed in any way. For example, prediction may be turned on for linear components of the self-interference channel, but disabled for higher order components of the self-interference channel.


Predicting channel estimates may have additional challenges when sub-carriers are not uniformly sampled in time. In an implementation of an invention embodiment, the predictor 146 scales differential values based on latched timestamps to compensate for non-uniform sampling, as shown in FIG. 12. Here, ΔT1 is the time at which prediction is desired minus the current time, and ΔT2 is the current time minus the previous update time.


While the predictor 146 has been described in some implementations as a combination of digital elements (see e.g., FIGS. 10-12), the predictor 146 may additionally or alternatively be implemented in any way; for example, as an end-to-end transfer function performing prediction.


The predictor 146 preferably performs prediction in the frequency domain, as shown in FIG. 13. Alternatively, the predictor 146 may perform prediction in the time domain, as shown in FIG. 14. This can reduce the complexity of prediction (because the time domain solution is generally smaller than the frequency domain solution), but may also diminish the ability to control for prediction on a sub-carrier basis.


As another alternative configuration, the predictor 146 may occur after the channel estimate has been converted to time domain and then back again to frequency domain (e.g., denoising), as shown in FIG. 15. While denoising leads to a cleaner prediction, it may also increase prediction complexity.


In a variation of an invention embodiment, the predictor 146 may extrapolate for a given subcarrier based not only on historical channel data for that subcarrier, but also for neighboring subcarriers. This may be particularly useful for communications systems where sub-carriers are scheduled intermittently.


While the predictor 146 as described above generally calculates an extrapolated channel estimate across frequencies for a given time, the predictor 146 may additionally perform time-domain interpolation to bridge between frequency-domain extrapolations. To exemplify this, consider a purely frequency domain example of the predictor. A first estimate of the channel is given at t0, and a second estimate of the channel is estimated to occur at t1. In a first example (with no time-domain interpolation), the self-interference channel is predicted on an extrapolation of the channel estimate at t0 extrapolated by








Δ





T

=



t
1

-

t
0


2


,





as shown in FIG. 16A. This channel estimate is used until the second estimate of the channel is received (if the extrapolation is close to reality, self-interference performance will be best at t0+ΔT, and not as good elsewhere). In a time-domain interpolation example, the self-interference channel is predicted on an extrapolation of the channel estimate at to extrapolated by ΔT=t1−t0, and then linearly interpolated based on the current time, as shown in FIG. 16B. This provides some of the advantages of time-domain prediction without the full complexity.


The extender 147 functions to extend self-interference channel estimates to smooth estimate edges (e.g., if a self-interference channel is calculated for a particular band and zero outside of that band, there may be a discontinuity or sharp edge at the band edge). Edges or other rapidly-varying features may require a large number of components to accurately implement the channel estimate in the time domain (e.g., in the interference canceller 140). Thus, it may be desirable to smooth such features in the frequency domain representation of the self-interference channel prior to converting the channel estimate to a time domain representation, in order to simplify the time domain representation of the transform in the canceller 140.


In smoothing either the magnitude or phase response of the channel estimate in the frequency domain, it may be necessary for the extender 147 to identify and/or locate edges or other similarly abrupt changes and/or rapidly varying features. Various techniques may be used to locate the edges. A first such variation is to compute the local derivative of the response vs. frequency (e.g., using a finite-differencing scheme) at each frequency value of the response, and to consider an “edge” to be located at any frequency where the local derivative exceeds a particular threshold. Thus, a local slope that is sufficiently “steep” (i.e., has a sufficiently large first derivative) can be recognized as an edge or other feature in need of smoothing. A related variation includes computing the local first derivative only within frequency bands of the response where sharp variations are known to occur, in order to reduce the computation time of edge detection. In other variations, locating edges or other abrupt changes may include one or a combination of step detection algorithms, such as 0-degree spline fitting, piecewise constant denoising, and variational methods (e.g., the Potts model). Additionally or alternatively, abrupt changes in the responses requiring smoothing can be located in any other suitable manner.


As shown in FIG. 17, the extender 147 preferably includes smoothing the magnitude response of a self-interference channel estimate. In this example, exponential decay functions are matched to edges (i.e., where the derivative of magnitude response vs. frequency exceeds a threshold) of the magnitude response. However, other functions may additionally or alternatively be matched to the edges of the magnitude response, such as a polynomial function, a cubic spline, or any other suitable smoothly varying function. The function used is preferably selected in order to minimize the number of components needed to represent the transform in the time domain, but can alternatively be selected for any suitable reason. The extender 147 may also extrapolate or otherwise modify magnitude response of an estimate in any manner, including performing curve fitting on portions of the magnitude response of an estimate. The extender 147 may also filter portions of the magnitude response of the estimate (e.g., median filtering, convolution filtering, and/or any other suitable smoothing filtering).


As shown in FIG. 18, the extender 147 preferably also smooths the phase response of the transform. In this example, phase is extrapolated linearly between edges of phase response (i.e., where the derivative of phase response vs. frequency exceeds a threshold). The extender 147 may also extrapolate or otherwise modify phase response of an estimate in any manner, including performing curve fitting on portions of the phase response of an estimate. The extender 147 may also filter portions of the phase response of the estimate (e.g., median filtering, convolution filtering, and/or any other suitable smoothing filtering).


The digital self-interference canceller 140 may additionally or alternatively include any other components as described in U.S. patent application Ser. No. 15/362,289, e.g., blocker filters, filter inverters, etc. The digital self-interference canceller 140 may additionally or alternatively include gain/phase compensators that function to modify the gain and phase of either the digital receive signal or the digital self-interference cancellation signal such that the two signals are aligned in gain and phase. Gain/phase compensation thus enables the canceller 140 to compensate for gain and/or phase error induced by the receive chain (or other sources). Gain/phase correction values are preferably set by the controller 144, but may additionally or alternatively be set in any manner.


The ADC 150 functions to convert a transmit signal from an analog signal to a digital signal; this signal is hereafter referred to as a converted transmit signal. Alternatively, the signal post-conversion may be referred to as an RF-sourced digital transmit signal (assuming conversion from an RF transmit signal) or an IF-sourced digital transmit signal (assuming conversion from an IF transmit signal). The ADC 150 is preferably substantially similar to the ADC 111, but may additionally or alternatively be any suitable ADC.


In addition to analog-to-digital signal conversion, the ADC 150 may perform signal scaling (in either analog or digital domains) as well as frequency conversion (in either analog or digital domains) for input analog signals. In one implementation, the ADC 150 includes at least one of a variable-gain amplifier (VGA) and a digital scaler. The variable-gain amplifier functions to scale an analog signal before conversion via the ADC 150, while the digital scaler functions to scale a digital signal after conversion via the ADC 150. Both the VGA and digital scaler are preferably capable of scaling signals with any complex multiplier (e.g., resulting in both amplitude and phase shift), but may additionally or alternatively be capable of scaling signals with a subset of the set of complex numbers. For example, a VGA may only be capable of scaling signals by a real number between 1 and 4.


The ADC 151 is preferably substantially similar to the ADC 150, except the ADC 151 functions to convert a receive signal from an analog signal to a digital signal. The ADC 151 preferably is used to sample a receive signal post-self-interference cancellation (i.e., a residue signal) to evaluate self-interference canceller 140/160 performance and/or aid in canceller tuning. Note that the system 100 may include multiple ADCs 151, and they may sample receive signals of the system 100 at any point. For example, the system 100 may include three ADCs 151; one coupled to a receive signal prior to any self-interference cancellation, one coupled to a receive signal after analog self-interference cancellation but prior to digital self-interference cancellation, and one coupled to the receive signal after both analog and digital self-interference cancellation. Likewise, one ADC 151 may couple to all three of those signals.


The DAC 152 functions to convert the digital self-interference cancellation signal from a digital signal to an analog signal; this signal is hereafter referred to as a converted digital self-interference cancellation signal. Alternatively, the signal post-conversion may be referred to as an digitally-sourced RF self-interference cancellation signal (assuming conversion to RF) or a digitally-sourced IF self-interference cancellation signal (assuming conversion to IF). The DAC 152 is preferably substantially similar to the DAC 121, but may additionally or alternatively be any suitable DAC.


In addition to digital-to-analog signal conversion, the DAC 152 may perform signal scaling (in either analog or digital domains) as well as frequency conversion (in either analog or digital domains) for input digital signals. In one implementation, the DAC 152 includes at least one of a variable-gain amplifier (VGA) and a digital scaler. The digital scaler functions to scale a digital signal before conversion via the DAC 152, while the VGA functions to scale an analog signal after conversion via the DAC 152. Both the VGA and digital scaler are preferably capable of scaling signals with any complex multiplier (e.g., resulting in both amplitude and phase shift), but may additionally or alternatively be capable of scaling signals with a subset of the set of complex numbers. For example, a VGA may only be capable of scaling signals by a real number between 1 and 4.


VGAs and/or digital scalers of the ADCs 150/151 and the DAC 152 are preferably controlled by the controller 144. For example, the controller 144 could set the scale factor of a scaler (dig. scaler and/or VGA) of the DAC 152 based on the content and/or amplitude of a residue signal; e.g., the transform adaptor 142 may increase the gain of the DAC 152 output in order to lower self-interference present in the residue signal. As another example, the controller 144 could temporarily reduce the gain of the DAC 152 to 0 for tuning purposes (e.g., to establish a baseline level of cancellation in the residue signal, where the baseline level is set based solely on cancellation performed by the analog canceller 160). As a third example, the controller 144 could increase the gain of the ADC 151 in response to a low-amplitude residue signal (e.g., the ADC 151 VGA gain could be re-set to increase the likelihood that the signal is neither clipped nor lost in noise by the analog-to-digital conversion block).


The analog self-interference canceller 160 functions to produce an analog self-interference cancellation signal from an analog transmit signal that can be combined with an analog receive signal to reduce self-interference present in the analog receive signal. The analog self-interference canceller 160 is preferably designed to operate at a single frequency band, but may additionally or alternatively be designed to operate at multiple frequency bands. The analog self-interference canceller 160 may include any of the circuits related to analog self-interference cancellation of U.S. patent application Ser. No. 14/569,354; e.g., the RF self-interference canceller, the IF self-interference canceller, associated up/downconverters, and/or tuning circuits.


The analog self-interference canceller 160 is preferably implemented as an analog circuit that transforms an analog transmit signal into an analog self-interference cancellation signal by combining a set of filtered, scaled, and/or delayed versions of the analog transmit signal, but may additionally or alternatively be implemented as any suitable circuit. For instance, the analog self-interference canceller 160 may perform a transformation involving only a single version or copy of the analog transmit signal. The transformed signal (the analog self-interference cancellation signal) preferably represents at least a part of the self-interference component received at the receiver.


The analog self-interference canceller 160 is preferably adaptable to changing self-interference parameters in addition to changes in the analog transmit signal; for example, transceiver temperature, ambient temperature, antenna configuration, humidity, and transmitter power. Adaptation of the analog self-interference canceller 160 is preferably performed by a tuning circuit, but may additionally or alternatively be performed by a control circuit or other control mechanism included in the canceller or any other suitable controller (e.g., by the controller 144).


In particular, the analog self-interference canceller 160 may be paused (e.g., generation of an analog self-interference cancellation signal may temporarily cease) or otherwise disabled by a tuning circuit or other controller (e.g., the controller 144). Alternatively, tuning of the analog self-interference canceller 160 may be paused (e.g., an iterative tuning process stopped, temporarily or otherwise).


Note that while the preceding paragraphs primarily describe a SISO (single-input single-output) implementation of the system 100, the system 100 may additionally or alternatively be implemented as a MIMO (multiple-input, multiple-output) system (or MISO, SIMO, etc.). The system 100 may be a 2×2 MIMO system, but may additionally have any suitable number of transmit and receive signal paths. Each signal path may have separate antennas; alternatively, signal paths may share antennas via a duplexer or other coupler. In one example, a 2×2 MIMO system has four antennas: a TX1 antenna, a TX2 antenna, an RX1 antenna, and an RX2 antenna. In another example, a 2×2 MIMO system has two antennas: a TX1/RX1 antenna (coupled to both TX1 and RX1 signal paths via a duplexer) and a TX2/RX2 antenna (coupled to both TX2 and RX2 signal paths via a duplexer).


Note that while a particular configuration of input/output connections for the digital and analog cancellers 140 and 160 are described, any configuration of these inputs and outputs (e.g., using ADCs/DACs to couple the digital canceller to analog signals, including residue signals, as shown in FIG. 2) may be used.


In a MIMO implementation, the transmitter 120 preferably has multiple inputs and outputs. In particular, the transmitter 120 preferably includes a DAC and frequency upconverter for each transmit signal path; additionally or alternatively, transmit signal paths may share DACs and/or frequency upconverters. Additionally or alternatively, the transmitter 120 may be any suitable MIMO transmitter (or the system 100 may include multiple transmitters 120); for example, the transmitter 120 may include MIMO signal splitting or processing circuitry (which may be used to process a single digital signal into multiple MIMO analog signals).


Likewise, the receiver 110 preferably has multiple inputs and outputs. In particular, the receiver 110 preferably includes an ADC and frequency downconverter for each receive signal path; additionally or alternatively, receive signal paths may share ADCs and/or frequency downconverters. Additionally or alternatively, the receiver 110 may be any suitable MIMO receiver (or the system 100 may include multiple receivers 110); for example, the receiver 110 may include MIMO signal splitting or processing circuitry (which may be used to process a single digital signal into multiple MIMO analog signals).


In a MIMO implementation, the digital self-interference canceller 140 is preferably designed for MIMO operating environments (i.e., multiple transmit and/or receive signals). In MIMO operating environments, self-interference may occur across separate communications streams; for example, a TX1 signal may cause interference in both of RX1 and RX2 signals. The digital self-interference canceller 140 may include multiple cancellation sub-blocks (each incorporating some or all of the functionality of a SISO implementation of the digital self-interference canceller 140). For example, the digital self-interference canceller may include sub-blocks for each possible RX/TX pairing (e.g., RX1/TX1, RX1 TX2, etc.). In this implementation, each sub-block functions to remove self-interference resulting from a particular pairing; e.g., an RX1/TX2 sub-block functions to remove self-interference in the RX1 receive signal resulting from the TX2 transmit signal.


Similarly to the digital self-interference canceller 140, the analog self-interference canceller 160 (implemented in a MIMO system) may split analog self-interference cancellation duties into sub-blocks or sub-circuits as previously described.


The methods of the preferred embodiment and variations thereof can be embodied and/or implemented at least in part as a machine configured to receive a computer-readable medium storing computer-readable instructions. The instructions are preferably executed by computer-executable components preferably integrated with a system for wireless communication. The computer-readable medium can be stored on any suitable computer-readable media such as RAMs, ROMs, flash memory, EEPROMs, optical devices (CD or DVD), hard drives, floppy drives, or any suitable device. The computer-executable component is preferably a general or application specific processor, but any suitable dedicated hardware or hardware/firmware combination device can alternatively or additionally execute the instructions.


As a person skilled in the art will recognize from the previous detailed description and from the figures and claims, modifications and changes can be made to the preferred embodiments of the invention without departing from the scope of this invention defined in the following claims.

Claims
  • 1. A method for digital self-interference cancellation, comprising: receiving a digital residue signal from a communication system;generating a first reduced-noise digital residue signal based on the digital residue signal;at a controller, sampling a controller-sampled digital residue signal;at the controller, determining a digital transform configuration based on the controller-sampled digital residue signal;based on a sampled digital transmit signal and the first reduced-noise digital residue signal, generating a current self-interference channel estimate according to the digital transform configuration;predicting a future self-interference channel estimate based on the current self-interference channel estimate; andgenerating a digital self-interference cancellation signal from the current self-interference channel estimate and the sampled digital transmit signal;wherein the digital self-interference cancellation signal is combined with a receive signal of the communication system to form the digital residue signal.
  • 2. The method of claim 1, further comprising: before generating the reduced-noise digital residue signal, transforming the digital residue signal from a time domain to a frequency domain; andtransforming the digital self-interference cancellation signal from the frequency domain to the time domain.
  • 3. The method of claim 2, further comprising: after transforming the digital self-interference cancellation signal from the frequency domain to the time domain, re-transforming the digital self-interference cancellation signal from the time domain to the frequency domain;after re-transforming the digital self-interference cancellation signal from the time domain to the frequency domain, at a channel memory, storing the current self-interference channel estimate; andreceiving a past self-interference channel estimate from the channel memory;
  • 4. The method of claim 3, further comprising, before transforming the digital self-interference cancellation signal from the frequency domain to the time domain, smoothing a self-interference channel estimate in the frequency domain, wherein the self-interference channel estimate is one of the current self-interference channel estimate and the future self-interference channel estimate.
  • 5. The method of claim 4, wherein smoothing the self-interference channel estimate comprises: locating an edge in the self-interference channel estimate; andmodifying at least one of a magnitude response or a phase response of the self-interference channel estimate at the edge.
  • 6. The method of claim 5, wherein modifying at least one of the magnitude response or the phase response comprises modifying the magnitude response by inserting an exponential decay function into the magnitude response at the edge.
  • 7. The method of claim 5, wherein: smoothing the self-interference channel estimate further comprises locating a second edge in the self-interference channel estimate; andmodifying at least one of the magnitude response or the phase response comprises modifying the phase response by extrapolating the phase response from the edge to the second edge.
  • 8. The method of claim 5, wherein locating the edge comprises: determining a sharply-varying frequency band of the self-interference channel estimate;determining a local derivative of the self-interference channel estimate within the sharply-varying frequency band; andlocating an edge at a frequency of the sharply-varying frequency band at which the local derivative exceeds a threshold value.
  • 9. The method of claim 4, wherein predicting the future self-interference channel estimate is performed before smoothing the self-interference channel estimate, wherein the self-interference channel estimate is the current self-interference channel estimate.
  • 10. The method of claim 3, wherein: storing the current self-interference channel estimate comprises storing a plurality of subcarriers of the current self-interference channel estimate on a per-subcarrier basis; andreceiving the past self-interference channel estimate from the channel memory comprises receiving a plurality of subcarrier estimates of the past self-interference channel estimate on a per-subcarrier basis.
  • 11. The method of claim 10, further comprising, during a first time interval, at the channel memory, storing the past self-interference channel estimate, wherein: storing the current self-interference channel estimate is performed during a second time interval after the first time interval;during the first time interval, the digital transmit signal comprises a sub-signal within a first subcarrier;during the second time interval, the digital transmit signal is substantially restricted to an active subset of subcarriers, wherein the active subset does not comprise the first subcarrier;receiving the plurality of subcarrier estimates of the past self-interference channel estimate comprises receiving a first subcarrier estimate of the past self-interference channel estimate, wherein the first subcarrier estimate is associated with the first subcarrier; andgenerating the current self-interference channel estimate comprises: based on the digital transmit signal and the reduced-noise digital residue signal, generating an active subset of subcarrier estimates, associated with the active subset of subcarriers; andcombining the active subset of subcarrier estimates with the first subcarrier estimate.
  • 12. The method of claim 11, wherein: the current self-interference channel estimate consists of: the active subset of subcarrier estimates; andan inactive subset of subcarrier estimates associated with an inactive subset of subcarriers; andpredicting the future self-interference channel estimate is not performed for the inactive subset of subcarriers.
  • 13. The method of claim 2, wherein: transforming the digital residue signal from the time domain to the frequency domain is performed using a Discrete Fourier Transform (DFT) matrix;transforming the digital self-interference cancellation signal from the frequency domain to the time domain comprises performing an Inverse Fast Fourier transform (IFFT) on the digital self-interference cancellation signal using a reduced Inverse Discrete Fourier Transform (IDFT) matrix; andthe reduced IDFT matrix is a pseudo-inverse of a reduced DFT matrix, wherein the reduced DFT matrix comprises a strict subset of elements of the DFT matrix.
  • 14. The method of claim 1, wherein the controller samples the controller-sampled digital residue signal from at least one of the digital residue signal or the reduced-noise digital residue signal.
  • 15. The method of claim 1, wherein generating the reduced-noise digital residue signal comprises time-averaging the digital residue signal over an averaging window.
  • 16. The method of claim 15, further comprising modifying the averaging window based on a rate of change of a ratio of the digital residue signal to the digital transmit signal.
  • 17. The method of claim 15, further comprising: based on the digital residue signal, determining a channel dynamics estimate associated with a channel variation metric; andmodifying the averaging window based on the channel dynamics estimate.
  • 18. The method of claim 17, wherein modifying the averaging window comprises decreasing the averaging window in response to an increase in the channel variation metric.
  • 19. The method of claim 18, wherein: the channel dynamics estimate is further associated with a noise variation metric; andmodifying the averaging window further comprises increasing the averaging window in response to an increase in the noise variation metric.
  • 20. The method of claim 1, further comprising: at a channel memory, storing the current self-interference channel estimate; andreceiving a past self-interference channel estimate from the channel memory;
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 16/450,092, filed 24 Jun. 2019, which is a continuation of U.S. patent application Ser. No. 16/125,269, filed on 7 Sep. 2018, now issued as U.S. Pat. No. 10,382,089, which is a continuation of U.S. patent application Ser. No. 15/937,605, filed on 27 Mar. 2018, now issued as U.S. Pat. No. 10,103,774, which claims the benefit of U.S. Provisional Application Ser. No. 62/477,301, filed on 27 Mar. 2017, all of which are incorporated in their entireties by this reference.

US Referenced Citations (359)
Number Name Date Kind
2267946 Pitman Dec 1941 A
3922617 Denniston et al. Nov 1975 A
4321624 Gibson et al. Mar 1982 A
4395688 Sellers Jul 1983 A
4952193 Talwar Aug 1990 A
5027253 Lauffer et al. Jun 1991 A
5212827 Meszko et al. May 1993 A
5262740 Willems Nov 1993 A
5278529 Willems Jan 1994 A
5355103 Kozak Oct 1994 A
5691978 Kenworthy Nov 1997 A
5734305 Ervasti Mar 1998 A
5734957 Ogawa et al. Mar 1998 A
5734967 Kotzin et al. Mar 1998 A
5790658 Yip et al. Aug 1998 A
5818385 Bartholomew Oct 1998 A
5930301 Chester et al. Jul 1999 A
6037848 Alila et al. Mar 2000 A
6215812 Young et al. Apr 2001 B1
6240150 Darveau et al. May 2001 B1
6300849 Takeda Oct 2001 B1
6307169 Sun et al. Oct 2001 B1
6411250 Oswald et al. Jun 2002 B1
6490328 Wu Dec 2002 B1
6539204 Marsh et al. Mar 2003 B1
6567649 Souissi May 2003 B2
6580771 Kenney Jun 2003 B2
6583021 Song Jun 2003 B2
6612987 Morsy et al. Sep 2003 B2
6639551 Li et al. Oct 2003 B2
6657950 Jones et al. Dec 2003 B1
6686879 Shattil Feb 2004 B2
6725017 Blount et al. Apr 2004 B2
6778599 Doron Aug 2004 B1
6784766 Allison et al. Aug 2004 B2
6815739 Huff et al. Nov 2004 B2
6907093 Blount et al. Jun 2005 B2
6915112 Sutton et al. Jul 2005 B1
6965657 Rezvani et al. Nov 2005 B1
6975186 Hirabayashi Dec 2005 B2
6985705 Shohara Jan 2006 B2
7057472 Fukamachi et al. Jun 2006 B2
7139543 Shah Nov 2006 B2
7177341 McCorkle Feb 2007 B2
7188135 Takatori et al. Mar 2007 B2
7228104 Collins et al. Jun 2007 B2
7230316 Yamazaki et al. Jun 2007 B2
7239219 Brown et al. Jul 2007 B2
7266358 Hillstrom Sep 2007 B2
7302024 Arambepola Nov 2007 B2
7336128 Suzuki et al. Feb 2008 B2
7336940 Smithson Feb 2008 B2
7348844 Jaenecke Mar 2008 B2
7349505 Blount et al. Mar 2008 B2
7362257 Bruzzone et al. Apr 2008 B2
7372420 Osterhues et al. May 2008 B1
7397843 Grant et al. Jul 2008 B2
7426242 Thesling Sep 2008 B2
7468642 Bavisi et al. Dec 2008 B2
7508898 Cyr et al. Mar 2009 B2
7509100 Toncich Mar 2009 B2
7622989 Tzeng et al. Nov 2009 B2
7667557 Chen Feb 2010 B2
7706755 Muhammad et al. Apr 2010 B2
7733813 Shin et al. Jun 2010 B2
7773759 Alves et al. Aug 2010 B2
7773950 Wang et al. Aug 2010 B2
7778611 Asai et al. Aug 2010 B2
7825751 Kawaguchi et al. Nov 2010 B2
7869527 Vetter et al. Jan 2011 B2
7948878 Briscoe et al. May 2011 B2
7962170 Axness et al. Jun 2011 B2
7987363 Chauncey et al. Jul 2011 B2
7990231 Morikaku et al. Aug 2011 B2
7999715 Yamaki et al. Aug 2011 B2
8005235 Rebandt et al. Aug 2011 B2
8023438 Kangasmaa et al. Sep 2011 B2
8027642 Proctor et al. Sep 2011 B2
8031744 Radunovic et al. Oct 2011 B2
8032183 Rudrapatna Oct 2011 B2
8055235 Gupta et al. Nov 2011 B1
8060803 Kim Nov 2011 B2
8081695 Chrabieh et al. Dec 2011 B2
8085831 Teague Dec 2011 B2
8086191 Fukuda et al. Dec 2011 B2
8090320 Dent et al. Jan 2012 B2
8093963 Yamashita et al. Jan 2012 B2
8155046 Jung et al. Apr 2012 B2
8155595 Sahin et al. Apr 2012 B2
8160176 Dent et al. Apr 2012 B2
8175535 Mu May 2012 B2
8179990 Orlik et al. May 2012 B2
8218697 Guess et al. Jul 2012 B2
8270456 Leach et al. Sep 2012 B2
8274342 Tsutsumi et al. Sep 2012 B2
8300561 Elahi et al. Oct 2012 B2
8306480 Muhammad et al. Nov 2012 B2
8325001 Huang et al. Dec 2012 B2
8331477 Huang et al. Dec 2012 B2
8345433 White et al. Jan 2013 B2
8349933 Bhandari et al. Jan 2013 B2
8351533 Shrivastava et al. Jan 2013 B2
8378763 Wakata Feb 2013 B2
8385855 Lorg et al. Feb 2013 B2
8385871 Wyville Feb 2013 B2
8391878 Tenny Mar 2013 B2
8410871 Kim et al. Apr 2013 B2
8417750 Yan et al. Apr 2013 B2
8422540 Negus et al. Apr 2013 B1
8428542 Bornazyan Apr 2013 B2
8446892 Ji et al. May 2013 B2
8456230 Fratti Jun 2013 B2
8457549 Weng et al. Jun 2013 B2
8462697 Park et al. Jun 2013 B2
8467757 Ahn Jun 2013 B2
8498585 Vandenameele Jul 2013 B2
8502623 Lee et al. Aug 2013 B2
8502924 Liou et al. Aug 2013 B2
8509129 Deb et al. Aug 2013 B2
8521090 Kim et al. Aug 2013 B2
8547188 Plager et al. Oct 2013 B2
8576752 Sarca Nov 2013 B2
8600331 Kravets Dec 2013 B2
8611401 Lakkis Dec 2013 B2
8619916 Jong Dec 2013 B2
8625686 Li et al. Jan 2014 B2
8626090 Dalipi Jan 2014 B2
8649417 Baldemair et al. Feb 2014 B2
8711943 Rossato et al. Apr 2014 B2
8744377 Rimini et al. Jun 2014 B2
8750786 Larsson et al. Jun 2014 B2
8755756 Zhang et al. Jun 2014 B1
8767869 Rimini et al. Jul 2014 B2
8787907 Jain et al. Jul 2014 B2
8798177 Park et al. Aug 2014 B2
8804975 Harris et al. Aug 2014 B2
8837332 Khojastepour et al. Sep 2014 B2
8842584 Jana et al. Sep 2014 B2
8879433 Khojastepour et al. Nov 2014 B2
8879811 Liu et al. Nov 2014 B2
8913528 Cheng et al. Dec 2014 B2
8929550 Shattil et al. Jan 2015 B2
8995410 Balan et al. Mar 2015 B2
9014069 Patil et al. Apr 2015 B2
9019849 Hui et al. Apr 2015 B2
9031567 Haub May 2015 B2
9042838 Braithwaite May 2015 B2
9054795 Choi et al. Jun 2015 B2
9065519 Cyzs et al. Jun 2015 B2
9077421 Mehlman et al. Jul 2015 B1
9112476 Basaran et al. Aug 2015 B2
9124475 Li et al. Sep 2015 B2
9130747 Zinser et al. Sep 2015 B2
9136883 Moher et al. Sep 2015 B1
9160430 Maltsev et al. Oct 2015 B2
9166766 Jana et al. Oct 2015 B2
9184902 Khojastepour et al. Nov 2015 B2
9185711 Lin et al. Nov 2015 B2
9231647 Polydoros et al. Jan 2016 B2
9231712 Hahn et al. Jan 2016 B2
9236996 Khandani Jan 2016 B2
9264024 Shin et al. Feb 2016 B2
9276682 Bharadia et al. Mar 2016 B2
9312895 Gupta et al. Apr 2016 B1
9325432 Hong et al. Apr 2016 B2
9331737 Hong et al. May 2016 B2
9413500 Chincholi et al. Aug 2016 B2
9413516 Khandani Aug 2016 B2
9455761 Bharadia et al. Sep 2016 B2
9461698 Moffatt et al. Oct 2016 B2
9490963 Choi et al. Nov 2016 B2
9537543 Choi Jan 2017 B2
9647705 Pack et al. May 2017 B2
9698860 Bharadia et al. Jul 2017 B2
9698861 Braithwaite Jul 2017 B2
9713010 Khandani Jul 2017 B2
9742593 Moorti et al. Aug 2017 B2
9935757 Chung et al. Apr 2018 B2
9973224 Liu et al. May 2018 B2
10103774 Moorti et al. Oct 2018 B1
10200217 Moorti et al. Feb 2019 B2
20020034191 Shattil Mar 2002 A1
20020064245 McCorkle May 2002 A1
20020072344 Souissi Jun 2002 A1
20020109631 Li et al. Aug 2002 A1
20020154717 Shima et al. Oct 2002 A1
20020172265 Kenney Nov 2002 A1
20030022395 Olds Jan 2003 A1
20030031279 Blount et al. Feb 2003 A1
20030099287 Arambepola May 2003 A1
20030104787 Blount et al. Jun 2003 A1
20030112860 Erdogan Jun 2003 A1
20030148748 Shah Aug 2003 A1
20030222732 Matthaei Dec 2003 A1
20040106381 Tiller Jun 2004 A1
20040266378 Fukamachi et al. Dec 2004 A1
20050030888 Thesling Feb 2005 A1
20050078743 Shohara Apr 2005 A1
20050094722 Takatori et al. May 2005 A1
20050101267 Smithson May 2005 A1
20050129152 Hillstrom Jun 2005 A1
20050159128 Collins et al. Jul 2005 A1
20050190870 Blount et al. Sep 2005 A1
20050195915 Raleigh et al. Sep 2005 A1
20050242830 Humphrey et al. Nov 2005 A1
20050250466 Varma et al. Nov 2005 A1
20050254555 Teague Nov 2005 A1
20050282500 Wang et al. Dec 2005 A1
20060029124 Grant et al. Feb 2006 A1
20060030277 Cyr et al. Feb 2006 A1
20060058022 Webster et al. Mar 2006 A1
20060083297 Yan et al. Apr 2006 A1
20060153283 Scharf et al. Jul 2006 A1
20060209754 Ji et al. Sep 2006 A1
20060240769 Proctor et al. Oct 2006 A1
20060273853 Suzuki et al. Dec 2006 A1
20070018722 Jaenecke Jan 2007 A1
20070105509 Muhammad et al. May 2007 A1
20070207747 Johnson et al. Sep 2007 A1
20070207748 Toncich Sep 2007 A1
20070223617 Lee et al. Sep 2007 A1
20070249314 Sanders et al. Oct 2007 A1
20070274372 Asai et al. Nov 2007 A1
20070283220 Kim Dec 2007 A1
20070296625 Bruzzone et al. Dec 2007 A1
20080037801 Alves et al. Feb 2008 A1
20080075189 Li et al. Mar 2008 A1
20080089397 Vetter et al. Apr 2008 A1
20080107046 Kangasmaa et al. May 2008 A1
20080111754 Osterhues et al. May 2008 A1
20080131133 Blunt et al. Jun 2008 A1
20080144852 Rebandt et al. Jun 2008 A1
20080192636 Briscoe et al. Aug 2008 A1
20080219339 Chrabieh et al. Sep 2008 A1
20080219377 Nisbet Sep 2008 A1
20080279122 Fukuda et al. Nov 2008 A1
20090022089 Rudrapatna Jan 2009 A1
20090034437 Shin et al. Feb 2009 A1
20090047914 Axness et al. Feb 2009 A1
20090115912 Liou et al. May 2009 A1
20090180404 Jung et al. Jul 2009 A1
20090186582 Muhammad et al. Jul 2009 A1
20090213770 Mu Aug 2009 A1
20090221231 Murch et al. Sep 2009 A1
20090262852 Orlik et al. Oct 2009 A1
20090303908 Deb et al. Dec 2009 A1
20100014600 Li et al. Jan 2010 A1
20100014614 Leach et al. Jan 2010 A1
20100022201 Vandenameele Jan 2010 A1
20100031036 Chauncey et al. Feb 2010 A1
20100056166 Tenny Mar 2010 A1
20100103900 Ahn et al. Apr 2010 A1
20100117693 Buer et al. May 2010 A1
20100136900 Seki Jun 2010 A1
20100150033 Zinser et al. Jun 2010 A1
20100150070 Chae et al. Jun 2010 A1
20100159837 Dent et al. Jun 2010 A1
20100159858 Dent et al. Jun 2010 A1
20100165895 Elahi et al. Jul 2010 A1
20100208854 Guess et al. Aug 2010 A1
20100215124 Zeong et al. Aug 2010 A1
20100226356 Sahin et al. Sep 2010 A1
20100226416 Dent et al. Sep 2010 A1
20100226448 Dent Sep 2010 A1
20100232324 Radunovic et al. Sep 2010 A1
20100266057 Shrivastava et al. Oct 2010 A1
20100279602 Larsson et al. Nov 2010 A1
20100295716 Yamaki et al. Nov 2010 A1
20110013684 Semenov et al. Jan 2011 A1
20110013735 Huang et al. Jan 2011 A1
20110026509 Tanaka Feb 2011 A1
20110081880 Ann Apr 2011 A1
20110149714 Rimini et al. Jun 2011 A1
20110171922 Kim et al. Jul 2011 A1
20110216813 Baldemair et al. Sep 2011 A1
20110222631 Jong Sep 2011 A1
20110227664 Wyville Sep 2011 A1
20110243202 Lakkis Oct 2011 A1
20110250858 Jain et al. Oct 2011 A1
20110254639 Tsutsumi et al. Oct 2011 A1
20110256857 Chen et al. Oct 2011 A1
20110268232 Park et al. Nov 2011 A1
20110311067 Harris et al. Dec 2011 A1
20110319044 Bornazyan Dec 2011 A1
20120021153 Bhandari et al. Jan 2012 A1
20120052892 Braithwaite Mar 2012 A1
20120063369 Lin et al. Mar 2012 A1
20120063373 Chincholi et al. Mar 2012 A1
20120115412 Gainey et al. May 2012 A1
20120140685 Lederer et al. Jun 2012 A1
20120147790 Khojastepour et al. Jun 2012 A1
20120154249 Khojastepour et al. Jun 2012 A1
20120155335 Khojastepour et al. Jun 2012 A1
20120155336 Khojastepour et al. Jun 2012 A1
20120201153 Bharadia et al. Aug 2012 A1
20120201173 Jain et al. Aug 2012 A1
20120224497 Lindoff et al. Sep 2012 A1
20130005284 Dalipi Jan 2013 A1
20130044791 Rimini et al. Feb 2013 A1
20130076433 Fratti Mar 2013 A1
20130089009 Li et al. Apr 2013 A1
20130102254 Cyzs et al. Apr 2013 A1
20130114468 Hui et al. May 2013 A1
20130120190 McCune May 2013 A1
20130155913 Sarca Jun 2013 A1
20130166259 Weber et al. Jun 2013 A1
20130194984 Cheng et al. Aug 2013 A1
20130207745 Yun et al. Aug 2013 A1
20130215805 Hong et al. Aug 2013 A1
20130225101 Basaran et al. Aug 2013 A1
20130253917 Schildbach Sep 2013 A1
20130259343 Liu et al. Oct 2013 A1
20130273871 Kravets Oct 2013 A1
20130286903 Khojastepour et al. Oct 2013 A1
20130294523 Rossato et al. Nov 2013 A1
20130301487 Khandani Nov 2013 A1
20130301488 Hong et al. Nov 2013 A1
20130308717 Maltsev et al. Nov 2013 A1
20130315211 Balan et al. Nov 2013 A1
20140011461 Bakalski et al. Jan 2014 A1
20140016515 Jana et al. Jan 2014 A1
20140126437 Patil et al. May 2014 A1
20140169236 Choi et al. Jun 2014 A1
20140185533 Haub Jul 2014 A1
20140206300 Hahn et al. Jul 2014 A1
20140219139 Choi et al. Aug 2014 A1
20140219449 Shattil et al. Aug 2014 A1
20140313946 Azadet Oct 2014 A1
20140348018 Bharadia et al. Nov 2014 A1
20140348032 Hua et al. Nov 2014 A1
20140376416 Choi Dec 2014 A1
20150009868 Jana et al. Jan 2015 A1
20150049834 Choi et al. Feb 2015 A1
20150078217 Choi et al. Mar 2015 A1
20150139122 Rimini et al. May 2015 A1
20150146765 Moffatt et al. May 2015 A1
20150156003 Khandani Jun 2015 A1
20150156004 Khandani Jun 2015 A1
20150171903 Mehlman et al. Jun 2015 A1
20150188646 Bharadia et al. Jul 2015 A1
20150215937 Khandani Jul 2015 A1
20150249444 Shin et al. Sep 2015 A1
20150270865 Polydoros et al. Sep 2015 A1
20150303984 Braithwaite Oct 2015 A1
20160036582 Jana et al. Feb 2016 A1
20160218769 Chang et al. Jul 2016 A1
20160226653 Bharadia et al. Aug 2016 A1
20160266245 Bharadia et al. Sep 2016 A1
20160380799 Chang et al. Dec 2016 A1
20170019190 Pack et al. Jan 2017 A1
20170041165 Cheng et al. Feb 2017 A1
20170104506 Liu et al. Apr 2017 A1
20170141886 Chung et al. May 2017 A1
20170179916 Hahn et al. Jun 2017 A1
20170180160 Moorti et al. Jun 2017 A1
20170187404 Hahn et al. Jun 2017 A1
20180013466 Kim et al. Jan 2018 A1
20190044555 Hewavithana et al. Feb 2019 A1
20190312609 Moorti Oct 2019 A1
Foreign Referenced Citations (13)
Number Date Country
1204898 Jan 1999 CN
1901362 Jan 2007 CN
0755141 Oct 1998 EP
1959625 Feb 2009 EP
2237434 Oct 2010 EP
2267946 Dec 2010 EP
2001196994 Jul 2001 JP
2003148748 May 2003 JP
2012021153 Feb 2012 JP
2256985 Jul 2005 RU
2013173250 Nov 2013 WO
2013185106 Dec 2013 WO
2014093916 Jun 2014 WO
Non-Patent Literature Citations (29)
Entry
Adib et al., “See Through Walls with Wi-Fi” Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM '13, pp. 75-86, ACM, New York, NY, USA, (2013).
Bharadia et al., “Full Duplex Radios” SIGOMM, Aug. 12-16, 2013, Hong Kong, China, Copyright 2013 ACM 978-1-4503-2056-6/6/13/08, 12 pages.
Wikipedia, “Star Trek Tricoder,” [Retrieved from the Internet Oct. 26, 2016: http://en.wikipedia.org/wiki/Tricorder].
Xiong et al., “ArrayTrack: A Fina-Grained Indoor Location System” In Proceedings of the 10th Usenix conference on Networed Systems Design and Implementation, nsdi '13, pp. 71-84, Usenix Association, Berkeley, CA, USA, (2013).
Zhang et al., “A novel method for microwave breast cancer detection,” Progress in Electromagnetics Research, vol. 83: 413-434, (2008).
Hua, Yingbo , et al., “Full Duplex Radios”, SIGOMM, Aug. 12-16, 2013, Hong Kong, China, Copyright 2013 ACM 978-1-4503-2056-6/6/13/08, 12 pages, Aug. 12, 2013.
Bindu et al., “Active microwave imaging for breast cancer detection,” Progress in Electromagnetics Research, vol. 58: 149-169, (2006).
Boyd, “Sequential Convex Programming.” [Retrieved from the Internet Oct. 26, 2016:http://www.stanford.edu/class/ee364b/lectures/seq_slides.pdf].
Cavoukian, “Whole Body Imaging in Airport Scanners: Building in Privacy by Design,” information and Privacy Commissioner of Ontario, Mar. 2009. [Retrieved from the Internet Oct. 25, 2016:https://www.ipc.on.ca/wp-content/uploads/.../wholebodyimaging.pdf.
Duarte et al., “Experiment-driven Characterization of Full-Duplex Wireless Systems,” (2011).[Retrieved from the Internet Oct. 25, 2016: https://arxiv.org/abs/1107.1276].
Ekanadham, “Continuous Basis Pursuit and Its Applications,” PhD thesis, New York, NY, USA, AAI3456394, (2012).
Erceg et al., “TGn channel models,” Tech. Rep. IEEE P802.11, Wireless LANs, Garden Grove, Calif., USA, (2004).
FDA, “Medical Imaging,”[Retrieved from the Internet Oct. 25, 2016: http://www.fda.gov/Radiation-EmittingProducts/RadiationEmittingProductsandProcedures/MedicalImaging/MedicalX-Rays/ucm115317.htm].
Fear et al., “Confocal Microwave Imaging for Breast Cancer Detection: Localization of Tumors in Three Dimensions,” IEEE Transactions on Biomedical Engineering, 49(8):812-822, (2002).
Fear et al., “Microwave Detection of Breast Cancer,” IEEE Transactions on Microwave Theory and Techniques, 48 (11):1854-1863, (2000).
Fleury et al., “Channel Parameter Estimation in Mobile Radio Environments Using the SAGE Algorithm,” IEEE Journal on Selected Areas in Communications, 17(3):434-450, (1999).
Guo et al., “Microwave Imaging via Adaptive Beamforming Methods for Breast Cancer Detection,” Progress in Electromagnetics Research, vol. 1, 350-353, (2005).
Hong et al., “Picasso: Flexible RF and Spectrum Slicing,” In Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '12, pp. 283-284, ACM, Helsinki, Finland, (2012).
“International Search Report and Written Opinion of the ISA, dated May 13, 2019, for application No. PCT/US19/19910.”.
“Italian National Research Council, “Dielectric Properties of Body Tissues.” [Retrieved from the Internet Oct. 25, 2016: http://niremf.ifac.cnr.it/tissprop/]”.
Jain et al., “Practical, Real-time, Full Duplex Wireless,” MobiCom '11, pp. 301-312, ACM, New York, NY, USA, (2011).
McMichael et al., “Optimal Tuning of Analog Self-Interference Cancellers for Full-Duple Wireless Communication”, Oct. 1-5, 2012, Fiftieth Annual Allerton Conference, Illinois, USA, pp. 246-251.
Riihonen, Taneli , et al., “Mitigation of Loopback Self-Interference in Full-Duplex MIMO Relays”, EEE Transactions on Signal Processing, vol. 59, No. 12, Dec. 1, 2011.
Shenghong, Li , et al., “Full-Duplex Wireless Communication Using Transmitter Output Based Echo Cancellation”, EEE Globecom 2011, Dec. 5, 2011, Dec. 5, 2011.
Tse et al., “Fundamentals of Wireless Communications,” Aug. 13, 2004. [Retrieved from the Internet Oct. 25, 2016: www.eeec.berkeley.edu/-dtse/main.pdf].
Sundstrom et al., “Power Dissipation Bounds for High-Speed Nyquist Analog-to-Digital Converters,” IEEE Transactions on Circuits and Systems: Regular Paper, 56(3):509-518, (2009).
Surowiec et al., “Dielectric Properties of Breast Carcinoma and the Surrounding Tissues,” IEEE Transactions on Biomedical Engineering, 35(4):257-263, (1988).
Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society, Series B (Methodological), pp. 267-288 (1996).
Slepian, D. , “Prolate spheroidal wave functions, Fourier analysis, and Uncertainty: The Discrete Case”, Bell Syst. Tech. Journal vol. 57, No. 5, pp. 1371-1430, May-Jun. 1978.
Related Publications (1)
Number Date Country
20200127700 A1 Apr 2020 US
Provisional Applications (1)
Number Date Country
62477301 Mar 2017 US
Continuations (3)
Number Date Country
Parent 16450092 Jun 2019 US
Child 16718447 US
Parent 16125269 Sep 2018 US
Child 16450092 US
Parent 15937605 Mar 2018 US
Child 16125269 US