Patent Grant
10868661
This invention relates generally to the wireless communications field, and more specifically to new and useful systems and methods for efficiently transformed digital self-interference cancellation.
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, particularly in frequency to time domain (and time to frequency domain) conversion. Thus, there is a need in the wireless communications field to create new and useful systems and methods for efficiently-transformed digital self-interference cancellation. This invention provides such new and useful systems and methods.
The following description of the preferred embodiments of the invention is not intended to limit the invention to these preferred 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 analog 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/baseband analog signals or RF/IF/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 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 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.
In particular, one of the factors that may influence the time to tune a digital cancellation system involves the efficiency of time to frequency domain and frequency to time domain conversions (via Fourier transforms and inverse Fourier transforms respectively). The systems and methods described herein may increase tuning performance of full-duplex transceivers as shown in
2. Efficiently-Transformed Digital Self-Interference Canceller
An efficiently-transformed digital self-interference canceller 100 preferably includes an FD transformer 110, a TD transformer 120, a channel estimator 130, a composer 140, and a controller 150 (e.g., as shown in
The canceller 100 functions to produce a digital self-interference cancellation signal from a digital transmit signal. More specifically, the FD transformer 110 transforms transmit (Tx) and residue (Rxr) signals from the time domain to the frequency domain. In the frequency domain, the channel estimator 130 generates an estimate of a self-interference channel from these signals. This channel estimate (after modification by the channel memory 160, predictor 170, and/or extender 180 if applicable) is transformed back into the time domain by the TD transformer 120. Finally, the time-domain self-interference channel is applied to the digital transmit signal by the composer 140 to generate a digital self-interference cancellation signal, which can then be combined with one or more receive signals to reduce self-interference present in those signals.
The FD transformer 110 and/or TD transformer 120 preferably utilize novel architectures that increase the efficiency of domain transformation, in turn increasing the performance of the digital self-interference canceller 100 (these techniques are discussed in more detail in later sections). Here, increased performance may be found in faster tuning time, lower computation resource usage (e.g., processor time, memory), and/or more accuracy in self-interference channel estimation.
The canceller 100 is preferably implemented using digital 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), but may additionally or alternatively be implemented in any manner.
The canceller 100 may source input signals (e.g., a digital transmit signal) from any source (e.g., a digital signal directly from a communication device prior to digital-to-analog conversion, or a digital signal converted from a sampled analog transmit signal after digital-to-analog conversion). Likewise, the output of the canceller 100 may be combined with a receive signal (resulting in a residue signal) in any manner (e.g., the digital self-interference cancellation signal may be combined with a digital receive signal, or the digital self-interference cancellation signal may be converted to analog and combined with an analog receive signal).
The frequency domain (FD) transformer 110 functions to transform signals (e.g., a channel estimate, a digital transmit signal, a digital residue signal, etc.) from a time domain to a frequency domain (via a Fourier transform). The FD transformer 110 preferably utilizes an implementation of the Fast Fourier Transform (FFT) algorithm (note that the FFT algorithm is used to compute the discrete Fourier transform, or DFT, of a sequence), but may additionally or alternatively utilize any Fourier transform technique.
The canceller 100 may utilize FD transformers 110 of different configuration for different purposes. For example, the canceller 100 preferably includes a first FD transformer 110 that converts the transmit signal (Tx) and residue (Rxr) from the time domain to the frequency domain (so that channel estimation may be performed within the frequency domain). This FD transformer 110 may perform a standard FFT calculation based on the sample rate of the transmit signal (e.g., a 3750 point FFT may be used for a sample rate of 56.25 MHz, corresponding to 3750 samples per OFDM symbol of a signal). Alternatively, this FD transformer 110 may function in any manner.
The canceller 100 may additionally include a second FD transformer 110 used to convert a self-interference channel estimate (or other signal) generated by the canceller 100 back to the frequency domain from the time domain (e.g., for storage by the channel memory 160). This second FD transformer 110 is preferably configured based on the configuration of the TD transformer 120 (and is discussed in further detail after the description of the TD transformer 120), but may alternatively be configured in any manner.
Likewise, the time domain (TD) transformer 120 functions to transform signals (e.g., a self-interference channel estimate) from the frequency domain to a time domain (via an inverse Fourier transform). The TD transformer 120 preferably utilizes an implementation of the Inverse Fast Fourier Transform (IFFT) algorithm (note that here the IFFT algorithm is used to compute the inverse discrete Fourier transform, or IDFT, of a sequence), but may additionally or alternatively utilize any Fourier transform technique. As with the FD transformer 110, the canceller 100 may utilize TD transformers 120 of different configuration for different purposes.
The canceller 100 preferably includes a TD transformer 120 that converts the frequency-domain self-interference channel estimate generated by the channel estimator 130 to the time domain. In one implementation of an invention embodiment, this TD transformer 120 includes a filter 121, an IFFT processor 122, and a post-compensator 123, as shown in
The filter 121 functions to downsample the frequency-domain signal as well as filter the frequency-domain signal (using an anti-aliasing filter). The filter 121 is preferably a decimating filter, but can additionally or alternatively function to downsample the frequency-domain signal in any other suitable manner. The filter 121 is preferably a finite impulse response (FIR) filter, but can additionally or alternatively include one or more infinite impulse response (IIR) filters and/or any other suitable filters. The filter 121 preferably performs these tasks using a single filter but may additionally or alternatively perform these tasks in any manner. For example, the filter 121 may be a decimating FIR low-pass filter.
The filter 121 can define a window function, preferably wherein application of the filter to a signal in the frequency domain is analogous to multiplying or convolving the window function with the signal in the time domain (e.g., wherein the signal is transformed into the time domain, then multiplied or convolved with the window function). The window function preferably defines a substantially limited time range (e.g., such that the window function overlaps all or substantially all of the amplitude or energy of a single period of a periodic time domain signal and/or overlaps none or substantially none of the amplitude or energy of all other periods of the time domain signal) and preferably concentrates a large portion (e.g., more than a threshold amount such as more than 50, 60, 70, 80, 90, 95, or 99%) of its frequency domain response within a finite range, such as within the range defined by the frequency domain taps of the filter. In some examples, the window function is associated with (e.g., composed of) one or more discrete prolate spheroidal functions (e.g., is equal to one such function or a linear combination of such functions). However, the filter can additionally or alternatively define any other suitable window function(s).
The filter 121 is preferably configured by the controller 150, but may additionally or alternatively be configured in any manner. Configuration for the filter may include, for example, filter size, filter coefficients, and/or decimation factor. For example, for a set of 1200 self-interference channel samples (e.g., corresponding to the number of active subcarriers for the OFDM symbol) the filter 121 may be configured as a 120 tap filter with a decimation factor of 30 (resulting in 40 filtered samples).
The decimation factor is preferably greater than or equal to a threshold number (e.g., 2, 3, 4, 5, 6-10, 10-20, 20-50, 50-100, 100-300, or greater than 300), but can alternatively be any other suitable factor. In examples in which the IFFT processor implements a multi-stage processing structure (e.g., multi-stage butterfly structure), the decimation factor is preferably comparable or larger than a metric associated with the scale of progression between stages, such as sufficiently large to eliminate one or more of the stages (as compared with an analogous IFFT process implemented on an un-decimated input signal). For example, the decimation factor can be substantially comparable to, equal to, or greater than a metric associated with the butterfly structure, such as a radix, a power of the radix (e.g., square, cube, fourth power, etc.), a product of multiple different radixes, or any other suitable metric.
The IFFT processor 122 functions to perform the inverse Fourier transform on the filtered samples. The filtered samples can optionally be rearranged and/or zero-padded (e.g., to increase the total number of input values to match the desired input size for the IFFT, preferably by padding with a number of zeros equal to the difference between the number of filtered samples and the number of IFFT inputs). In some embodiments, the IFFT processor implements an IFFT butterfly structure. The IFFT butterfly structure preferably defines a plurality of stages, wherein each stage defines a radix. The radixes of the stages are preferably equal, but some or all such radixes can alternatively differ. The IFFT butterfly structure can be the same as or different from the FFT butterfly structure described below. In examples, the IFFT butterfly structure can define 2, 3, 4, 5, 6-10, or more than 10 stages, and the stages can define radixes of 2, 3, 4, 5, 6-10, or more than 10.
The IFFT is preferably able to operate at a lower dimensionality (e.g., making it more computationally and memory efficient), such as due to the downsampling performed by the filter 121. For example, in the previous example (where the OFDM symbol comprised 3750 samples and 1200 active subcarriers and the filter 121 generated 40 filtered samples), the IFFT processor 122 may perform a 125 sample IFFT on the 40 samples (note that to perform this, the 40 filtered samples are padded by the IFFT processor 122 with 85 zeros). The result of processing by the IFFT processor 122 is a set of time domain self-interference channel samples (in the case of the 125 sample IFFT, 125). In a specific example, in which the IFFT processor implements an IFFT butterfly structure to achieve the 125 sample transformation, the IFFT butterfly structure defines 3 stages, each of radix 5. However, the IFFT processor 122 can additionally or alternatively implement any other suitable IFFT processes in any suitable manner.
The IFFT processor can be configured by the controller 150, but can additionally or alternatively be configured in any other suitable manner. Configuration for the IFFT processor can include, for example, input and/or output size (e.g., dimensionality), number of stages, radix of each stage, and/or twiddle factors.
The post-compensator 123 can function to further process the output of the IFFT processor 122. The post-compensator 123 preferably corrects for distortion in the time domain self-interference channel samples resulting from the fact that the filter 121 may impose a non-flat time domain response (e.g., time domain response associated with the window function of the filter 121). The post-compensator 123 preferably does this by multiplying each time-domain channel sample by the reciprocal of the time domain response of the filter 121, but may additionally or alternatively correct for the non-flat time domain response of the filter 121 in any manner. Note that in some cases, the post-compensator 123 may perform this post-compensation only for a subset of the time-domain channel samples. For example, if it is determined that only a certain number of time-domain channel samples are needed to effectively model the self-interference channel, the post-compensator 123 may perform compensation for only a subset of the time-domain channel samples (e.g., a window of consecutive samples, such as the first, last, or central window of a desired size and/or any other suitable window; a subset of non-consecutive samples, such as every other sample, every third sample, or any other suitable regular or non-regular subsampling; etc.). For example, it may be determined that 64 time-domain channel samples is adequate; in this case, the post-compensator 123 may perform compensation for only 64 of the 125 time-domain channel samples (e.g., the first 64 samples). In such in an implementation, the post-compensator 123 may likewise output only the subset of channel samples deemed relevant to self-interference cancellation (e.g., the 64 for which post-compensation were produced).
The post-compensator 123 can be configured by the controller 150, but can additionally or alternatively be configured in any other suitable manner. Configuration for the post-compensator preferably includes compensation coefficients, but can additionally or alternatively include any other suitable configuration information.
The structure of the TD transformer 120 can provide inherent benefits over other approaches for cases where the frequency domain sample size differs largely from the desired number of time-domain channel estimates (such as in the discussed example, where 64 time-domain channel samples are generated from 1200 frequency-domain samples). While the filter 121 typically adds computational complexity, nevertheless, the combination of the filter 121 and the reduced size FFT performed by the IFFT processor 122 may result in substantial computational efficiency over an approach such as simply performing the IFFT on the 1200 samples (e.g., via matrix multiply with a 64×1200 matrix).
Additionally or alternatively, the structure of the TD transformer 120 can provide more flexibility than many other approaches. For example, if it is determined that 96 time-domain channel estimates are desired to model the self-interference channel, the matrix approach requires that the IFFT matrix be completely re-calculated. In contrast, such a change with this structure requires only that the post-compensator 123 be modified to perform post-compensation for 96 samples instead of 64 (additionally, coefficients of the filter 121 may be slightly modified), while the IFFT processor 122 may continue to be used without modification. This enables changes in configuration with substantially less computational overhead (and allows more flexibility to perform in different configurations on the same hardware). Likewise, sampling rate changes can be accomplished without modifying or recalculating values of the IFFT processor 122.
As previously mentioned, in some implementations of the canceller 100, the canceller 100 may include a second FD transformer 110 used to convert a time-domain self-interference channel estimate back to the frequency domain (e.g., to store in channel memory 160). One reason that this may be done (e.g., as opposed to, or in addition to, simply storing the channel estimate immediately after generation, while still in the frequency domain) is that the conversion to the time domain may smooth and/or reduce noise in the self-interference channel estimate.
In one implementation of an invention embodiment, this FD transformer 110 preferably includes a pre-compensator 111, an FFT processor 112, and/or a filter 113 (e.g., as shown in
The pre-compensator 111 can function to distort the time-domain input to the FD transformer 110 to mitigate later distortion by the filter 113 (which, similar to the filter 121, may have a non-flat time domain response, such as a response defined by the window function of the filter 113 described below). The pre-compensator 111 performs this mitigation by multiplying each time-domain channel sample by the reciprocal of the time domain response of the filter 113, but may additionally or alternatively correct for the non-flat time domain response of the filter 113 in any manner.
The pre-compensator 111 can be configured by the controller 150, but can additionally or alternatively be configured in any other suitable manner. Configuration for the pre-compensator preferably includes compensation coefficients, but can additionally or alternatively include any other suitable configuration information.
The FFT processor 112 functions to perform the Fourier transform on the pre-compensated samples. In some embodiments, the FFT processor implements an FFT butterfly structure. The FFT butterfly structure preferably defines a plurality of stages, wherein each stage defines a radix. The radixes of the stages are preferably equal, but some or all such radixes can alternatively differ. The FFT butterfly structure can be the same as or different from the IFFT butterfly structure described above. In examples, the butterfly structure can define 2, 3, 4, 5, 6-10, or more than 10 stages, and the stages can define radixes of 2, 3, 4, 5, 6-10, or more than 10.
Low dimensionality of the input to the FFT processor 112 (and/or low dimensionality required of the output, such as low dimensionality enabled by later upsampling, preferably upsampling performed by the filter 113) can enable more efficient operation of the FFT processor 112 than in embodiments with greater dimensionality. For example, the FFT processor 112 may perform a 125 sample FFT on 64 time-domain channel estimate samples (e.g., zero-padded with 61 zeros), resulting in 125 frequency-domain channel estimate samples. In a specific example, in which the FFT processor implements an FFT butterfly structure to achieve the 125 sample transformation, the FFT butterfly structure defines 3 stages, each of radix 5. However, the FFT processor 112 can additionally or alternatively implement any other suitable FFT processes in any suitable manner.
The FFT processor can be configured by the controller 150, but can additionally or alternatively be configured in any other suitable manner. Configuration for the FFT processor can include, for example, input and/or output size (e.g., dimensionality), number of stages, radix of each stage, and/or twiddle factors.
The filter 113 preferably functions to upsample the frequency-domain signal and/or filter the frequency-domain signal (e.g., using an interpolating filter), more preferably performing both upsampling and filtering. The filter 113 is preferably a FIR filter, but can additionally or alternatively include one or more IIR filters and/or any other suitable filters. The filter 113 preferably performs these tasks using a single filter, but may additionally or alternatively perform these tasks in any manner. For example, the filter 113 may be a upsampling FIR interpolating filter. As described above regarding the filter 121, the filter 113 can define a window function (e.g., the same or substantially the same window function as the window function of the filter 121, a substantially different window function, etc.). In some examples, the window function is associated with (e.g., composed of) one or more discrete prolate spheroidal functions (e.g., is equal to one such function or a linear combination of such functions). However, the filter can additionally or alternatively define any other suitable window function(s).
The filter 113 is preferably configured by the controller 150, but may additionally or alternatively be configured in any manner. Configuration for the filter may include, for example, filter size, filter coefficients, and/or upsampling factor. For example, the filter 113 may take 125 outputs of the FFT processor 112, upsample by a factor of 30, and interpolate in the frequency domain to produce a total of 3750 self-interference channel samples (1200 of which correspond to active subcarriers).
The upsampling factor is preferably greater than or equal to a threshold number (e.g., 2, 3, 4, 5, 6-10, 10-20, 20-50, 50-100, 100-300, or greater than 300), but can alternatively be any other suitable factor. The upsampling factor is preferably comparable to (e.g., equal to, substantially equal to, etc.) the decimation factor of the filter 121, but can alternatively be substantially greater than the decimation factor, substantially less than the decimation factor, or have any other suitable value. In examples in which the FFT processor implements a multi-stage processing structure (e.g., multi-stage butterfly structure), the upsampling factor is preferably comparable or larger than a metric associated with the scale of progression between stages, such as sufficiently large to eliminate one or more of the stages (as compared with an analogous FFT process implemented to produce an output signal of the same size as the upsampled signal). For example, the upsampling factor can be substantially comparable to, equal to, or greater than a metric associated with the butterfly structure, such as a radix, a power of the radix (e.g., square, cube, fourth power, etc.), a product of multiple different radixes, or any other suitable metric.
The structure of the FD transformer 110 may enhance inherent performance and/or flexibility (e.g., in similar ways as the TD transformer 120). In embodiments, adjustments either to sampling rate or number of time-domain self-interference cancellation samples may be modified without modifying or recalculating parameters for the FFT transformer 112 (e.g., as with the TD transformer 120).
The canceller 100 may additionally or alternatively include any other transformers that transform signals 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).
The channel estimator 130 preferably functions to generate a current self-interference cancellation channel estimate (A) from a suitable signal source. The channel estimator 130 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.
The channel estimator 130 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 130 include generalized memory polynomial (GMP) models, Volterra models, and Wiener-Hammerstein models; the channel estimator 130 may additionally or alternatively use any combination or set of models.
The channel estimator 130 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 130 preferably performs channel estimate generation according to a transform configuration set dynamically by the controller 150 (discussed in more detail in sections covering the controller 150). Additionally or alternatively, the channel estimator 130 may combine signal components in any manner in order to generate a self-interference channel estimate.
In some embodiments, the channel estimator 130 may perform filtering for signals processed by the estimator 130. For example, the estimator 130 may reduce input noise by performing time-averaging of input signals to prepare the signals for self-interference cancellation signal generation. The estimator 130 may perform time-averaging in any manner; e.g., block averaging, moving averaging, infinite impulse response (IIR) filtering, etc.
Input signals may include transmit signals (Tx), receive signals (Rx), or any other signals (e.g., a ratio of Tx to Rx). Note that Rx may be written as follows: Rx=TxH+Z, where 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 A is a self-interference channel estimate and −TxĤ represents a self-interference cancellation signal.
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 150 preferably dynamically adjusts the number of samples the estimator 130 uses to perform averaging (i.e., the averaging window) to improve canceller 100 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 150 may additionally or alternatively vary any aspect of filtering.
The estimator 130 may additionally or alternatively perform any signal transformation to aid in preparing input signals for self-interference cancellation. For example, the estimator 130 may perform sample rate conversion of signals, scaling, shifting, and/or otherwise modifying signals.
In one implementation, the estimator 130 modifies sampled digital transmit signals by removing information unlikely to substantially affect the output of the estimator 130. 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 used by the estimator 130 in generating channel estimates.
If the estimator 130 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 estimator 130 may additionally or alternatively combine the signals in any suitable way or may select one signal over another. For instance, the estimator 130 may base channel estimates on the average of the two signals. As another example, the estimator 130 may prefer an RF-sourced digital transmit signal over the transmit-path digital transmit signal (e.g., sampled before conversion by the transmitter) 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 estimator 130 preferably uses 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 canceller 100) to generate self-interference channel estimates but may additionally or alternatively use 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 canceller 100 preferably includes a single channel estimator 130, but may additionally or alternatively include multiple channel estimators 130. For example, the digital self-interference canceller 100 may include one channel estimator 130 for linear self-interference cancellation and one for non-linear self-interference cancellation. Signal components may be transmitted to multiple channel estimators 130 in any manner. If the canceller 100 includes multiple channel estimators 130, the output of these filters may be combined in any manner to generate a self-interference cancellation signal.
The digital transform configuration preferably includes settings that dictate how the digital self-interference canceller 100 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).
The composer 140 preferably functions to generate a self-interference cancellation signal from the self-interference channel generated by the channel estimator 130 (optionally modified by the channel memory 160, predictor 170, and/or extender 180). The self-interference channel may be either in the frequency or time domains (or any other basis) and may be transformed any number of times by FD and/or TD transformers 110/120. The composer 140 preferably generates the self-interference cancellation signal using a finite impulse response (FIR) filter applied to a transmit signal (e.g., wherein the self-interference channel is used by the controller 150 to set the configuration of this filter). Additionally or alternatively, the composer 140 may generate a self-interference cancellation signal from the self-interference channel (and/or other output of the estimator 130) in any manner.
The controller 150 functions to set the transform configuration of the channel estimator 130 and to control configuration aspects of the FD transformer 110 and TD transformer 120. The controller 150 may additionally or alternatively set or modify any other configuration parameters of the canceller 100.
The transform configuration preferably includes the type of model or models used by the channel estimator 130 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 130 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 channel estimator 130. For example, if the channel estimator 130 includes multiple transform paths, the controller 150 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 channel estimator 130.
Transform configurations are preferably selected and/or generated by the controller 150. The controller 150 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 150 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 150 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 150 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 150 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 150 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 150 may use the output of this model (given transmitter power) as input data for setting transform configurations.
When utilizing digital residue signals, the controller 150 preferably utilizes an un-filtered digital residue signal (as shown in
The controller 150 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 150 may re-set transform configurations every ten seconds according to changed input data values. As another example, the controller 150 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 150 may cooperate with analog self-interference cancellers (for instance, setting transform configurations based on data from the analog canceller, coordinating transform configuration setting times with the analog canceller, disabling or modifying operation of the analog canceller) to reduce overall self-interference (or for any other suitable reason).
The controller 150 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 150 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 150 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 150 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 150 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 150 may look for that same modulation in the self-interference signal; more specifically, the controller 150 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 150 may additionally or alternatively function to set tuning parameters for components outside of the digital self-interference canceller 100, particularly if those parameters are relevant to digital self-interference canceller performance and/or tuning.
In addition to setting the transform configuration, the controller 150 may also be used to change other parameters surrounding digital self-interference cancellation. For example, the controller 150 may be used to modify the size of the averaging window (i.e., number of samples used to perform averaging) of a filter in response to estimated channel characteristics (e.g., channel power, channel dynamics).
The channel memory 160 functions to hold data relating to past self-interference channel estimates. In some use cases, it may be desired that the channel estimator 130 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 160 may function 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 130 to create a new full channel estimate. As shown in
Note that as shown in
The digital self-interference canceller 100 may combine channel estimates from channel memory 160 with the output of the channel estimator 130 in any manner. For example, the digital self-interference canceller 100 may replace a section (e.g., a sub-band) of a past channel estimate with the output of the channel estimator 130. As a second example, the channel estimator 130 may average the output of the channel estimator 130 and the channel memory 160 within a sub-band of relevance.
The predictor 170 functions to predict a future self-interference cancellation channel estimate from current and/or past self-interference cancellation channel estimates. Because performing cancellation tuning requires non-zero time, any tuning on a varying self-interference channel is typically delayed. The predictor 170 preferably modifies the output of the channel estimator 130 to compensate for some or all of the delay incurred by the tuning process. Additionally or alternatively, the predictor 170 may predict future self-interference cancellation channels in order to increase time in between tuning for the canceler 100.
For example, as shown in
The predictor 170 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 170 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 170 may perform extrapolation based on the average of several such differences (e.g., the most recent three differences).
The predictor 170 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 170 may jointly predict time and frequency variance of the self-interference channel (discussed in later sections).
The predictor 170 preferably performs linear extrapolation of the channel, but may additionally or alternatively perform any type of extrapolation (e.g., quadratic). The predictor 170 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).
As previously discussed, the predictor 170 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 170. 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 170 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 170 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 170 scales differential values based on latched timestamps to compensate for non-uniform sampling.
The predictor 170 preferably performs prediction in the frequency domain, as shown in
As another alternative configuration, the predictor 170 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
In a variation of an invention embodiment, the predictor 170 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.
The extender 180 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 100). 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 100.
In smoothing either the magnitude or phase response of the channel estimate in the frequency domain, it may be necessary for the extender 180 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 o-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
As shown in
The digital self-interference canceller 100 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 100 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 100 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 150, but may additionally or alternatively be set in any manner.
3. Self-Interference Cancellation System
As shown in
The system 200 functions to perform self-interference cancellation utilizing an efficiently transformed digital self-interference canceller substantially similar to that of the canceller 100.
The system 200 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 200 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 system 200 preferably is coupled to a receiver. The receiver functions to receive analog receive signals transmitted over a communications link (e.g., a wireless channel, a coaxial cable). The receiver 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 is preferably a radio-frequency (RF) receiver, but may additionally or alternatively be any suitable receiver. The receiver is preferably coupled to the communications link by a duplexer-coupled RF antenna, but may additionally or alternatively be coupled to the communications link in any suitable manner. Some examples of alternative couplings include coupling via one or more dedicated receive antennas. In another alternative coupling, the receiver may be coupled to the communications link by a circulator-coupled RF antenna.
The receiver preferably includes an analog-to-digital converter (ADC) and a frequency downconverter. The receiver may additionally include a low-noise amplifier. The receiver may additionally or alternatively include amplifiers, filters, signal processors and/or any other suitable components. In one variation of a preferred embodiment, the receiver includes only analog processing circuitry (e.g., amplifiers, filters, attenuators, delays). The receiver may function to scale, shift, and/or otherwise modify the receive signal. The downconverter functions to downconvert the analog receive signal from RF (or any other suitable frequency) to a baseband or IF analog receive signal, and the analog-to-digital converter (ADC) functions to convert the baseband or IF analog receive signal to a digital receive signal.
Likewise, the system 200 is preferably also coupled to a transmitter. The transmitter functions to transmit signals of the communications system over a communications link to a second communications system. The transmitter preferably converts digital transmit signals into analog transmit signals.
The transmitter is preferably a radio-frequency (RF) transmitter, but may additionally or alternatively be any suitable transmitter.
The transmitter is preferably coupled to the communications link by a duplexer-coupled RF antenna, but may additionally or alternatively be coupled to the communications link in any suitable manner. Some examples of alternative couplings include coupling via one or more dedicated transmitter antennas. In another alternative coupling, the transmitter may be coupled to the communications link by a circulator-coupled RF antenna.
The transmitter preferably includes a digital-to-analog converter (DAC) and a frequency upconverter. The transmitter may additionally include a power amplifier. The transmitter may additionally or alternatively include amplifiers, filters, signal processors and/or any other suitable components. The transmitter may function to scale, phase shift, delay, and/or otherwise modify the transmit signal. The digital-to-analog converter (DAC) functions to convert the digital transmit signal to a baseband or IF analog transmit signal, and the upconverter functions to upconvert the baseband or IF analog transmit signal from baseband or IF to RF (or any other intended transmission frequency).
The transmit coupler 210 functions to provide a sample of the analog transmit signal for the digital canceller 220 and/or the analog canceller 2400. Transmit couplers may additionally be used to split power between signal paths (e.g., splitting power between different analog canceller 240 blocks).
The transmit coupler 210 is preferably a short section directional transmission line coupler, but may additionally or alternatively be any power divider, power combiner, directional coupler, or other type of signal splitter. The transmit coupler 210 is preferably a passive coupler, but may additionally or alternatively be an active coupler (for instance, including power amplifiers). For example, the transmit coupler 210 may comprise a coupled transmission line coupler, a branch-line coupler, a Lange coupler, a Wilkinson power divider, a hybrid coupler, a hybrid ring coupler, a multiple output divider, a waveguide directional coupler, a waveguide power coupler, a hybrid transformer coupler, a cross-connected transformer coupler, a resistive or capacitive tee, and/or a resistive bridge hybrid coupler. The output ports of the transmit coupler 210 are preferably phase-shifted by ninety degrees, but may additionally or alternatively be in phase or phase shifted by any amount (e.g., zero degrees, 180 degrees).
The transmit coupler 210 may also be included in an active element in the transmitter; e.g. the PA or PMA (post mixer amplifier). This may be attractive with respect to cost and size for highly integrated systems like WLAN or cellular chips sets. Likewise the RX coupler may be integrated with e.g. the LNA in the receive chain.
Transmit couplers 210 may be arranged in series and/or in parallel. The configuration of multiple transmit couplers 210 in the system 200 is discussed in further detail in later sections.
The receive coupler 211 functions to combine one or more analog self-interference cancellation signals (from analog/digital cancellers) with the analog receive signal.
The receive coupler 211 is preferably a short section directional transmission line coupler, but can additionally or alternatively be any power divider, power combiner, directional coupler, or other type of signal splitter. The receive coupler 211 is preferably a passive coupler, but can additionally or alternatively be an active coupler (for instance, including power amplifiers). For example, the receive coupler 211 can comprise a coupled transmission line coupler, a branch-line coupler, a Lange coupler, a Wilkinson power divider, a hybrid coupler, a hybrid ring coupler, a multiple output divider, a waveguide directional coupler, a waveguide power coupler, a hybrid transformer coupler, a cross-connected transformer coupler, a resistive tee, and/or a resistive bridge hybrid coupler. The output ports of the receive coupler 211 are preferably phase-shifted by ninety degrees, but can additionally or alternatively be in phase or phase shifted by any amount (e.g., zero degrees, 180 degrees).
Receive couplers 211 may be arranged in series and/or in parallel. The configuration of multiple receive couplers 211 in the system 200 is discussed in further detail in later sections.
The digital canceller 220 preferably includes the canceller 100 described above (and/or elements thereof); for example, the digital canceller 220 can be substantially similar to the canceller 100. However, the digital canceler 220 can additionally or alternatively be any suitable digital self-interference canceller and/or include any other suitable elements in any suitable arrangement.
The ADC 230 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).
In addition to analog-to-digital signal conversion, the ADC 230 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 230 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 230, while the digital scaler functions to scale a digital signal after conversion via the ADC 230. 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 231 is preferably substantially similar to the ADC 230, except the ADC 231 functions to convert a receive signal from an analog signal to a digital signal. The ADC 231 preferably is used to sample a receive signal post-self-interference cancellation (i.e., a residue signal) to evaluate self-interference canceller 220/240 performance and/or aid in canceller tuning. Note that the system 200 may include multiple ADCs 231, and they may sample receive signals of the system 200 at any point. For example, the system 200 may include three ADCs 231; 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 231 may couple to all three of those signals.
The DAC 232 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).
In addition to digital-to-analog signal conversion, the DAC 232 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 232 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 232, while the VGA functions to scale an analog signal after conversion via the DAC 232. 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 analog self-interference canceller 240 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 240 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 240 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 240 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 240 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 240 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 240 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.
In particular, the analog self-interference canceller 240 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. Alternatively, tuning of the analog self-interference canceller 240 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 200, the system 200 may additionally or alternatively be implemented as a MIMO (multiple-input, multiple-output) system (or MISO, SIMO, etc.). The system 200 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 220 and 240 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
In a MIMO implementation, the transmitter preferably has multiple inputs and outputs. In particular, the transmitter 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 may be any suitable MIMO transmitter (or the system 200 may couple to multiple transmitters); for example, the transmitter 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 preferably has multiple inputs and outputs. In particular, the receiver 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 may be any suitable MIMO receiver (or the system 200 may couple to multiple receivers); for example, the receiver 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 220 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 220 may include multiple cancellation sub-blocks (each incorporating some or all of the functionality of a SISO implementation of the digital self-interference canceller 220). 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 220, the analog self-interference canceller 240 (implemented in a MIMO system) may split analog self-interference cancellation duties into sub-blocks or sub-circuits as previously described.
However, the system 200 can additionally or alternatively include any other suitable elements in any suitable arrangement.
4. Method for Digital Self-Interference Cancellation
A method 300 for digital self-interference cancellation preferably includes: receiving inputs S310; transforming the inputs S320; generating outputs based on the transformed inputs S330; transforming the outputs S340; and/or generating a cancellation signal based on the outputs S350; and can optionally include re-transforming the outputs S360 (e.g., as shown in
S310 preferably functions to receive one or more input signals for use in self-interference cancellation. The input signals preferably include a transmit signal and a residue signal (e.g., as described above regarding signals of the canceller 100 and/or system 200). The input signals are preferably digital signals, but can additionally or alternatively include analog signals such as RF, IF, and/or baseband signals, and/or signals in any other suitable representation. The signals are preferably time-domain signals, and are preferably received by an FD transformer (e.g., the “first FD transformer” described above regarding the canceller 100). However, S310 can additionally or alternatively include receiving any other suitable signals in any suitable manner.
S320 preferably functions to transform the signals received in S310 from the time domain to the frequency domain. S320 is preferably performed by the FD transformer (e.g., “first FD transformer”). S320 preferably includes transforming the signals without pre-compensation and/or upsampling (e.g., performing a high-dimensionality fast Fourier transform on a high-resolution signal, rather than a low-dimensionality transform on a lower-resolution signal), such as described above regarding operation of the first FD transformer. In alternate embodiments, S320 can include transforming one or more of the signals in a manner analogous to that described below regarding S360, such as by pre-compensating, transforming (e.g., with low dimensionality), and/or filtering the signals. However, S320 can additionally or alternatively include transforming the signals in any other suitable manner.
S330 preferably functions to determine one or more channel estimates based on the transformed inputs (e.g., as described above, such as regarding elements 130, 150, 160, 170, and/or 180, etc.), and preferably includes providing the channel estimates as outputs. In some embodiments, S330 is performed based further on the re-transformed outputs (e.g., self-interference channel estimates) generated in S360 (e.g., stored in memory and combined with updated transformed inputs, such as described above regarding the canceller 100). S330 is preferably performed in the frequency domain, but can additionally or alternatively be performed in the time domain and/or otherwise performed. However, S330 can additionally or alternatively include generating any other suitable outputs in any suitable manner.
S340 preferably functions to transform the output(s) generated in S330 from the frequency domain to the time domain. S340 is preferably performed by the TD transformer (e.g., TD transformer 120 described above), but can additionally or alternatively be performed by any other suitable elements. In some embodiments, S340 includes: filtering the outputs S341; transforming the filtered outputs S342; and/or post-compensating the transformed outputs S343 (e.g., as shown in
S350 preferably functions to generate a self-interference cancellation signal based on the output(s). S350 is preferably performed by the composer 140 described above, but can additionally or alternatively be performed by any other suitable elements. S350 is preferably performed in the time-domain, and preferably performed based on the transformed outputs (e.g., time-domain channel estimates). However, S350 can additionally or alternatively be performed in the frequency domain and/or performed based on frequency-domain outputs, such as un-transformed outputs and/or re-transformed outputs, and/or based on any other suitable information. In some embodiments, S350 includes filtering the outputs and/or one or more of the inputs (e.g., the transmit signal), such as described above. However, S350 can additionally or alternatively include generating any other suitable cancellation signal in any suitable manner.
The method 300 can optionally include performing one or more additional transformations. For example, the method 300 can include re-transforming the transformed outputs S360 (e.g., the time-domain channel estimates generated in S340). Such re-transformation is preferably performed by an FD transformer (e.g., the “second FD transformer” described above), but can additionally or alternatively be performed by any other suitable elements.
In some embodiments, S360 includes: pre-compensating the outputs S361; transforming the pre-compensated outputs S362; and/or filtering the transformed outputs S363 (e.g., as shown in
The method 300 can optionally include implementing any or all of the functionality described above regarding the canceller 100 and/or system 200. However, the method 300 can additionally or alternatively include performing any other suitable elements in any suitable manner.
An alternative embodiment preferably implements the some or all of above methods in a computer-readable medium storing computer-readable instructions. The instructions are preferably executed by computer-executable components preferably integrated with a communication routing system. The communication routing system may include a communication system, routing system and a pricing system. The computer-readable medium may 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 processor but the instructions may alternatively or additionally be executed by any suitable dedicated hardware device.
Although omitted for conciseness, embodiments of the system and/or method can include every combination and permutation of the various system components and the various method processes, wherein one or more instances of the method and/or processes described herein can be performed asynchronously (e.g., sequentially), concurrently (e.g., in parallel), or in any other suitable order by and/or using one or more instances of the systems, elements, and/or entities described herein.
The FIGURES illustrate the architecture, functionality and operation of possible implementations of systems, methods and computer program products according to preferred embodiments, example configurations, and variations thereof. In this regard, each block in the flowchart or block diagrams may represent a module, segment, step, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block can occur out of the order noted in the FIGURES. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer 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.
This application claims the benefit of U.S. Provisional Application Ser. No. 62/818,264, filed on 14 Mar. 2019, which is incorporated in its entirety by this reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 106515 | Smith | Aug 1870 | A |
| 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 | Sarin 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 | 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 | Sarin 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 | Ahn | 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 | Feb 2019 | A1 |
| 20190312609 | Moorti et al. | Oct 2019 | A1 |
| 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 |
| 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, “Full Duplex Backscatter,” Proceeding s of the 12th ACM Workshop on Hot Topics in Networks, 7 pages, ACM, (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/Medicallmaging/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). |
| 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. |
| 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). |
| Tse et al., “Fundamentals of Wireless Communications,” Aug. 13, 2004. [Retrieved from the Internet Oct. 25, 2016: www.eeec.berkeley.edu/-dtse/main.pdf]. |
| Wikipedia, “Star Trek Tricoder,” [Retrieved from the Internet Ocotber 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. |
| 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. |
| 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. |
| Number | Date | Country | |
|---|---|---|---|
| 20200295912 A1 | Sep 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62818264 | Mar 2019 | US |
