 Research
 Open access
 Published:
Iterative equalization for OFDM systems over wideband MultiScale MultiLag channels
EURASIP Journal on Wireless Communications and Networking volume 2012, Article number: 280 (2012)
Abstract
OFDM suffers from intercarrier interference (ICI) when the channel is time varying. This article seeks to quantify the amount of interference resulting from wideband OFDM channels, which are assumed to follow the multiscale multilag (MSML) model. The MSML channel model results in full channel matrices both in the frequency and time domains. However, banded approximations are possible, leading to a significant reduction in the equalization complexity. Measures for determining whether a timedomain or frequencydomain approach should be undertaken are provided based on the interference analysis, and we propose to use the conjugate gradient (CG) algorithm to equalize the channel iteratively. The suitability of a preconditioning technique, that often accompanies the CG method to accelerate the convergence, is also discussed. We show that in order for the diagonal preconditioner to function properly, optimal resampling is indispensable.
Introduction
With many desirable properties such as a high spectral efficiency and inherent resilience to the multipath dispersions of frequencyselective channels, the orthogonal frequency division multiplexing (OFDM) technology shows attractive features to wireless radio applications[1]. OFDM relies on the assumption that the channel stays constant within at least one OFDM symbol period. When Doppler effects due to temporal channel variation cannot be ignored, this assumption does not hold any more since the communication channel becomes time varying. The Doppler effects corrupt the orthogonality among OFDM subcarriers by inducing nonnegligible intercarrier interference (ICI)[2], and can therefore severely deteriorate the system performance. For traditional terrestrial radio systems, compensation of ICI in channel equalization has widely been researched for narrowband systems. Due to the small relative signal bandwidth (actual bandwidth divided by the center frequency) of narrowband systems, the Doppler effects can be modeled primarily by frequency shifts[3, 4], in which case it is reasonable to assume that each OFDM subcarrier experiences a statistically identical frequency offset[2]. Consequently, the effective channel matrix of a narrowband OFDM system in the presence of Doppler can be approximated as banded. Efficient equalization schemes for such a banded channel matrix have been studied in, e.g.,[5–7].
In a wideband system, where the relative signal bandwidth is large, the Doppler effects should be more appropriately modeled as scalings of the signal waveform[3, 4]. Wideband systems arise in, e.g., underwater acoustic (UWA) systems or wideband terrestrial radio frequency systems such as ultra wideband (UWB). Due to multipath, a wideband linear timevarying (LTV) channel can be more accurately described by a multiscale multilag (MSML) model[3, 8]. Many signaling schemes have been studied for wideband systems. For instance,[9, 10] consider directsequence spread spectrum (DSSS). Recently, the use of OFDM for UWA or UWB has received considerable attention. To counteract the scaling effect due to Doppler,[11] proposes a multiband OFDM system such that within each band, the narrowband assumption can still be valid. More commonly, many works assume a singlescale multilag (SSML) model for the wideband LTV channel. Based on the SSML assumption, after a resampling operation the channel can be approximated by a timeinvariant channel but subject to a carrier frequency offset (CFO)[12, 13]. However, since the channel should be more accurately described by an MSML model, determining the optimal resampling rate is not trivial[14].
In this article, we consider OFDM transmission based on an MSML model. The resulting channel, which is a full matrix in the presence of Doppler, will be equalized by means of the conjugate gradient (CG) algorithm[15], whose performance is less sensitive to the condition of the channel matrix than, e.g., a leastsquares approach. On the other hand, the convergence rate of CG is inversely proportional to the channel matrix condition number. This is especially of significance if a truncated CG is to be used in practice, which halts the algorithm after a limited number of iterations in order to reduce the overall complexity. Therefore, it is desired that the channel matrix is wellconditioned to ensure a fast convergence. To this end, preconditioning techniques can be invoked to enforce the eigenvalues of the channel matrix to cluster around one[16]. To achieve a balance between performance and complexity, we restrict the preconditioner to be a diagonal matrix, whose diagonal entries can be designed by following the steps given in[17]. We notice that a circulant preconditioner in the time domain was introduced in[18], which is equivalent to a diagonal preconditioner in the frequency domain. This preconditioner is introduced based on a basis expansion model (BEM), which is often used to approximate the channel’s timevariation for a narrowband system. For a wideband system as considered in this article, it can be shown that this preconditioner in the frequency domain is equal to the inverse of the diagonal entries of the frequencydomain channel matrix.
What is not considered in[17, 18] is the resampling operation at the receiver, which is an indispensable and crucial step for wideband LTV channels. Different from the trivial resampling scheme for SSML channel models, an optimum resampling method is proposed in[14] for MSML channels, which aims at minimizing the average error of approximating the MSML channel by an SSML model. This article studies the resampling from a preconditioning point of view. It is observed that if the major channel energy is located on the offdiagonals of the channel matrix, a diagonal preconditioner will deteriorate the channel matrix condition rather than improve it, thereby reducing the convergence rate of CG instead of increasing it as opposed to the claim of[17]. The energy distribution of the channel matrix is governed by the resampling. Different from[14], which only considers rescaling the received signal, and[19], which considers both rescaling and frequency synchronization, this article will show that for OFDM systems, all these three resampling parameters can have a significant impact on the system performance (i.e., rescaling, frequency synchronization and time synchronization). More specifically, we will extend the results of[19, 20] by jointly optimizing these three resampling parameters both in the frequency domain and the time domain.
Notation: Upper (lower) boldface letters stand for matrices (vectors); superscripts T, H, and ∗ denote transpose, Hermitian transpose and conjugate transpose, respectively; we reserve j for the imaginary unit, <k> and ⌈k⌉ for integer rounding and ceiling of a number k, ∥x∥_{2} for the two norm of the vector x, ∥A∥_{Fro} for the Frobenius norm of the matrix A, [A]_{k,m} for the (k,m)th entry of the matrix A; diag(x) for a diagonal matrix with x on its main diagonal, and ⊙ for the Hadamard product of two matrices.
System model based on an MSML channel
Continuous data model
Suppose that the baseband transmit signal s(t) consists of K subcarriers, and can be written as
where the data symbol b_{ k } is modulated on the k th subcarrier f_{ k }=k Δf, for k = 0,1,…,K−1, with Δf being the OFDM subcarrier spacing. With T = 1/(k Δf), KT is the effective duration of an OFDM symbol. The cyclic prefix and postfix are given as T_{pre} and T_{post}, respectively. The cyclic prefix is assumed to be longer than the delay spread and the cyclic postfix is long enough to ensure signal completeness in case of scaling, which will be defined later on. The rectangular pulse u(t) is defined to be 1 within t∈[−T_{pre},KT + T_{post}] and 0 otherwise. Prior to transmission, s(t) is upconverted to passband, yielding\left(\right.separators="">\n \n \n \n s\n \n \u0304\n \n (\n t\n )\n =\n \u211c\n {\n s\n (\n t\n )\n \n \n e\n \n \n j\n 2\n \Pi \n \n \n f\n \n \n c\n \n \n t\n \n \n }\n \n, where f_{ c }denotes the carrier frequency. With sufficient cyclic extensions, the interference form adjacent OFDM symbols can be neglected and hence we are allowed to consider an isolated OFDM symbol in this article without loss of generality. Although this article discusses the scenario when cyclic extensions are used, the analysis can be directly applied to zero padding OFDM (ZPOFDM) with minor modifications.
The considered signal is transmitted over a wideband LTV channel, which is assumed to comprise multiple resolvable paths. The l th path can mathematically be characterized by the following three parameters:\left(\right.separators="">\n \n \n \n \n \n h\n \n \u0304\n \n \n \n l\n \n \n \n, the path gain; v_{ l }, the radial velocity which is uniquely determined by the incident angle of this path; and τ_{ l }, the delay due to the propagation time. In compliance with the wideband assumption, the received signal resulting from the l th path is given by\left(\right.separators="">\n \n \n \n \n \n h\n \n \u0304\n \n \n \n l\n \n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \n \n s\n \n \u0304\n \n (\n \n \n \alpha \n \n \n l\n \n \n (\n t\n \u2212\n \n \n \tau \n \n \n l\n \n \n )\n )\n \n, where\left(\right.separators="">\n \n \n \n \alpha \n \n \n l\n \n \n =\n \n \n c\n +\n \n \n v\n \n \n l\n \n \n \n \n c\n \u2212\n \n \n v\n \n \n l\n \n \n \n \n \u2248\n 1\n +\n \n \n 2\n \n \n v\n \n \n l\n \n \n \n \n c\n \n \n \n is the scaling factor with c the speed of the communication medium (normally c ≫ v_{ l }) and\left(\right.separators="">\n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \n is added as a normalization factor. Depending on the sign of v_{ l }, the received signal waveform via this path can be either dilated (a negative v_{ l }) or compressed (a positive v_{ l }).
With a collection of L + 1 paths, the actual received signal\left(\right.separators="">\n \n \n \n y\n \n \u0304\n \n (\n t\n )\n \n is given by
where\left(\right.separators="">\n \n \n \n w\n \n \u0304\n \n (\n t\n )\n \n stands for the passband noise. In the above, if there exist at least two paths l and l’, for which\left(\right.separators="">\n \n \n \n \alpha \n \n \n l\n \n \n \u2260\n \n \n \alpha \n \n \n \n \n l\n \n \n \u2032\n \n \n \n \n \n and/or\left(\right.separators="">\n \n \n \n \tau \n \n \n l\n \n \n \u2260\n \n \n \tau \n \n \n \n \n l\n \n \n \u2032\n \n \n \n \n \n, the channel exhibits a multiscale multilag (MSML) character. For a practical channel, it is realistic to assume that α_{ l }∈[1,α_{max} and τ_{ l }∈[0,τ_{max}^{a}, where α_{max} ≥ 1 and τ_{max} ≥ 0 determines the scale spread and delay spread, respectively. Note that in many prior works[12, 13], the approximation\left(\right.separators="">\n \n \n \n \alpha \n \n \n l\n \n \n \u2248\n \n \n \alpha \n \n \n \n \n l\n \n \n \u2032\n \n \n \n \n \n for any l≠l^{′} is adopted for the sake of analytical ease, which gives rise to an SSML model.
The equivalent complex baseband received signal of\left(\right.separators="">\n \n \n \n y\n \n \u0304\n \n (\n t\n )\n =\n \u211c\n {\n y\n (\n t\n )\n \n \n e\n \n \n j\n 2\n \Pi \n \n \n f\n \n \n c\n \n \n t\n \n \n }\n \n is given by
where w(t) stands for the baseband noise. By substituting (1) in the above, we can rewrite y(t) as
where
which stands for the timevarying channel frequency response seen by the k th subcarrier. From the definition of h_{ k }(t), we notice that the k th subcarrier experiences a frequency offset of (α_{ l }−1)(f_{ c } + f_{ k }) over the l th path.
Remark 1
The cyclic prefix is assumed to be longer than the delay spread and the cyclic postfix has a duration long enough to ensure signal continuity in the observation window for t∈[0,KT]. Specifically, it is required that u(α_{ l }t−α_{ l }τ_{ l })=1 within this window for all paths. In other words, because u(α_{ l }t−α_{ l }τ_{ l }) gives a time support on\left(\right.separators="">\n \n t\n \u2208\n \n \n \n \n \u2212\n \n \n T\n \n \n pre\n \n \n +\n \n \n \alpha \n \n \n l\n \n \n \n \n \tau \n \n \n l\n \n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n ,\n \n \n KT\n +\n \n \n T\n \n \n post\n \n \n +\n \n \n \alpha \n \n \n l\n \n \n \n \n \tau \n \n \n l\n \n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \n \n \n, we should then always satisfy\left(\right.separators="">\n \n \n \n \u2212\n \n \n T\n \n \n pre\n \n \n +\n \n \n \alpha \n \n \n l\n \n \n \n \n \tau \n \n \n l\n \n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \u2264\n 0\n \n and also\left(\right.separators="">\n \n \n \n KT\n +\n \n \n T\n \n \n post\n \n \n +\n \n \n \alpha \n \n \n l\n \n \n \n \n \tau \n \n \n l\n \n \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \u2265\n KT\n \n for any l∈{0,1,…,L}. It leads to
When the above conditions are satisfied, we are allowed to drop the notation of the rectangular pulse u(t) embedded in h_{ k }(t) in the sequel for the sake of notational ease.
Discrete data model
For MSML channels, discretizing the received signal and achieving time/frequency synchronization is not trivial[12, 14]. We illustrate such difficulty in Figure1, where we assume the transmit signal propagates via three paths. Since the received symbol is the summation of these three paths, it invites the following questions:

1.
Which point should we consider as the starting point of the OFDM symbol (time synchronization)?

2.
What sampling rate should we adopt to discretize the received signal over MSML channels (rescaling)?

3.
What frequency shift should we apply to remove the residual carrier frequency offset (frequency synchronization)?
These problems can mathematically be described by determining β, ϕ and σ in the following expression
where β is a positive number within [1,α_{max}] and βT represents the sampling rate at the receiver; σ is the time shift factor, which is used to represent time synchronization; and likewise, ϕ is the phase shift factor used for frequency synchronization.\left(\right.separators="">\n \n \n \n \n \n 1\n \n \n \beta \n \n \n \n \n \n is a normalization factor. Later on, we will show that a different choice of (β,ϕ,σ) can influence the energy distribution of the channel matrix significantly. For the moment, we leave the values of these parameters open to allow for a general treatment of the problems. It is clear that when (β,ϕ,σ) = (1,0,0), there is no resampling operation carried out.
After resampling, the noiseless sample obtained at the n th time instance in the time domain is given by (see Appendix 2 for the detailed derivation)
where we use
to denote the normalized carrier frequency and
to denote the normalized delay of the l th path; and the discrete channel coefficient is given by
In (9), the term\left(\right.separators="">\n \n \n \n e\n \n \n j\n 2\n \Pi \n \omega \n \n \n (\n \n \n \alpha \n \n \n l\n \n \n \u2212\n 1\n +\n \varphi \n )\n \n \n \beta \n \n \n \n \n n\n \n \n K\n \n \n \n \n \n corresponds to the residual CFO related with the l th path after resampling; the term\left(\right.separators="">\n \n \n \n e\n \n \n \u2212\n j\n 2\n \Pi \n f\n \n \n \alpha \n \n \n l\n \n \n (\n \n \n \lambda \n \n \n l\n \n \n +\n \sigma \n )\n \n \n k\n \n \n K\n \n \n \n \n \n corresponds to the phase changes due to the time shift along the l th path; and the summation\left(\right.separators="">\n \n \n \n \u2211\n \n \n k\n =\n 0\n \n \n K\n \u2212\n 1\n \n \n \n \n b\n \n \n k\n \n \n \n \n e\n \n \n j\n 2\n \Pi \n \n \n \n \n \alpha \n \n \n l\n \n \n \n \n \beta \n \n \n \n \n nk\n \n \n K\n \n \n \n \n \n is the adapted version of the transmitted OFDM signal due to the channel time variation in the l th path.
Let us now stack the received samples\left(\right.separators="">\n \n \n \n r\n \n \n n\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n, for n = 0,…,K−1, into a vector\left(\right.separators="">\n \n \n \n r\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n [\n \n \n r\n \n \n 0\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n ,\n \u2026\n ,\n \n \n r\n \n \n K\n \u2212\n 1\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n ]\n \n \n T\n \n \n \n, and similarly let b = [b_{0},…,b_{K−1}]^{T}. In the noiseless case, it follows that
where F_{ α }denotes a fractional normalized discrete Fourier transform (DFT) matrix, whose (m,k)th entry is defined as
Obviously, F_{1} reduces to a regular normalized DFT matrix. In addition,
and
where the superscript (β,ϕ) in\left(\right.separators="">\n \n \n \n D\n \n \n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n and (σ) in\left(\right.separators="">\n \n \n \n \u22c0\n \n \n l\n \n \n (\n \sigma \n )\n \n \n \n reflects the dependence on the specific resampling parameters. This convention will hold throughout this article.
Interference analysis
Normally speaking, equalization of an OFDM channel is implemented in the frequency domain. To this end, the received signal\left(\right.separators="">\n \n \n \n r\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n is first transformed into the frequency domain by means of the DFT, which in the absence of noise yields
where\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n stands for the frequencydomain (FD) channel matrix, which is defined as
with\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n =\n \n \n F\n \n \n 1\n \n \n \n \n D\n \n \n \n \n \lambda \n \n \n l\n \n \n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n \n F\n \n \n \n \n \alpha \n \n \n l\n \n \n /\n \beta \n \n \n H\n \n \n \n being its l th component, whose (m, k)th entry is specified as
where\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F1\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n \beta \n \n \n \beta \n \n \n \n and\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F2\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n 1\n +\n \varphi \n \n \n \beta \n \n \n \omega \n \n with\left(\right.separators="">\n \n sinc\n (\n t\n )\n =\n \n \n sin\n (\n \Pi \n t\n )\n \n \n \Pi \n t\n \n \n \n.
It is obvious from (16) that in the absence of Dopper effects, i.e., α_{ l }= 1 for l = 0,1,…,L, no rescaling and frequency synchronization is necessary, hence β = 1 and ϕ = 0, which leads to a diagonal\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n 1\n ,\n 0\n )\n \n \n \n with\left(\right.separators="">\n \n \n \n \n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n \n \n \n m\n ,\n k\n \n \n =\n \n \n \delta \n \n \n m\n \u2212\n k\n \n \n \n. In another special case where α_{ l }≡ α for l = 0,1,…,L, we can also enforce a diagonal\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n by letting β = α and ϕ = 1−α, a scenario considered in, e.g.,[13]. For a realistic wideband LTV channel, however, the channel energy distribution in\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n is governed by a Dirichlet kernel, where the center of this Dirichlet kernel is offset by
Clearly, such an offset is not only dependent on the Doppler spread α and the carrier frequency f_{ c }, but also on the subcarrier frequency f_{ k }= k Δf. The dependence of the signal energy offset on the subcarrier index is unique to wideband channels, and is also referred to as nonuniform Doppler shifts in[13]. In contrast, the frequency offset for narrowband channels is statistically identical for all the subcarriers[2].
The Dirichlet kernel in (16) also suggests that the signal energy is mostly concentrated in subcarrier\left(\right.separators="">\n \n k\n +\n \n \n \Delta \n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n and its nearby subcarriers, and decays fast in subcarriers farther away. To appreciate how fast the signal energy decays, let us introduce\left(\right.separators="">\n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n to quantify the number of subcarriers where most of the energy of b_{ k } is located, which can thus be viewed as the bandwidth of\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n along its k th column.\left(\right.separators="">\n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n is obtained as the smallest B for which
where γ is a positive threshold no larger than 1. In the left plot of Figure2, the relationship between\left(\right.separators="">\n \n \n \n max\n \n \n k\n \n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n and γ for the case β = 1 and α = 0 (no resampling and frequency synchronization) is plotted. It is clear that most of the signal energy of b_{ k }is captured within a limited bandwidth. For example, with a bandwidth\left(\right.separators="">\n \n \n \n max\n \n \n k\n \n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n 1\n ,\n 0\n )\n \n \n (\n k\n )\n =\n 5\n \n, roughly 98 % of the signal energy of b_{ k } is captured. Notably, this bandwidth is almost independent of ξ_{l,F1}and ξ_{l,F2} as suggested by the left plot of Figure2.
Since each\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n is roughly banded, it is therefore reasonable to approximate\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n, which is a weighted sum of different\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n matrices, also as banded. As an example, we plot in Figure3 the structure of\left(\right.separators="">\n \n \n \n H\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n, where we assume that there are in total two paths. Obviously, the approximate bandwidth of\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n at the k th column, denoted as\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n, is
which is independent of σ. We refer the reader to Figure3 for the physical meaning of the notations. It is important to underscore that since the bandwidth\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n is dependent on the subcarrier index k, the boundaries of the band are not parallel to each other as in the narrowband case. A banded approximation of the channel matrix is crucial to many lowcomplexity equalizers, e.g.,[5–7, 18]. The equalizer considered in this article will also adopt this approximation to reduce the complexity. More specifically, we first define a matrix\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n, whose (m k)th entry is equal to 1 if\left(\right.separators="">\n \n \n \n min\n \n \n l\n \n \n \n \n k\n +\n \n \n \Delta \n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \u2212\n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n \n \u2264\n m\n \u2264\n \n \n max\n \n \n l\n \n \n \n \n k\n +\n \n \n \Delta \n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n (\n k\n )\n \n \n +\n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n \n \n, and 0 otherwise, and we then consider the matrix
as the banded approximation of\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n.
With the banded approximation, let us rewrite (14) as
where\left(\right.separators="">\n \n \n \n \n \n v\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \u2212\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n b\n \n.
The above analysis can also be applied in the time domain in an analogous manner. See Appendix 3 for the details. Here we only want to highlight that, different from the energy distribution in the FD channel matrix which is influenced by the rescaling factor β and the phaseshift factor ϕ[c.f. ξ_{l,F1} and ξ_{l,F2}in (16)], the energy distribution in the TD channel matrix is affected by the rescaling factor β and the timeshift factor σ[c.f. ξ_{l,T1} and ξ_{l,T2} in (39)]. However, similarly as the FD channel matrix, we can also understand from the right subplot of Figure2 that\left(\right.separators="">\n \n \n \n H\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n \n is roughly banded along the l th path in the time domain, and so is the overall timedomain channel matrix\left(\right.separators="">\n \n \n \n H\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n.
Channel equalization scheme
Let us now focus on the channel frequencydomain equalization, which is depicted in Figure4. In this figure, it is clear that, prior to the equalization, we propose an optimum resampling operation to achieve\left(\right.separators="">\n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n =\n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n, which is different from[14, 19] as mentioned previously. Specifically, the resampling method proposed in[14] only considers the rescaling parameter β while[19] ignores the timeshift parameter σ. Afterwards, the banded matrix\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n \n is adopted to approximate\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n \n according to the approach mentioned in the last section. Our banded method induces a nonparallel bandwidth structure which is different from the banded approach used in narrowband OFDM systems[5–7, 21]. In order to speed up the convergence of the iterative equalization, we then design a diagonal preconditioner to improve the condition of this banded matrix. It is noteworthy here that our preconditioner design is adapted from[17, 18] to enhance its suitability for our MSML scenario. Finally, iterative equalization is proposed on the preconditioned channel matrix. Although we choose the CG method in this article, other iterative methods can also be applied, such as the LSQR algorithm[22].
Additionally, we would like to highlight that just as a singlecarrier channel can be equalized in the frequency domain, it is also possible to equalize an OFDM channel in the time domain. Due to the similarity, we again refer the reader to Appendix 3 for a detailed mathematical derivation of the timedomain method. The question in which domain the wideband channel should be equalized, shall be addressed in the following section.
Iterative equalization
To better motivate the other components of our equalization scheme, we first introduce the channel equalization method itself. A zeroforcing equalizer in the frequency domain is considered, given by
where\left(\right.separators="">\n \n \n \n b\n \n \u0302\n \n \n is the obtained estimate of b. Because the original channel matrix\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n is a full matrix, its inversion inflicts a complexity of\left(\right.separators="">\n \n O\n (\n \n \n K\n \n \n 3\n \n \n )\n \n and is thus not desired for a practical system. To lower the complexity,\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n has been replaced by the banded approximation\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n in (22).
Besides, the matrix inversion in (22) will be implemented iteratively using the CG algorithm. An advantage of using CG rather than inverting the matrix directly is that the resulting data estimates yielded by CG are always constrained in the Krylov subspace, making its performance less susceptible to the spectral distribution of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n. In practice, a truncated CG, which halts the algorithm after a limited number of iterations, is desired to further reduce the complexity. It is wellknown that the convergence of the CG algorithm can be accelerated by applying preconditioning on\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n[16, 17, 23]. With C_{F}denoting such a preconditioner, the I/O relationship given in (21) in the noiseless case can be rewritten as
from which an estimate of\left(\right.separators="">\n \n \n \n b\n \n \n C\n \n \n =\n \n \n C\n \n \n F\n \n \n \u2212\n 1\n \n \n b\n \n is first obtained by applying CG on the preconditioned matrix\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n. Afterwards,\left(\right.separators="">\n \n \n \n b\n \n \u0302\n \n =\n \n \n C\n \n \n F\n \n \n \n \n \n \n b\n \n \u0302\n \n \n \n C\n \n \n \n is computed to obtain the final data estimates. For details about our CG equalization, see Appendix 4.
The optimal design of C_{F}can be exhaustive[23]. Inspirited by[17], we find our preconditioner by minimizing a cost function based on the Frobenius norm, which clusters most of the eigenvalues of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n around 1 with the exception of a few outliers. Further, observing that the design of C_{F} itself, as well as the operation of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n, inflicts an additional complexity, a common approach is to impose a sparse structure on C_{F}, e.g., diagonal[17] as
Diagonal preconditioning
In this section, we will show that the normal approach to design the diagonal preconditioner as described in[17] will not necessarily cluster eigenvalues around one. To realize this, let us consider the diagonal preconditioner C_{F,⋆} that minimizes the cost function in the Frobenius norm[17] given by
which leads to
where e_{ k } is the k th column of the identity matrix.
One problem of the above diagonal preconditioner designed by (25) is that the eigenvalues may, in some situations, tend to cluster around zero instead of one, with the consequence that the condition number of the preconditioned channel matrix increases considerably. To understand this, assume there exists a ε_{1}>0 such that
for k={0,1,…,K−1}. At the same time, assume there exists a ε_{0}>0 such that
for k∈{0,…,K−1}.
If we denote the k th eigenvalue of the preconditioned channel matrix\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n as μ_{ k }, (27) indicates that (for details see Appendix 5)
which means that all μ_{ k }’s lie inside a disk of radius\left(\right.separators="">\n \n \n \n K\n \n \n \n \n \epsilon \n \n \n 0\n \n \n \n centered around zero. Similarly, from (26) we have
which implies that all μ_{ k }’s at the same time lie inside a disk of\left(\right.separators="">\n \n \n \n K\n \n \n \n \n \epsilon \n \n \n 1\n \n \n \n centered around one. It is clear that if ε_{0}<ε_{1}, then minimizing\left(\right.separators="">\n \n \n \n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \u2212\n \n \n I\n \n \n K\n \xd7\n K\n \n \n \n \n \n \n Fro\n \n \n 2\n \n \n \n will at the same time minimize the Frobenius norm\left(\right.separators="">\n \n \n \n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n \n \n \n Fro\n \n \n 2\n \n \n \n itself, making the eigenvalues more clustered around zero rather than one.
With c_{F,k,⋆}defined in (25), we can show that
and
Obviously, if\left(\right.separators="">\n \n \n \n \n [\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n ]\n \n \n k\n ,\n k\n \n \n \n \n \n \n \n 2\n \n \n \n \n \n \u2211\n \n \n m\n =\n 0\n \n \n K\n \u2212\n 1\n \n \n \n \n \n \n [\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n ]\n \n \n m\n ,\n k\n \n \n \n \n \n \n \n 2\n \n \n \n, for k=0,…,K−1, then the optimal diagonal preconditioner will cluster the eigenvalues in a “wrong” area. This case arises when the sum of the offdiagonal power in each column is higher than the power on the diagonal. Such a situation could occur in multiscale channels where significant channel power is located on offdiagonal entries as we argued in the previous section (see Figure3 for instance). In the upperleft plot of Figure5, the eigenvalues of such a matrix, with and without preconditioning, are displayed on a complex plane. It can be seen that diagonal preconditioning indeed clusters the eigenvalues around zero rather than one.
To evaluate the impact of such a preconditioner on the convergence of CG, we compute the mean squared error (MSE) as
with\left(\right.separators="">\n \n \n \n \n \n b\n \n \u0302\n \n \n \n (\n i\n )\n \n \n \n being the result obtained at the i th iteration of our CG equalization as mentioned in Appendix 4. In the topright plot of Figure5, it is clear that the CG convergence with such a diagonal preconditioner is even worse than without any preconditioning. This illustrates that the diagonal preconditioning defined in (25) may not always yield a better performance than without preconditioning, as opposed to what is claimed in[17, 18]. Using a more complex structured preconditioner can avoid this, which is, however, not desired due to complexity and implementation considerations.
To alleviate this problem, we adapt the diagonal preconditioner in (24) and (25) as follows
where
In Section ‘Optimal resampling’, we will show how to enhance (32) with a higher probability by means of optimal resampling.
Optimal resampling
From the previous subsections, we understand that the effectiveness of a diagonal preconditioner depends on the energy distribution of the channel matrix. It is desired that the channel matrix should have most of its energy concentrated on the main diagonal. The analysis in Section ‘Discrete data model’ learns that the resampling operation (β ϕ σ) plays an important role in governing the energy distribution of the channel matrix, and so far we have left (β ϕ σ) open for choice. Recall that resampling is a standard step taken in many wideband LTV communication systems to compensate for the Doppler effect. For example, optimizing β is considered in[14], while β and ϕ are jointly optimized in[21]. In this sense, the optimal resampling proposed in this article can be considered as a generalization of[14, 21].
Next, we shall discuss how to jointly optimize the resampling parameters (β,ϕ,σ). Focusing on the FD matrix\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n, we desire\left(\right.separators="">\n \n \n \n \n \n \n \n \n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n \n \n k\n ,\n k\n \n \n \n \n \n \n 2\n \n \n \n \n \n \u2211\n \n \n m\n \u2260\n k\n \n \n \n \n \n \n \n \n \n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n \n \n m\n ,\n k\n \n \n \n \n \n \n 2\n \n \n \n for all k∈{0,1,…,K−1}. However, satisfying the above condition for each index k individually is expensive. As a relaxation, we practically seek\left(\right.separators="">\n \n \n \n \u2211\n \n \n k\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n \n \n k\n ,\n k\n \n \n \n \n \n \n 2\n \n \n \n \n \n \u2211\n \n \n k\n \n \n \n \n \u2211\n \n \n \n m\n \u2260\n k\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n \n \n m\n ,\n k\n \n \n \n \n \n \n 2\n \n \n .\n \n
To this end, let us denote the diagonal energy ratio as
and define our resampling operation by solving
which leads to the maximal ratio\left(\right.separators="">\n \n \n \n \rho \n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n \n. One can also explain this resampling as minimizing the total amount of ICI in the frequency domain.
Since the energy governing mechanism is determined by the sinc function as indicated in (16), we can equivalently rewrite (34) by only maximizing the diagonal energy of\left(\right.separators="">\n \n \n \n H\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n as
where again\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F1\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n \beta \n \n \n \beta \n \n \n \n and\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F2\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n 1\n +\n \varphi \n \n \n \beta \n \n \n \omega \n \n. It is noteworthy that all three parameters, β, ϕ and σ, play a role in (35), indicating that separately considering one or two parameters as in[14, 21] might lead to a local maximum.
To illustrate our resampling approach in the frequency domain, we consider the channel example specified in Table1, where we also compare the properties of the resampled FD channel (i.e., the condition number and diagonal power ratio of the channel matrix) with the original MSML FD channel. A geometric interpretation may help to understand our resampling operation since β rotates the FD matrix through\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F1\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n \beta \n \n \n \beta \n \n \n \n, ϕ shifts the FD matrix through\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n F2\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n 1\n +\n \varphi \n \n \n \beta \n \n \n \omega \n \n in (16), and σ influences the phase of each element in (35). The joint effect of these actions maximizes the matrix diagonal energy. The yielded resampling (β_{F,⋆}ϕ_{F,⋆}σ_{F,⋆})=(1.015,−0.015,−15.00) corresponds to a maximal diagonal power ratio\left(\right.separators="">\n \n \n \n \rho \n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n =\n 0\n .\n 9279\n \n. We underscore that the condition number is already significantly reduced, solely by the optimum resampling, from 4.26×10^{5}to 23.36. In comparison, the resampling method proposed in[14] yields (β ϕ σ)=(1.016,0,0) and\left(\right.separators="">\n \n \n \n \rho \n \n \n F\n \n \n (\n 1\n .\n 016\n ,\n 0\n ,\n 0\n )\n \n \n =\n 0\n .\n 3623\n \n. Its corresponding condition number is 432.78, which is larger than our condition number after resampling. This is not surprising since the criterion adopted in[14] focuses only on minimizing the aggregate errors between the multiscale channel and its singlescale approximation, which is different from our criterion.
In the lower plots of Figure5, we show the effectiveness of diagonal preconditioning applied to the resampled channel in Table1. It is clear that, after our resampling procedure, the diagonal preconditioner clusters the eigenvalues of the preconditioned FD channel matrix closer to one than without preconditioning, which further reduces the condition number from 23.36 to 7.17. In contrast, without optimal resampling, the preconditioner “wrongly” pushes the eigenvalues closer to zero. In this case, the matrix condition number increases from 4.26×10^{5} to 1.19×10^{6}, and hence the CG equalizer performs even worse than without preconditioning as shown in the top two plots of Figure5.
Similarly, we can show that optimal resampling can also improve the performance of the CG in the time domain, for which we just provide Table2 and Figure6 here due to space limitations. From them, we can make the same observations as from Table1 and Figure5 for the frequency domain case.
Frequencydomain or timedomain equalization?
In the previous sections, we showed that the equalization of an OFDM channel can be implemented in either the frequency or the time domain. With the CG algorithm specified in Appendix 4, it is clear that the cost of equalization in the frequency domain will be upperbounded by\left(\right.separators="">\n \n O\n (\n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n K\n )\n \n with\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n =\n \n \n max\n \n \n k\n \n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n for each CG iteration. Likewise, the cost of equalization in the time domain will be upperbounded by\left(\right.separators="">\n \n O\n (\n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n K\n )\n \n with\left(\right.separators="">\n \n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n =\n \n \n max\n \n \n m\n \n \n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \n. By assuming that the number of CG iterations is predetermined and identical in both domains, we can use the ratio\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n /\n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n \n as a criterion to choose in which domain the equalization will be realized in order to minimize the complexity.
However, the evaluation of\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n /\n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n \n is cumbersome and lacks the insight of the channel physics. For simplicity reasons, we equivalently consider the proportion given by
where we reasonably assume\left(\right.separators="">\n \n \n \n B\n \n \n rul\n \n \n =\n \n \n max\n \n \n l\n ,\n k\n \n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n k\n )\n \u2248\n \n \n max\n \n \n l\n ,\n m\n \n \n \n \n B\n \n \n T\n ,\n l\n \n \n (\n m\n )\n \n [see Figure2. One may argue that the above evaluation is still cumbersome. However, if a realistic channel allows us to assume, for all l∈{1,2,…,L}, that
which indicates that the Doppler scale spread is welllimited, it follows that\left(\right.separators="">\n \n \n \n max\n \n \n l\n ,\n k\n \n \n (\n \n \n \n \xi \n \n \n l\n ,\n F1\n \n \n \n k\n )\n \u226a\n 1\n \n and\left(\right.separators="">\n \n \n \n max\n \n \n l\n ,\n m\n \n \n (\n \n \n \n \xi \n \n \n l\n ,\n T1\n \n \n \n m\n )\n \u226a\n 1\n \n. In other words,\left(\right.separators="">\n \n \n \n \Delta \n \n \n F\n ,\n l\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n (\n k\n )\n \u2248\n \n \n \n \n \xi \n \n \n l\n ,\n F2\n \n \n \n \n \n and\left(\right.separators="">\n \n \n \n \Delta \n \n \n T\n ,\n l\n \n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n \n (\n m\n )\n \u2248\n \n \n \n \n \xi \n \n \n l\n ,\n T2\n \n \n \n \n \n, both of which are independent of the symbol index. With these assumptions, ε can further be simplified as
which suggests that if the maximum difference between the Doppler shifts of each path (i.e.,\left(\right.separators="">\n \n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n 1\n \n \n \beta \n \n \n \omega \n \n) is smaller than the maximum difference between the time shifts of each path (i.e., α_{ l }λ_{ l }), then equalization should be realized in the frequency domain; otherwise, a timedomain approach will be preferred. A similar conclusion has been made for narrowband systems[24], though its extension to wideband systems is not straightforward as shown above.
To illustrate the above idea, we again use the channel examples specified in Tables1 and2, respectively. We use B_{rul}=5 to roughly capture γ=98% of the channel energy in both domains where γ is introduced in (18). In this way, we have ε≈0.10<1 for the channel in Table1, while for the channel in Table2, we have ε≈2.00>1.
For both channels, we compare the equalization performance in different domains. OFDM with K=128 subcarriers using QPSK is transmitted and the receiver is assumed to have perfect channel knowledge. We examine the bit error rate (BER) results of our CG equalization with a fixed CG iteration number (e.g., i_{F,max}=i_{T,max}=100). We use different bandwidths for the banded approximation\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n \n and\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n T\n \n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n \n \n during the equalization and the values for\left(\right.separators="">\n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n and\left(\right.separators="">\n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n have also been given in Tables1 and2, respectively. After our optimal resampling in either domain, the CG equalization is carried out using the appropriate preconditioner design.
The left subplot of Figure7 plots the BER performance as a function of signaltonoise ratio (SNR) for Channel I. Note that (β_{F,⋆},ϕ_{F,⋆},σ_{F,⋆})=(1.015,−0.015,−15) and (β_{T,⋆},ϕ_{T,⋆},σ_{T,⋆})=(1.015,−0.016,0.00) for this channel. It can be seen that the performance of the FD equalizer (FDE) based on\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n \n outperforms the TD equalizer (TDE) based on\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n T\n \n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n \n \n using the same bandwidth\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n =\n \n \n B\n \n \n T\n \n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n \n \n. In other words, FDE is more attractive than TDE in this case.
The BER performance for Channel II is illustrated in the right subplot of Figure7, where the optimal resampling parameters are (β_{T,⋆},ϕ_{T,⋆},σ_{T,⋆})=(1.016,−0.021,−1) and (β_{F,⋆},ϕ_{F,⋆},σ_{F,⋆})=(1.016,−0.016,−3). In this case, it is evident that the TD equalizer is more appealing.
These observations made for the channels in Tables1 and2 confirm our metric ε for determining which domain is more suitable for channel equalization. Additionally, we like to point out that, in either domain, with a larger bandwidth the BER performance of our CG equalization will be increased.
Numerical results
In this section, we randomly generate two different types of wideband channels as specified in Table3: ε<1 (Case I) represents wideband LTV channels where the Doppler differences among the multipath are more pronounced than the delay differences; and ε>1 (Case II) is the case where the Doppler differences among the multipath are less pronounced than the delay differences. For all simulations, OFDM with K=128 subcarriers is considered with QPSK. The wideband channels are assumed to have L=5 paths, whose channel gains (i.e.,\left(\right.separators="">\n \n \n \n \n \n h\n \n \u0304\n \n \n \n l\n \n \n \n’s) are modeled to be identically and independently distributed. The path delay (τ_{ l }) is chosen as a random variable that has a uniform distribution within the range [0,τ_{max}]. Likewise, the path scale (α_{ l }) is chosen as a random variable that obeys a uniform distribution within the range [1,1 + α_{sp}] with α_{sp} the scale spread. For both cases, the receiver is assumed to have perfect channel knowledge and the cyclic extensions at the transmitter are T_{pre}=32T and T_{post}=10T which satisfy (6) and (7). In all simulations, a banded approximation of the channel matrix is adopted in both domains with the same bandwidth (e.g.,\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \n \n \beta \n \n \n F\n ,\n \u22c6\n \n \n ,\n \n \n \varphi \n \n \n F\n ,\n \u22c6\n \n \n )\n \n \n =\n \n \n B\n \n \n T\n \n \n (\n \n \n \beta \n \n \n T\n ,\n \u22c6\n \n \n ,\n \n \n \sigma \n \n \n T\n ,\n \u22c6\n \n \n )\n \n \n =\n 11\n \n).
In Figure8, the convergence of the CG equalization is plotted in terms of the bit error rate (BER) against the number of iterations at SNR=30 dB for Case I. Since ε<1, frequencydomain equalization (FDE) is carried out. It is clear that the receiver, which simply adopts a diagonal preconditioner in (25) without resampling, performs worst. The performance is already considerably improved if optimal resampling is applied. Moreover the use of our preconditioner given by (31) boosts the performance even further.
The proposed resampling and preconditioning method can also benefit from other Krylovbased algorithms. For instance, the LSQR algorithm exploiting a full channel matrix is studied in[18]. Note that[18] focuses on a narrowband LTV system where no resampling is required. Further, the preconditioner given in[18] is based on a truncated basis expansion model (BEM) which is usually used for the approximation of a narrowband timevarying channel. Because it is not clear whether such a truncated BEM is still suitable for a wideband LTV channel, in order to emulate a similar approach as in[18] for constructing the preconditioner, we utilize a (trivial) fullorder criticallysampled complex exponential BEM (the CCEBEM[25]) in the simulation. The preconditioner in[18] then boils down to the inverse of the diagonal of the frequencydomain channel matrix, which is obviously suboptimal in the Frobenius norm sense. Consequently, it is no surprise that directly applying the equalizer of[18] to wideband LTV channels yields a bad performance as shown in Figure8. In comparison, the LSQR algorithm benefiting from the optimal resampling and our preconditioner renders the fastest convergence rate and lowest BER amongst all the equalization schemes. Of course, such an improved BER performance is achieved by leveraging the full channel matrix at the cost of a higher complexity, compared to our proposed method using banded matrices.
Figure9 exhibits the BER versus SNR for the CGbased equalization schemes, where a truncated CG is used which halts at the 5th iteration. It can be seen in the figure that the equalizer leveraging the full channel matrix gives the best BER performance but inflicts more complexity. When using a banded channel matrix approximation, the frequencydomain approach performs much better than the timedomain approach because we have ε<1 for this type of channel. Additionally, the equalization approach in[14] is carried out and its performance is also shown in Figure9. As we discussed earlier, the resampling operation in[14] is solely focused on the rescaling parameter ignoring the impact of frequency and time synchronization, which is therefore suboptimal. Besides, the equalizer in[14] approximates the channel matrix to be diagonal (i.e., using a bandwidth of one for the banded matrices), and thus its performance becomes inferior in the presence of higher scale differences among the multipath as in the tested channel here.
The performance of the equalizers for Case II is depicted in Figure10, where the significance of optimal resampling and our adapted preconditioner is again illustrated just like in Figure8. Similarly, we can see that the LSQR algorithm in[18] also works well for this type of channel if optimal resampling and preconditioning are included.
Different from Case I, the channels of Case II are subject to a larger delay spread than a Doppler spread (i.e., ε>1). In this case, a timedomain equalizer will be more effective than its frequencydomain counterpart as validated in Figure11. The equalizer in[14] yields a much worse performance than ours since the Doppler scale spread differences in this case are even higher than for Case I.
Conclusions
In this article, we have discussed iterative equalization of wideband channels using the conjugate gradient (CG) algorithm for OFDM systems. The channel follows a multiscale multilag (MSML) model, and suffers therefore from interferences in both the frequency domain and time domain. To lower the equalization complexity, the channel matrices are approximated to be banded in both domains. A novel method of optimal resampling is proposed, which is indispensable for wideband communications. A diagonal preconditioning technique, that accompanies the CG method to accelerate the convergence, has also been adapted to enhance its suitability. Experimental results have shown that our equalization scheme allows for a superior performance to those schemes based on a singlescale resampling method, without any resampling operation, or using a traditional preconditioning procedure. In addition, we gave a simple criterion to determine whether to use a frequencydomain or timedomain equalizer, depending on the channel situation, to obtain the best BER performance with the same complexity. Such a criterion is also validated by experiments.
Appendix 1
Detailed derivation of the discrete data model
Here we give the derivation of (9), assuming no noise is present. We start from (8) given by
where h_{ k }(t) is defined in (5) and the embedded u(t) in h_{ k }(t) is considered to be one for the concerned observation window as clarified in Remark 1.
Now, we substitute h_{ k }(t) to obtain
where the channel coefficient is given by
Now, if we denote
for the normalized carrier frequency and
for the normalized delay of the l th path, we have
which gives (9).
Appendix 2
System model in the time domain and timedomain equalization
To derive the timedomain model, let us rewrite (10) as
where\left(\right.separators="">\n \n s\n =\n \n \n F\n \n \n 1\n \n \n \u2212\n 1\n \n \n b\n \n, and\left(\right.separators="">\n \n \n \n H\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n stands for the timedomain (TD) channel matrix
with\left(\right.separators="">\n \n \n \n H\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n =\n \n \n F\n \n \n \n \n \alpha \n \n \n l\n \n \n /\n \beta \n \n \n H\n \n \n \n \n \u22c0\n \n \n \n \n \lambda \n \n \n l\n \n \n \n \n (\n \sigma \n )\n \n \n \n \n F\n \n \n 1\n \n \n \n being its l th component. The (m,k)th entry of\left(\right.separators="">\n \n \n \n H\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n \n is given by
where\left(\right.separators="">\n \n \n \n \xi \n \n \n l\n ,\n T\n 1\n \n \n =\n \n \n \n \n \alpha \n \n \n l\n \n \n \u2212\n \beta \n \n \n \beta \n \n \n \n and ξ_{l,T2}=α_{ l }(λ_{ l } + σ).
Observing the analogy between (16) and (39), a similar interference analysis can be made on H_{T}. By defining
we can introduce the symbol\left(\right.separators="">\n \n \n \n B\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \n defined as [c.f. (18)]
which determines the index set of the data symbols that contribute the most to the m th received signal\left(\right.separators="">\n \n \n \n [\n \n \n r\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n ]\n \n \n m\n \n \n \n via the l th path. Note that\left(\right.separators="">\n \n \n \n B\n \n \n F\n ,\n l\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n in (18) depends on the resampling factor β and the frequency shift factor ϕ, whereas\left(\right.separators="">\n \n \n \n B\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \n in (18) depends on the resampling factor β and the time shift factor σ.
Similarly as in the frequency domain, we obtain a banded approximation of\left(\right.separators="">\n \n \n \n H\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n by introducing
and a selection matrix\left(\right.separators="">\n \n \n \n B\n \n \n T\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n \n, whose (m,k)th entry is equal to 1 if\left(\right.separators="">\n \n \n \n min\n \n \n l\n \n \n \n \n m\n +\n \n \n \Delta \n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \u2212\n \n \n B\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \n \n \u2264\n k\n \u2264\n \n \n max\n \n \n l\n \n \n \n \n m\n +\n \n \n \Delta \n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n (\n m\n )\n \n \n +\n \n \n B\n \n \n T\n ,\n l\n \n \n (\n \beta \n ,\n \sigma \n )\n \n \n (\n m\n )\n \n \n \n, and 0 otherwise. Then the banded approximation of\left(\right.separators="">\n \n \n \n H\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n is obtained by
We can then rewrite (37) as
where\left(\right.separators="">\n \n \n \n \n \n v\n \n \u0304\n \n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n \n \n H\n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \u2212\n \n \n \n \n H\n \n \u0304\n \n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n s\n .\n \n
The timedomain equalization can be presented in an analogous manner as in the frequency domain. Similar to its FD counterpart in (23), we here rewrite the noiseless case for (44) as
where\left(\right.separators="">\n \n s\n =\n \n \n F\n \n \n 1\n \n \n H\n \n \n b\n \n, C_{T} is the preconditioner applied in the time domain and\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n TC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n C\n \n \n T\n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n T\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n. We first estimate s by applying the CG algorithm on\left(\right.separators="">\n \n \n \n r\n \n \n TC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n to invert\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n TC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n iteratively, and afterwards we obtain\left(\right.separators="">\n \n \n \n b\n \n \u0302\n \n =\n \n \n F\n \n \n 1\n \n \n H\n \n \n \n \n s\n \n \u0302\n \n \n.
We highlight that the adopted diagonal preconditioner C_{T,⋆}=diag{[c_{T,0,⋆},c_{T,1,⋆},…,c_{T,K−1,⋆}]^{T}} is defined in a similar manner as in the frequency domain. Specifically, we use
where
To enhance the suitability of the preconditioner, the optimal resampling operation is needed as given by
Appendix 3
Equalization using the conjugate gradient algorithm
If we consider to solve the preconditioned system in (23) in a similar manner as (22), we have
where\left(\right.separators="">\n \n \n \n \n \n M\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n H\n \n \n \n \n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n, and\left(\right.separators="">\n \n \n \n \n \n b\n \n \u0302\n \n \n \n C\n \n \n \n is the estimate of\left(\right.separators="">\n \n \n \n b\n \n \n C\n \n \n =\n \n \n C\n \n \n F\n \n \n \u2212\n 1\n \n \n b\n \n.
Its implementation using CG is described in the frequency domain as follows

1.
Define \left(\right.separators="">\n \n \n \n d\n \n \n F\n \n \n =\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n H\n \n \n \n \n \n \n r\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n and i=0;

2.
Perform the following iterations:
\begin{array}{l}\text{Loop}\phantom{\rule{2em}{0ex}}\\ {\mathbf{g}}^{\left(i\right)}={\mathbf{d}}_{\mathrm{F}}{\stackrel{\u0304}{\mathbf{M}}}_{\text{FC}}^{(\beta ,\varphi ,\sigma )}{\widehat{\mathbf{b}}}_{\text{C}}^{\left(i\right)},\phantom{\rule{2em}{0ex}}\\ {\mathbf{a}}^{\left(i\right)}=\frac{\parallel {\mathbf{g}}^{\left(i\right)}{\parallel}_{2}^{2}}{\parallel {\mathbf{g}}^{(i1)}{\parallel}_{2}^{2}}{\mathbf{a}}^{(i1)}+{\mathbf{g}}^{\left(i\right)},\phantom{\rule{2em}{0ex}}\\ {u}^{\left(i\right)}=\frac{\parallel {\mathbf{g}}^{\left(i\right)}{\parallel}_{2}^{2}}{{\mathbf{a}}^{{\left(i\right)}^{H}}{\stackrel{\u0304}{\mathbf{M}}}_{\text{FC}}^{(\beta ,\varphi ,\sigma )}{\mathbf{a}}^{\left(i\right)}},\phantom{\rule{2em}{0ex}}\\ {\widehat{\mathbf{b}}}_{\text{C}}^{\left(i\right)}={\widehat{\mathbf{b}}}_{\text{C}}^{(i1)}+{u}^{\left(i\right)}{\mathbf{a}}^{\left(i\right)}\phantom{\rule{2em}{0ex}}\\ \text{End Loop};\phantom{\rule{2em}{0ex}}\end{array}(64)where a^{(0)}=g^{(0)}=d_{F},\left(\right.separators="">\n \n \n \n u\n \n \n (\n 0\n )\n \n \n =\n \n \n \u2225\n \n \n d\n \n \n F\n \n \n \n \n \u2225\n \n \n 2\n \n \n \n \n \n \n d\n \n \n F\n \n \n H\n \n \n \n \n M\n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n d\n \n \n F\n \n \n \n \n \n and\left(\right.separators="">\n \n \n \n \n \n b\n \n \u0302\n \n \n \n (\n 0\n )\n \n \n =\n \n \n u\n \n \n (\n 0\n )\n \n \n \n \n d\n \n \n F\n \n \n \n;

3.
Perform \left(\right.separators="">\n \n \n \n \n \n b\n \n \u0302\n \n \n \n (\n i\n )\n \n \n =\n \n \n C\n \n \n F\n \n \n \n \n b\n \n \n C\n \n \n (\n i\n )\n \n \n \n, which is the i th output of the equalization process, and the index i is incremental from 0 to i _{max} where i _{max} is the iteration number when the stopping criterion of the CG is satisfied.
Notably, the optimal stopping criterion for CG can be case dependent, e.g., as discussed in[23], and is not included in this article. When our CG iterations stop, we finally have\left(\right.separators="">\n \n \n \n b\n \n \u0302\n \n =\n \n \n \n \n b\n \n \u0302\n \n \n \n (\n \n \n i\n \n \n max\n \n \n )\n \n \n \n, which is the data estimate.
It is worthy to note that the computational complexity of each CG iteration above is determined by the complex multiplication (CM) of\left(\right.separators="">\n \n \n \n \n \n M\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n with a vector (e.g.\left(\right.separators="">\n \n \n \n \n \n b\n \n \u0302\n \n \n \n (\n i\n )\n \n \n \n or a^{(i)}), e.g., as in (49). When\left(\right.separators="">\n \n \n \n C\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n is a diagonal preconditioner as considered in this article, the bandwidth of the preconditioned\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n equals that of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n C\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n, and consequently\left(\right.separators="">\n \n \n \n \n \n M\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n is banded with a bandwidth\left(\right.separators="">\n \n 2\n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n \n where\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n =\n \n \n max\n \n \n k\n \n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n with\left(\right.separators="">\n \n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n (\n k\n )\n \n defined in (19). In this case, the computational complexity of each iteration is upperbounded by\left(\right.separators="">\n \n O\n (\n \n \n B\n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n )\n \n \n K\n )\n \n which is linear in the vector size K.
One can also repeat the above derivations using the TD notations for the TD CG equalization.
Appendix 4
Eigenvalue locations
We consider the diagonal matrix C_{F}=diag{[c_{F,0},c_{F,1},…,c_{F,K−1}]^{T}}, and denote the eigenvalues of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n =\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n as {μ_{1},μ_{2},…,μ_{K−1}}.
Let UWU be a Schur decomposition of\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n FC\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n such that U U^{H}=I_{K×K} and the diagonal elements of W equal {μ_{1},μ_{2},…,μ_{K−1}}. Then
Note that\left(\right.separators="">\n \n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n e\n \n \n k\n \n \n \n \n c\n \n \n F\n ,\n k\n \n \n =\n \n \n \n \n H\n \n \u0304\n \n \n \n F\n \n \n (\n \beta \n ,\n \varphi \n ,\n \sigma \n )\n \n \n \n \n C\n \n \n F\n \n \n \n \n e\n \n \n k\n \n \n \n, where e_{ k }stands for an allzero vector except for its k th entry which equals 1, as defined in (25) for k=0,1,…,K. We then recall (27), which holds for any k∈{0,1,…,K−1}, and thus upperbounds the above expressions as
Similarly, we can also prove that\left(\right.separators="">\n \n \n \n \u2211\n \n \n k\n =\n 0\n \n \n K\n \u2212\n 1\n \n \n \n \n \n \mu \n \n \n k\n \n \n \u2212\n 1\n \n \n \n \n \n 2\n \n \n \u2264\n K\n \n \n \epsilon \n \n \n 1\n \n \n 2\n \n \n \n associated with (26).
Endnote
^{a} As a matter of fact, the case where α_{ l }<1 or τ_{ l }<0 can be converted to the current situation by means of proper resampling and timing at the receiver. This justifies the assumption of a compressive and causal scenario without loss of generality.
References
Wang Z, Giannakis GB: Wireless multicarrier communications: where Fourier meets Shannon. IEEE Signal Process. Mag 2000, 17(3):2948. 10.1109/79.841722
Cai X, Giannakis GB: Bounding performance and suppressing intercarrier interference in wireless mobile OFDM. IEEE Trans. Commun 2003, 51(12):20472056. 10.1109/TCOMM.2003.820752
Weiss LG: Wavelets and wideband correlation processing. IEEE Signal Process. Mag 1994, 11: 1332.
Ricker DW: The Doppler sensitivity of large TW phase modulated waveforms. IEEE Trans. Signal Process 1992, 40(10):24062413. 10.1109/78.157285
Schniter P: Lowcomplexity equalization of OFDM in doubly selective channels. IEEE Trans. Signal Process 2004, 52(4):10021011. 10.1109/TSP.2004.823503
Rugini L, Banelli P, Leus G: Simple equalization of timevarying channels for OFDM. IEEE Commun. Lett 2005, 9(7):619621. 10.1109/LCOMM.2005.1461683
Fang K, Rugini L, Leus G: Lowcomplexity block turbo equalization for OFDM systems in timevarying channels. IEEE Trans. Signal Process 2008, 56(11):55555566.
Jiang Y, PapandreouSuppappola A: Discrete timescale characterization of wideband timevarying systems. IEEE Trans. Signal Process 2006, 54(4):13641375.
Sozer EM, Proakis JG, Stojanovic R, Rice JA, Benson A, Hatch M: Direct sequence spread spectrum based modem for under water acoustic communication and channel measurements. Proc. Conf. IEEE/MTS OCEANS, vol. 1 (Boston, MA, USA, 1999), pp. 228–233
Margetts AR, Schniter P, Swami A: Joint scalelag diversity in wideband mobile direct sequence spread spectrum systems. IEEE Trans. Wirel. Commun 2007, 6(12):43084319.
Leus G, van Walree P: Multiband OFDM for covert acoustic communications. IEEE J. Sel. Areas Commun 2008, 26(9):16621673.
Salberg AB, Swami A: Doppler and frequencyoffset synchronization in wideband OFDM. IEEE Trans. Wirel. Commun 2005, 4(6):28702881.
Li B, Zhou S, Stojanovic M, Freitag L, Willett P: Multicarrier communication over underwater acoustic channels with nonuniform Doppler shifts. IEEE J. Oceanic Eng 2008, 33(2):198209.
Yerramalli S, Mitra U: Optimal resampling of OFDM signals for multiscalemultilag underwater acoustic channels. IEEE J. Oceanic Eng 2011, 36: 126138.
Golub GH, van Loan CF: Matrix Computations,. (Johns Hopkins University Press, 1996)
Benzi M: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys 2002, 182: 418477. 10.1006/jcph.2002.7176
Groote MJ, Huckle T: Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput 1997, 18: 838853. 10.1137/S1064827594276552
Hrycak T, Das S, Matz G, Feichtinger HG: Low complexity equalization for doubly selective channels modeled by a basis expansion. IEEE Trans. Signal Process 2010, 58(11):57065719.
Tang Z, Remis R, Leus G, Xu T, Nordenvaad ML: Equalization for multiscale/multilag OFDM channels. Proc. Allerton Conf. Comm., Control, and Comput., vol. 1 (Monticello, IL, USA, 2011), pp. 654–661
Xu T, Tang Z, Leus G, Mitra U: Time or frequencydomain equalization for wideband OFDM channels? Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), vol. 5 (Kyoto, Japan, 2012) pp. 3029–3032
Tang Z, Remis R, Nordenvaad ML: On preconditioned conjugate gradient method for timevarying OFDM channel equalization. Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), vol. 5 (Kyoto, Japan, 2012) pp. 2119–2122
Paige CC, Saunders MA: LSQR: an algorithm for sparse linear equations and sparse least square problems. ACM Trans. Math. Softw 1982, 8: 4371. 10.1145/355984.355989
Hanke M: Conjugate Gradient Type Methods for illPosed Problems. (Longman Scientific & Technical, 1992)
Falconer D, Ariyavisitakul SL, BenyaminSeeyar A, Eidson B: Frequency domain equalization for singlecarrier broadband wireless systems. IEEE Commun. Mag 2002, 40(4):5866. 10.1109/35.995852
Giannakis GB, Tepedelenlioglu C: Basis expansion models and diversity techniques for blind identification and equalization of timevarying channels. Proc. IEEE 1998, 86(10):19691986. 10.1109/5.720248
Acknowledgements
The first author wants to thank the National University of Defense Technology, China, and also the China Scholarship Council for the financial support. This work was supported in part by NWOSTW under the VICI program (project 10382). The work of Z. Tang is also supported in part by the European Defence Agency (EDA) project RACUN (Robust Acoustic Communication in Underwater Networks). In addition, we would like to thank Dr. Magnus Lundberg Nordenvaad from the Lulea University of Technology, Sweden, Prof. Urbashi Mitra from the University of Southern California, U.S., and Prof. Huihuang Chen from the Xiamen University, China, who participated in valuable discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Xu, T., Tang, Z., Remis, R. et al. Iterative equalization for OFDM systems over wideband MultiScale MultiLag channels. J Wireless Com Network 2012, 280 (2012). https://doi.org/10.1186/168714992012280
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/168714992012280