Limitations and disadvantages of conventional and traditional approaches to electronic communications will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.
Systems and methods are provided for transmitter signal shaping, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.
These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.
Conventional receivers can manage relatively low amounts of nonlinear distortion of their input communication signal. In contrast, receivers in accordance with various implementations of this disclosure may be capable of handling deep communication signal distortion by measuring and modeling the nonlinear response. This capability allows communication systems to handle deep Power Amplifier (PA) nonlinearity. This capability can also be used to handle intentional distortion digitally applied by the transmitter in order to improve various signal characteristics. Circuitry for introducing such digital distortion is referred to herein as a TX nonlinear shaper. In various implementations, the TX nonlinear shaper can achieve one or more the following goals:
The composite response of the TX nonlinear shaper and the PA is referred to in this disclosure as the composite nonlinear response. This composite nonlinear response may include memory. As compared to Digital Pre-distortion (DPD) techniques which attempts to substantially linearize the PA response, thus producing a linearized composite response (typically referred to as “soft limiter”), the TX nonlinear shaper of various implementations of this disclosure aims for a nonlinear composite response that is soft (well behaved derivative) and monotonic, and allows substantially better receiver performance (for a receiver that can manage distorted signal) than the linearized composite achieved with conventional DPD.
Referring now to
The FEC encoding circuit 110 is operable to encode an incoming bitstream in accordance with any suitable FEC encoding algorithm such as Reed-Solomon encoding, low density parity check (LDPC) encoding, turbo encoding, and/or the like to output FEC codewords.
The interleaving circuit 112 is operable to interleave the FEC symbols/bits output by FEC encoding circuit 110 such that the order in which the FEC symbols/bits emerge from the interleaving circuit 112 is different than the order in which they emerge from the FEC encoding circuit 110.
The constellation mapping circuit 114 is operable to map bits of the FEC codewords to symbols of a selected constellation (e.g., BPSK, QPSK, N-QAM, or the like).
The bin mapping circuitry 116 is operable to assign each of the frequency-domain symbols output by the constellation mapping circuit 114 to a respective one of a plurality of frequency bins. The frequency mapping may, for example, be based on frequency bins assigned to the transmitter 101 by a link partner. For example, where the transmitter 101 is in a LTE handset, the frequencies may be assigned by the base station currently handling the handset. The output of the bin mapping circuitry 116 may be zero padded relative to its input.
The buffer 118 is operable to store the frequency-mapped symbols until an OFDM symbol's worth of constellation symbols (e.g., an integer number F) are buffered, at which point the constellation symbols are passed to the IDFT circuit 120.
The IDFT circuit 120 converts the frequency-domain representation of the constellation symbols to a time-domain representation (e.g., comprising T time-domain samples).
The upsampler 122 is operable to upsample the time-domain representation by a factor of L (e.g., resulting if L×T samples from the original T samples).
The P/S and CP add circuit 124 is operable to convert the parallel stream of time-domain samples to a serial stream and then adds a cyclic prefix.
The digital filtering and/or windowing circuit 126 is operable to apply a windowing function and/or other filtering to the output of circuit 124, resulting in a digital-domain OFDM symbol.
The DAC and lowpass filtering circuit is operable to filter and convert to analog the digital-domain OFDM symbol output by circuit 126, resulting in an analog-domain OFDM symbol.
The power amplifier (PA) 130 is operable to transmit the OFDM symbol onto a wired, wireless, or optical communication medium.
In the example implementation shown in
In the example transmitter of
I. DNF Circuit 102
The DNF circuit 102 may be optimized to compress the transmitted signal to limit out-of-band distortion introduced by the Power Amplifier (e.g. reducing cubic metric) and maximize receiver performance. In various example implementations, the DNF circuit 102 results in a smooth and monotonic nonlinearity designed to allow operation under deep compression at the Power Amplifier 130 without violating transmission mask and still allowing for sufficient receiver performance. A few example Approaches to configuring the DNF circuit 102 will now be discussed. It will be understood, however, that many design approaches are possible and fall within the scope of this disclosure.
The following is notation used in this disclosure.
In a first example implementation, the DNF 102 aims to minimize the average total noise and clip distortion experienced by the receiver in the process of cancelling out the distortion. In such an implementation, the DNF 102 approximately models distortion cancellation at the receiver as an inversion of the composite cNL. In other words, the received distorted signal is
y[n]=cNL(x[x])
Thus, the inverting function is denoted hNL (y) such that
hNL(y[n])=hNL(cNL(x[n])+v[n]′)≅x[n]
Based on AM/AM and AM/PM distortion curves for the inversion of the composite cNL, the amplitude of the received samples can be used, i.e.
hNL(y[n])=hamp(|y[n]|)·hphase(|y[n]|)·exp(j·arg(y))
where hamp and hphase compute the correct amplitude and phase correction.
The inversion, however, is noisy and biased, two impairments may be desirable to minimize
hNL(y[n])=hNL(cNL(x[n])+v′[n])=x[n]+v[n]+b[n]
where b[n] is the bias occurring when |x[n]|>XSAT, since in this case y[n] cannot be inverted since x[n] is saturated by cNL(x).
To estimate the noise enhancement, the basic identity
can be used, which can be easily derived by differentiating h(cNL(x))=x. Where ƒ′( ) denotes the derivative of function ƒ( ).
Thus the total noise+distortion due to clipping is
Since the inversion is based on the received signal amplitude, and the OFDM signal is complex Gaussian, the underlying distribution determining the noise enhancement is Rayleigh (with corresponding complex Gaussian signal power of σX2).
An example process for configuring the DNF circuit 102 for minimizing average total noise and distortion is as follows:
Using Lagrange multipliers it can be shown that a good choice for the composite function cNL(x) would be such that:
for x<X′sAT
And to bound |cNL(x)|≦ASAT K is determined such that
The parameter X′SAT may be optimized numerically by searching for the X′SAT that minimizes σvd2(X′SAT)
In another example implementation using a more heuristic criteria, the DNF circuit 102 is used in order transform the complex Gaussian distribution of x[n] at the input of the DNF circuit 102 to another distribution having preferred characteristics at the output of the PA 130. For example, the output distribution may be configured to maximize capacity (or achieve a desired minimum threshold capacity) for the particular power backoff at which the PA 130 is operating. For example, for very low PA output backoff of 3 dB and high signal-to-noise ratio (SNR) at the receiver, the system could transform the input distribution such that the distribution at the output of PA 130 is uniform within a circle of a radii ASAT. This maximizes the entropy of the power-limited transmitted signal, which approximately maximizes capacity in the assumed high SNR case.
The distribution of y=CNL (x) when x is complex Gaussian in again influenced by the derivative c′NL(x). Using the basic identity py(y)=px(cNL−1(y))/cNL′(cNL−1(y)), then to get a uniform distribution the following is needed:
Thus to output a uniform distribution the derivative c′NL(x) is set as follows:
and to bound |cNL (x)|≦ASAT it is also needed to determine K such that
As before, the system can select XSAT′ to minimize the overall clip distortion, or optimize it based on receiver performance.
The approaches in examples 1 and 2 above have a general form of cNL′(x)=K·pdƒ(x), where the probability density function (pdƒ(x)) is the underlying Rayleigh or complex Gaussian probability density function. These approaches can be generalized to:
cNL′(x)=K·pdƒ(x)a
where α is a real positive value, pdƒ(x) is some probability density function, and K is chosen such that
This family of DNF functions contains example 2 (above) when pdƒ(x) is Gaussian and α=1. Empirically, the whole set of functions gives a good tradeoff between noise enhancement and backoff.
As can be seen in
In example implementations 1-3, above, the composite cNL( ) has been optimized. The composite, however, accounts for the responses of both the DNF 102 and the PA 130. Thus, it is needed to compensate DNF for PA existence to get the desired composite. In other words, ƒNL(gNL(x))=cNL(x)=>gNL(x)=ƒNL−1(cNL(x)), where gNL (x) is nonlinear response of the DNF circuit 102. Accurate modeling of the PA 130 is not needed for this purpose. One alternative is to get desired properties of the DNF circuit 102 itself. For example, with low input backoff to the PA 130, the system could optimize gNL (x) directly instead of cNL( ).
In another example implementation, criteria of optimizing gNL( ) may be used to allow mask compliance at higher transmit power. In some instances, such an optimized gNL ( )(e.g., optimized using numerical methods) outperforms conventional DPD in terms of mask compliance.
In another example implementation, gNL ( ) may be optimized (e.g., using numerical methods) to relax the requirements of PA PSD Shaper 108. For example, by optimizing gNL ( ) to reduce distortion at high frequency offsets, the requirements of the PA PSD shaper 108 at high frequency offset are relaxed and therefore the PA PSD Shaper 108 may operate at lower overall sampling rate.
II. DNF PSD Shaper Circuit 104
The DNF PSD shaper circuit 104 may operate to reject out-of-band distortion introduced by the DNF 102. In
In a first example implementation, the DNF PSD shaper 104 is operable to compute the distortion in the frequency domain and cancel it. This may comprise the DNF PSD shaper 104 performing discrete Fourier transform (DFT) on the oversampled DNF output y(n) (e.g. at 2× oversampling) to obtain high frequency content of the output of the DNF circuit 102, which contains out-of-band (OOB) components introduced by the DNF circuit 102. The DNF PSD Shaper 104 may then zero, or attenuate below an applicable spectral mask, the OOB components. The DNF PSD shaper 104 may then perform an inverse DFT (IDFT) to convert the signal back to the time domain.
One drawback with the example implementation just discussed, is that cancelling the OOB components increases the PAPR/cubic metric of the signal. Accordingly, in a second example implementation, the DNF PSD Shaper 104 adjusts the filtering/zeroing of the OOB components based on the resulting cubic metric (e.g., attempts to keep the increase in cubic metric within determined bounds).
In another example implementation, the DNF PSD shaper 104 may actively generate an OOB cancelling signal dic[x] that, on one hand, attenuates the OOB components, and on the other hand does not increase PAPR/Cubic Metric. This can be expressed as follows:
CM(y[n]+dic[n])≦CM0
and
|F(y[n]+dic[n])−F(x[n])|2≦DistortionMask(ƒ)
where CM( ) computes the cubic metric; CM0 is a target cubic metric (e.g. 1.3 dB); and DistortionMask(ƒ) is the maximum allowed DNF distortion mask. For in-band frequencies (as defined by the applicable standard, and which may include some guard band), DistortionMask(ƒ) takes into account the EVM and in-band emissions. For out-of-band frequencies, DistortionMask(ƒ) takes into account adjacent channel leakage ratio (ACLR), and spectral emissions requirements, and also incorporates some margin to allow for distortion introduced by the PA 130.
III. PA Compensation Circuit 106
The foregoing discussed ways to optimize the DNF circuit 102 such that signal characteristics at the output of the PA are improved. Since the PA 130 is part of the composite response from the input of the DNF circuit 102 to the output of the PA 130, in some implementations it is desirable or necessary for the transmitter 101 to compensate for the PA 130, in order to get the desired composite response. As compared to conventional DPD, which turns the composite response into a soft limiter (linear response that is clipped at some level), the PA compensation circuit 106 is not a soft limiter, and can use a much less accurate model of the PA 130.
An aim of the PA compensation circuit 106 can be expressed as
ƒNL(gNL(x))=cNL(x)
Several example implementations of the PA compensation circuit 106 will now be described.
A first example implementation, already discussed above, directly incorporates the response of the PA compensation circuit 106 into the configuration/operation of the DNF circuit 102. By setting gNL(x)=ƒNL−1(cNL(x)), then cNL(x)=ƒNL(gNL(x)). With this approach, the transmitter 101 doesn't need a separate PA compensation circuit 106 in order to comply with an applicable mask and enable sufficient receiver performance.
In another example implementation, the PA compensation circuit 106 is separated from the DNF circuit 102 and the PA Compensation circuit 106 is applied to the output of the DNF PSD Shaper 104. In other words, the processing performed by the PA compensation circuit 106 is s[n]=ƒNL−1(z[n]) (where ƒNL( ) may be an approximation). An advantage of the PA compensation circuit 106 operating on the output of the DNF PSD Shaper 104 is that is reduces OOB distortion introduced by the PA 130.
IV. Iterative PA PSD Shaper Circuit 108
The DFT circuit 208 is operable to convert the time-domain signal s(n) to frequency-domain signal S[k] (e.g., using a fast Fourier transform algorithm). The IDFT circuit 210 is operable to convert the frequency-domain signal A[k] to time-domain signal a(n). The discrete Fourier transform (DFT) circuit 208, an inverse DFT (IDFT) 210 may be synchronized to OFDMA or single carrier frequency division multiple access (ScFDMA) symbol time, such that out-of-band corrections would be orthogonal to the desired signal.
The composite nonlinear distortion modeling circuit 212 processes the time-domain signal a(n) to distort the signal using the composite nonlinear distortion model cNL( ). In
The DFT circuit 214 is operable to convert the time-domain signal j(n) to frequency-domain signal J[k] (e.g., using a fast Fourier transform algorithm).
The bin modification circuit 216 is operable to select one or more frequency bins of the signal J[k] to be modified, and modify the selected bin(s). Modification of a bin may comprise, for example, adjusting a real and/or imaginary component (i.e., amplitude and/or phase) of that bin. Additional details of operation of the bin modification circuit 216 are described below.
The combiner 222 comprises circuitry, for example, an adder or adder-subtractor. In the example shown, combiner 222 is configured for of one complex number from another.
The PA PSD shaper circuit 108 may operate to combine its input signal with a pre-distortion signal in order to reject out-of-band distortion due to the PA 130. In an example implementation, the PA PSD shaper circuit 108 may implement an iterative algorithm. The PA PSD shaper circuit 108 may enhance performance in when only a relatively accurate model of the PA 130 is available. As discussed in further detail with reference to
A goal of the iterative PA PSD shaper circuit 108 is to mitigate out-of-band (OOB) distortion that may be introduced by the PA 130 and/or the DNF circuit 102 (e.g. when the DNF circuit 102 is located between PA PSD shaper 108 and PA 130, as in the example implementations described below with reference to
For example, where mask requirements are more difficult than EVM requirements (thus permitting correction of out-of-band distortion at the expense of increasing in-band distortion), as is the case for some communication standards such as LTE ScFDMA, keeping the desired signal intact may reduce the power of pre-distortion signal for the same level of out-of-band rejection (since no need to correct in-band), thus allowing the PA PSD shaper 108 to operate at stronger compression than a conventional DPD system while achieving the same level of out-of-band rejection.
Also, unlike conventional modulation, the fact that the PA PSD shaper 108 keeps the desired signal intact mean that it may be used even in conjunction with high modulations requiring low EVM, when the receiver is capable of dealing with nonlinear distortion introduced by both the PA 130 and the PA PSD shaper 108.
Furthermore, when used with the DNF circuit 102, the fact that the PA PSD shaper circuit 108 keeps the desired signal intact means that desired/intended nonlinearity introduced by the DNF circuit 102 is not disturbed (e.g., not inverted).
The desired signal is a frequency region, e.g. a subset of OFDM bins. As a non-limiting example for illustration, but not limitation, the desired signal in a frequency division multiple access channel (e.g. uplink OFDMA or uplink ScFDMA) may be considered to be either: (1) the entire carrier bandwidth including guard bands; (2) the allocation of a single user within the multiple concurrent OFDMA/ScFDMA allocations sharing the carrier bandwidth; or (3) some superset or subset thereof. In the first case, the PA PSD shaper circuit 108 may correct only distortion violating the transmission mask (not touching in band and guard band distortion). In the second case, the PA PSD shaper 108 also corrects distortion that may leak into frequency bins allocated to other users.
In an example implementation, the iterative PA PSD shaper 108 may correct distortion in the frequency domain (e.g. the OFDM bins domain, that is, correct distortion on an OFDM-bin-by-OFDM-bin basis) by transmitting over frequency regions, not including the desired signal (Desired OFDM bins), a pre-distortion signal generated to cancel the out-of-band distortion introduced by DNF circuit 102, the PA 130, and/or other components of the transmitter 101. When cancellation is done in the OFDM bins domain, the PA PSD shaper circuit 108 can restore OFDMA orthogonality despite the PA compression-induced distortion. Therefore, the TX nonlinear shaper 100 can manage both mask and in-band orthogonality requirements.
As mentioned above, the PA PSD shaper 108 may be used independent of the other components of the Tx nonlinear shaper 100. Examples of this are shown in
Referring to
Referring to
Referring to
In
In
Operation of the example transmitter 301 will now be described. Transmission symbols x[n] are modulated by modulator 302 and then interpolated to a shaper oversampling rate. The resulting samples s(n) are converted to frequency by DFT circuit 208, the resulting frequency domain signal is denoted S[k]. In an example implementation, the PA PSD shaper 108 processes S[k] in an iterative way, using a relatively accurate composite nonlinear distortion model cNL( ). For the first iteration on a particular symbol, the switch 220 is configured to connect the output of the DFT 208 to the combiner 222. The signal S[k] is combined with an initial value of D[k] (output by bin modification circuit 216) to result in an initial value of A[k]. A[k] is then stored to memory 218. For subsequent iterations (if any) on the same symbol, the switch 220 is configured to connect the output of memory 218 to the input of the combiner 222. That is, for second and subsequent iterations on a particular symbol, A[k] is generated from the value of A[k] generated during the previous iteration. In each iteration, A[k] is converted to time domain signal a(n) by IDFT circuit, then circuit 212 distorts the signal a(n) according to cNL( ) to generate signal j(n). The distorted signal j(n) is then converted to frequency domain signal J[k].
In an example implementation, the frequency bins of signal J[k] corresponding to desired signal (i.e., the desired frequency bins of signal S[k]) are then zeroed by bin modification circuit 216, resulting in the frequency distortion signal D[k]. That is, in such an implementation, the signal D[k] is zero valued in one or more frequency bins corresponding to the desired signal and non-zero valued in other bins. These non-zero values of the signal D[k] thus correspond to interference cancelling signals located in undesired frequency bins (i.e., in
In an example implementation, the frequency bins of signal J[k] corresponding to undesired signal (i.e., undesired frequency bins of signal S[k] and/or additional frequency bins not corresponding to components of signal s(n)) are then zeroed by bin modification circuit 216, resulting in the frequency distortion signal D[k]. That is, in such an implementation, the signal D[k] is zero valued in one or more bins corresponding to undesired signal and non-zero valued in one or more frequency bins corresponding to the desired signal. These non-zero values of the signal D[k] thus correspond to interference cancelling signals located in desired frequency bins (i.e., in
After the ith iteration on a particular symbol, a next symbol S[k] arrives at the PA PSD Shaper 108 and the process repeats. Thus, D[k] is updated for each symbol and thus is periodic with a periodicity synchronized to the symbol timing of S[k].
In the above example, the bin modification circuit 216 gives each bin of J[K] a weight of either 0 or 1 which results in each bin of J[K] being either completely subtracted from A[K], or not at all subtracted. The bin modification circuit 216 is not, however, limited to using only weights of 0 and 1. Any real or complex weights may be used. For example, relatively lower, non-zero real weights may be used for weaker cancellation of distortion on a first set of bins, and relatively higher, non-zero real weights may be used for stronger cancellation of distortion on a second set of bins. Such weightings may be chosen, for example, based on a priori knowledge that weaker cancellation suffices on the first set and/or that stronger cancellation is need on the second set. Alternately, PA PSD Shaper may change the weights dynamically from iteration to iteration based on an amount of excess distortion in a bin at the end of a previous iteration. For example, if distortion of a specific bin is lower than a determined threshold (e.g., determined based on the applicable standard, based on knowledge of the intended receiver, and/or the like) then PA PSD shaper 108 may use a low weight for partial distortion cancellation for that bin, but if distortion is above the threshold, the PA PSD Shaper may apply a higher weight (e.g. up to a weight of 1 to fully cancel distortion for that bin).
In an example implementation, the bin mapper circuit 116 and/or the bin modification circuit 216 may apply a complex weight to frequency bins of signal S[k] corresponding to pilots. Such a weighting may enable better channel estimation in a receiver and thus reduce EVM in the receiver. To explain, the transmitter may insert pilots which a receiver may use to train its equalizer. The pilots may be, for example, scattered among the bins of an OFDM symbol or may be on all bins of certain SC-FDMA symbols (e.g., the UL Reference signal in LTE). Pilots, however, have low-PAPR and thus do not experience significant nonlinear distortion. Therefore, equalizer training based on such low-PAPR pilots does not take into account the nonlinear distortion introduced by the system (including, for example, the PA PSD Shaper 108, the DNF 102, the DPD 306, and/or the PA 130). In some instances, where the receiver is capable, this may be compensated for by providing the nonlinear model (CNL) to the receiver (e.g., via a control channel) and the receiver may thus take it into account when configuring its equalizer and/or other circuitry. In other instances (e.g., in the case of a conventional LTE receiver), however, the receiver is not capable of receiving CNL and knowing how to use it for configuring its circuitry. In these other instances, the transmitter may intentionally distort the pilot symbols (i.e., modify the amplitude and/or phase of the pilots) so that equalizer training in the receiver inherently takes the multiplicative part of the distortion into account.
The complex weight applied to bins of S[k] corresponding to pilots is designated Wp here and may correspond to expectancy, over the set of all possible transmission symbols (i.e., for OFDM, all possible OFDM symbols or, for SC-FDMA, all possible SC-FDMA symbols), of the amplitude reduction and phase rotation caused by the nonlinear elements of the transmitter. The expectancy may be calculated from CNL using a model, formula, or lookup table, for example. The expectancy may depend on the particular allocation of bins among the users.
Although the complex weighting of pilots may occur in the frequency domain, as just described, in other implementations it may be applied in the time domain. Complex weighting of pilots in the time domain may be particularly straightforward where all bins of a particular symbol carry pilots, such as in an LTE UL Reference Signal. This is shown in
In an example implementation (e.g., where the transmitter is in a basestation using downlink (DL) OFDMA), the distortion may be shaped by moving it to frequencies allocated for use with relatively lower-order modulation constellations. For example, if out-of-band distortion is too high and is desired to be moved in-band, the frequencies onto which to move that distortion may be selected to be frequencies allocated for use with relatively lower-order modulation constellations. Similarly, if distortion in a first frequency bin is too high and it is desired to move it to a second one or more bin(s), those second bins may be selected from subcarriers using a lower-order modulation constellation than the constellation being used on the first bin. (e.g., the higher-order constellation may be NQAM and the lower order constellation may be MQAM with N>M). Such distortion shaping may be selected to take advantage of the fact that frequencies allocated for use with higher-order modulation constellations would typically require lower distortion floors than the frequencies allocated for use with the lower-order modulation constellations. Such shaping may be achieved by more aggressive cancelling of distortion on frequencies allocated for use with higher-order modulation constellation allocations and less aggressive cancelling (or no cancelling at all) on frequencies allocated for use with lower-order modulation constellations. The PA PSD Shaper 108 may also operate to move distortion from in-band to out-of-band in cases where very low in-band EVM is needed, and out-of-band rejection requirements can tolerate some additional out-of-band distortion.
In an example implementation (e.g., where the transmitter is in a handset using uplink (UL) ScFDMA), different weights to be applied to different in-band allocated frequencies may be determined based on known noise and/or interference at the receiver. For example, if the noise plus interference floor at receiver is not flat by design of the network (e.g., in a network using fractional frequency re-use), such that there is lower interference on some frequencies than others, the bin modification circuit 216 may take this into account when determining weights to apply to the various frequencies.
Operation of the example transmitter 351 will now be described. A bit stream b[ ] is constellation mapped (e.g., according to a selected QAM constellation) into the symbol stream x[n]. S/P circuit 354 groups the symbol stream into groups of size L, where L is the number of frequency bins allocated for ScFDMA burst transmission. A L-size DFT is performed by L-DFT circuit 356 to transform ScFDMA symbols into L frequency domain bins. The bin mapper 116 then maps the resulting L bins according to specific burst allocation in frequency (i.e., maps the bins to the frequencies allocated to the transmitter 351). The output of the bin mapper 116 represents a DPD oversampled signal, and consists of Nfft*DPD_OVS frequency bins (where Nfft corresponds to ScFDMA carrier BW, and DPD_OVS is the DPD oversampling rate). This frequency domain signal is taken directly as signal S[k] and input to the PA PSD shaper 108. The rest of the processing blocks are the same as described for
In an example implementation, D[k] for the first iteration may be configured based on a priori knowledge about the communication system. In another example implementation, D[k] for the first iteration may be simply all zeroes. In such an implementation, the IDFT circuit 210 may be skipped for the first iteration and circuit 212 may operate directly on s(n) for the first iteration.
In the example implementations of
When the DPD/ET circuit 306 is present and DNF circuit 102 is not used (i.e., not present or bypassed), then cNL( )=ƒNL( ) (an estimation of the nonlinear distortion introduced by PA 130). This model may be a memoryless nonlinearity (in the simpler case), or consist of nonlinearity with memory. Estimation of ƒNL( ) may, for example, be based on feedback from the PA 130 and/or based on a priori information about the PA 130 (e.g., its part number, its bias voltage, characterization data from a manufacturer of the PA, etc.).
When the DPD/ET circuit 306 is present, it may use feedback from PA 130 to estimate, and compensate for, ƒNL( ). This may result in a composite response that is approximately a soft-limiter (an example soft-Limiter response is shown in
In an example implementation, the PA PSD shaper 108 may use numerical optimization to, for example, determine which weights to apply to various bins of J[k]. This may comprise optimization of a performance metric using numerical techniques such as gradient descent. One example of such a performance metric is the mean squared error between permissible out-of-band distortion (as set by an applicable standard and/or regulatory body) and the out-of-band distortion predicted by D[k]. The result of the numerical optimization may be that the bin modification circuit 216 weights differently distortion in different frequency bands. For example, the bin modification circuit 216 may apply higher weights to out-of-band distortion components exceeding an applicable spectral mask and lower weights to distortion components leaking into bins allocated to other users. The use of numerical optimization may use, for example, relatively few gradient descent iterations, thus resulting in a cost-effective implementation.
It is noted that, in the example implementations of
The control circuitry 502 is operable to configure the switch 220. This control circuit is also operable to control when the circuit 124 reads in the output of the PA PSD Shaper 108. Through these two controls, the control circuitry 502 can thus control the number of iterations performed on any given symbol. The number of iterations performed on any particular symbol may be determined a priori and/or in real-time. The number of iterations performed on any particular symbol may be determined based on any one or more of a variety of parameters such as: the constellation used to generate the symbol, the particular constellation points in the symbol, the peak to average power ratio (PAPR) of the symbol, the number of subcarriers in the symbol, which subset of a larger subset of subcarriers have been allocated for transmission of the symbol, a spectral mask of the standard with which transmission of the symbol is to comply, a permissible error vector magnitude (e.g., set by an applicable standard and/or by the capabilities of the receiver for which the symbol is destined), the power backoff setting of the power amplifier, a performance metric, and/or the like. A performance metric used to control the number of iterations may be measured by the transmitter and/or may be measured by a receiver and fed back to the transmitter via a control channel. A performance metric used to control the number of iterations may be, for example, an error (e.g., a difference or squared difference) between the signal S(n) or J(n) and a requirement set forth by an applicable standard (e.g., maximum out-of-band power, EVM, and/or the like).
The control circuitry is also operable to configure the bin modification circuit 216. This may comprise selecting which of the bins may be modified and the extent to which the selected bins may be modified. Configuration of the bin modification circuit 216 may be determined a priori and/or in real-time (e.g., on a per-symbol or per-link basis). The configuration of the bin modification circuit 216 for any particular symbol may be determined based on any one or more of a variety of parameters such as: the constellation used to generate the symbol, the particular constellation points in the symbol, the peak to average power ratio (PAPR) of the symbol, the number of subcarriers in the symbol, which subset of a larger subset of subcarriers have been allocated for transmission of the symbol, a spectral mask of the standard with which transmission of the symbol is to comply, a permissible error vector magnitude (e.g., set by an applicable standard and/or by the capabilities of the receiver for which the symbol is destined), the power backoff setting of the power amplifier, a performance metric, and/or the like. A performance metric used to for configuring the bin modification circuit 216 (e.g., configuring weights applied to various bins for any particular iteration i on a symbol) may be measured by the transmitter and/or may be measured by a receiver and fed back to the transmitter via a control channel. A performance metric used to configure the bin modification circuit 216 may be, for example, an error (e.g., a difference or squared difference) between the signal S(n) or J(n) and a requirement set forth by an applicable standard (e.g., maximum out-of-band power, EVM, and/or the like).
In an example implementation, processing
In accordance with an example implementation of this disclosure, a transmitter (e.g., 301 or 351) comprises at least one nonlinear circuit, and a power spectral density (PSD) shaping circuit (e.g., 108). The PSD shaping circuit is operable to receive a symbol of a modulated signal (e.g., time domain symbol s(n) or frequency domain symbol s[k]), wherein the symbol corresponds to a first one or more frequency bins. The PSD shaping circuit is operable to perform iterative processing of the symbol, wherein each iteration of the processing comprises: generation of a first pre-distortion signal (e.g., frequency domain signal D[k] or time-domain signal D(n)) based on a model of the at least one nonlinear circuit, wherein the pre-distortion signal corresponds to a second one or more frequency bins; and combination of the symbol (e.g., S[k]), or a pre-distorted version of the symbol (e.g., A[k]), with the pre-distortion signal. The generation of the pre-distortion signal may comprises generation of a nonlinearly-distorted signal (e.g., J(n) or J[k]), and adjustment of one or more components of the nonlinearly-distorted signal.
The adjustment may comprise weighting the one or more components of the nonlinearly-distorted signal. The weighting may be determined per frequency bin or per group of frequency bins. The weighting may be determined based on distortion remaining in the pre-distorted signal after an iteration of the iterative processing of the symbol. The one or more components may be in one or more desired signal frequency bands. The one or more desired signal frequency bands may be frequency bands assigned to the transmitter by a basestation. The one or more components may be in one or more undesired signal frequency bands. The one or more undesired signal frequency bands may be out-of-band frequency bands. The one or more undesired signal frequency bands may be frequency bands allocated, by a basestation, to one or more other transmitters. The adjustment of the one or more components may be controlled (e.g., by circuit 502) based on a performance metric (e.g., SNR) fed back to the transmitter from a receiver. The adjustment of the one or more components may be controlled based on order of a modulation constellation used for generation of the symbol. The adjustment of the one or more components may be controlled based on a determination of interference present at a receiver to which said symbol is to be transmitted.
The adjustment of the one or more components may be controlled based on which frequency bands have been allocated to the transmitter by a basestation. The adjustment of the one or more components may results in shifting distortion from out-of-band frequencies to in-band frequencies or from in-band frequencies to out-of-band frequencies. The adjustment of the one or more components may result in shifting distortion from in-band frequencies to out-of-band frequencies. The adjustment of the one or more components may be controlled based on whether a receiver to which the symbol is destined comprises circuitry for modeling and mitigating nonlinear distortion introduced by the transmitter. The at least one nonlinear circuit may comprise a power amplifier and/or a digital pre-distortion circuit. The at least one nonlinear circuit may comprise a digital nonlinear function circuit configured to compress a signal to be transmitted prior to input of the signal to be transmitted to a power amplifier of the transmitter. The said generation of the pre-distortion signal may be based on a seeking of a minimum, maximum, or desired value (e.g., above or below a threshold) of a performance metric. The transmitter may comprise a pilot distortion circuit (e.g., bin mapper 116 or multiplier 390) operable to distort pilots of said symbol.
In accordance with an example implementation of this disclosure, a transmitter (e.g., 301 or 351) may comprise a modulator circuit, a combiner circuit (e.g., 222 and/or 606), a nonlinear distortion modeling circuit (e.g., 212), and a modification circuit (e.g., 216). The modulator is operable to generate a symbol to be transmitted (e.g., time domain symbol s(n) or frequency domain symbol s[k]). The combiner circuit is operable to combine the symbol with a first portion of a pre-distortion signal (e.g., D[k] for a first iteration), a result of the combination being a pre-distorted signal (e.g., a(n)). The nonlinear distortion modeling circuit is operable to: model nonlinear distortion introduced by at least one nonlinear circuit of the transmitter; and nonlinearly distort the pre-distorted signal, a result of the nonlinear distortion being a distorted signal (e.g., J(n) or J[k]). The modification circuit is operable to modify the distorted signal to generate a second portion of a pre-distortion signal (e.g., D[k] for a second iteration). The modification of the distorted signal may be on a per subcarrier basis. The modification of the distorted signal by the modification circuit may comprise zeroing spectral components of the distorted signal.
As utilized herein the terms “circuits” and “circuitry” refer to physical electronic components (i.e. hardware) and any software and/or firmware (“code”) which may configure the hardware, be executed by the hardware, and or otherwise be associated with the hardware. As used herein, for example, a particular processor and memory may comprise a first “circuit” when executing a first one or more lines of code and may comprise a second “circuit” when executing a second one or more lines of code. As utilized herein, “and/or” means any one or more of the items in the list joined by “and/or”. As an example, “x and/or y” means any element of the three-element set {(x), (y), (x, y)}. In other words, “x and/or y” means “one or both of x and y”. As another example, “x, y, and/or z” means any element of the seven-element set {(x), (y), (z), (x, y), (x, z), (y, z), (x, y, z)}. In other words, “x, y and/or z” means “one or more of x, y and z”. As utilized herein, the term “exemplary” means serving as a non-limiting example, instance, or illustration. As utilized herein, the terms “e.g.,” and “for example” set off lists of one or more non-limiting examples, instances, or illustrations. As utilized herein, circuitry is “operable” to perform a function whenever the circuitry comprises the necessary hardware and code (if any is necessary) to perform the function, regardless of whether performance of the function is disabled or not enabled (e.g., by a user-configurable setting, factory trim, etc.).
Other embodiments of the invention may provide a non-transitory computer readable medium and/or storage medium, and/or a non-transitory machine readable medium and/or storage medium, having stored thereon, a machine code and/or a computer program having at least one code section executable by a machine and/or a computer, thereby causing the machine and/or computer to perform the processes as described herein.
Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in at least one computing system, or in a distributed fashion where different elements are spread across several interconnected computing systems. Any kind of computing system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computing system with a program or other code that, when being loaded and executed, controls the computing system such that it carries out the methods described herein. Another typical implementation may comprise an application specific integrated circuit or chip.
The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.
While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims.
This application claims priority to the following application(s), each of which is hereby incorporated herein by reference: U.S. provisional patent application 62/042,356 filed on Aug. 27, 2014; and U.S. provisional patent application 62/126,881 filed on Mar. 2, 2015.
Number | Name | Date | Kind |
---|---|---|---|
4109101 | Mitani | Aug 1978 | A |
4135057 | Bayless, Sr. et al. | Jan 1979 | A |
4797925 | Lin | Jan 1989 | A |
5111484 | Karabinis | May 1992 | A |
5131011 | Bergmans et al. | Jul 1992 | A |
5202903 | Okanoue | Apr 1993 | A |
5249200 | Chen et al. | Sep 1993 | A |
5283813 | Shalvi et al. | Feb 1994 | A |
5291516 | Dixon et al. | Mar 1994 | A |
5394439 | Hemmati | Feb 1995 | A |
5432822 | Kaewell, Jr. | Jul 1995 | A |
5459762 | Wang et al. | Oct 1995 | A |
5590121 | Geigel et al. | Dec 1996 | A |
5602507 | Suzuki | Feb 1997 | A |
5710792 | Fukawa et al. | Jan 1998 | A |
5757855 | Strolle et al. | May 1998 | A |
5784415 | Chevillat et al. | Jul 1998 | A |
5818653 | Park et al. | Oct 1998 | A |
5886748 | Lee | Mar 1999 | A |
5889823 | Agazzi et al. | Mar 1999 | A |
5915213 | Iwatsuki et al. | Jun 1999 | A |
5930309 | Knutson et al. | Jul 1999 | A |
5946359 | Tajiri et al. | Aug 1999 | A |
6009120 | Nobakht | Dec 1999 | A |
6167079 | Kinnunen et al. | Dec 2000 | A |
6233709 | Zhang et al. | May 2001 | B1 |
6272173 | Hatamian | Aug 2001 | B1 |
6335954 | Bottomley et al. | Jan 2002 | B1 |
6356586 | Krishnamoorthy et al. | Mar 2002 | B1 |
6516025 | Warke et al. | Feb 2003 | B1 |
6516437 | Van Stralen et al. | Feb 2003 | B1 |
6529303 | Rowan et al. | Mar 2003 | B1 |
6532256 | Miller | Mar 2003 | B2 |
6535549 | Scott et al. | Mar 2003 | B1 |
6591090 | Vuorio et al. | Jul 2003 | B1 |
6608873 | Spinnler et al. | Aug 2003 | B1 |
6675184 | Matsui | Jan 2004 | B1 |
6690754 | Haratsch et al. | Feb 2004 | B1 |
6697441 | Bottomley et al. | Feb 2004 | B1 |
6718165 | Ha | Apr 2004 | B1 |
6785342 | Isaksen et al. | Aug 2004 | B1 |
6871208 | Guo et al. | Mar 2005 | B1 |
6968021 | White et al. | Nov 2005 | B1 |
6985709 | Perets | Jan 2006 | B2 |
7158324 | Stein et al. | Jan 2007 | B2 |
7190288 | Robinson et al. | Mar 2007 | B2 |
7190721 | Garrett | Mar 2007 | B2 |
7205798 | Agarwal et al. | Apr 2007 | B1 |
7206363 | Hegde et al. | Apr 2007 | B2 |
7215716 | Smith | May 2007 | B1 |
7269205 | Wang | Sep 2007 | B2 |
7286598 | Kochale | Oct 2007 | B2 |
7318185 | Khandani et al. | Jan 2008 | B2 |
7333561 | Pinckley | Feb 2008 | B2 |
7336716 | Maltsev et al. | Feb 2008 | B2 |
7463697 | Maltsev et al. | Dec 2008 | B2 |
7467338 | Saul | Dec 2008 | B2 |
7583755 | Ma et al. | Sep 2009 | B2 |
7830854 | Sarkar et al. | Nov 2010 | B1 |
7924956 | Maltsev et al. | Apr 2011 | B2 |
7974230 | Talley et al. | Jul 2011 | B1 |
8005170 | Lee et al. | Aug 2011 | B2 |
8059737 | Yang | Nov 2011 | B2 |
8175186 | Wiss et al. | May 2012 | B1 |
8175201 | Mathew et al. | May 2012 | B2 |
8199804 | Cheong | Jun 2012 | B1 |
8248975 | Fujita et al. | Aug 2012 | B2 |
8265561 | Nakamura | Sep 2012 | B2 |
8331500 | Choi et al. | Dec 2012 | B2 |
8351536 | Mazet et al. | Jan 2013 | B2 |
8422589 | Golitschek Edler Von Elbwart et al. | Apr 2013 | B2 |
8427935 | Van de Beek et al. | Apr 2013 | B2 |
8432987 | Siti et al. | Apr 2013 | B2 |
8498591 | Qian et al. | Jul 2013 | B1 |
8519789 | Hawkes | Aug 2013 | B2 |
8526523 | Eliaz | Sep 2013 | B1 |
8548072 | Eliaz | Oct 2013 | B1 |
8548089 | Agazzi et al. | Oct 2013 | B2 |
8548097 | Eliaz | Oct 2013 | B1 |
8553821 | Eliaz | Oct 2013 | B1 |
8559494 | Eliaz | Oct 2013 | B1 |
8559496 | Eliaz | Oct 2013 | B1 |
8559498 | Eliaz | Oct 2013 | B1 |
8565363 | Eliaz | Oct 2013 | B1 |
8566687 | Eliaz | Oct 2013 | B1 |
8571131 | Eliaz | Oct 2013 | B1 |
8571146 | Eliaz | Oct 2013 | B1 |
8572458 | Eliaz | Oct 2013 | B1 |
8582637 | Eliaz | Nov 2013 | B1 |
8599914 | Eliaz | Dec 2013 | B1 |
8605832 | Eliaz | Dec 2013 | B1 |
8665941 | Eliaz | Mar 2014 | B1 |
8665992 | Eliaz | Mar 2014 | B1 |
8666000 | Eliaz | Mar 2014 | B2 |
8675769 | Eliaz | Mar 2014 | B1 |
8675782 | Eliaz | Mar 2014 | B2 |
8681889 | Eliaz | Mar 2014 | B2 |
8731413 | Dave et al. | May 2014 | B1 |
8737458 | Eliaz | May 2014 | B2 |
8744003 | Eliaz | Jun 2014 | B2 |
8744009 | Kleider et al. | Jun 2014 | B2 |
8774738 | Dakshinamurthy et al. | Jul 2014 | B2 |
8781008 | Eliaz | Jul 2014 | B2 |
8804879 | Eliaz | Aug 2014 | B1 |
8811548 | Eliaz | Aug 2014 | B2 |
8824572 | Eliaz | Sep 2014 | B2 |
8824599 | Eliaz | Sep 2014 | B1 |
8824611 | Eliaz | Sep 2014 | B2 |
8831124 | Eliaz | Sep 2014 | B2 |
8842778 | Eliaz | Sep 2014 | B2 |
8873612 | Eliaz | Oct 2014 | B1 |
8885698 | Eliaz | Nov 2014 | B2 |
8885786 | Eliaz | Nov 2014 | B2 |
8891701 | Eliaz | Nov 2014 | B1 |
8897387 | Eliaz | Nov 2014 | B1 |
8897405 | Eliaz | Nov 2014 | B2 |
8948321 | Eliaz | Feb 2015 | B2 |
8972836 | Eliaz | Mar 2015 | B2 |
8976853 | Eliaz | Mar 2015 | B2 |
8976911 | Eliaz | Mar 2015 | B2 |
8982984 | Eliaz | Mar 2015 | B2 |
8989249 | Zerbe et al. | Mar 2015 | B2 |
9003258 | Eliaz | Apr 2015 | B2 |
9071305 | Eliaz | Jun 2015 | B2 |
9088400 | Eliaz | Jul 2015 | B2 |
9088469 | Eliaz | Jul 2015 | B2 |
9094269 | Ling | Jul 2015 | B2 |
9100071 | Eliaz | Aug 2015 | B2 |
9106292 | Eliaz | Aug 2015 | B2 |
9118519 | Eliaz | Aug 2015 | B2 |
9124399 | Eliaz | Sep 2015 | B2 |
9130627 | Eliaz | Sep 2015 | B2 |
9130637 | Eliaz | Sep 2015 | B2 |
9130795 | Eliaz | Sep 2015 | B2 |
9137057 | Eliaz | Sep 2015 | B2 |
9166833 | Eliaz | Oct 2015 | B2 |
9166834 | Eliaz | Oct 2015 | B2 |
20010008542 | Wiebke et al. | Jul 2001 | A1 |
20010036151 | Cimini et al. | Nov 2001 | A1 |
20020016938 | Starr | Feb 2002 | A1 |
20020060827 | Agazzi et al. | May 2002 | A1 |
20020123318 | Lagarrigue | Sep 2002 | A1 |
20020150065 | Ponnekanti | Oct 2002 | A1 |
20020150184 | Hafeez et al. | Oct 2002 | A1 |
20020172297 | Ouchi et al. | Nov 2002 | A1 |
20030016741 | Sasson et al. | Jan 2003 | A1 |
20030132814 | Nyberg | Jul 2003 | A1 |
20030135809 | Kim | Jul 2003 | A1 |
20030207680 | Yang et al. | Nov 2003 | A1 |
20030210352 | Fitzsimmons et al. | Nov 2003 | A1 |
20030227981 | Vella-Coleiro | Dec 2003 | A1 |
20040008616 | Jung et al. | Jan 2004 | A1 |
20040009783 | Miyoshi | Jan 2004 | A1 |
20040037374 | Gonikberg | Feb 2004 | A1 |
20040081259 | Ammer et al. | Apr 2004 | A1 |
20040086276 | Lenosky | May 2004 | A1 |
20040120409 | Yasotharan et al. | Jun 2004 | A1 |
20040142666 | Creigh et al. | Jul 2004 | A1 |
20040170228 | Vadde | Sep 2004 | A1 |
20040174937 | Ungerboeck | Sep 2004 | A1 |
20040203458 | Nigra | Oct 2004 | A1 |
20040227570 | Jackson et al. | Nov 2004 | A1 |
20040240578 | Thesling | Dec 2004 | A1 |
20040257955 | Yamanaka | Dec 2004 | A1 |
20050032472 | Jiang et al. | Feb 2005 | A1 |
20050047517 | Georgios et al. | Mar 2005 | A1 |
20050089125 | Zhidkov | Apr 2005 | A1 |
20050123077 | Kim | Jun 2005 | A1 |
20050135472 | Higashino | Jun 2005 | A1 |
20050163252 | McCallister et al. | Jul 2005 | A1 |
20050193318 | Okumura et al. | Sep 2005 | A1 |
20050219089 | Batruni | Oct 2005 | A1 |
20050220218 | Jensen et al. | Oct 2005 | A1 |
20050265470 | Kishigami et al. | Dec 2005 | A1 |
20050276317 | Jeong et al. | Dec 2005 | A1 |
20060034378 | Lindskog et al. | Feb 2006 | A1 |
20060067396 | Christensen | Mar 2006 | A1 |
20060109780 | Fechtel | May 2006 | A1 |
20060109935 | McQueen et al. | May 2006 | A1 |
20060171489 | Ghosh et al. | Aug 2006 | A1 |
20060176948 | Lee | Aug 2006 | A1 |
20060203943 | Scheim et al. | Sep 2006 | A1 |
20060239339 | Brown et al. | Oct 2006 | A1 |
20060245346 | Bar-Ness et al. | Nov 2006 | A1 |
20060245765 | Elahmadi et al. | Nov 2006 | A1 |
20060280113 | Huo | Dec 2006 | A1 |
20070047121 | Eleftheriou et al. | Mar 2007 | A1 |
20070089015 | Saul | Apr 2007 | A1 |
20070092017 | Abedi | Apr 2007 | A1 |
20070098059 | Ives et al. | May 2007 | A1 |
20070098090 | Ma et al. | May 2007 | A1 |
20070098116 | Kim et al. | May 2007 | A1 |
20070110177 | Molander et al. | May 2007 | A1 |
20070110191 | Kim et al. | May 2007 | A1 |
20070127608 | Scheim et al. | Jun 2007 | A1 |
20070140330 | Allpress et al. | Jun 2007 | A1 |
20070189404 | Baum et al. | Aug 2007 | A1 |
20070213087 | Laroia et al. | Sep 2007 | A1 |
20070230593 | Eliaz et al. | Oct 2007 | A1 |
20070258517 | Rollings et al. | Nov 2007 | A1 |
20070291719 | Demirhan et al. | Dec 2007 | A1 |
20080002789 | Jao et al. | Jan 2008 | A1 |
20080049598 | Ma et al. | Feb 2008 | A1 |
20080080644 | Batruni | Apr 2008 | A1 |
20080130716 | Cho et al. | Jun 2008 | A1 |
20080130788 | Copeland | Jun 2008 | A1 |
20080144709 | McCallister et al. | Jun 2008 | A1 |
20080159377 | Allpress et al. | Jul 2008 | A1 |
20080207143 | Skarby et al. | Aug 2008 | A1 |
20080260985 | Shirai et al. | Oct 2008 | A1 |
20090003425 | Shen et al. | Jan 2009 | A1 |
20090028234 | Zhu | Jan 2009 | A1 |
20090034625 | Komi et al. | Feb 2009 | A1 |
20090052577 | Wang | Feb 2009 | A1 |
20090058521 | Fernandez | Mar 2009 | A1 |
20090075590 | Sahinoglu et al. | Mar 2009 | A1 |
20090086808 | Liu et al. | Apr 2009 | A1 |
20090115513 | Hongo et al. | May 2009 | A1 |
20090122854 | Zhu et al. | May 2009 | A1 |
20090137212 | Belotserkovsky | May 2009 | A1 |
20090185612 | McKown | Jul 2009 | A1 |
20090213907 | Bottomley | Aug 2009 | A1 |
20090213908 | Bottomley | Aug 2009 | A1 |
20090220034 | Ramprashad et al. | Sep 2009 | A1 |
20090245226 | Robinson et al. | Oct 2009 | A1 |
20090245401 | Chrabieh et al. | Oct 2009 | A1 |
20090286494 | Lee et al. | Nov 2009 | A1 |
20090290620 | Tzannes et al. | Nov 2009 | A1 |
20090323841 | Clerckx et al. | Dec 2009 | A1 |
20100002692 | Bims | Jan 2010 | A1 |
20100034253 | Cohen | Feb 2010 | A1 |
20100039100 | Sun et al. | Feb 2010 | A1 |
20100062705 | Rajkotia et al. | Mar 2010 | A1 |
20100074349 | Hyllander et al. | Mar 2010 | A1 |
20100158085 | Khayrallah | Jun 2010 | A1 |
20100166050 | Aue | Jul 2010 | A1 |
20100172309 | Forenza et al. | Jul 2010 | A1 |
20100202505 | Yu et al. | Aug 2010 | A1 |
20100202507 | Allpress et al. | Aug 2010 | A1 |
20100203854 | Yu et al. | Aug 2010 | A1 |
20100208774 | Guess et al. | Aug 2010 | A1 |
20100208832 | Lee et al. | Aug 2010 | A1 |
20100215107 | Yang | Aug 2010 | A1 |
20100220825 | Dubuc et al. | Sep 2010 | A1 |
20100278288 | Panicker et al. | Nov 2010 | A1 |
20100283540 | Davies | Nov 2010 | A1 |
20100284481 | Murakami et al. | Nov 2010 | A1 |
20100309796 | Khayrallah | Dec 2010 | A1 |
20100329325 | Mobin et al. | Dec 2010 | A1 |
20110051864 | Chalia et al. | Mar 2011 | A1 |
20110064171 | Huang et al. | Mar 2011 | A1 |
20110069791 | He | Mar 2011 | A1 |
20110074500 | Bouillet et al. | Mar 2011 | A1 |
20110074506 | Kleider et al. | Mar 2011 | A1 |
20110075745 | Kleider et al. | Mar 2011 | A1 |
20110090986 | Kwon et al. | Apr 2011 | A1 |
20110101957 | Boufounos | May 2011 | A1 |
20110134899 | Jones, IV et al. | Jun 2011 | A1 |
20110150064 | Kim et al. | Jun 2011 | A1 |
20110164492 | Ma et al. | Jul 2011 | A1 |
20110170630 | Silverman et al. | Jul 2011 | A1 |
20110175678 | Velazquez | Jul 2011 | A1 |
20110182329 | Wehinger | Jul 2011 | A1 |
20110188550 | Wajcer et al. | Aug 2011 | A1 |
20110228869 | Barsoum et al. | Sep 2011 | A1 |
20110243266 | Roh | Oct 2011 | A1 |
20110249709 | Shiue et al. | Oct 2011 | A1 |
20110275338 | Seshadri et al. | Nov 2011 | A1 |
20110310823 | Nam et al. | Dec 2011 | A1 |
20110310978 | Wu et al. | Dec 2011 | A1 |
20120025909 | Jo et al. | Feb 2012 | A1 |
20120027132 | Rouquette | Feb 2012 | A1 |
20120051464 | Kamuf et al. | Mar 2012 | A1 |
20120106617 | Jao et al. | May 2012 | A1 |
20120120990 | Koren et al. | May 2012 | A1 |
20120163489 | Ramakrishnan | Jun 2012 | A1 |
20120177138 | Chrabieh et al. | Jul 2012 | A1 |
20120195392 | Kushnir | Aug 2012 | A1 |
20120207248 | Ahmed et al. | Aug 2012 | A1 |
20120269286 | Huang et al. | Oct 2012 | A1 |
20130028299 | Tsai | Jan 2013 | A1 |
20130044877 | Liu et al. | Feb 2013 | A1 |
20130077563 | Kim et al. | Mar 2013 | A1 |
20130121257 | He et al. | May 2013 | A1 |
20130200950 | Bai | Aug 2013 | A1 |
20130343480 | Eliaz | Dec 2013 | A1 |
20130343487 | Eliaz | Dec 2013 | A1 |
20140036969 | Wyville et al. | Feb 2014 | A1 |
20140036986 | Eliaz | Feb 2014 | A1 |
20140056387 | Asahina | Feb 2014 | A1 |
20140098841 | Song et al. | Apr 2014 | A2 |
20140098907 | Eliaz | Apr 2014 | A1 |
20140098915 | Eliaz | Apr 2014 | A1 |
20140105267 | Eliaz | Apr 2014 | A1 |
20140105268 | Eliaz | Apr 2014 | A1 |
20140105332 | Eliaz | Apr 2014 | A1 |
20140105334 | Eliaz | Apr 2014 | A1 |
20140108892 | Eliaz | Apr 2014 | A1 |
20140133540 | Eliaz | May 2014 | A1 |
20140140388 | Eliaz | May 2014 | A1 |
20140140446 | Eliaz | May 2014 | A1 |
20140146911 | Eliaz | May 2014 | A1 |
20140161158 | Eliaz | Jun 2014 | A1 |
20140161170 | Eliaz | Jun 2014 | A1 |
20140198255 | Kegasawa | Jul 2014 | A1 |
20140241477 | Eliaz | Aug 2014 | A1 |
20140247715 | Tsai et al. | Sep 2014 | A1 |
20140247904 | Eliaz | Sep 2014 | A1 |
20140269861 | Eliaz | Sep 2014 | A1 |
20140286459 | Eliaz | Sep 2014 | A1 |
20140294119 | Sochacki | Oct 2014 | A1 |
20140301507 | Eliaz | Oct 2014 | A1 |
20140321525 | Eliaz | Oct 2014 | A1 |
20140328428 | Eliaz | Nov 2014 | A1 |
20140355718 | Guan et al. | Dec 2014 | A1 |
20140376358 | Eder et al. | Dec 2014 | A1 |
20150010108 | Eliaz | Jan 2015 | A1 |
20150049843 | Reuven et al. | Feb 2015 | A1 |
20150055722 | Eliaz | Feb 2015 | A1 |
20150063499 | Eliaz | Mar 2015 | A1 |
20150070089 | Eliaz | Mar 2015 | A1 |
20150071389 | Eliaz | Mar 2015 | A1 |
20150078491 | Eliaz | Mar 2015 | A1 |
20150124912 | Eliaz | May 2015 | A1 |
20150131709 | Eliaz | May 2015 | A1 |
20150131710 | Eliaz | May 2015 | A1 |
20150131759 | Eliaz et al. | May 2015 | A1 |
20150156041 | Eliaz | Jun 2015 | A1 |
20150172078 | Eliaz | Jun 2015 | A1 |
20150172079 | Eliaz | Jun 2015 | A1 |
20150207527 | Eliaz et al. | Jul 2015 | A1 |
20150222456 | Intrater et al. | Aug 2015 | A1 |
20150256293 | Eliaz et al. | Sep 2015 | A1 |
20150270926 | Eliaz | Sep 2015 | A1 |
20150312065 | Eliaz | Oct 2015 | A1 |
Number | Date | Country |
---|---|---|
1710894 | Dec 2005 | CN |
101562589 | Oct 2009 | CN |
101582748 | Nov 2009 | CN |
1865677 | Dec 2007 | EP |
1928141 | Apr 2008 | EP |
1953981 | Aug 2008 | EP |
9941839 | Aug 1999 | WO |
2007000495 | Jan 2007 | WO |
2008154965 | Dec 2008 | WO |
2012092647 | Jul 2012 | WO |
2013030815 | Mar 2013 | WO |
Entry |
---|
Equalization: The Correction and Analysis of Degraded Signals, White Paper, Agilent Technologies, Ransom Stephens V1.0, Aug. 15, 2005 (12 pages). |
Modulation and Coding for Linear Gaussian Channels, G. David Forney, Jr., and Gottfried Ungerboeck, IEEE Transactions of Information Theory, vol. 44, No. 6, Oct. 1998 pp. 2384-2415 (32 pages). |
Intuitive Guide to Principles of Communications, www.complextoreal.com, Inter Symbol Interference (ISI) and Root-raised Cosine (RRC) filtering, (2002), pp. 1-23 (23 pages). |
Chan, N., “Partial Response Signaling with a Maximum Likelihood Sequence Estimation Receiver” (1980). Open Access Dissertations and Theses. Paper 2855, (123 pages). |
The Viterbi Algorithm, Ryan, M.S. and Nudd, G.R., Department of Computer Science, Univ. of Warwick, Coventry, (1993) (17 pages). |
R. A. Gibby and J. W. Smith, “Some extensions of Nyquist's telegraph transmission theory,” Bell Syst. Tech. J., vol. 44, pp. 1487-1510, Sep. 1965. |
J. E. Mazo and H. J. Landau, “On the minimum distance problem for faster-than-Nyquist signaling,” IEEE Trans. Inform. Theory, vol. 34, pp. 1420-1427, Nov. 1988. |
D. Hajela, “On computing the minimum distance for faster than Nyquist signaling,” IEEE Trans. Inform. Theory, vol. 36, pp. 289-295, Mar. 1990. |
G. Ungerboeck, “Adaptive maximum-likelihood receiver for carrier modulated data-transmission systems,” IEEE Trans. Commun., vol. 22, No. 5, pp. 624-636, May 1974. |
G. D. Forney, Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. 18, No. 2, pp. 363-378, May 1972. |
A. Duel-Hallen and C. Heegard, “Delayed decision-feedback sequence estimation,” IEEE Trans. Commun., vol. 37, pp. 428-436, May 1989. |
M. V. Eyubog •Iu and S. U. Qureshi, “Reduced-state sequence estimation with set partitioning and decision feedback,” IEEE Trans. Commun., vol. 36, pp. 13-20, Jan. 1988. |
W. H. Gerstacker, F. Obernosterer, R. Meyer, and J. B. Huber, “An efficient method for prefilter computation for reduced-state equalization,” Proc. of the 11th IEEE Int. Symp. Personal, Indoor and Mobile Radio Commun. PIMRC, vol. 1, pp. 604-609, London, UK, Sep. 18-21, 2000. |
W. H. Gerstacker, F. Obernosterer, R. Meyer, and J. B. Huber, “On prefilter computation for reduced-state equalization,” IEEE Trans. Wireless Commun., vol. 1, No. 4, pp. 793-800, Oct. 2002. |
Joachim Hagenauer and Peter Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” in Proc. IEEE Global Telecommunications Conference 1989, Dallas, Texas, pp. 1680-1686,Nov. 1989. |
S. Mita, M. Izumita, N. Doi, and Y. Eto, “Automatic equalizer for digital magnetic recording systems” IEEE Trans. Magn., vol. 25, pp. 3672-3674, 1987. |
E. Biglieri, E. Chiaberto, G. P. Maccone, and E. Viterbo, “Compensation of nonlinearities in high-density magnetic recording channels,” IEEE Trans. Magn., vol. 30, pp. 5079-5086, Nov. 1994. |
W. E. Ryan and A. Gutierrez, “Performance of adaptive Volterra equalizers on nonlinear magnetic recording channels,” IEEE Trans. Magn., vol. 31, pp. 3054-3056, Nov. 1995. |
X. Che, “Nonlinearity measurements and write precompensation studies for a PRML recording channel,” IEEE Trans. Magn., vol. 31, pp. 3021-3026, Nov. 1995. |
O. E. Agazzi and N. Sheshadri, “On the use of tentative decisions to cancel intersymbol interference and nonlinear distortion (with application to magnetic recording channels),” IEEE Trans. Inform. Theory, vol. 43, pp. 394-408, Mar. 1997. |
Miao, George J., Signal Processing for Digital Communications, 2006, Artech House, pp. 375-377. |
Xiong, Fuqin. Digital Modulation Techniques, Artech House, 2006, Chapter 9, pp. 447-483. |
Faulkner, Michael, “Low-Complex ICI Cancellation for Improving Doppler Performance in OFDM Systems”, Center for Telecommunication and Microelectronics, 1-4244-0063-5/06/$2000 (c) 2006 IEEE. (5 pgs). |
Stefano Tomasin, et al. “Iterative Interference Cancellation and Channel Estimation for Mobile OFDM”, IEEE Transactions on Wireless Communications, vol. 4, No. 1, Jan. 2005, pp. 238-245. |
Int'l Search Report and Written Opinion for PCT/IB2013/01866 dated Mar. 21, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/001923 dated Mar. 21, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/001878 dated Mar. 21, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/002383 dated Mar. 21, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/01860 dated Mar. 21, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/01970 dated Mar. 27, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/01930 dated May 15, 2014. |
Int'l Search Report and Written Opinion for PCT/IB2013/02081 dated May 22, 2014. |
Al-Dhahir, Naofal et al., “MMSE Decision-Feedback Equalizers: Finite-Length Results” IEEE Transactions on Information Theory, vol. 41, No. 4, Jul. 1995. |
Cioffi, John M. et al., “MMSE Decision-Feedback Equalizers and Coding—Park I: Equalization Results” IEEE Transactions on Communications, vol. 43, No. 10, Oct. 1995. |
Eyuboglu, M. Vedat et al., “Reduced-State Sequence Estimation with Set Partitioning and Decision Feedback” IEEE Transactions onCommunications, vol. 36, No. 1, Jan. 1988. |
Khaled M. Gharaibeh, Nonlinear Distortion in Wireless Systems, 2011, John Wiley & Sons, 2nd Edition, chapter 3, pp. 59-81. |
Forney, G. David Jr., “Coset Codes—Part I: Introduction and Geometrical Classification” IEEE Transactions on Information Theory, vol. 34, No. 5, Sep. 1988. |
Int'l Search Report and Written Opinion for PCT/IB2014/002449 dated Mar. 12, 2015. |
Digital predistortion of power amplifiers for wireless applications (Doctoral dissertation, Georgia Institute of Technology). Retrieved from the internet <http://http://202.28.199.34/multim/3126235.pdf> Ding, L. Mar. 31, 2005. |
Digital predistortion for power amplifiers using separable functions. Signal Processing, IEEE Transactions on, 58(8), 4121-4130. Retrieved from the internet </http://arxiv.org/ftp/arxiv/papers/1306/1306.0037.pdf> Jiang, H., & Wilford, P.A. Aug. 8, 2010. |
Digital predistortion linearization methods for RF power amplifiers. Teknillinen korkeakoulu. Retrieved from the Internet <http://lib.tkk.fi/Diss/2008/isbn9789512295463/isbn9789512295463.pdf> Teikari I. Sep. 30, 2008. |
Kayhan, F., et al., Joint Signal-Labeling Optimization for Pragmatic Capacity under Peak-Power Constraint, 978-1-4244-5637, 2010. |
Kayhan, F., et al., Constellation Design for Transmission over Nonlinear Satellite Channels, Oct. 5, 2012. |
Liu, N. et al., Iterative intersymbol interference cancellation in vestigial sideband Nyquist-subcarrier modulation system. Nov. 2014, Optical Engineering, vol. 53(11) 116109. |
Singla, R., et al. Digital predistortion of power amplifiers using look-up table method with memory effects for LTE wireless systems, Journ. On Wireless Communications and Networking 2012:330 http:jwcn.eurasipjournals.com/content/2012/1/330. |
Tellado, J. et al., PAR Reduction in Multicarrier Transmission Systems, Feb. 9, 1998. |
Prlja, Adnan et al., “Receivers for Faster-than-Nyquist Signaling with and Without Turbo Equalization,” Jul. 6, 2008. |
Kayhan, F., et al., “Signal and Labeling Optimization for Non-Linear and Phase Noise Channels,” Department of Electronics and Telecommunications, Dec. 3, 2012. |
Han, H., et al. “Simultaneous Predistortio and nonlinear Detection for nonlinearly Distorted OFDM Signals,” 2005. |
Int'l Search Report and Written Opinion for PCT/IB2014/002688 dated Jun. 29, 2015. |
Gregorio, F. H., et al. Receiver-side nonlinearities mitigation using an extended interative decision-based tecnique. Signal Processing, 91(8), 2042-2056, Mar. 23, 2011. |
Int'l Search Report and Written Opinion for PCT/IB2015/00572 dated Oct. 10, 2015. |
Chen, H., et al. An Iterative Method to Restore the Performance of Clipped and Filtered OFDM Signals, Dept. Elec. & Comp. Eng. 0-7803-7802-4/03/© 2003 IEEE, pp. 3438-3443. |
Aziz, W., et al. PAPR Reduction in OFDM using Clipping and Filtering, World Applied Sciences Journal 18 (11): pp. 1495-1500, 2012 ISSN 1818-4952 © IDOSI Publications, 2012. |
Abouty, S., et al. A Novel Iterative Clipping and Filtering Technique for PAPR Reduction of OFDM Signals: System Using DCT/IDCT Transform, Int'l Jour. of Future Generation Comm. and Networking, vol. 6, No. 1, Feb. 2013, pp. 1-8. |
Gurung, A.K., et al., Power Savings Analysis of Clipping and Filtering Method in OFDM Systems, 978-1-4244-2603-4/08/© 2008 IEEE, pp. 204-208. |
Wang, Y.-C., et al. Optimized Iterative Clipping and Filtering for PAPR Reduction of OFDM Signals, Jan. 13, 2011, pp. 1-9. |
Lee, T., et al. Experimental Analysis of Clipping and Filtering Effects on OFDM Systems, 978-1-4244-6404-3/10/© 2010 IEEE, pp. 1-5. |
da Silva, Pedro F.G., et al. Design of Crest Factor Reduction Techniques Based on Clipping and Filtering for Wireless Communications Systems, 978-1-4799-1132-5/13/© 2013 IEEE, pp. 1-5. |
Rana, M. M., Clipping Based PAPR Reduction Method for LTE OFDMA Systems, Int'l Journ. of Elec. & Comp. Sci. IJECS-IJENS vol. 10 No. 05 (Oct. 2010) pp. 1-5. |
McClearnon, D., et al., Wideband Digital Pre-Distortion Modeling for LTE-Advanced, Agilent Technologies, Jul. 2012, p. 64. |
Number | Date | Country | |
---|---|---|---|
62042356 | Aug 2014 | US | |
62126881 | Mar 2015 | US |