 Research
 Open access
 Published:
Frequencydomain equalizers with zero restoration for zeropadded block transmission with high SNR
EURASIP Journal on Wireless Communications and Networking volume 2016, Article number: 101 (2016)
Abstract
This paper focuses on the equalization of block transmissions with zero pad (ZP). If the channel impulse response length does not exceed the ZP length, it is possible to construct zeroforcing equalizers (ZFEs). Improved performance may be achieved using a minimum mean squared error (MMSE) equalizer. However, these equalizers are computationally intensive when a timedomain implementation is used. While the frequencydomain implementation of a ZFE has a lower complexity, it is prone to—potentially infinite—noise enhancement in the presence of spectral zeros. The MMSE equalizer in the frequency domain performs better by limiting the noise enhancement but still loses all information stored at the spectral zeros. This paper presents a method to exploit the redundancy of the padding to recover this lost information, leading to two new frequencydomain equalizers, a ZFE and an MMSElike equalizer. These two equalizers are evaluated through simulations. They have a performance close to the timedomain equalizers, while maintaining the low complexity of the original frequencydomain equalizers. The equalizers are especially useful for scenarios with a high signaltonoise ratio (SNR), where the performance is not limited by the presence of noise, but by the absence of the information stored in the spectral zeros. In practice, this means an SNR >30 dB. With minor modifications, the equalizers can also be applied if the ZP is replaced by a unique word (UW).
1 Introduction
The idea of using a discrete Fourier transform (DFT) to (de)modulate data on carriers—referred to as tones or subcarriers—goes back a long time [1]. The transmission is organized in blocks and operates as follows: each tone is assigned a complex data symbol corresponding to a constellation point. These complex data symbols for all tones are packed together in a vector which is converted to the time domain by means of an inverse DFT (IDFT). The resulting timedomain waveform can be seen as a summation of orthogonal signals—one for each tone—hence the name orthogonal frequency division multiplexing (OFDM). This waveform is now transmitted over the channel. The received samples are stored in a vector which is converted back to the frequency domain using a DFT. Unfortunately, the channel causes intersymbol interference and destroys the orthogonality between the tones, complicating the equalization. Both problems can be solved by introducing a cyclic prefix (CP): a block of samples at the end of the timedomain waveform is copied and added in front of the waveform prior to transmission [2]. At the receiver side, the samples pertaining to the CP are discarded. The resulting effect is that the linear channel convolution now appears to be circular. Accordingly, the corresponding channel matrix in the frequency domain becomes a diagonal one and the received symbols on each tone only depend on the transmitted symbols on that tone. Equalization can now easily be done by multiplying with the inverse of the diagonal channel matrix. A good overview is given in [3–5].
Later on, it was realized that this equalization technique is not limited to OFDM but also applicable to singlecarrier block transmissions (SC), see [6], who observes that this idea was already suggested two decades earlier [7].
Since one can be converted into the other by merely adding an orthogonal precoding, OFDM and SC have many similarities and mathematical techniques for one of them can usually be adapted for use with the other. The differences mostly concern practical implementation issues: because SC systems generally have a lower peaktoaverage power ratio (PAPR) and a better robustness against nonlinearities or carrier offset [6, 8, 9], their demands on the analog hardware are lower than those of OFDM. Adaptive OFDM, on the other hand, has the advantage of allowing bit loading and power loading of each subcarrier according to its quality [9].
Furthermore, adding a CP is not the only way to convert the linear channel convolution into a circular one. This can also be obtained by adding a zero pad (ZP) or unique word (UW) to the waveforms in the time domain. Specifically, a CP system relies on the overlapsave (OLS) technique, while a ZP system uses overlapadd (OLA) to obtain a circular convolution. Although CP and ZP systems appear to be interchangeable, there are important differences. More specifically, if the channel frequency response exhibits spectral zeros on or zeros near the unit circle, zeroforcing equalization may be impossible for a CP system or may lead to severe noise enhancement [10, 11]. A CPOFDM system can take this into account by discarding the affected subcarriers if the channel is known at the transmitter or by using forward error correction (FEC) codes if it is not [8, 11]. The signal projection scheme from [12] offers a fundamental solution but is prohibitive in complexity, while the precoding technique from [13] requires the channel to remain constant over a period of multiple blocks. For a CPSC system with a zeroforcing equalizer (ZFE), the presence of spectral zeros in the channel response is even worse, as the enhanced noise spreads out over the entire timedomain block. The classical solution is to limit the noise enhancement by using a minimum mean square error (MMSE) equalizer instead [14]. The information stored in the subcarriers corresponding to the zeros, however, will still be lost.
For a ZP system, on the other hand, zeroforcing equalization is always possible [11, 15]. Unfortunately, using the OLA technique to implement the ZFE in the frequency domain introduces the same vulnerability to spectral zeros in the channel response as in CP systems. This results in an illconditioned problem and again the need to revert to an MMSE equalizer. Again, the information stored in the subcarriers corresponding to the zeros is still lost. A decision feedback equalizer (DFE) on sample level might solve this problem. However, due to the processing in the time domain, its implementation will be much less efficient than the frequencydomain techniques mentioned before.
This paper presents two new frequencydomain equalizers for ZP transmission which can recover the information lost in the spectral zeros, while maintaining a complexity, comparable to frequencydomain solutions. They are applicable to OFDM as well as SC transmissions. The equalizers are analysed through simulation for several realistic scenarios, including situations where the performance is not limited by the signaltonoise ratio (SNR), but by the missing information of the spectral zero. With minor modifications, they can also be used for systems using a UW.
The paper is organized is as follows: in Section 2, the system model and existing equalization techniques are presented. In Section 3, the new frequencydomain equalizers are introduced. In Section 4, simulations results are presented. Finally, in Section 5, conclusions are summarized.
2 System model and equalizers
The following conventions are followed: bold lowercase letters denote vectors and bold uppercase letters denote matrices. Normal uppercase letters denote constants. (.)^{T}, \((.)^{\mathcal {H}}\), (.)^{†} and E{.} denote transpose, Hermitian, pseudoinverse and expected value, respectively, and A(:,[l _{1}…l _{k}]) selects columns l _{1}…l _{k} of A. The DFT, IDFT, zero and identity matrix of size K are represented by \(\boldsymbol {\mathcal {F}}_{\mathrm {K}}\), \(\boldsymbol {\mathcal {I}}_{\mathrm {K}}\), 0 _{K} and I _{K}, respectively. Occasionally, for clarity, the dimensions of a matrix are indicated as [.]_{K×L}.
Now, consider a finite impulse response (FIR) transmission channel \(\mathbf {h}=\left [\begin {array}{cccc} \!h_{\textrm {0}} \! & h_{\textrm {1}} \! & \dots & \! h_{\mathrm {L}} \! \end {array} \right ]^{T}\)of order L, which is known by both transmitter and receiver and which can be considered quasistatic over one block period. The transmitted block \(\mathbf {x}=\left [ \begin {array}{cccc} \! x_{\textrm {1}} & \! x_{\textrm {2}} & \! \dots & \! x_{\mathrm {N}} \! \end {array} \right ]^{T}\)is followed by a ZP of length P, with P≥L to avoid interblock interference (IBI). Without loss of generality, it is assumed that the variance of x equals unity, i.e. \(E\{\mathbf {x}\mathbf {x}^{\mathcal {H}}\}=\mathbf {I}_{\mathrm {N}}\) and that P=L. The received signal y is given as
with H the linear convolution matrix of h and n additive noise. Without loss of generality, it is assumed that the noise is zeromean and white with variance \(\sigma _{\mathrm {n}}^{2}\), i.e. \(E\{\mathbf {n} \mathbf {n}^{\mathcal {H}}\}=\sigma _{\mathrm {n}}^{2}\mathbf {I}_{\textrm {N+L}}\).
2.1 Time domain equalization
An equalizer W is a matrix for which \(\hat {\mathbf {x}}=\mathbf {W} \mathbf {y}\) is an estimate of x. Moreover, any equalizer W _{ZFE} that satisfies the following constraint
is referred to as a zero forcing equalizer (ZFE). In the absence of noise, such ZFE obviously leads to a perfect reconstruction of the transmitted block. Because H is a tall Toeplitz matrix, an infinite number of equalizers exist that satisfy Eq. (2). Since \(\hat {\mathbf {x}}=\mathbf {x} +\mathbf {W}_{\textrm {ZFE}} \mathbf {n}\), ZFEs only differ in the way they treat the noise. One particular ZFE is obtained as the pseudoinverse of H, which then provides the minimumnorm solution of Eq. (2). It is given by^{1}
Here, \(\mathbf {H}^{\mathcal {H}} \mathbf {H}\) is a fullrank N×N matrix and hence always invertible. This is referred to as the ZFETD (timedomain ZFE) where ‘timedomain’ refers to the absence of a transformation to the frequency domain (see Section 2.2). It is the optimal ZFE because it has the smallest noise enhancement.
By dropping the perfect reconstruction constraint of Eq. (2), it is often possible to achieve improved performance. The MMSE equalizer also takes into account the noise statistics and performs an overall optimization by minimizing the expected value of the squared error, E{x−W _{MMSETD} y^{2}}. It can be expressed as
The calculation of these equalizers has a complexity of \(\mathcal {O}(N^{2})\) flops (using structured matrix inversion formulae) while calculating \(\hat {\mathbf {x}}=\mathbf {Wy}\) requires no more than \(\mathcal {O}(N^{2})\) flops per block [16].
2.2 Frequencydomain equalization based on matrix folding
To exploit frequencydomain techniques, the linear channel convolution needs to be converted into a circular one. Accordingly, the matrix H needs to be transformed into a circular matrix. This can be achieved in two ways: either by folding the last L rows back to the top or by extending it with L more columns. The first method corresponds to an overlapadd operation: the last L samples of y are added to the first L samples and then only the first N samples of the result are kept, resulting in
Note that the multiplication with the (N × (N + L))matrix G _{f} reduces the number of matrix rows and hence the information in the system. The existence of a ZFE solution may therefore no longer be guaranteed. Indeed, H _{f} is an N×N matrix which becomes rank deficient if the Ztransform of h has a zero on one of the N equally spaced points \(e^{\frac {2\pi i}{N}k}\), with k=0…N−1, referred to as spectral zeros. If H _{f} has rank N, the resulting unique ZFE can be written as
To perform the equalization in the frequency domain, note that H _{f} can be diagonalized to Λ _{f}, such that Eq. (5) becomes
The frequencydomain ZFE can now be written as
The calculation of the inversion of the diagonal matrix in this equation requires \(\mathcal {O}(N)\) flops, whereas the calculation of \(\hat {\mathbf {x}}\) requires only \(\mathcal {O}(N\log (N))\) flops per block, if the (I)DFT operation is implemented using the (inverse) fast Fourier transform. Obviously, an important saving is to be made compared to the ZFETD, especially for large values of N. However, this speedup comes at a cost: if the channel has spectral zeros or zeros near the unit circle, the inversion of Λ _{f} may be impossible or lead to very large values and hence a significant noise enhancement.
This problem is well known, and several authors have proposed the MMSE approach to limit the detrimental influence of the noise [12, 17], see [18] for the OFDM case. The frequencydomain MMSE equalizer can be expressed as
where the regularization term \(\left (\frac {N+L}{N}\right)\) reflects the difference in noise shaping due to G _{f}.
2.3 Frequencydomain equalization based on matrix extension
It is also possible to add appropriate columns to H to extend it to a circular (N+L)×(N+L) matrix H _{e}. Equation (1) is then extended to explicitly involve the ZP in the calculations, i.e.
Note that H _{e} is an M×M matrix, with M=N+L, of which the rank is minimally N. Now, H _{e} can be diagonalized to Λ _{e}, having diagonal elements \(\lambda _{\mathrm {e}_{\textrm {1}}}, \lambda _{\mathrm {e}_{2}},\dots \ \lambda _{\mathrm {e}_{\mathrm {M}}}\), yielding
The frequencydomain ZFE can be written as
The calculation of the inversion of the diagonal matrix in this equation requires \(\mathcal {O}(M)\) flops, whereas the calculation of \(\hat {\mathbf {x}}\) requires \(\mathcal {O}(M\log (M))\) flops per block. Note that, in the absence of spectral zeros, there exists a clever method to express the optimal ZFE, W _{ZFETD} in terms of W _{ZFEFDEXT} and a correction term of low complexity [19].
In case of spectral zeros at one of the points \(e^{\frac {2\pi i}{N+L}k}\), with k=0…M−1, Λ _{e} may be a rankdeficient matrix. Again, this can be dealt with by using the MMSE equalizer,
It is remarkable that the assured possibility of zeroforcing equalization is lost in going from Eq. (1) to Eq. (12), because the number of equations is unchanged (contrary to Eq. (5), where information is truly discarded). The problem arises in Eq. (10) when the matrix H _{e} is not of full rank. For the solution in the time domain, however, H _{e} does not need to be of full rank because the last L elements of x _{ZP} are known to be zero. In the frequency domain, this additional information is unavailable. In the next section, this problem is solved by feeding back this known information and fixing the possible ‘gaps’ in Λ _{e}, thereby restoring the information that was lost due to the spectral zeros.
3 Improved frequencydomain equalization
In Section 2.3, the ZP part of the equalized signal is discarded by the multiplication with \(\left [ \begin {array}{ccc} \mathbf {I}_{\mathrm {N}} &\bigg & \mathbf {O} \end {array} \right ] \)in Eqs. (12) and (13). The equalized ZP, however, contains information that can help to improve the equalization of the useful signal.
Before diving into the mathematics, the general idea will be illustrated by a graphical example. Consider a simple binary communication system with zero padding. The elements of x only take two values, as shown in Fig. 1. Assume a channel that can be properly equalized at every subcarrier except for one, where it exhibits a spectral zero. Any energy received at the subcarrier exhibiting this spectral zero can therefore only be noise and the best any frequencydomain equalizer can do is to discard it. Note that this is exactly what the MMSE equalizer in Eq. (13) does. The resulting \(\hat {\mathbf {x}}\), including the equalized ZP, is also shown in Fig. 1. Comparing the transmitted signal and the equalized version, a sinusoidal disturbance is immediately apparent. This disturbance is caused by the absence of the contribution of the subcarrier which exhibited a spectral zero. If this missing contribution would be added, the equalized useful signal points would be closer to the transmitted ones, and the equalized zero pad would be closer to zero. Exactly this last observation suggests a method to determine the contribution of the missing subcarrier: its phase and amplitude should be chosen so as to minimize the zero pad. After determining these parameters, the contribution of this subcarrier can be added. It is expected that this addition will also improve the quality of the useful signal. This idea will now be elaborated mathematically. To simplify the notation, it is assumed that L=P, which can easily be obtained by padding h with zeros.
3.1 Frequencydomain ZFE with zero restoration
If Λ _{e} is invertible and wellconditioned, the solutions from Eqs. (12) or (13) can be used. If Λ _{e} is rankdeficient or illconditioned, assume V diagonal elements of Λ _{e} are nonzero while the remaining K=M−V elements are zero or close to zero. Note that, because H _{e} is at least of rank N, it follows that K≤P. Now rearrange the diagonal elements of Λ _{e} such that the K (closeto) zero elements are collected at the end. Rearrange the rows of the DFTmatrix \(\boldsymbol {\mathcal {F}}_{\mathrm {M}}\) in a likewise manner and call the result F. The matrix H _{e} can now be diagonalized as
in which Λ _{nz} holds the nonzero diagonal elements of Λ _{e}, Λ _{ ε } holds the (closeto) zero elements and F _{A} _{(V×N)}, and F _{B} _{(V×L)}, F _{C} _{(K×N)} and F _{D} _{(K×L)} are submatrices of F. Because \(\mathbf {F}^{\mathcal {H}} \mathbf {F} = \mathbf {I}\), specific relations hold between these submatrices, e.g. \(\mathbf {F}_{\mathrm {B}}^{\mathcal {H}} \mathbf {F}_{\mathrm {A}}=\mathbf {F}_{\mathrm {D}}^{\mathcal {H}} \mathbf {F}_{\mathrm {C}}\) and \(\mathbf {F}_{\mathrm {A}}^{\mathcal {H}} \mathbf {F}_{\mathrm {A}}+\mathbf {F}_{\mathrm {C}}^{\mathcal {H}} \mathbf {F}_{\mathrm {C}}=\mathbf {I}\).
Inverting Λ _{ ε }—if at all possible—would lead to a significant noise enhancement. However, by disregarding Λ _{ ε } and inverting only Λ _{nz}, a first approximation of x _{ZP} can be calculated,
Note that for high SNR values, this converges to the MMSEsolution of Eq. (13).
Because \(\mathbf {F}^{\mathcal {H}}\) can be derived from \(\boldsymbol {\mathcal {I}}\) by a simple permutation of the rows and columns, it is also an orthogonal matrix and, as such, its columns form a base onto which the eventual equalizer output \(\hat {\mathbf {x}}\) can be decomposed. Most of the coefficients of this decomposition can be derived from Eq. (16); more specifically, these are the coefficients related to the first V columns of \(\mathbf {F}^{\mathcal {H}}\) and the result is \({\hat {\mathbf {x}}}_{\text {ZP}_{\text {temp}}}\). The coefficients related to the last K columns of \(\mathbf {F}^{\mathcal {H}}\) are unknown and set to zero in (16). However, including these columns could potentially lead to a better approximation of x. Therefore, a correction term is added to \({\hat {\mathbf {x}}}_{\text {ZP}_{\text {temp}}}\), which lies in the column space of the last K columns of \(\mathbf {F}^{\mathcal {H}}\), and which can be written as
where q holds the unknown coefficients related to the last V columns of \(\mathbf {F}^{\mathcal {H}}\). The correction term can be determined by taking into account that the last P elements of \(\hat {\mathbf {x}}_{\text {ZP}}\) should be zero. This leads to a system of P equations in K unknowns, which can be solved exactly if no noise is present. In practice, the correction term can be calculated from the following leastsquares (LS) system:
the solution of which is given by
The overall expression for \(\hat {\mathbf {x}}\) therefore becomes
This equation defines the ZFEZR, where ZR refers to zero restoration. It can be rewritten as
with \(\mathbf {Q}=(\mathbf {F}_{\mathrm {D}} \mathbf {F}_{\mathrm {D}}^{\mathcal {H}})^{1} \mathbf {F}_{\mathrm {D}} \mathbf {F}_{\mathrm {B}}^{\mathcal {H}}=\left (\mathrm {F}_{\mathrm {D}}^{\mathcal {H}}\right)^{\dag } \mathbf {F}_{\mathrm {B}}^{\mathcal {H}}\).
It can now be shown that W _{ZFEZR} satisfies the constraint of Eq. (2):
So the ZFEZR is indeed a ZFE, capable of recovering the lost information. Note that this derivation holds even if the diagonal elements of Λ _{ ε } are not exactly equal to zero, which is more common in realworld situations.
Note that this procedure involves calculating the pseudoinverse of \(\mathrm {F}_{\mathrm {D}}^{\mathcal {H}}\), which is poorly conditioned if the corresponding columns of the IDFT matrix are close to each other. In other words, the restoration of the information lost in spectral (closeto) zeros works best if these spectral (closeto) zeros are not clustered.
The result of Eq. (21) has some similarity to another ZFE proposed in [20], which indeed targets the same problem of spectral zeros, be it in the context of a diversity analysis. In the current notation, this ZFE can be written as
which can easily be shown to satisfy Eq. (2) as well. Note that Eq. (23) assumes that K=P, because F_{A} needs to be square. Under this assumption, the solutions of Eqs. (21) and (23) are mathematically identical, because of the uniqueness of \(\mathbf {F}_{\mathrm {A}}^{1}\). Regarding the computational complexity, however, they are very different. The evaluation of Eq. (23) requires the inversion of F _{A}. Taking into account the Vandermonde structure of this matrix, this requires 5N ^{2}/2 operations [20], which typically is much higher than the evaluation of Eq. (21), as will be shown later. Note that the same author also offered a similar solution, which was the first linear equalization scheme to achieve maximum multipath diversity over singleinput singleoutput wireless links [21].
3.2 Frequencydomain MMSElike equalization with zero restoration
As noted before, frequencydomain MMSE equalizers can avoid dramatic noise enhancement due to an illconditioned channel matrix. However, they too do not offer any solution for the loss of information associated with a (closeto) zero on the diagonal of Λ _{ c }. This can be solved using a structure similar to the ZFEZR presented in the previous section.
Using Λ _{nz} and Λ _{ ε } from Eq. (14), the following diagonal matrices can be defined:
such that the MMSEFDEXT in Eq. (13) can be rewritten as
Following the same steps as in the previous section, an improved MMSElike equalizer with zero restoration can be obtained as
with exactly the same Q as in Eq. (21).
For a theoretical analysis of these two equalizers, we refer to the Appendix.
3.3 Remarks
Before proceeding to the simulation results, some additional remarks are in place:
3.3.1 Threshold
Practical channel knowledge is imperfect because it is based on estimates and hence spectral zeros will mostly be identified as spectral closetozeros. Therefore, a decision needs to be made as to which elements of Λ _{e} should effectively be treated as zero, e.g. based on a threshold. This can be set at some percentage of the root mean square value of h or through some other method. In any case, it needs to be such that the number of zeros K is not larger than P. A tradeoff needs to be made: setting a low threshold and identifying too few spectral closetozeros can lead to noise enhancement. Setting a high threshold can lead to too many spectral closetozeros, all of whose received information is discarded.
In the case of reasonably high values of the SNR (e.g. >30 dB), elements of Λ _{e} with an absolute value below σ _{n} should be treated as zeros, because they have a major contribution to the MSE. In the case of nonwhite noise, the threshold should also take into account the SNR level at each subcarrier.
3.3.2 Condition
Related to the previous point, it should be avoided to assign consecutive elements of Λ _{e} as zeros. This would lead to an LS system based on consecutive rows of a DFT submatrix, which can be poorly conditioned.
Both points should lead to some heuristic algorithm to determine the selection of the elements which will be treated as zeros, e.g. the approach used in the simulations section is to only retain the ‘lowest’ of a set of consecutive zeros.
Extensive simulations have shown that treating one element of Λ _{e} as a zero generally does no harm and has the potential to improve the performance significantly. Keeping in mind that spectral zeros are relatively rare, and multiple spectral zeros are even rarer, designating the lowest element of Λ _{e} as a zero suffices for most ‘difficult’ channels. Even if this tone was carrying useful information, this can easily be recovered from the information in the other tones. On the other hand, in the extreme case, where K=P, Eq. (18) is no longer a LS system and will be modeling the noise as well as reconstruct the information stored in the spectral zeros. This should only be considered for relatively high values of the SNR.
3.3.3 UW
The zerorestoration equalizers can also be adapted to UWbased transmission, either by subtracting the contribution of the UW at the receiver and proceeding as in the ZP case or by replacing \(\hat {\mathbf {x}}_{\text {ZP}}\) by \(\hat {\mathbf {x}}_{\text {UW}}\) and modifying the LS system such that the last P samples of \(\hat {\mathbf {x}}_{\text {UW}}\) equal the UW.
3.3.4 Implementation
Note that, while in Eq. (15) the last K columns of \(\mathbf {F}^{\mathcal {H}}\) are effectively multiplied by coefficients equal to zero, even nonzero coefficients may be used here, because these are then absorbed by q anyway. It is therefore also possible to choose coefficients equal to \(\mathbf {\Lambda }_{\epsilon }^{1}\). This implies that the ZFEZR can be implemented as a postprocessing of the ZFEFDEXT.
A practical implementation could therefore start with the evaluation of —without the premultiplication with \(\left [ \begin {array}{ccc} \mathbf {I}_{\mathrm {N}} &\bigg & \mathbf {O} \end {array} \right ]\)—as an alternative for \({\hat {\mathbf {x}}}_{\text {ZP}_{\text {temp}}}\). Next, the LS system from Eq. (18) is solved, which is typically very small. The calculation of q requires \((N+L+\frac {K}{3})K^{2}\) flops ([22], p. 238) and the calculation of \({\hat {\mathbf {x}}}_{\text {ZP}_{\text {corr}}}\) requires another (2K−1)N flops to multiply q and \(\mathbf {F}^{\mathcal {H}}_{\mathrm {C}}\). The overall computational complexity is thus equal to the complexity of Eq. (12) plus approximately \(\mathcal {O}((K^{2}+2K)N)\) flops and is generally significantly smaller than the complexity of the timedomain equalizers of Eqs. (3) and (4). Likewise, the MMSEZR can be implemented as a postprocessing of the MMSEFDEXT. Based on the measurement of the actual channel and the SNR, it can be decided to use the postprocessing step or not.
Note that the ZFEFDFOLD and the MMSEFDFOLD cannot be used as a starting point of the ZRalgorithm because, contrary to H _{e}, H _{f} is not guaranteed at least of rank N and may not contain enough information to calculate N unknowns. For an easy comparison, the complexity of all equalizers has been summarized in Table 1.
More precisely, the complexity for the MMSEFDEXT is

