CLAIM OF PRIORITY PRIORITY CLAIM

[0001] This application claims priority to the following application(s), each of which is hereby incorporated herein by reference:

United States provisional patent application 62/042,286 titled "Multiple Input Multiple Output Communications Over Nonlinear Channels Using Orthogonal Frequency Division Multiplexing" filed on August 27, 2014;

United States provisional patent application 62/049,428 titled "Multiple Input Multiple Output Communications Over Nonlinear Channels Using Orthogonal Frequency Division Multiplexing" filed on September 12, 2014; and

United States provisional patent application 62/047,721 titled "Multiple Input Multiple Output Communications Over Nonlinear Channels Using Orthogonal Frequency Division Multiplexing" filed on September 9, 2014.

INCORPORATION BY REFERENCE

[0002] This application claims priority to the following application(s), each of which is hereby incorporated herein by reference:

United States patent application 14/809,408 titled "Orthogonal Frequency Division Multiplexing Based Communications over Nonlinear Channels" filed on July 27, 2015. BACKGROUND

[0003] Limitations and disadvantages of conventional and traditional methods and systems for 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.

BRIEF SUMMARY OF THE INVENTION

[0004] A system and/or method is provided for multiple input multiple output communications over nonlinear channels, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.

[0005] 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.

[0001] BRIEF DESCRIPTION OF THE FIGURES

[0002] FIG. 1 depicts a transmitter in accordance with an example implementation of this disclosure.

[0003] FIG. 2 depicts AM-to-AM and AM-to-PM response of a typical power amplifier with and without intervention by the digital predistortion circuit of the transmitter.

[0004] FIG. 3 depicts a receiver in accordance with an example implementation of this disclosure.

DETAILED DESCRIPTION

[0006] In an OFDM system, allowing the Transmitter's analog front end (AFE) to compress the transmitted signal can significantly reduce the cost and power consumption of the AFE but at the cost of introducing distortion. The distortion introduced can be described as applying a non-linear function f _NL (x) to the time-domain transmitted signal x. This distortion is assumed to be known by the receiver, and can be dealt with by through an iterative process. An example transmitter of such a system is depicted in figure FIG. 1 and an example receiver of such a system is depicted in FIG. 3.

[0005] 'M' in FIG. 1 is the OFDM symbol index and 'N' is the size of the IDFT 114.

[0006] In an example implementation, the Inner FEC encoder 106 codeword size is aligned to IDFT 114 size (i.e. IFT 114 accommodates an integer number of FEC code-words, or FEC code-word size accommodates integer number of FFT's). In an example implementation the inner FEC encoder 106 and Mapper 110 may be merged thereby creating a Euclidean code.

[0007] As indicated by the dashed lines, the outer FEC 102 may not be used in some implementations. In this regard, in an example implementation in which the codeword size of the inner FEC encoder 106, which is aligned to the OFDM symbol, is too short to get good coding gain, then the outer FEC encoder 102 may accordingly be used. In such an implementation, the rate of the code may be split between the outer FEC encoder 102 and the inner FEC encoder 106. For example, to get a total code rate of 0.9 the rate of the inner FEC encoder 106 (R _in ) and the rate of the outer FEC encoder 102 (R _out ) may be set such that R _m *R ₀ ut = 0.9. In such an implementation, the inner FEC encoder 106 and corresponding SISO (Soft Input Soft Output) FEC decoder 224 (FIG. 3) may be specifically designed for handling nonlinearity. SISO Decoder means that the decode gets soft values at its input and it performs some soft-decision decoding resulting in soft decisions at its output rather than hard bit decisions.

[0008] As indicated by the dashed lines, the outer interleaver 104 may not be used in all implementations. In this regard, the outer interleaver 104 may be used in implementations where channel fading is such that it is desired to have a big enough interleaver which spans over several OFDM symbols. [0009] I n an example implementation, the FEC 106 may not be aligned I DFT 114. The receiver may be configured to be capable of demodulating non-aligned FEC blocks as explained in the sequel.

[0007] I n the example transmitter 100 shown, data from a single source or multiple sources is encoded by encoder 106 (or 102 and 106, if 102 is present) and then parsed to N _S s spatial streams. I n another implementation, the data associated with the different spatial streams may be encoded independently (i.e., via Λ/ encoders 106 and/or Nss encoders 102).

[0008] The bits of the one or more spatial streams are mapped to constellation symbols by mappers 110i-110 _ss . Alternatively, a single mapper 110 may be used to map all spatial streams in turn.

[0010] I n an example implementation where the transmitter 100 has information on the selectivity of the fading channel from transmitter 100 to an intended receiver (e.g., receiver 200 of FIG. 3), the symbol mapper(s) 110 may be used to zero out pairs of subcarriers and M I MO spatial streams that undergo extreme attenuation (e.g., attenuation greater than some threshold amount of attenuation). As used herein, such a subcarrier and stream pair may be referred to as a "bin", where for example subcarrier 10 of stream 1 is one bin, subcarrier 20 of stream 1 is another bin, subcarrier 2 of stream 2 is another bin, and so on. I n another example the symbol mapper(s) 110 may set extremely-attenuated bins to values known to the receiver (i.e. pilots). This is beneficial, for example, in the case of a highly distorted power amplifier (PA) since the extremely attenuated bins contribute very little mutual information to the receiver, while also non-linearly mixing with other bins and increasing their distortion. In particular, the receiver typically tracks the OFDM channel continuously. The receiver may periodically determine those bins being so highly attenuated that they inflict more distortion than contributing useful signal. The receiver then periodically sends a list indicating these bins to the transmitter. I n which case the symbol mapper(s) 110 may zero out the transmission signal on those bins. Thus receiver knows the transmitted values on these bins exactly - either zeros or scrambled pilots - for the purpose of computing distortion. The receiver, for the purpose of FEC decoding, may consider the bits carried by these bins as punctured by zeroing out the soft decisions (e.g., log likelihood ratios LLRs) for such bins. I n some cases the transmitter 100 may determine by itself the list of bins to zero (e.g. by use of channel reciprocity). I n such a case, a more robust packet header may be transmitted including a list of zeroed bins. I n an example the more robust packet header uses lower constellations and lower rate and thus can be demodulated without aid of anonlinear solver (NLS) circuit (such as N LS 216 described below).

[0009] The one or more spatial stream(s) is/are mapped to transmit chains where the number of the transmit chains (N _Tx ) is equal to or larger than the number of spatial streams (Λ/ ). I n the example transmitter 100, this mapping is accomplished by an N _Tx x N _S s spatial mapping matrix V (per each OFDM subcarrier). This matrix, which is implemented by precoder 130 in the example transmitter 100, routes a linear combination of the data of the one or more streams to each transmit chain. The precoder 130 provides some spatial diversity to the transmitted data and the use of multiple data strea ms which are transmitted concurrently is a M I MO (multiple input multiple output) configuration called spatial multiplexing. This configuration uses multiple transmit chains (each including an antenna in wireless comm unication) in order to increase the attainable data rate. I n order to communicate such a signal associated with Λ/ independent spatial streams, the transmitter 100 should comprise at least Nss transmit chains. When the number of such transmit chain, N _Tx> is larger than the number of spatial streams, N _S s, some degree of diversity is achieved along with spatial multiplexing. In general, the precoder matrix V (where bolding is used in this disclosure to indicate vectors and matrices) is derived by the following singular value decomposition (SVD) of the channel response matrix: H = UDV ^H , where H is an estimate of the actual channel response H, for a certain subcarrier frequency, D is a diagonal matrix and U and V are unitary matrices. This decomposition describes the channel as a combination of Eigen modes (spatial directions) associated with some quality factor (value of the singular values on the diagonal matrix D). The frequency-domain signals at the output of the precoder 130 are collected to generate OFDM symbols. These symbols are converted to the time domain by N _Tx IDFT (inverse Discrete Fourier Transform) (e.g., implemented using an IFFT algorithm) circuits 114. Another implementation may use a single IDFT circuit 114 that processes and generates, independently, all of the N _Tx signals for the N _Tx transmit chains, in turn. [0010] The multiple sample streams are processed by N _Tx transmitter chains (each comprising a digital to analog converter 126 and an analog front end (including power amplifier) 128) and transmitted onto the channel. According to one embodiment, the amplifiers in 128i-128 _Tx in the multiple transmit chains are operated in a relatively non-linear power range. That is, the PAPR (Peak to Average Power Ratio) at the transmitter output is low (relative to conventional OFDM transmitter), e.g., in the range of 3dB-10dB.

[0011] The DNF circuits 124i-124 _Tx process the filtered signals output by filtering and/or windowing circuit 122 non-linearly (for example, clipping by a soft limiter) in order to conform to some given spectral limitation and/or to facilitate the reconstruction of the transmitted data in the receiver. Without the digital nonlinear function (DNF) circuitry 124i-124 _Tx , the AM to AM characteristic of the PA may not be one-to-one, as depicted by lines 304 and 302 of FIG. 2 (line 304 corresponds to without protective clipping by the DNF circuitry 124, and line 302 corresponds to with protective clipping by the DNF circuitry 124). Lines 306 and 308 of FIG. 2 similarly illustrate the impact of protective clipping by the DNF circuitry 124 on the AM to PM response. The nonlinearity of the DNF circuits 124i-124 _Tx may predominate the overall nonlinear characteristic of the transmitter 100 such that the nonlinear characteristic may be substantially-known to a receiver (i.e., known to be substantially equal to the nonlinear characteristics of the DNF circuitry 124), as opposed to the response of the PA which may vary somewhat unpredictably over time. Because the nonlinearity of the transmitted signal is substantially the nonlinearity of the DNF circuitry 124, the DNF circuitry 124 may be configured to have a nonlinearity that simplifies the reconstruction of the data in the receiver through use of the known nonlinearity. Below the clipping threshold (where a "soft clip" is implemented either by the DNF 124 or a separate digital predistortion circuit concatenated with the DNF circuit 124), the response of the DNF 124 may be nonlinear, and, in an example implementation, this nonlinearity may be different than the inverse of the power amplifier (of a respective one of AFEs 128) response below the clipping threshold. Thus, the response of the concatenation of: the DNF circuit 124, a digital predistortion circuit (optional), and power amplifier may be the clipped response above the clipping threshold and may be substantially nonlinear below the clipping threshold (with that substantial nonlinearity being dominated by the response of the DNF circuit 124).

[0011] receiver in accordance with an example implementation of this disclosure depicted in FIG. 3. The receiver 200 is operable to receive M IMO transmissions with N _S s underlying spatial streams. The receiver 200 employs N _Rx receive chains such that N _Rx ≥ N _S s- Each of the different receive chains comprises an ADC 204. I n the example receiver 200 shown, the outputs of the ADCs 2041-204Rx are filtered by anti-aliasing filter 206 and then downsampled in circuit 208 before cylclic prefix removal by circuit 210. The resulting signals N _Rx signals are then processed by independent DFT (Discrete Fourier Transform) or FFT (fast Fourier Transform) circuits 214i-214 _Rx .

[0012] Notation used in FIG. 3 is as follows: M is the OFDM symbol index, N is the size of each of the DFTs 214i-214 _R , f _NL is a model of nonlinearity experienced by the received samples y, H is the estimated transfer characteristic of the channel via which the samples y were received, B is the number of bits per symbol (e.g., B=10 for 1024-QAM), and Z ^M is a vector of metrics (e.g., a vector comprising X (i.e., estimated transmitted subcarrier value which may be, for example, the expectation of X), a quantization of X to the nearest point of the constellation that is in use, and/or a minimal bit LLR for each symbol) for OFDM symbol M.

[0013] I n an example implementation the receiver 200 searches at symbol M for a matrix X ^M having N _ss rows and N _FFT columns. Where X ^M is an estimate of transmitted signal for symbol M over all spatial streams and subcarriers. This matrix estimation X ^M needs to corresponds to a valid seq uence of FEC code words that also minimizes the following cost (over the set of valid code word sequences) X _s ,. ] _n ) (1)