(per channel update) evaluating Eq. (13), except for the DFT operations: 2M complex multiplications, M complex additions

to evaluate \(\hat {\mathbf {x}}\):

FFT: \(\frac {1}{2}M \log (M)\) complex multiplications, \(\frac {1}{2}M \log (M)\) complex additions

M complex multiplications

IFFT: \(\frac {1}{2}M \log (M)\) complex multiplications, \(\frac {1}{2}M \log (M)\) complex additions

In (the rather common) case only one spectral zero would be reconstructed, the MMSEZR would add to this:

(per channel update) calculate \(\mathbf {F}_{\mathrm {D}} \mathbf {F}_{\mathrm {D}}^{\mathcal {H}}\), needed for q: P complex multiplications, P−1 complex additions

to evaluate \(\hat {\mathbf {x}}\):

calculating q: P complex multiplications, P−1 complex additions

scaling and adding the complex exponential pertaining to the missing zero: N complex multiplications, N complex additions.

For N=48 and P=16, this means that the number of complex multiplications for a channel update, assuming Λ _{f} is known, increases from 128 to 144 (+ 13 %). The number of complex multiplications to evaluate \(\hat {\mathbf {x}}\) it increases from 448 to 510 (+ 14 %). The figures for the additions are nearly identical.
4 Simulations and discussion
To illustrate the performance of the ZR technique, simulations have been done based on two channels found in literature as well as for the general case of Rayleigh fading. The section is concluded with a more general comparison of equalization techniques using ITU channels.
Channels h _{1}(n)=[−0.3699+j0.5782−0.4053+j0.5750−0.0834+j0.04060.1587+j0.0156] and h _{2}(n)=[0.707000.707] correspond to p _{2} from [14] and channel A from [12], respectively. These channels are shown in Fig. 2.
The OFDM system in the original papers is replaced by ZPSC with M=64, P=L and N=64−P. Note that h _{1}(n) has a spectral closetozero at the 30th subcarrier and h _{2}(n) has a spectral zero as well as two spectral closetozeros. The noise is white Gaussian with different variances to match the SNR. The BER performance is simulated using a Monte Carlo method with 100,000 random blocks, assuming a 16QAM system.
For the first channel, Fig. 3 indicates that limiting the noise at the spectral closetozero frequency, as the MMSEFDEXT does, is a good strategy for low SNR. However, because of the noise enhancement at the spectral closetozero, the MMSEFDEXT is unable to benefit fully from increasing SNR levels and at some point the ZFETD starts to perform better. The ZFEZR equalizer manages to stay very close to the ZFETD, which obviously provides a performance lower bound for any ZFE. As expected, the MMSEZR performs better than the ZFEZR, especially for low SNRs, and it even outperforms the ZFETD. Because the channel exhibits a spectral closetozero, and therefore the noise enhancement is finite, even the performance of the ZFEFDEXT eventually improves as the SNR increases, albeit slower.
The results for channel h _{2}(n) are shown in Fig. 4. Because of the spectral zero, the noise enhancement for the ZFEFDEXT equals infinity, as reflected by a BER of 0.5 for all SNR values. The MMSEFDEXT is also severely impacted by the spectral zero.
For moderate SNR values, its performance is comparable to that of Fig. 3, however, the performance now saturates for high SNR values. Indeed, all information is lost at the spectral zero and the best strategy is to discard the noise present at this subcarrier. Roughly speaking, this implies that one Mth part of the signal power will be lost, resulting in an irreducible error, no matter how high the SNR. This is also apparent from the MSE curves in Fig. 5, for which this limit would be at 64^{−1} or −18 dB. The ZFEZR and MMSEZR on the other hand assume three spectral (closeto) zeros (K=3) and reconstruct the information that was stored there. As the SNR levels increase, the estimation of the q vector in Eq. (18) also improves and therefore these equalizers do not show a saturation. They achieve a performance close to the ZFETD and the MMSETD, which are obviously not at all affected by the spectral zero. These curves also illustrate that the MSE for the two ZFEs is linearly dependent on the noise energy. For low SNR values, the ZFEs are clearly inferior to MMSEbased equalizers that limit the noise enhancement.
The Rayleigh fading model is a more realistic description of the wireless channel dominated by multipath ([23], p. 705). Such model has been simulated for 10,000 randomly generated channels of order L=5, with both the real and imaginary part of the impulse responses following a Gaussian distribution with variance \(\sigma _{\mathrm {h}}^{2}=0.5\). For each channel, 1000 random blocks using 64QAM coding have been simulated with M=32, P=L=5, N=26. The threshold to determine which elements of Λ _{e} are considered as zeros was set at 0.05. The calculated BER is shown in Fig. 6. Again, the zerorestoration equalizers outperform the classical frequencydomain equalizers but are inferior to equalization in the time domain. Note that the zerorestoration mechanism is only triggered for a limited number of channels. The gain is therefore less impressive than for the previous results.
Finally, some more extensive simulations have been done, comparing ZP to CP, SC to OFDM and matrix folding to matrix extension. The dimensions for IEEE 802.11a [24] have been used together with channel models presented by the ITU, more specifically the Indoor office test environment channel B [25]. The useful signal length N=48 and the padding length P=16, be it a ZP or CP. The constellation size for all symbols was QAM64. It is important to note that no coding was used and for OFDM no bit loading was done. The following modulation schemes are compared:

SCZP, using MMSETD, ZFETD, MMSEZR, ZFEZR, MMSEFDEXT, ZFEFDEXT and MMSEFDFOLD

SCCP, using an MMSEstyle FD equalizer

OFDMZP, using MMSEFDEXT and MMSEZR.

OFDMCP, using an MMSEstyle FD equalizer without the final IDFT step. This is the typical OFDM operation.
In total, 20,000 random channels were generated; for each one, 1000 symbols were transmitted. The results are presented in Fig. 7.
The best performance for SCZP systems is again obtained using the MMSETD and ZFETD, followed by the MMSEZR and ZFEZR and the other equalizers. It is interesting to see that the SCZP with MMSEFDFOLD has the same performance as SCCP, which makes sense because the operations on the useful signal are identical; only the noise distribution is different. The OFDM schemes systematically perform worse than the corresponding SC alternative. This result is pessimistic, though, because no bit loading is being used. Nevertheless, the OFDMMMSEZR again performs better than the OFDMMMSEFDEXT.
5 Conclusions
Two new frequencydomain equalizers have been proposed to equalize zeropadded OFDM and SCblock transmissions over a channel exhibiting spectral zeros or spectral closetozeros. Both exploit the redundancy of the ZP to restore the lost information. The first technique is shown to have the zero forcing property; the second one is very similar to an MMSE equalizer. A particularly interesting feature is that these equalizers can be implemented by adding a postprocessing to the output of a classical frequencydomain equalizer, typically requiring only very limited additional resources. Simulations show a performance comparable to timedomain equalizers, at a computational complexity comparable to the original frequencydomain equalizers. The equalizers can easily be modified to work with unique wording as well.
6 Appendix
6.1 Theoretical analysis of the performance
The bit error rate (BER) of a communications system can directly be calculated from the modulation scheme and the achieved mean squared error (MSE). For any equalizer W, the MSE of the equalized blocks is given by the diagonal elements of the autocorrelation matrix of the equalization error, i.e.
The MSE has a contribution stemming from the inexact channel equalization and a noise contribution. The first contribution obviously equals zero for any ZFE.
6.2 ZFE
Bearing in mind that the ZFEFDEXT of Eq. (12) can be rewritten as
its MSE equals
with Tr{.} the trace operator and 1_{N}×1 an allone vector. This MSE is identical for all elements in the received block. The MSE of the ZFEZR can be written as
This MSE has a complex dependency on the noise of the subcarriers corresponding to Λ _{nz} and the correlation between the submatrices of F. However, it is clear that it lacks the detrimental term in \(\boldsymbol {\Lambda }_{\epsilon }^{1}\). As the diagonal elements of Λ _{ ε } approach zero, the MSE of the ZFETDEXT increases unboundedly while the MSE of the ZFEZR is not influenced. Therefore, the latter has a superior performance in the presence of spectral (closeto) zeros.
6.3 MMSE
The MSE of MMSE equalizers has a contribution stemming from the inexact channel equalization as well as a noise contribution. Both will now be analysed for the MMSEFDEXT and the MMSEZR.
6.3.1 Signal contribution
For the MMSEFDEXT, the signal contribution to the MSE equals
where the approximation is valid in case of spectral (closeto) zeros and for high SNR values, i.e. small σ _{n}, so that the following relations hold:
and
From Eq. (32), it is seen that part of the information is irrevocably lost due to Eq. (34), leading to an irreducible error. If K=1 (only one spectral zero), this MSE contribution is identical for all elements of the block and equal to M ^{−1}; otherwise, it is dependent on the correlation between the rows of F _{C}.
For the MMSEZR, the signal contribution to the MSE can be written as
in which the approximation is valid for high SNR values, i.e. small σ _{n}.
Summarizing: in case the elements of Λ _{ ε } are (closeto) zero, the MSE due to inexact channel equalization decreases as the SNR increases. For the MMSEFDEXT, this MSE hits a lower bound for low noise levels. In the case of the MMSEZR, there is no such lower bound, implying that this equalizer has more benefit from a higher SNR. The reason for this difference is that the information stored at the corresponding subcarriers is irrevocably lost for the MMSEFDEXT, while it can be recovered by the MMSEZR, and the quality of this recovered signal improves as the SNR increases.
6.3.2 Noise contribution
For the MMSEFDEXT, the noise contribution to the MSE equals
This MSE contribution is again identical for all elements in the transmitted block. Substituting Eqs. (24) and (25) and taking into account the definition of Λ _{nz} and Λ _{ ε }, Eq. (36) can be rewritten as a function of the spectral responses \(\phantom {\dot {i}\!}\lambda _{\mathrm {e}_{\mathrm {i}}}\):
Spectral zeros do not contribute to the MSE here. Spectral closetozeros do contribute, however, and dominate at high SNR values, i.e. for small values of σ _{n}. This follows from the behaviour of the function \(\phantom {\dot {i}\!}\sigma _{\mathrm {n}}^{2} \frac {\lambda ^{H}_{\mathrm {e}_{\mathrm {i}}}}{\lambda ^{\mathcal {H}}_{\mathrm {e}_{\mathrm {i}}} \lambda _{\mathrm {e}_{\mathrm {i}}} + \sigma _{\mathrm {n}}^{2}} \left (\frac {\lambda ^{H}_{\mathrm {e}_{\mathrm {i}}}}{\lambda ^{\mathcal {H}}_{\mathrm {e}_{\mathrm {i}}} \lambda _{\mathrm {e}_{\mathrm {i}}} + \sigma _{\mathrm {n}}^{2}}\right)^{\mathcal {H}}\), which is shown in Fig. 8. For large values of σ _{n}, this function is small because the MMSE equalizer prevents noise enhancement. Obviously, it is also small for extremely small values of σ _{n}. It reaches a maximum at an in between point, more specifically for \(\phantom {\dot {i}\!}\sigma _{\mathrm {n}}=\lambda _{\mathrm {e}_{\mathrm {i}}}\).
For the MMSEZR, the noise contribution to the MSE equals
It is not trivial to give a quantitative description of this contribution to the MSE. Obviously, in the case of a spectral zero, this MSE contribution will be larger than for the case of the MMSEFDEXT. However, with increasing SNR, i.e. decreasing values of σ _{n}, this contribution will go down rapidly. For spectral closetozeros, the situation is even more favourable, especially at higher SNR values, because the dominant contributions from Λ _{ ε }, as described above, are not present here.
When looking at both the signal and the noise contributions to the MSE, it can be concluded that above a certain SNR threshold, the MMSEZR is expected to perform better than the MMSEFDEXT. Simulations have shown that for realistic scenarios this SNR threshold is typically somewhere between 10 and 30 dB.
To illustrate this with an example, Fig. 9 shows the value of the MSE contributions, averaged over the block, for the MMSEFDEXT and the MMSEZR, for the channel ‘ h _{1}’, used before. The presence of a closetozero starts dominating the MSE contribution of the noise for the MMSEFDEXT around SNR =50 dB. The contribution of the inexact channel equalization of the MMSEFDEXT tends to saturate, but eventually σ _{n} becomes low enough such that the approximation of Eq. (34) no longer holds.
References
S Weinstein, P Ebert, Data transmission by frequencydivision multiplexing using the discrete Fourier transform. Commun. Technol. IEEE Trans.19(5), 628–634 (1971). doi:10.1109/TCOM.1971.1090705.
A Peled, A Ruiz, in Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP ’80, 5. Frequency domain data transmission using reduced computational complexity algorithms, (1980), pp. 964–967. doi:10.1109/ICASSP.1980.1171076.
JAC Bingham, Multicarrier modulation for data transmission: an idea whose time has come. Commun. Mag. IEEE. 28(5), 5–14 (1990). doi:10.1109/35.54342.
N LaSorte, WJ Barnes, HH Refai, in Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE. The history of orthogonal frequency division multiplexing, (2008), pp. 1–5. doi:10.1109/GLOCOM.2008.ECP.690.
SB Weinstein, The history of orthogonal frequencydivision multiplexing [history of communications]. Commun. Mag. IEEE. 47(11), 26–35 (2009). doi:10.1109/MCOM.2009.5307460.
H Sari, G Karam, I Jeanclaude, Transmission techniques for digital terrestrial tv broadcasting. Commun. Mag. IEEE. 33(2), 100–109 (1995). doi:10.1109/35.350382.
T Walzman, M Schwartz, Automatic equalization using the discrete frequency domain. Inform. Theory IEEE Trans.19(1), 59–68 (1973). doi:10.1109/TIT.1973.1054952.
D Falconer, SL Ariyavisitakul, A BenyaminSeeyar, B Eidson, Frequency domain equalization for singlecarrier broadband wireless systems. Commun. Mag. IEEE. 40(4), 58–66 (2002). doi:10.1109/35.995852.
F Pancaldi, G Vitetta, R Kalbasi, N AlDhahir, M Uysal, H Mheidat, Singlecarrier frequency domain equalization. Signal Process. Mag. IEEE. 25(5), 37–56 (2008). doi:10.1109/MSP.2008.926657.
B Muquet, Z Wang, GB Giannakis, M de Courville, P Duhamel, Cyclicprefixing or zero padding for wireless multicarrier transmissions?Commun. IEEE Trans.50(12), 2136–2148 (2002). doi:10.1109/TCOMM.2002.806518.
A Scaglione, GB Giannakis, S Barbarossa, Redundant filterbank precoders and equalizers. i. unification and optimal designs. Signal Process. IEEE Trans.47(7), 1988–2006 (1999). doi:10.1109/78.771047.
J Wang, J Song, ZX Yang, L Yang, J Wang, Frames theoretic analysis of zeropadding ofdm over deep fading wireless channels. Broadcasting IEEE Trans.52(2), 252–260 (2006). doi:10.1109/TBC.2006.872993.
XG Xia, Precoded and vector ofdm robust to channel spectral nulls and with reduced cyclic prefix length in single transmit antenna systems. Commun. IEEE Trans.49(8), 1363–1374 (2001). doi:10.1109/26.939855.
YP Lin, SM Phoong, in Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP ’03). 2003 IEEE International Conference on, 4. MMSE OFDM and prefixed single carrier systems: BER analysis (Hong Kong, Hong Kong, 2003), pp. 229–324.
GB Giannakis, Filterbanks for blind channel identification and equalization. Signal Process. Lett. IEEE. 4(6), 184–187 (1997). doi:10.1109/97.586044.
Z Wang, X Ma, GB Giannakis, in Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 IEEE, 2. Optimality of singlecarrier zeropadded block transmissions, (2002), pp. 660–6642. doi:10.1109/WCNC.2002.993346.
B Muquet, M de Courville, GB Giannakis, Z Wang, P Duhamel, in Acoustics, Speech, and Signal Processing, 2000. ICASSP ’00. Proceedings. 2000 IEEE International Conference on, 5. Reduced complexity equalizers for zeropadded OFDM transmissions, (2000), pp. 2973–29765. doi:10.1109/ICASSP.2000.861158.
B Muquet, M de Courville, P Dunamel, G Giannakis, in Communications, 2000. ICC 2000. 2000 IEEE International Conference on, 2. OFDM with trailing zeros versus OFDM with cyclic prefix: links, comparisons and application to the HiperLAN/2 system, (2000), pp. 1049–10532. doi:10.1109/ICC.2000.853658.
C Tepedelenlioğlu, Q Ma, in Global Telecommunications Conference, 2005. GLOBECOM ’05. IEEE, 6. On the performance of linear equalizers for block transmission systems, (2005), pp. 5–3896. doi:10.1109/GLOCOM.2005.1578499.
C Tepedelenlioğlu, in Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP ’03). 2003 IEEE International Conference on, 4. Low complexity linear equalizers with maximum multipath diversity for zeropadded transmissions, (2003), pp. 636–94. doi:10.1109/ICASSP.2003.1202723.
C Tepedelenlioğlu, Maximum multipath diversity with linear equalization in precoded OFDM systems. Inform. Theory, IEEE Trans.50(1), 232–235 (2004). doi:10.1109/TIT.2003.821987.
GH Golub, CFV Loan, Matrix computations, 3rd edn. (Johns Hopkins University Press, Baltimore, Maryland, USA, 1996).
JG Proakis, Digital communication, 2nd edn. (McGrawHill, McGrawHill of New York, New York, USA, 1989).
IEEE, IEEE Std 802.11a1999(R2003) Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, Highspeed Physical Layer in the 5GHz band. The Institute of Electrical and Electronics Engineers, Inc. New York, NY 100165997, USA (2003).
International Telecommunications Union (ITU), Rec. ITUR M.1225, Guidelines for evaluation of radio transmission technologies for IMT2000. International Telecommunication Union (ITU) Geneva, Switzerland (1997).
Acknowledgements
The authors are with the Department of Electrical Engineering (ESAT) and iMinds Future Health department, KU Leuven, Belgium. This research was carried out at ESAT, KU Leuven, in the frame of KU Leuven Research Council CoE EF/05/006 ‘Optimization in Engineering’ (OPTEC) and PFV/10/002 (OPTEC), Concerted Research Action GOAMaNet, the Belgian Programme on Interuniversity Attraction Poles initiated by the Belgian Federal Science Policy Office IUAP P7/19 ‘Dynamical systems, control and optimization’ (DYSCO) 20122016 and IWT Project ‘PHysical layer and Access Node TEchnology Revolutions: enabling the next generation broadband network’ (PHANTER).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The text was developed by the corresponding author, with reviewing and corrections by the second author. Both authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Cuypers, G., Moonen, M. Frequencydomain equalizers with zero restoration for zeropadded block transmission with high SNR. J Wireless Com Network 2016, 101 (2016). https://doi.org/10.1186/s1363801605917
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1363801605917