where:

• X, the estimated transmitted signal, is a N _ss x N _NFFT matrix, where N _FFT is the number of subcarriers (FFT size);

• X _s . is the s ^th row of ; • Y is the observed signal in frequency domain, which is an N _Rx x N _FFT matrix;

• Y _i} , is the i ^th row of Y ;

• Oy is the noise power, which in (1) is assumed to be white but which could be replaced with noise variance that is indexed by subcarrier and receive antenna to account for frequency and spatially selective noise;

• H. . _k , for 0 < k≤ N _FFT — 1, is the N _Rx X N _Tx channel estimation matrix for subcarrier k, and Hi j _k is channel response matrix from transmitter j to receiver i for subcarrier k ;

• V-.,-.,k' f° ^r 0 < k≤ N _FFT — 1, is the N _Tx X N _ss precoder matrix for subcarrier k, and Vj _{s k} is the transfer from the s ^th stream to the j ^th transmit chain of subcarrier k;

• f _L for 1 < j < N _TX , is the nonlinear response of the j ^th transmit chain (either known to the receiver as a result of being transmitted by the transmitter in control/setup traffic or estimated by the receiver as†NL Q );

• the matrix norm is chosen to be the Frobenius norm;

• The I DFT/DFT represents IDFT/DFT operations operating on the input samples of size

[0012] I n an example implementation, some of the bins in X ^M are known in advance.

There is therefore no need to search for them and they may instead be held fixed. In an example implementation, some of the bins are known to be zeros (e.g. out-of-band and guard band bins). In an example implementation, some of the bins are known to be pilots having a known scrambling sequence.

[0013] The M I MO receiver of FIG. 3 employs a rotation operation applied to the received signal and channel estimate in order to streamline the detection. For example, per subcarrier, the output Y of the DFT(s) 214 may be multiplied, in rotator circuit 240, by a transmit chain matrix Q ^H derived from the following QR decomposition: QR = HV, where H is the estimated channel response matrix. The QR transformation is intended to convert the estimated channel matrix HV to a triangular (and possibly diagonal) matrix Q ^H HV. This new channel response matrix is identified with the rotated signal vector Q ^H Y. The rotator circuit 240 may carry out this rotation of the received signal per each subcarrier independently of the other subcarriers. This may streamline the detection of the MIMO signal, especially when closed-loop MIMO configuration is used such that the off-diagonal entries of the equivalent channel response matrix Q ^H HV are relatively small.

[0014] Thus rotator circuit 240 outputs a rotated version of the FFT output at each subcarrier Q ^H Y. The output of rotator 240 is processed by the NLS circuit 216 such that the transmitted symbols over each subcarrier are detected and soft values are provided to the FEC decoder 224. For example, the cost function of Eq. (1) may be re-written in terms of the Q rotated signal as shown in (2). where: Y = Q ^H Y and H = Q ^H H are the Q rotated observation and channel estimation matrix, respectively.

[0014] In an example implementation, the receiver 200 finds X by iterating between the

NLS 216 and SISO (Soft-In-Soft-Out) FEC decoder 224. The NLS 216 minimizes the equation (1) (or equation (2)) error based on the output 225 of SISO FEC ("inner FEC") decoder 224, and also using the channel observation output by rotator circuit 240. The SISO FEC decoder 224 then computes soft-decisions (e.g., LLRs) based on NLS 216 output. These iterations are called "outer" iterations and are repeated until decoding condition is met (e.g., a particular performance threshold is reached, a particular iterations limit is reached, and/or the like). In an example implementation, the NLS 216 may do several "inner" iterations per outer iteration, for the purpose of minimizing (1) ( or (2) ). In an example implementation, the FEC decoder 224 may do several "inner" iterations per outer iteration for the purpose of computing soft decisions.

[0015] To simplify notation, and reduce the number of indices, in the remainder of this disclosure (except where otherwise specified) the 3D matrices are reformulated as 2D sparse "blocks diagonal" matrices. Similarly, since cost functions (1) and (2) have identical form, and therefore can be treated the same, the remainder of this disclosure we will only consider cost function (1). Using the block diagonal formulation, the following cost function (3) is obtained (and is completely eq uivalent to (1)).

(3)

Y-H DFT (f _NL (lDFT(V ^■ X

| - DFT (f ^j _L [lDFT(∑ ^N l V _{Ls .} -¾ _<: )]J

where:

• = [¾ ₀ , ¾ _% ,i, ... ,Xl.N _SS ,N _FFT -i] , ^{which is a} N _sss/ws * 1 vector, is obtained by stacking up X. _k for all subcarriers k. Thus X(s— 1 + [0: N _FFT — 1] ^■ N _ss ) corresponds to subcarriers of stream 5.

• N _SSB[NS = N _ss ^■ N _FFT represents the aggregate number of subcarriers in all spatial streams

• = [ ^Y l. _NRX ,o>Yl. _NRX ,i> - >YI. _NRX , _NFFT - _I ] , which is a N _RXB[NS xl vector, is obtained by stacking up Y. _k for all subcarriers k.

• ^ _RXBINS ⁼ N _RX ^■ N _FFT represents the aggregate number of subcarriers over all receive antennas

• N _TXB[NS = N _TX ^■ N _FFT represents the aggregate number of subcarriers over all transmit antennas

• H is a (N _RX ^■ N _FFT ) x (N _TX ^■ N _FFT ) channel estimation matrix, where H=0 except for the elements Hk ^■ N _RX + (0: N _RX -l),k- N _TX + (0: N _TX - 1) ) = H , _NRX> , _NTX , for k E 0. . N _FFT - 1

• V is a (N _TX ^■ N _FFT ) x (N _ss ^■ N _FFT ) precoding matrix, where V=0 except for the elements (k ^■ N _ss + (0: N _ss -l,k- N _TX + (0: N _TX - 1) ) = V _1:Ar∞(1:JV „ _(fc , for k £ 0. . N _FFT - 1

• f _NL is a vector of N _Tx nonlinear functions capturing the nonlinear behavior of the N _Tx transmit chains. I .e. [η/Ν _Ί where: 1 + (n mod N _Tx ) represents the index of the TX antenna, and

x(n mod N _Tx )+[o.N _FFT -i]-N _Tx ^{is the set} of time samples for the corresponding antenna • IDFT I DFT represent N _Tx IDFT/DFT operations operating on the input samples of each one of the transmitters. I.e.

N ppf—1

IDFT{X) \ _n ≡—- ) X((n mod N _Tx ) + k - N _Tx ) e "FFT

k=0

N FFT ~1

-j2n[k/N _Tx jn

x((k mod N _Tx ) + n ^■ N _Tx ) e ⁿ FFT

n=0

where: (/c mod N _Tx ) and (n mod N _Tx ) - where mod==modulo, both represent the index of the TX antenna minus 1, and [k/N _Tx \ and [n/N _Tx \ - where | aj is floor operation on a, represent the subcarrier and sample time indices of the corresponding TX antenna.

[0016] I n an example implementation, the eq ualization and M IMO decoder 242 may be omitted in which case the output of N Ls circuitry 216 is used directly by the demapper 220. In such an implementation, the estimates of the transmitted symbols generated by the N LS circuitry 216, X, are used through demapper 220 to derive the soft values (e.g., LLRs) to the FEC decoder 224.

[0017] I n another embodiment, the M IMO equalizer and decoder 242 may be used in order to utilize the information generated by the NLS circuit 216. I n this implementation, the M I MO equalizer and decoder 242 operates on a per-subcarrier basis. The input to the M IMO eq ualizer and decoder 242 is the estimated symbol for that subcarrier over all spatial streams, (e.g., X _{1 ]NsSi} k f° ^r subcarrier k) as well as the noise covariance matrix for that subcarrier (e.g., for subcarrier k) as estimated by the NLS circuit 216, where the (/ ^' ,y)-entry of that matrix is the estimated covariance of the noise components over the / ^'th and ^h streams of the k ^th subcarrier. The symbol estimates in addition to the noise covariance matrix are used to generate soft values (e.g,. LLRs) through demapper 220 by calculating the cost function (or a variant thereof) of (5 for multiple candidates A^ _{N k} : where L denotes the number of candidates visited by the MIMO decoder in order to derive a list of the probable (low cost) symbol N _ss -tuples that best match the input estimate vector Xi N _S s,k ^{a nc} ' ⁿ °i ^se covariance matrix. This number of candidates may be subcarrier index- dependent or vary according to the processed data (estimated symbol /V ₅₅ -tuple and noise covariance matrix). This list of A/ _ss -tuple candidate symbols may be used by the demapper 220 or directly by the MIMO Equalizer & decoder 242 to generate soft-values (per-bit of each one of the N _ss symbols communicated over the processed subcarrier) which are then fed to the FEC decoder 224. As a MIMO equalizer and decoder 242 one may use any suitable decoding technique such as sphere decoding, list decoding, successive interference cancellation, linear MIMO decoding, and/or any other suitable decoding technique. It is noted that the NLS circuitry 216 exploits the dependencies induced by the nonlinearity on the different subcarriers. In an example implementation, the NLS circuitry 216 may use a simplified cost function that does not totally account for the correlation between the noise components over the different spatial streams. Instead, the extraction of the dependencies between the different special streams of the same subcarrier, under the restriction that the transmitted symbols must take on a value from a known constellation grid, may be relegated to the MIMO Equalizer & decoder according to the scheme described herein.

[0018] In another embodiment, the MIMO equalizer and decoder 242 may be used along with a cost function that accounts for the nonlinear model of the transmitter (e.g., Eqs. (l)-(3)). In other words, by contrast to prior art MIMO Equalizer and Decoder, a MIMO Equalizer and Decoder according to this embodiment works on a distorted space and calculates a measure of likelihood of some list of candidates on that space that captures the nonlinear characteristic of the transmitter. For example, the MIMO Equalizer and Decoder can take the estimate found by the NLS machine, X _1[NsS: k, and search in some vicinity of that solution, per subcarrier, for constellation points that achieve relatively low cost under the nonlinear model (Eqs. (l)-(3)). These candidates may be found by some gradient method, searching for points for a single subcarrier at a time, setting the rest to the values found by the NLS machine. The list of candidates, per each subcarrier, are used by the MIMO Equalizer and Decoder or by the subsequent Demapper in order to calculate the LLR values for the constituent bits. [0019] In an example implementation, f _NL (including the components for N _Tx different power amplifiers) is updated according to the rate at which characteristics of the analog front ends 128 (e.g., comprising a power amplifier and, in some instances, an upconverter) change. In an example implementation, f _NL may be updated each OFDM symbol, or once per every few OFDM symbols. In an example implementation in which burst transmissions are used, f _NL may be updated at start of each burst. In an example implementation, f _NL may be adapted using dedicated preambles or beacon patterns that are generated once in a while (e.g., periodically, pseudo-randomly, and/or the like) by the transmitter. In an example implementation, f _NL may be adapted based on X and/or other metrics calculated based on the LLRs output by FEC decoder 224, as further described below.

MIMO COST MINIMIZATION

[0020] In an example implementation the receiver 200 finds X by iterating between the

NLS 216 and SISO FEC decoder 224. In order to impose FEC constraints on the NLS circuitry 216 we a correction term AX is introduced and applied to a previous FEC estimate X. The cost function (3) is augmented to constrain the correction in the following way (this applies similarly to cost function (2)). Every outer iteration, the NLS 216 needs to find an N _SSB[NS = N _ss x N _NFFT correction matrix AX that minimizes the frequency-domain cost function (5).

NSSBINS- ¹

½X _k \'

Y - H DFT l f _NL IDFT [ V ^■ (X + AX)

at (5)

NSSBINS is ^tne aggregate number of subcarriers over all spatial streams

II -|| denotes the Frobenius norm of a vector.

Y is the observed signal in frequency domain, over all RX antennas

H is the block diagonal channel estimation matrix, over all bins, RX antennas, and TX antennas • _{J L} ( ) is ^tne overall nonlinear response experienced by signals received by the receiver. In an example implementation this may be dominated by non-linear response of the transmitter (e.g., the response of the AFE 128 and/or the response of the DNF circuitry 124) as depicted in FIG. 2 (AM to AM distortion and AM to PM distortion). It can be implemented, for example, as a mathematical computation or a Look Up Table (LUT)

• X _k is the estimated transmitted bin k (e.g., calculated as the expectation of X), which corresponds to spatial stream s = k mod N _ss , and subcarrier [k / N _ss \

• X is a N _SSB[NS X 1 vector that aggregates transmitted bins over all spatial streams (input of IDFT 114 in FIG. 1)

• X \s a N _SSB[NS X 1 vector whose elements are X _k ;

• X _k is an estimation of the error at bin k (i.e., element k of the vector X— X );

• AX is a N _SSB[NS X 1 vector whose elements are X _k ;

• Oy is the noise floor (in frequency) here assumed to be uniform over antennas and subcarriers, but may be made subcarrier and RX antenna dependent in other implementations

• h is the channel response; and

• o _k is the reliability measure for bin X _k . That is, when there is high reliability estimate for bin k, then it would be reflected in the cost function as a small o _k in order to induce relatively high penalty to deviations from this estimate. I n an example implementation, o _k may be set to the variance of X _k . I n an example implementation, o _k may be a function of LLRs output by the SISO FEC decoder 224 (e.g., a function of the inverse of the min(lLLRl). In an example implementation, when o _k is below some determined threshold for a particular symbol, it may be set to ∞ for that symbol to indicate the symbol is bad.

[0021] The receiver uses outer iterations where, at each iteration, an estimation of X _k

(for one or more values of k) that minimizes the cost function (5) is produced by N LS circuitry 216 and re-fed to the FEC decoder 224. The cost function need not necessarily find the best solution for X _k , but need only find new value of X _k that reduces the cost, while providing information that is extrinsic to the FEC decoder 224. This refinement is iteratively used in the FEC decoder 224 to further distill X. This iterative scheme uses the nonlinear cost function (5) - including /w . and M I MO channel - as an inner code in conjunction with an outer FEC code. The N LS circuitry 216 uses constraints, such as those shown in (5), on the freq uency domain signal to aid in generation of its output, and the decoder 224 similarly imposes FEC code constraints on the frequency domain signal, as discussed below, to aid in generation of its output. Each one of the N LS circuitry 216 and the FEC decoder 224 uses a refinement of the data estimation generated by the other in order to improve its own estimate based on different, independent constraints in an iterative scheme.

[0022] I n an example implementation, X is estimated by the metric update block 232 by calculating X. using LLR's from the SISO FEC decoder 224 ("mapping" the LLR's). In an example implementation X. the expectation based on the LLR's.

[0023] I n an example implementation the cost function (5) is minimized by use of gradient descent to find all or a subset of the bin corrections X _k . I n an example implementation, AX _k may be estimated for all bins during each iteration.

[0024] I n an example implementation, only those bins for which the confidence of being erroneous is high (e.g., based on LLRs output by the SISO FEC decoder 224) may be estimated during a particular iteration and other bins, referred to here as "good," (e.g. those bins having a decoded LLR above a determined threshold) may be fixed based on an assumption that the output of FEC decoder 224 is correct. The X _k for good bins may, for example, be fixed at a value of zero while adapting the X _k for the other bins.

[0025] The values of X are limited to some constellation χ (e.g. 1024QAM). Therefore the estimation may be constrained to the same constellation (i.e. (X _k + X _k ) e χ ) . This, however, results in a very difficult discrete minimization problem. To overcome this difficulty, in one example implementation, X _k + X _k is limited to a rectangular range ( |re(¾ + Δ¾) | < X _max and \ im{X _k + Δ¾) | < X _max ) that includes the constellation χ, this is called the hard bound approach. The down side of this approach is that gradient descent convergence is slowed down by the hard bounds. Accordingly, in an example implementation, soft bounds may be used as an additional penalty term to the cost function (e.g., values of X _k + X _k outside the constellation rectangle are penalized with a penalty increasing with distance from the constellation rectangle, as shown in equation (6) below).

where:

• X _m ax - Is maximum constellation value (e.g. 31 for 1024 QAM)

• (a > b) - evaluates to 1 if the condition is true and zero otherwise.

[0026] Referring back to Figure 3, for this second example implementation of the NLS circuitry 216, Γ ^Μ output by the NLS circuitry 216 may be equal to X ^M + ΔΧ™ .

[0027] In an example implementation in which phase noise is negligible, H may be a purely block diagonal matrix with N _RX x N _TX blocks on the diagonal. In an example implementation, the matrix H may comprise off-diagonal block that account for Inter-Carrier Interference, to compensate for phase noise and/or any other Inter-Carrier Interference (e.g. caused by fast varying channel).

SPLITTING THE PROBLEM TO TWO DIMENSIONS

[0028] In an example implementation, to increase the diversity of the cost with respect to "good" decision errors we may minimize real(X) and imag(X) as separate variables. This allows performance improvement by deciding on the reliability of single bin dimension (i.e. good/bad decisions taken separately on bin real part and separately on bin imaginary part), rather than the reliability of complex bins (e.g., for a certain bin Xk the real part may be considered bad and take part in minimization, while the imaginary part may be considered good and kept fixed).

HARD METRIC VS. SOFT METRIC

[0029] As mentioned above, the 2nd term in equation (5) indicates the reliability of bin

X _k . When σ is close to 0, the cost would only allow using values of A¾which are very small.

[0030] In an example implementation, the second term may be dropped from equation

(5). Instead, the NLS circuitry 216 may determine which of the elements in X are reliable, (denoted as "good" bins) and which elements in X are unreliable ("bad" bins) and operate as follows: During the 1st iteration on an OFDM symbol m, the N LS circuitry 216 may assume that all bins are bad bins (except of those corresponding to out of band zeros and pilot), and then search for /V _SS BINS Δ¾ elements (or 2· /V _SS BINS Δ¾ elements if working independently on real and imaginary dimensions). Then, in later iterations, the N LS circuitry 216 may get information from the metric update block 232 which enables the N LS circuitry 216 to lower the number of X _k elements in the search (i.e. fix the good bins to constant values), and the problem boils down to finding the bad bins that minimize the cost. Thus, the N LS circuitry 216 may search for Nbad (where N _bad < /V _SS BINS) Δ¾ elements corresponding to the N _bad bad bins. In such an implementation, the hard metric cost function may be as shown in equation (7).

Y - H - DFT(f _NL (IDFT(x))) \\ ² (7) where:

• TH is a threshold for selecting the good bins. I n an example implementation, the NLS circuitry 216 determines good/bad by comparing the metric 6 _k to a threshold TH (e.g., if 6 _k < TH then bin k is considered a good bin). I n an example implementation, the threshold TH is fixed at a determined value. In another example implementation, described below, TH may be dynamically configured.

• 6 _k is a metric that is used to determine if a bin is a good bin or a bad bin. The metric 6 _k is determined by metric update block 232. In an example implementation, 6 _k = o _k . I n an example implementation, the metric update block 232 maps the interleaved LLRs {LLR } for bin k, to produce its estimate X _k , and also computes the metric 6 _k = — min{| LLR¾ |} . In other words, NLS circuitry 216 may determine the bin to be good if the absolute value of the minimal LLR in the bin is higher than a threshold. For example, for a 1024-point symbol constellation there may be 10 LLRS per symbol and the minimal LLR may be the smallest of the 10. In an example implementation, to increase diversity, the N LS circuitry 216 may determine good and bad per bins dimension, (e.g. the real part of a particular bin can be declared "good" while the imaginary part of the particular bin may be determined to be "bad"). For example, for 1024QAM there may be 10 LLRS per symbol with the first 5 of them corresponding to the real component and the second 5 of them corresponding to the imaginary component, and the NLS circuitry 216 may determine the smallest LLR of the first 5 and the smallest LLR of the second 5.

UPDATING GOOD SELECTION THRESHOLD ("GEARS")

[0031] In an example implementation, the threshold TH is set dynamically (per iteration and codeword) according to some percentile P of the set of metrics {0 _k \k = 1. .2N _{CW bins} , where the factor of two arises from treating the real and imaginary dimensions separately, computed per codeword based on latest FEC decoding, where N _{cw bins} is the number of QAM symbols (i.e. bins) composing the FEC codeword (i.e. the most reliable P% of the set of real and imaginary values of the bins are selected as goods). That is, the sequence of sorted metrics shown in equation (8) may be calculated for each codeword.

(d _s ) _s=1 .. _{2Ncw bins} = sort {0 _k \k = 1. . 2N _{cw fcins} }) (8)

[0032] The sorting may be performed in increasing order (i.e. starting with θ ₅₌₁ , which is the most-reliable bin and ending with Θ _ς - _?Ν cw_b , i .ns ,' which is the least reliable) '. Per codeword and iteration, the NLS circuitry 216 may set TH = 9 _s=P . _{2Ncw bins} . For each subsequent iteration on the same codeword, and for the next codeword, the NLS circuitry 216 may again sort the metrics and set the threshold based on the P ^th percentile.

[0033] In an example implementation where the decisions as to which bins are good and which are bad is made per complex bin (rather than separately for the real and imaginary dimensions) the metrics {0 _k \k = l. . N _{cw bins} may be determined per bin and a similar selection process for the threshold TH may be used.

[0034] In an example implementation the percentile P used for determining the threshold TH is also changed as the iterations progress. In one example the percentile P may be iteration dependent (i.e. P <- Pi _ter ).

USING "BRANCHES"

[0035] For the hard metric case, mistaking a bin dimension (i.e. real dimension or imaginary dimension) that contains erroneously decoded bits as "good" might result in performance reduction, since the good bin dimensions are not corrected by the NLS circuitry 216 (although the FEC decoder 224 may still correct these bits). This problem may be overcome, in one example, by the NLS circuitry 216 assuming we have total of N _g good bin dimensions and running N _g + 1 times per codeword in the following way: In order to estimate the real and/or imaginary bin dimensions that are bad, the NLS circuitry 216 runs once to minimize the cost function of equation (5) by optimizing X _k≡bads while the correction for all the good bins dimensions is fixed to zero (i.e., X _k≡good = 0). Then, for each good bin dimension, (m E good) the NLS circuitry 216 runs again to minimize the same cost function by optimizing AX _k≡[m]ubads while setting AX _k≡goo d-{m] — 0, from which only the m ^th bin dimension correction (i.e. X _m ) is used. Since in this case NLS circuitry 216 is run to obtain both the good bin dimensions as well as the bad bin dimensions, the outer iterations can effectively handle false goods.

[0036] In an example implementation, the NLS circuitry 216 may run fewer times per codeword by dividing the good bin dimensions into N _B non-overlapping sets called "branches" B _b such that good bins = Ll^ _i ^- In an example implementation, the sets may be of approximately the same size. Then the NLS circuitry 216 may run N _B + 1 times per codeword. In order to estimate the bad bin dimensions, the NLS circuitry 216 runs once, as before, to minimize cost by optimizing X _k≡bads with correction for all the good bin dimensions fixed to zero (i.e., X _k≡good = 0). Then, for each branch B _b (with b = 1, . . , N _B ) the NLS circuitry 216 is run again to minimize cost by optimizing AX _keBbUbads while setting AX _kegood _ _Bb = 0, from which only the branch B _b bin dimensions corrections (i.e. X _keBb ) are used.

[0037] In an example implementation, the same branch scheme may be used, but using only one branch (i.e. using b = 1). In this implementation, the NLS circuitry 216 may run only twice per codeword - once to estimate all bad bin dimensions ( X _k≡bads ) using the good ones, and a second time to estimate the good bin dimensions (&X _kegood ) without fixing any correction to zero (i.e. all X _k are optimized but only output X _k≡good is used).

[0038] In an example implementation, the percentile P may be increased when the NLS circuitry 216 determines that the number of false good bin dimensions (mistakenly identified as good bin dimensions) for previous iterations is low. This may be based on the latest iteration for branches. In an example implementation, a sequence of successive P values is used. The NLS circuitry 216 initially starts with 0 good bin dimensions, but after the first iteration uses Pi ' Ncw bins good bin dimensions for / = 1. Then, for each additional outer iteration, the NLS circuitry 216 increases I if the latest branch corrections (|Δ¾ _ε500£ί |) are small enough. In an example implementation, the NLS circuitry 216 may compare the sum (or average) of absolute branch ^{t0 a} threshold, and increase if the sum (or average) is below the threshold. In an example implementation, the NLS circuitry 216 compares the sum (or average) of some monotonically increasing function /(. ) of absolute branch corrections (i.e. ∑kegood to ^a threshold, and increases I if the sum (or average) is below the threshold. In an example implementation, the NLS circuitry 216 may use f(\AX _k \) = |Δ¾ | ⁴ . In an example implementation, the NLS circuitry 216 may divide the good bin dimensions into P groups and for each 1 < q≤ P compute the metric∑ _k egood_p and increase the good percentage P _q specific to that group. In an example implementation, the two groups may be the real and imaginary parts of the bin symbols (i.e. one group being all the real dimensions and the other group being all the imaginary dimensions). In an example implementation, the NLS circuitry 216 may replace the branch correction AX _k with the difference between latest output of FEC decoder 224 to previous output of NLS circuitry 216 for the good bin dimensions. In an example implementation, the NLS circuitry 216 may replace the branch correction AX _k by the difference between latest output of the FEC decoder 224 and the previous input to the NLS circuitry 216 for the good bin dimensions. In an example implementation, the NLS circuitry 216 may use a combination of the previous differences between input of NLS circuitry 216, output of NLS circuitry 216, and latest output of FEC decoder 224.

[0039] In an example implementation, a single instance of NLS circuitry 216 is used but still applies a limited correction to the good bin dimensions by taking advantage of the iterative nature of the NLS circuitry 216, which may use inner iterations (not to be confused with outer iterations involving the FEC decoder 224). The inner iterations of the NLS circuitry 216 change only the bad bin dimensions without changing the good ones. On each inner NLS iteration, the gradient of the good bin dimensions (typically costing no additional complexity) is computed, but without updating the good bin dimensions. After completing the NLS inner iterations, another gradient descent step is performed using the mean of the good gradient (averaged per- bin dimension over all NLS inner iterations) this time updating the good bin dimensions. In an example implementation, this gradient step is incorporated into the last NLS inner iteration. In this case, the percentile P may be determined defining X _k as NLS correction to the good bin dimensions (as opposed to previously using the branch correction).

SOLVING THE UPDATE METRIC

[0040] In an example implementation, the NLS circuitry 216 finds the AX which minimizes the cost function (5) using an iterative scheme. In an example implementation, the NLS circuitry 216 uses a gradient decent algorithm (GD).

[0041] There are two basic kinds of nonlinearity models: with memory, and without memory. Memoryless power amplifiers are completely characterized by their AM/AM (Amplitude to Amplitude) and AM/PM (Amplitude to Phase) conversions which depend only on the current input signal value.

[0042] The following gradient derivation deals with memoryless PA, examples for PA with memory can be found in United States Patent Application 14/809,408, which is hereby incorporated herein by reference in its entirety. The gradient can be used to minimize the cost function repeated here omitting 1/σ . For the purpose of gradient derivation the receiver 200 may use the cost function (1) formulation and not the block diagonal formulation.

Where f _NL (x) is a scalar complex=>complex function modeling the j memoryless PA nonlinear response. f ^J _NL (x) are not necessarily analytical; and j E l. . N _Tx

[0043] Given this memoryless PA model, the receiver 200 can implement the gradient descent with 0(N*logN) complexity (where O is a positive number). The gradient has the form shown in (10): dC M, IMO dC M, IMO

dRe(X _m ) ^J dIm(X _m )

where:

[0044] The above derivation is directly applicable to cost function (2) where QR rotation transformation is applied to the received signal. In such case, and H in Eqs. (9)-(ll) should be replaced by their rotated counterparts, QHY and R = QHH, respectively. In Eq . (11), the superscript (k) stands for the subcarrier index.

[0045] The above minimization may be carried out jointly over all of the spatial streams.

Alternatively, nonlinearity accommodating approaches for single input single output (SISO) systems may be used in conjunction with some "layered" M I MO detector (e.g., successive interference cancellation (SIC) detector) in order to solve the problem, stream by stream. Such approaches may use some channel state information in order to decide on the solution order of the different streams. In general, the minimization is not restricted to take on only values on the constellation grid. However, for M IMO it may be beneficial to combine the "soft-value" minimization problem with M I MO detection. For example, a layered approach may be used such that a triangular form is obtained by QR rotation and each layer is minimized according to Eq. (1). A quantized version of the previously minimized streams may be re-substituted in the above equations in order to solve it for the subsequent stream. In such an embodiment, the MIMO processing (detection) is absorbed into the least squares minimization of the above equations.

PRE-PA MODELING

[0046] In addition to modeling the PA of the transmitter, the NLS circuitry 216 may also model linear and non-linear response of pre-PA circuitry which operates on x(t) (121 in Fig 1). In particular, two dominant components may be present: The DNF circuitry 124 (e.g. exhibiting a protective clip response, f _PC (x); and the linear response (h _prePA ) of interpolation filters and analog filtering before PA.

[0047] The protective clip of the DNF circuitry 124 may have the form shown in equation (12). f Cx) = \ ^X ' ^{< PCUp} (12)

\x/\x\ ^■ pclip, \x\≥ pclip

where pclip is the threshold at which the DNF circuitry 124 clips the transmission signal in order to remain in well behaved PA input range (e.g., not exceed a threshold amount of compression).

[0048] The combined response, for which the gradient (substantially using the derivation chain rule) is to be calculated may therefore be given by equation (13). f ^J NL ( ^h prePA * fpc(x ) ( ¹³ ) where f _NL models the non-linear response of the j ^th antenna PA.

[0049] Thus, the sampling rate and bandwidth of the DAC and anti-aliasing filters 126, should be wide enough to accommodate the bandwidth of f _PC (x) (which is relatively wide due to clips).

[0050] In an example implementation where h _prePA is not too sharp (e.g., rolls off less than some threshold amount per decade) within this bandwidth, the transmitter can digitally compensate for h _prePA (e.g., by amplifying frequencies that are attenuated by h _prePA ). In an example implementation where h _prePA must be made sharp (e.g. to prevent transmitting aliases), the transmitter can compensate for h _prePA to transform it to a linear response - hprePAo ~ ^tnat is known to the receiver and would be modeled by NLS circuitry 216. In another example, if the transmitter uses digital predistortion, the combined response f _NL (h _prePA * pc( )) ^ma Y be transformed to a soft limiter f _PC (x) (e.g., by digital predistortion circuitry residing between 124 and 126 in FIG. 1). In another example implementation the receiver may use the training sequence used to estimate f _NL and channel, also to estimate h _prePAQ . In this case the receiver models h _prePA0 as part of f _NL in the minimization of the NLS cost function (e.g. equation(5)).

SOFT BOUNDS GRADIENT

[0051] For a soft bounds approach, a penalty term (6) is added to the cost, and the NLS circuitry 216 computes the corresponding gradient as shown in (14).

Bound _GD = 2(re(x) > I _mai )(re(x) - X _max ) + 2(re(x) < -X _max )(re(x) + X _max )

+ 2(im(x) > X _max )(im(x) - X _max ) (14) + 2(im(x) < -X _max )(im(x) + X _max )

where

• Xmax is maximum constellation value (e.g. 31 for 1024 QAM)

• (a > b) is 1 if a is greater than b is true and zero otherwise

GRADIENT DESCENT ALGORITHM

[0052] Denoting the gradient computed in (10) as G _k

[0053] The Gradient decent algorithm can then be expressed as in equation (15).

AX _k ⁽ⁱ⁺¹⁾ = AX _k ⁽ⁱ⁾ + / · I G _k + η■ Bound (15)

where is a step size, that is 0 for good bins, and a non-zero fixed value for bad bins.

[0054] Constellation soft bounds are handled b 'η ^■ Bound _GD and are based on (13), where η is a scaling factor. The last term of equation (15), corresponding to last term in (5), may be used as a 'soft-metric'. It is noted that the nonlinear model, though extensive, is just an example. Other, even more elaborate models may be used and a similar derivation may be applied.

[0055] In an example implementation, the transcmitter and receiver of Figures 1 and 3 may use Bit-lnterleaved-Coded-Modulation (BICM) (e.g. LDPC). In such an implementation, output 225 of the SISO FEC decoder 224 comprises per-bit Log-Likelihood-Ratios (LLRs). In an example implementation, Euclidean coding (e.g. trellis coded modulation(TCM) or modulation as described in U.S. Patent 8,582,637, which is hereby incorporated herein by reference) may be used to provide likelihood in the Euclidean domain.

MICRO FEC ITERATIONS

[0056] In an example implementation, the FEC decoder 224 may be an iterative decoder. In an example implementation, the iterative decoder may be run a sufficient number of iterations until it fully converges. However, since the FEC decoder 224 needs to be run for multiple outer iterations, the overall decoder complexity is significant. In an example implementation, in order to reduce the decoding complexity, the iterative FEC decoder 224 is not run until it converges, but rather is stopped substantially prematurely. Despite stopping prematurely, state (accumulated extrinsic information) of the iterative FEC decoder 224 may be maintained and not be reset every outer iteration. With a message passing decoder, this maintenance of state information may be accomplished by continuing the message passing across outer iterations (i.e., messages generated but not processed at outer iteration q, since decoding was stopped, are processed at outer iteration q+1.) In general, this corresponds to adding the NLS circuitry 216 as additional check nodes in a Tanner graph which combines both FEC and nonlinearity constraints.

[0057] To illustrate, an example implementation in which the FEC decoder 224 is an

LDPC decoder will now be described using the following notation:

• / ^' , y - the variable node and check node indices correspondingly

• L i) - The LLR of code bit i obtained from demapper 220

• L(rji) - Message from check node j to variable node i

• L(qij) - Message from variable node i to check node j • Ci - Set of check nodes connected to variable node i

• Vj - Set of variable nodes connected to check node j

[0058] At each outer iteration, the LDPC decoder 224 is fed with output L(i) from demapper 220. Then, the LDPC decoder 224 applies (16) to L(i) and the L(r _;i ) messages stored from the previous outer iteration (denoted (7·^)), where for the first outer iterationL(r _; ' _j ) = 0) to generate variable node to check node messages. The Lfrj'i) messages were generated using (17) to compute the decoded bits output LLRs by the LDPC in the previous outer iteration and, as said, are then processed using (16) to generate messages to check nodes in current (successive) outer iteration. In the current outer iteration, the latest NLS updated L(i), and not the old L(i) that was used for the previous outer iteration, is used in (16).

[0059] The LDPC algorithm runs several inner iterations of the form shown in equations

[0060] (16) and (17).

Variable node to check node messages:

Vi,j: L( _qi j) = L(i) +∑ _eC1 -{/} ^L ( ^r i) ( ¹⁶ ) Check node to variable node messages:

Vj, i: L(i}-i) = 2 atanh tanh ( L(q

_j †j) (17)

[0061] After completing the LDPC iterations, the final check node to variable node messages i(r _;i ) are stored for the next outer iteration, and the LLRs output by FEC decoder 224 are computed using equation (18 .

[0062] In the example just discussed, Tanner graph iterative decoding was used in a way that alternates between NLS check node iterations and FEC check node iterations, repeating for some number of outer iterations which may be predetermined and/or dynamically determined. In other implementations, the FEC + NLS Tanner graph based decoder may be iterated in different ways. For example, the NLS and FEC check node may be iterated in parallel, or subsets of NLS and FEC check nodes may be iterated sequentially or in parallel. A similar approach is applicable for other iterative decoders. CHANNEL RESPONSE AND DISTORTION ESTIMATION

[0063] As used here, the "channel response" is the response of the communication medium (e.g., air, copper cable, fiber, etc.) between the output (e.g., antenna for wireless) of the transmitter and the input (e.g., antenna for wireless) of the receiver, and does not include the power amplifier or receiver circuitry.

[0064] Learning Channel response and the nonlinear PA models f ^J _NL ,j E l. . N _Tx , for

N _Tx transmit antennas may be accomplished is several ways. In an example implementation, the link between a transmitter and a receiver may be established with low-baud-rate packets using low-order modulations (and/or low-amplitude symbols of a higher-order modulation) which are less vulnerable to nonlinear distortion. The receiver may then recover the payload of such packets (using FEC decoding, which may be reliable because of the relatively low amounts of nonlinear distortion in these packets) to recover the transmitted symbols, and then determine the channel response and nonlinear distortion through a comparison of the received symbols with the transmitted symbols. In an example implementation, when the transmitter knows its nonlinear response, a representation of f ^J _NL (or just a parametric model of f ^J _NL to simplify receiver learning) may be directly transmitted in a payload of such packets. Thereafter, the link may upgrade to higher modulation orders, and/or higher-amplitude symbols, which may be demodulated by using the learned nonlinear model. In another example implementation, the transmitter-receiver pair may use probe signals, known to the receiver a priori, to learn the nonlinear model, where the probe signals may be as specified by an applicable standard. As another example, additional training signals, to be used by the intended receiver for channel estimation and learning of the nonlinear characteristic of the transmitter, may be appended to preambles defined in existing standards.

[0065] In an example implementation, the channel response (H) may be estimated using preamble(s) or beacon(s) which have low peak-to-average-power ratio (PAPR) such that it suffers only a negligible amount of nonlinear distortion. In an example implementation, the preambles or beacons may intentionally have high PAPR (thus experiencing relatively severe nonlinear distortion), but may be generated/selected to have characteristics (e.g., occupying at least a determined number and/or range of frequencies, occupying at least a determined number of signal levels, and/or providing at least a determined amount of repetition of frequencies and/or signal levels) that allow the same preamble or beacon to be used for both nonlinearity estimation and channel response estimation. I n an example implementation, the channel response (H) may be estimated as part of the iterative process performed in the N LS circuit 216, as discussed below.

[0066] I n an example implementation, in order to estimate both distortion and channel response from the same preamble, the receiver may operate to separate distortion effects and channel effects. To enable this separation, special sequences having the following properties may be transmitted by the transmitter: The seq uence is composed of a set of N values that, in the time domain, is denoted as p _[0j , P[i _j ... P\N-I\ , this set of values is rich enough (e.g., a sufficient number and/or diversity of power levels are present in the sequence) to capture both nonlinearity and channel response (e.g., as few as two levels may suffice for estimating the channel response but more levels may be better for estimating the nonlinearity). The preamble is then composed of a permutation of M such sets of these N values. Therefore circuitry for estimating the distortion and channel (e.g., the N LS circuitry 216) needs to estimate a finite number (N) of distorted transmitted values of the form w.(pw) for k=0..N-l, and the channel response Λ _[0 ], y ... x-i], where T is the length of the channel response. This results in +T unknowns with N-M equations, so M >= 1+ /N \s needed for a unique solution. In addition, smoothness constraints may be placed on the estimated nonlinearity in order to reduce estimation noise and/or to reduce the required value of M. By repeating the same values (the M permutations), the number of unknowns remains constant even when preamble length increases, thus enabling a unique solution. I n an example implementation, the value of N is selected based on the desired granularity with which it is desired to estimate f _NL . This granularity and the set of values selected (p _[0 ] , P[i _j ... P[N-IJ) is not necessarily uniformly spaced, as, for example, lower sampling granularity may be used for lower voltage levels (where f _NL has low distortion) and higher granularity at higher voltage levels (that are highly distorted). Once the set of preamble values p[ ₀ j, P[ij ... P[N-I\ have been determined, a plurality of pseudo random permutations of these values are selected for transmission to support distortion and channel estimation. In an example implementation, the permutations are selected such that the resulting preamble segments are substantially white in frequency.

[0067] In an example implementation, the channel response may be estimated using a time domain synchronous (TDS)-OFDM scheme where, instead of using pilots for channel estimation, the guard period is utilized for transmission of a training sequence (i.e. data that is known to the intended receiver a priori). This scheme is appropriate for the case where the received signal is distorted since the training sequence can be selected to have a desired PAPR (and thus desired amount of nonlinear distortion). By selecting the training sequence, which operates in the time domain, to have a low PAPR (and thus distortion), it can be used for accurate channel estimation. In an example implementation using the TDS-OFDM approach, the same training sequence may be used for nonlinearity estimation on top of channel response estimation. In an example implementation, the TDS-OFDM scheme may be used for nonlinearity estimation (i.e., to determine f _NL ) but not channel estimation.

[0068] In an example implementation using TDS-OFDM, where the data symbol is preceded by a training sequence, the receiver may use a permuted sequence approach similar to that described above. In this case, the same basic set of values p _[0j , p _[ i _j ... P[N-IJ where N> may be used every TDS-OFDM training sequence, but with each symbol using a different permutation of the same sequence of values. In such an implementation, the receiver may use multiple training sequences (from multiple symbols) to estimate or improve estimation of both the channel response and the nonlinearity. This permuted training sequence is also useful to reduce correlation between the desired signal training sequence, and any interfering sequence of co-channel signals (e.g., interference between different users belonging to different cells in a cellular system).

[0069] In an example implementation, a TDS-OFDM scheme may be used for deriving the off-diagonal elements of H for phase noise compensation. In an example implementation, these elements are determined by calculating one or more derivatives (e.g., the 1 ^st and/or 2 ^nd derivative(s)) of H. In an example implementation, the NLS circuitry 216 may calculate the calculate the derivative(s) using: (1) the training sequence of a current symbol, (2) training sequence of a next symbol, and (3) tentative decisions of X for the current symbol. Thus, the channel response can be estimated along 3 time instances which enables calculating I ^s and 2 ⁿ derivative.

[0070] In an example implementation the channel may be estimated using X at output of circuit 232, or X + AX at output of NLS circuitry 216. This can be done in the following way: The signal expected to be present at the transmission antenna array (at PA output) can be expressed using the block diagonal formulation of (19): z = DFT f _NL (lDFT(V ^■ X)fj ¹⁹

[0071] where:

• z is a N _Tx ^■ N _FFT X 1 vector;

• z(k ^■ N _Tx + [0: N _Tx — 1]) is the output of the PA output for subcarrier k and transmit antennas 1: N _Tx ;

• X vector is estimated spatial streams sig stacked over all subcarrier (discussed above);

• V is the block diagonal precoding matrix discussed above.

[0072] Using z, the signal at the transmission antenna array, and y, the signal at reception antenna array, both measured over several symbols, the receiver can estimate the channel response H _k for every bin k, since:

y(k ^■ N _RX + [0: N _RX - 1])= H _k ^■ z(k ^■ N _Tx + [0: N _Tx - 1]) (20) where y is a N _RXBINS x 1 vector, is the Rx antenna's signal stacked over all subcarriers; and H _k is the channel response for bin k.

[0073] In an example implementation, the channel response H _k is additionally smoothed according to channel coherence bandwidth, power delay profile, of a combination of the two. Thus, even if X. is with errors, the smoothing enables accurate channel estimation. Thus, per each iteration when errors decrease, the NLS circuitry 216 can derive an improved channel estimation. For the 1 ^st iteration on a particular OFDM symbol, in slow-varying channels, the NLS circuitry 216 may use the channel estimation of a previous symbol (the immediately previous symbol or an even earlier symbol). For the 1 ^st iteration on a particular OFDM symbol, in fast-varying channels, the NLS circuitry 216 may use a TDS-OFDM or similar scheme.

[0074] In an example implementation, e.g. where transmit power control continuously changes the input backoff, the transmitter may inform the receiver of its current input backoff. I n an example implementation this can be transmitted using the packet header and, assuming the packet header uses lower constellations, for exam ple, then it can be demodulated despite the compression. This allows the receiver to use the f _NL estimation computed for a previous packet but compensated for input backoff changes. The previous f _NL estimation may be used either instead of f _NL estimation from training sequence or in addition to it (to reduce estimation noise). When input backoff changes the transmitter may also vary the protective clip saturation level to correspond to an approximately fixed level below analog Psat. In an example implementation, the protective clip saturation level is a function of input backoff. The receiver can then use input backoff transmitted as part of the header to set its expected protective clip level to be exactly equal to that of the transmitter.

EFFICI ENT USE OF CYCLIC PREFIX

[0075] As is well known, the cyclic prefix in OFDM is used to avoid ISI and to simplify eq ualization to per bin multiplication, by turning linear convolution into cyclical convolution. However OFD WAM Receiver does equalization implicitly via the cost function minimization, and handles distortion between demodulated bins by use of iterative convergence. Therefore avoiding ISI and simplified equalization are not needed thus OFD WAM Receiver can work without a cyclic prefix (CP) or alternately use the energy of the CP. With No CP OFD WAM receiver we can model the linear convolution including the previous symbol ISI using the following cost function:

where:

• X ¹ , X ^t_1 are the current and previous estimated symbols;

• ΔΧ ¹ , ΔΧ ^ί_1 are the current symbol and previous symbol corrections

• (Js fcis the reliability measure for subcarrier • yi(: ) , is the observed signal in time domain for receive antenna / ^' ;

• Oy - is the noise power which here is assumed to be white;

• hi j(n is channel estimation in time from antenna / ^' to j;

• h ^ISI i j(n) is previous symbol ISI channel estimation in time from antenna / ^' to j;

• V-.,-.,k for 0 < k≤ N _FFT — 1 is the N _Tx X N _ss precoder matrix for subcarrier k;

• f _L for 1 < / ^' < N _TX , is the nonlinear response of the j'th transmit chain;

• The IDFT/DFT represents IDFT/DFT operations operating on the input samples of size

[0015] In this case summation occurs not only over N _FFT samples, but also over the CP part. Thus, if the system uses a CP the energy of the CP is not wasted. The ISI from the previous symbol is mitigated by use of the estimate for the previous symbol convolved with the ISI response (h ^ISI £j(n)), where, through the use of pipelining, as discussed below, the previous symbol estimate (Xlj ^"1 ) NLS circuitry 216 processes the previous symbol independent of the current symbol, and the previous symbol has undergone more outer iterations than the current symbol. The receiver may also use non-cyclic convolution with the channel response (¾ _; (η)).

[0016] In addition, it is possible to concurrently optimize two or more symbols thereby further increasing performance. I.e. summing cost function of several symbols. For example,the corrections ΔΧ^., ΔΧ^ ^"1 , ΔΧ^ ^~2 for times t, t-1, and t-2 may be optimized concurrently.

PIPELINED STRUCTURE OF HARDWARE

[0076] In an example implementation, the receiver of Figure 3 may use a pipelined hardware architecture in which several receive paths operate concurrently on several code words. In such an implementation, a first path may handle outer iteration J (a positive integer) on code word M while, a second path (if present) may operate on outer iteration 7-1 on code word M+1, a third path (if present) may concurrently operate on outer iteration 7-2 on code word M+2, and so on for as many paths as is desired. In an example implementation comprising at least two such paths, during the 1 ^st iteration (in slow varying channels), processing of OFDM symbols belonging to code word M+1 may use channel estimation based on symbols belonging to the second iteration of code word M. In an example implementation, the derivative of the channel for symbols belonging to code word M, iteration 7 can be derived from the channel estimation from symbols belonging to code word M-l, iteration 7+1 and the channel estimation from symbols belonging to code word M+1, iteration 7-1.

[0077] For the case of misalignment between code words and symbols, operating the

N LS circuitry 216 code word by code word (i.e. not pipelined) may induce some performance loss because, when applying NLS circuitry 216 for code word M that shares a symbol with code word M+1, the N LS circuitry 216 has no estimation (X _k ) from the FEC decoder 224 for bins in the shared symbol belonging to code word M+1. In an example implementation, the pipelined implementation is used to obtain X _k for the shared symbol. That is, the first path may handle outer iteration 7 (a positive integer) on code word M while a second path (if present) may operate on outer iteration 7-1 on code word M+1. In this case, for first path outer iteration 7 running on last/shared symbol (of code word M), the N LS circuitry 216 may use the shared symbol bins estimations X _k obtained by the FEC decoder 224 for second path outer iteration 7-1 on code word M+1 .

[0078] The pipelined structure can also be used in an OFDMA scenario where different packets from different users (on adjacent frequencies) are not aligned. In OFDMA, non-linear distortion leaks from one user to the adjacent users in frequency. The N LS circuitry 216 can start processing a user packet as soon as a code word becomes available without using "goods" which are related to code words that haven't been processed yet. However, whenever an adjacent (in frequency or time) code word has been processed, the N LS circuitry 216 may use the most recent soft information obtained for it by the decoder 224 (LLRs, estimation X _k , and/or other information).

USING OFF DIAGONAL ELEM ENTS IN H TO HANDLE PHASE NOISE AND FAST VARYI NG CHANN ELS. [0079] The derivation for the SISO case (single spatial path) applies to Nj Rx

N _Tx physicals channel from every transmit antenna to every receiver antenna, and thus can be used in the MIMO case as well. The channel is assumed to be composed of several reflections, each reflection delays the transmitted signal and multiplies it by a complex factor. The formulation for such a channel between single TX and single RX antenna is shown in equation

(22). where, in slow varying channels (e.g., where estimation using a one-symbol delay is provides sufficient SNR), and when phase noise is weak enough (e.g., below a determined threshold), it is assumed that h _t {t) is constant within the duration of an OFDM symbol. However, in the presence of phase noise and/or when channel varies fast this assumption no longer holds. In this case, a Taylor expansion may be used around the middle of the OFDM symbol, which results in the formulation of equation (23).

where h _i ^{p )} is the p ^th derivative of h _t (t) at the middle of the OFDM symbol (i.e. at time instant

T _Sy 2).

[0080] Using (23), and under the assumption that the cyclic prefix is longer than the maximal path delay, τ, it can be shown that received signal in frequency domain is :

Y _k = H _k - X _k +∑(x _k (24)

p=l

Where:

• is the Fourier transform of - dt )

• * denotes convolution ϊ

[0081] Equation (24) can be represented in matrix form as shown in equation (25).

Y = H X (25) where:

• H = diag{[H ₀ ... H _k ... H _N +∑L ^(p) - ... ... ¾> ])

p=l

• is the convolution matrix of &

[0082] Since L ^ip> decays, which accounts for the fact that the variations cause Inter

Carrier Interference (ICI) that diminishes as carriers are further apart, considering only a few off-diagonal elements is sufficient in an example implementation.

[0083] Approximation of H _k ^(p) requires knowledge of H _k at p+1 time instances for every

(TX,RX) antenna pair. In an example implementation this is done by use of pilots from the every transmit antenna that are repeated every few OFDM symbols.

[0084] Applying the previous derivation to every transmit receive antenna pair we get the following output for RX antenna / ^' .

£ = (26) j=i

Where:

• i, j are the receive and transmit antenna indices respectively;

• _^ . . is the ICI corrupted channel from transmit antenna j to receive antenna /;

• X_j is the MIMO precoded signal on transmit antenna j.

[0085] Equation (5), by virtue of using the block diagonal formulation, can be applied to

ICI case by setting H (Due to ICI modeling this modified Ή would no longer have the block diagonal form)

H{k - N _Rx + i - l,k - N _Tx + j - l) = H (27) Where i, j are the receive and transmit antenna indices respectively. [0086] 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)}. 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)}. 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, by some user-configurable setting.

[0087] The present method and/or system may be realized in hardware, software, or a combination of hardware and software. The present methods and/or systems 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. Some implementations may comprise a non-transitory machine-readable (e.g., computer readable) medium (e.g., FLASH drive, optical disk, magnetic storage disk, or the like) having stored thereon one or more lines of code executable by a machine, thereby causing the machine to perform processes as described herein.

[0088] While the present method and/or system has been described with reference to certain implementations, 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 method and/or system. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present disclosure without departing from its scope. Therefore, it is intended that the present method and/or system not be limited to the particular implementations disclosed, but that the present method and/or system will include all implementations falling within the scope of the appended claims.