This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Joint Channel Estimation and Signal Detection for MIMO-OFDM: A Novel Data-Aided Approach with Reduced Computational Overhead

Xinjie Li,  Jing Zhang,  Xingyu Zhou,  Chao-Kai Wen,  and Shi Jin X. Li, J. Zhang, X. Zhou, and S. Jin are with the National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China (e-mail: lixinjie@seu.edu.cn; jingzhang@seu.edu.cn; xy_zhou@seu.edu.cn; jinshi@seu.edu.cn).C.-K. Wen is with Institute of Communications Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan (e-mail: chaokai.wen@mail.nsysu.edu.tw).
Abstract

The acquisition of channel state information (CSI) is essential in MIMO-OFDM communication systems. Data-aided enhanced receivers, by incorporating domain knowledge, effectively mitigate performance degradation caused by imperfect CSI, particularly in dynamic wireless environments. However, existing methodologies face notable challenges: they either refine channel estimates within MIMO subsystems separately, which proves ineffective due to deviations from assumptions regarding the time-varying nature of channels, or fully exploit the time-frequency characteristics but incur significantly high computational overhead due to dimensional concatenation. To address these issues, this study introduces a novel data-aided method aimed at reducing complexity, particularly suited for fast-fading scenarios in fifth-generation (5G) and beyond networks. We derive a general form of a data-aided linear minimum mean-square error (LMMSE)-based algorithm, optimized for iterative joint channel estimation and signal detection. Additionally, we propose a computationally efficient alternative to this algorithm, which achieves comparable performance with significantly reduced complexity. Empirical evaluations reveal that our proposed algorithms outperform several state-of-the-art approaches across various MIMO-OFDM configurations, pilot sequence lengths, and in the presence of time variability. Comparative analysis with basis expansion model-based iterative receivers highlights the superiority of our algorithms in achieving an effective trade-off between accuracy and computational complexity.

Index Terms:
MIMO-OFDM, LMMSE, expectation propagation, iterative receiver, data-aided channel estimation.

I Introduction

Multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), which combines spatial multiplexing and flat fading channels, has been a foundational technology since the advent of fourth-generation mobile cellular wireless systems. With the transition to fifth-generation (5G) and beyond, the New Radio (NR) architecture introduces a resource block (RB)-based frame structure that accommodates multiple numerologies for MIMO-OFDM transmissions [1, 2].

Channel estimation and signal detection are critical components of MIMO-OFDM receivers. Channel frequency responses (CFRs) are typically estimated using training pilots, with a comb-type pattern facilitating the tracking of time-varying channel characteristics in realistic wireless environments [3, 4]. Extrapolation or interpolation techniques [5], particularly the linear minimum mean square error (LMMSE) method, are commonly employed to estimate the CFRs of data symbols. For signal detection, message-passing-based detectors, such as approximate message passing (AMP) and expectation propagation (EP) [6, 7, 8], provide a favorable balance between performance and complexity, leading to their widespread adoption.

However, detection performance degrades significantly in the presence of imperfect channel state information (CSI) [9]. In recent years, numerous studies have sought to enhance traditional receiver designs using deep learning (DL). Specifically, data-driven approaches [10, 11, 12] leverage neural networks to recover transmitted bits directly from the received signal, bypassing the need for domain knowledge. While these neural network-based methods improve receiver performance through joint optimization, they come with substantial computational costs. Moreover, pretrained neural networks often experience significant performance degradation in real-world dynamic channels [13, 14, 15]. These challenges in complexity and generalization underscore the need for improved designs that integrate domain knowledge, spurring a resurgence in the Joint Channel estimation and signal Detection (JCD) framework.

The JCD framework, applicable to a wide range of communication systems, offers a promising solution to mitigate performance degradation caused by imperfect CSI. Within this framework, data-aided channel estimation leverages a priori information from data estimates to enhance accuracy, thereby improving signal detection reliability. Typically, the decoder is integrated into the JCD iterations for error correction, with the output extrinsic information enabling more precise data feedback. The integration of JCD within receiver designs has been extensively investigated in [16, 17, 18, 19, 20].

Despite significant progress, recent works emphasize variants of the joint optimization problem to further advance JCD designs. Some approaches construct prior assumptions about channel characteristics to approximate the posterior distribution [21, 22, 23, 24]. For example, in [21, 22, 23], the joint posterior distribution of channels and data symbols is factorized, and bilinear Bayesian inference is applied using Gaussian [21, 22] or Bernoulli-Gaussian [23] priors. Similarly, [24] approximates the posterior via a Gaussian mixture model (GMM), introducing subspace projection methods to enhance the GMM-based data-aided estimator. Other variants enhance JCD receivers by incorporating model-driven DL methods [25, 26, 27, 28, 29, 30]. Specifically, [25, 26] develop LMMSE-based data-aided channel estimation and refine message-passing signal detection with trainable hyperparameters to improve convergence and performance. Deep unfolding techniques are integrated in [27, 28, 29] using algorithms such as generalized expectation maximization [27] and the alternating direction method of multipliers [28, 29], achieving improved detection performance with data-aided estimation derived via variational inference. [30] integrates neural network-enhanced designs within bilinear Gaussian belief propagation iterations to perform channel extrapolation and refine prior knowledge for data-aided estimation.

While these JCD designs [21, 22, 23, 24, 25, 26, 27, 28, 29, 30] provide valuable insights, they are predominantly developed under block fading channel assumptions, making them unsuitable for high-mobility scenarios in 5G and beyond networks [1, 31], where quasi-static models fail. In contrast, the comb-type pilot pattern effectively captures the symbol-by-symbol time-varying nature of wireless channels. However, existing data-aided estimators face significant complexity challenges.

For instance, works such as [32, 33, 34] address scalability by constructing equivalent systems that concatenate information across time, frequency, and spatial domains, approximating the probability density function (pdf) using message-passing techniques. This concatenation, however, incurs high computational costs. Complexity reduction is achieved in [35] by employing the basis expansion model (BEM), which uses discrete prolate spheroidal (DPS) sequences [36] and B-spline basis functions [37, 38] to model fading characteristics. Nevertheless, time-frequency concatenation in data-aided estimation remains computationally expensive, and reliance on decision criteria for true data estimation errors introduces potential inaccuracies. Thus, further investigation is needed into data-aided channel estimation techniques that support subcarrier-specific allocation of pilots and symbols in MIMO-OFDM systems. This exploration is crucial for developing practical schemes that balance flexibility, performance, and complexity reduction in time-selective fading environments.

In this paper, we propose a JCD framework for MIMO-OFDM receivers that supports flexible deployment of various detectors and optionally incorporates a decoding module. The EP detector is applied, and the decoding module is activated only after convergence in the JCD process to minimize computational load. Unlike previous approaches reliant on block-fading assumptions [21, 22, 23, 24, 25, 26, 27, 28, 29, 30] or incurring substantial computational overhead [32, 33, 34, 35], the proposed data-aided LMMSE channel estimation method is applicable to various time-selective fading scenarios. A closed-form solution is derived by incorporating true detection error statistics, and an equivalent representation is proposed to significantly reduce complexity. The main contributions of this paper are summarized as follows:

  • The general form of data-aided LMMSE-based channel estimation within the JCD structure, termed MJCD-LMMSE, is derived. MJCD-LMMSE leverages the estimated data symbols provided by the EP detector in the previous JCD layer to compute refined channel estimations, thereby providing more accurate coefficients for subsequent signal detection. Extrinsic log-likelihood ratios (LLRs), based on EP estimates from the final JCD iteration, are computed for channel decoding.

  • To reduce the complexity of implementation in standard MIMO-OFDM configurations, a novel equivalent representation, termed OJCD-LMMSE, is introduced. OJCD-LMMSE decouples spatial-frequency correlation properties into individual OFDM subsystems, enabling separate quantification of interference statistics. This approach results in an alternative solution that significantly reduces complexity compared to MJCD-LMMSE.

  • Numerical simulations demonstrate that the MJCD-LMMSE-based approach significantly outperforms traditional methods. Moreover, substituting MJCD-LMMSE with OJCD-LMMSE in the proposed framework delivers similar performance with remarkably lower computational cost. Evaluations under various time-varying conditions confirm the practical effectiveness of the proposed design in realistic wireless transmissions, highlighting its conspicuous advantage in balancing performance and complexity.

The rest of this paper is organized as follows. MIMO-OFDM system model including traditional LMMSE estimation and EP detection based receiver is introduced in Section II. In Section III, MJCD-LMMSE is derived for data-aided channel estimation in our proposed JCD structure, and the equivalent low-complexity algorithm OJCD-LMMSE is proposed in Section IV. Numerical results are represented in Section V, and Section VI finally concludes the paper.

Notations: Superscripts ()T{(\cdot)^{T}} and ()H{(\cdot)^{\mathrm{H}}} denote the transpose and conjugate transpose respectively. zz^{*} and |z||z| denote the complex conjugate and modulus of a complex number zz. The expectation operator is denoted by 𝔼{}\mathbb{E}\{\cdot\}, while Var{}\text{Var}\{\cdot\} indicates the variance. 𝐈\mathbf{I} is the identity matrix, 𝟎\mathbf{0} represents the zero matrix, and 𝒩(𝟎,σw2𝐈)\mathcal{N}({{\mathbf{0}},\sigma_{w}^{2}{\mathbf{I}}}) indicates Gaussian random variables with zero mean and variance σw2\sigma_{w}^{2}. diag(𝐱)\text{diag}(\mathbf{x}) returns a diagonal matrix with 𝐱\mathbf{x} on the main diagonal. In addition, \otimes and \odot represent the Kronecker product and Hadamard product respectively, and \lfloor{\cdot}\rfloor represents the floor operator.

II System Model

A MIMO-OFDM system configured with NR×NTN_{\text{R}}\times N_{\text{T}} antennas and KK subcarriers is considered, where traditional LMMSE interpolator is adopted for comb-type pilot-assisted channel estimation and EP detector is utilized in signal detection, as illustrated in Fig. 1.

Refer to caption

Figure 1:  Block diagram of MIMO-OFDM receiver with traditional LMMSE channel estimation and EP signal detection.

II-A MIMO-OFDM

An OFDM frame consisting of a pilot block and a data block is formed and transmitted at each antenna, under the duration of which the corresponding channel coefficients are assumed to be constant. PP out of KK subcarriers are chosen for inserting pilot sequences, while other subcarriers are used for data transmission. For more accurate estimation, the subcarriers taken up by pilot symbols are spaced evenly in KP\lfloor{\frac{K}{P}}\rfloor intervals. Moreover, pilot sequences transmitted at different antennas are required to be orthogonal. The received signals corresponding to NRNT{N_{\text{R}}}{N_{\text{T}}} sets of OFDM channels are demanded.

Specifically, the output at the mm-th receiving antenna corresponding to the nn-th transmitted pilot block 𝐲m,np=[ym,np1,,ym,npP]TP×1{\mathbf{y}}_{m,n}^{\text{p}}={[{y_{m,n}^{{p_{1}}},\ldots,y_{m,n}^{{p_{P}}}}]^{T}}\in{\mathbb{C}^{P\times 1}} can be expressed as

𝐲m,np=𝐗np𝐡m,np+𝐰m,np{\mathbf{y}}_{m,n}^{\text{p}}={\mathbf{X}}_{n}^{\text{p}}{\mathbf{h}}_{m,n}^{\text{p}}+{\mathbf{w}}_{m,n}^{\text{p}} (1)

for m=1,2,,NRm=1,2,\dots,N_{\text{R}} and n=1,2,,NTn=1,2,\dots,N_{\text{T}}, where {pk}k=1P\{{{p_{k}}}\}_{k=1}^{P} denotes the index for pilot subcarriers. The transmitted pilot block is denoted as 𝐗np=diag(𝐱np)=diag(xnp1,,xnpP)P×P{\mathbf{X}}_{n}^{\text{p}}={\text{diag}}({{\mathbf{x}}_{n}^{\text{p}}})={\text{diag}}({x_{n}^{{p_{1}}},\ldots,x_{n}^{{p_{P}}}})\in{\mathbb{C}^{P\times P}}, and the corresponding channel coefficients are 𝐡m,np=[hm,np1,,hm,npP]T{\mathbf{h}}_{m,n}^{\text{p}}={[{h_{m,n}^{{p_{1}}},\ldots,h_{m,n}^{{p_{P}}}}]^{T}}. 𝐰m,np=[wm,np1,,wm,npP]T{\mathbf{w}}_{m,n}^{\text{p}}={[{w_{m,n}^{{p_{1}}},\ldots,w_{m,n}^{{p_{P}}}}]^{T}} is an additive white Gaussian noise (AWGN) vector, i.e., 𝐰m,np𝒩(𝟎,σw2𝐈){\mathbf{w}}_{m,n}^{\text{p}}\sim\mathcal{N}({{\mathbf{0}},\sigma_{w}^{2}{\mathbf{I}}}).

As for data transmission, the information sequences are modulated with a complex MM-ary quadrature amplitude modulation (QAM) constellation 𝒜\mathcal{A} and assembled as data blocks, which are represented as 𝐗nd=diag(𝐱nd)=diag(xnd1,,xndKP)(KP)×(KP){\mathbf{X}}_{n}^{\text{d}}={\text{diag}}({{\mathbf{x}}_{n}^{\text{d}}})={\text{diag}}({x_{n}^{{d_{1}}},\ldots,x_{n}^{{d_{K-P}}}})\in{\mathbb{C}^{({K-P})\times({K-P})}} for n=1,2,,NTn=1,2,\dots,N_{\text{T}}. The data blocks are then transmitted over the channel simultaneously. The received data block at the mm-th receiving antenna 𝐲md=[ymd1,,ymdKP]T(KP)×1{\mathbf{y}}_{m}^{\text{d}}={[{y_{m}^{{d_{1}}},\ldots,y_{m}^{{d_{K-P}}}}]^{T}}\in{\mathbb{C}^{({K-P})\times 1}} is denoted as

𝐲md=n=1NT𝐗nd𝐡m,nd+𝐰md{\mathbf{y}}_{m}^{\text{d}}=\sum\limits_{n=1}^{{N_{\text{T}}}}{{\mathbf{X}}_{n}^{\text{d}}{\mathbf{h}}_{m,n}^{\text{d}}}+{\mathbf{w}}_{m}^{\text{d}} (2)

for m=1,2,,NRm=1,2,\dots,N_{\text{R}}. Similarly, {dk}k=1KP\{{{d_{k}}}\}_{k=1}^{K-P} denotes the index for data subcarriers, and the noise vector has independent components with zero-mean and σw2\sigma_{w}^{2}-variance. The corresponding channel coefficients are 𝐡m,nd=[hm,nd1,,hm,ndKP]T{\mathbf{h}}_{m,n}^{\text{d}}={[{h_{m,n}^{{d_{1}}},\ldots,h_{m,n}^{{d_{K-P}}}}]^{T}}. Notably, for specific dk{d_{k}}, the corresponding vector 𝐲dk=[y1dk,,yNRdk]TNR×1{{\mathbf{y}}^{{d_{k}}}}={[{y_{1}^{{d_{k}}},\ldots,y_{{N_{\text{R}}}}^{{d_{k}}}}]^{T}}\in{\mathbb{C}^{{N_{\text{R}}}\times 1}} consisting of NR{N_{\text{R}}} components from different receiving antennas can also be represented as

𝐲dk=𝐇dk𝐱dk+𝐰dk,{{\mathbf{y}}^{{d_{k}}}}={{\mathbf{H}}^{{d_{k}}}}{{\mathbf{x}}^{{d_{k}}}}+{{\mathbf{w}}^{{d_{k}}}}, (3)

where 𝐱dk=[x1dk,,xNTdk]TNT×1{{\mathbf{x}}^{{d_{k}}}}={[{x_{1}^{{d_{k}}},\ldots,x_{{N_{\text{T}}}}^{{d_{k}}}}]^{T}}\in{\mathbb{C}^{{N_{\text{T}}}\times 1}} and 𝐇dkNR×NT{{\mathbf{H}}^{{d_{k}}}}\in{\mathbb{C}^{{N_{\text{R}}}\times{N_{\text{T}}}}}. Consequently, at any specific data subcarrier, the receiving representation can be treated as MIMO receiving signal equivalently. The equivalent MIMO system can be represented as

𝐲=𝐇𝐱+𝐰,{\mathbf{y}}={\mathbf{Hx}}+{\mathbf{w}}, (4)

where the subcarrier index dk{d_{k}} is omitted for simplicity.

II-B LMMSE-based Channel Estimation

Since only PP subcarriers are used for pilot transmission, channel estimation is expected to recover unknown channel coefficients at data subcarriers using acquirable information at pilot subcarriers. Based on least squares (LS) estimation at pilot subcarriers, LMMSE estimation can realize such a goal utilizing the frequency correlation in MIMO-OFDM channels. Specifically, the initial LS estimation at pilot subcarriers is

𝐡m,nLS=(𝐗np)1𝐲m,np,{\mathbf{h}}_{m,n}^{{\text{LS}}}={\left({{\mathbf{X}}_{n}^{\text{p}}}\right)^{-1}}{\mathbf{y}}_{m,n}^{\text{p}}, (5)

and the estimated channel coefficients at all subcarriers using LMMSE algorithm is

𝐡m,nLMMSE\displaystyle{\mathbf{h}}_{m,n}^{{\text{LMMSE}}} =𝐖LMMSE𝐡m,nLS,\displaystyle={{\mathbf{W}}_{{\text{LMMSE}}}}{\mathbf{h}}_{m,n}^{{\text{LS}}}, (6)
𝐖LMMSE\displaystyle{{\mathbf{W}}_{{\text{LMMSE}}}} =𝐑𝐡𝐡p(𝐑𝐡p𝐡p+σw2𝐈)1,\displaystyle={{\mathbf{R}}_{{\mathbf{h}}{{\mathbf{h}}^{\text{p}}}}}{\left({{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}+\sigma_{w}^{2}{\mathbf{I}}}\right)^{-1}}, (7)

where the correlation among subcarriers 𝐑𝐡𝐡pK×P{{\mathbf{R}}_{{\mathbf{h}}{{\mathbf{h}}^{\text{p}}}}}\in{\mathbb{C}^{K\times P}} and 𝐑𝐡p𝐡pP×P{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}\in{\mathbb{C}^{P\times P}} can be acquired from the channel correlation matrix in the frequency domain, i.e., 𝐑Freq\mathbf{R}^{\text{Freq}}.

II-C EP-based Signal Detection

After acquiring LMMSE estimation of NRNT{N_{\text{R}}}{N_{\text{T}}} sets of OFDM channels, channel coefficients at data subcarriers are utilized during signal detection. According to (3), at any data subcarrier dk{d_{k}}, the NRNT{N_{\text{R}}}{N_{\text{T}}} estimated components can be reassembled as a matrix such that 𝐇^dkNR×NT{\hat{\mathbf{H}}^{{d_{k}}}}\in{\mathbb{C}^{{N_{\text{R}}}\times{N_{T}}}}, which can be further simplified as 𝐇^{\hat{\mathbf{H}}} during the operation of signal detection.

EP approximates the posterior distribution with factorized Gaussian distributions as follows [8]

p(𝐱|𝐲)\displaystyle p\left({{\mathbf{x}}|{\mathbf{y}}}\right) 𝒩(𝐲;𝐇𝐱,σw2𝐈NR)n=1NTpa(xn),\displaystyle\propto\mathcal{N}\left({{\mathbf{y}};{\mathbf{Hx}},\sigma_{w}^{2}{{\mathbf{I}}_{{N_{\text{R}}}}}}\right)\cdot{\prod\limits_{n=1}^{{N_{\text{T}}}}{{p_{\text{a}}}\left({{x_{n}}}\right)}}, (8)
q(𝐱|𝜸,𝚲)\displaystyle q\left({{\mathbf{x}}|\bm{\gamma},\bm{\Lambda}}\right) 𝒩(𝐲;𝐇𝐱,σw2𝐈NR)𝒩(𝐱;𝚲1𝜸,𝚲),\displaystyle\propto\mathcal{N}\left({{\mathbf{y}};{\mathbf{Hx}},\sigma_{w}^{2}{{\mathbf{I}}_{{N_{\text{R}}}}}}\right)\cdot\mathcal{N}\left({{\mathbf{x}};{\bm{\Lambda}^{-1}}\bm{\gamma},{\bm{\Lambda}}}\right), (9)

where pa(xn){p_{\text{a}}}({{x_{n}}}) is the a priori pdf of 𝐱\mathbf{x}, and the EP solution (9) approximates (8) by recursively updating (𝜸,𝚲)(\bm{\gamma},\bm{\Lambda}). After TT iterations, data estimates 𝐱^\hat{\mathbf{x}} are output.

Refer to caption

Figure 2:  Illustration of MIMO-OFDM receiver with the proposed JCD structure and channel decoder.
Input: 𝐇^\hat{\mathbf{H}}, 𝐲\mathbf{y}, σw2\sigma_{w}^{2}, TT, β\beta
Output: 𝐱p(T){\mathbf{x}}_{\text{p}}^{\left(T\right)}
Initialize: γi(0)=0\gamma_{i}^{\left(0\right)}=0, λi(0)=Es1\lambda_{i}^{\left(0\right)}=E_{\text{s}}^{-1} for t=1,,Tt=1,\ldots,T do
       Compute covariance and mean of the unnormalized Gaussian distribution:
𝚺(t)\displaystyle\bm{\Sigma}^{\left(t\right)} =(σw2𝐇^T𝐇^+𝝀(t1))1,\displaystyle={\left({\sigma_{w}^{-2}{{\hat{\mathbf{H}}}^{T}}{\hat{\mathbf{H}}}+{\bm{\lambda}^{\left({t-1}\right)}}}\right)^{-1}}, (10)
𝝁(t)\displaystyle\bm{\mu}^{\left(t\right)} =𝚺(t)(σw2𝐇^T𝐲+𝜸(t1));\displaystyle={\bm{\Sigma}^{\left(t\right)}}\left({\sigma_{w}^{-2}{{\hat{\mathbf{H}}}^{T}}{\mathbf{y}}+{\bm{\gamma}^{\left({t-1}\right)}}}\right);
       Compute extrinsic covariance and mean of the cavity marginal:
𝐕e(t)\displaystyle{\mathbf{V}}_{\text{e}}^{\left(t\right)} =𝚺(t)1𝚺(t)𝝀(t1),\displaystyle=\frac{{{\bm{\Sigma}^{\left(t\right)}}}}{{1-{\bm{\Sigma}^{\left(t\right)}}{\bm{\lambda}^{\left({t-1}\right)}}}}, (11)
𝐱e(t)\displaystyle{\mathbf{x}}_{\text{e}}^{\left(t\right)} =𝐕e(t)(𝝁(t)𝚺(t)𝜸(t1));\displaystyle={\mathbf{V}}_{\text{e}}^{\left(t\right)}\left({\frac{{{\bm{\mu}^{\left(t\right)}}}}{{{\bm{\Sigma}^{\left(t\right)}}}}-{\bm{\gamma}^{\left({t-1}\right)}}}\right);
       Compute the posterior mean and covariance:
𝐱p(t)\displaystyle{\mathbf{x}}_{\text{p}}^{\left(t\right)} =𝔼{𝐱|𝐱e(t),𝐕e(t)},\displaystyle=\mathbb{E}\left\{{{\mathbf{x}}|{\mathbf{x}}_{\text{e}}^{\left(t\right)},{\mathbf{V}}_{\text{e}}^{\left(t\right)}}\right\}, (12)
𝐕p(t)\displaystyle{\mathbf{V}}_{\text{p}}^{\left(t\right)} =Var{𝐱|𝐱e(t),𝐕e(t)};\displaystyle={\text{Var}}\left\{{{\mathbf{x}}|{\mathbf{x}}_{\text{e}}^{\left(t\right)},{\mathbf{V}}_{\text{e}}^{\left(t\right)}}\right\};
       Refine the parameter pairs:
𝝀(t)\displaystyle{\bm{\lambda}^{\left(t\right)}} =(𝐕p(t))1(𝐕e(t))1,\displaystyle={\left({{\mathbf{V}}_{\text{p}}^{\left(t\right)}}\right)^{-1}}-{\left({{\mathbf{V}}_{\text{e}}^{\left(t\right)}}\right)^{-1}}, (13)
𝜸(t)\displaystyle{\bm{\gamma}^{\left(t\right)}} =(𝐕p(t))1𝐱p(t)(𝐕e(t))1𝐱e(t);\displaystyle={\left({\mathbf{V}_{\text{p}}^{\left(t\right)}}\right)^{-1}}{\mathbf{x}}_{\text{p}}^{\left(t\right)}-{\left({{\mathbf{V}}_{\text{e}}^{\left(t\right)}}\right)^{-1}}{\mathbf{x}}_{\text{e}}^{\left(t\right)};
if λi(t)<0\lambda_{i}^{\left(t\right)}<0 then
            λi(t)=λi(t1)\lambda_{i}^{\left(t\right)}=\lambda_{i}^{\left(t-1\right)}, γi(t)=γi(t1)\gamma_{i}^{\left(t\right)}=\gamma_{i}^{\left(t-1\right)};
       end if
      Smooth parameter updates:
𝝀(t)\displaystyle{\bm{\lambda}^{\left(t\right)}} =β𝝀(t)+(1β)𝝀(t1),\displaystyle=\beta{\bm{\lambda}^{\left(t\right)}}+\left({1-\beta}\right){\bm{\lambda}^{\left({t-1}\right)}}, (14)
𝜸(t)\displaystyle{\bm{\gamma}^{\left(t\right)}} =β𝜸(t)+(1β)𝜸(t1).\displaystyle=\beta{\bm{\gamma}^{\left(t\right)}}+\left({1-\beta}\right){\bm{\gamma}^{\left({t-1}\right)}}.
end for
Algorithm 1 EP Detector using imperfect CSI

When the actual channel coefficients are not perfectly known, EP detection can be performed according to Algorithm 1. However, under such circumstances, degradation in detection performance is exhibited [9]. This performance degradation necessitates an improved design that takes the imperfect CSI into account. Specifically, the data-aided method is considered, using the estimated symbols for a more accurate estimation of channel coefficients, which in turn mitigates the influences induced by channel estimation error. The detailed design is illustrated in the next section.

III Proposed Channel Estimation

In this section, we propose the LMMSE-based data-aided method in MIMO-OFDM receiver, where JCD structure with II iterations is considered, as shown in Fig. 2. The proposed data-aided channel estimation algorithm, combined with EP detector, is utilized in JCD-2 to JCD-II. Note that the combination of the methods in Section II-A and II-B, i.e. traditional LMMSE and EP, corresponds to the case that I=1I=1. Moreover, channel decoding is performed only once to compute LLRs according to extrinsic information (𝐱e(T),𝐕e(T))({{\mathbf{x}}_{\text{e}}^{(T)},{\mathbf{V}}_{\text{e}}^{(T)}}) in (11) offered by EP detector at JCD-II. The proposed method, simplified as MJCD-LMMSE, is presented as follows.

III-A MJCD-LMMSE

For the derivation of the estimation algorithm, we begin with the equivalent representation of MIMO-OFDM system. Specifically, consider MIMO-OFDM system as a “MIMO” system with large scale, where data blocks from NR{N_{\text{R}}} receiving antennas {𝐲md}m=1NR\{{{\mathbf{y}}_{m}^{\text{d}}}\}_{m=1}^{{N_{\text{R}}}} are concatenated as a vector 𝐲{\mathbf{y}}, such that 𝐲=[(𝐲1d)T,,(𝐲NRd)T]TNR(KP)×1{\mathbf{y}}={[{{{({{\mathbf{y}}_{1}^{\text{d}}})}^{T}},\ldots,{{({{\mathbf{y}}_{{N_{\text{R}}}}^{\text{d}}})}^{T}}}]^{T}}\in{\mathbb{C}^{{N_{\text{R}}}({K-P})\times 1}}. Therefore, the relationship between received signals and transmitted symbols is represented as

𝐲=𝐗𝐡+𝐰,{\mathbf{y}}={\mathbf{Xh}}+{\mathbf{w}}, (15)

where the transmitted block 𝐗=𝐈NR[(𝟏1×NT𝐈(KP))diag(𝐱)]NR(KP)×NRNT(KP){\mathbf{X}}={{\mathbf{I}}_{{N_{\text{R}}}}}\otimes[{({{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{({K-P})}}}){\text{diag}}({\mathbf{x}})}]\in{\mathbb{C}^{{N_{\text{R}}}({K-P})\times{N_{\text{R}}}{N_{\text{T}}}({K-P})}} is derived by the concatenation of NT{N_{\text{T}}} transmitted blocks 𝐱=[(𝐱1d)T,,(𝐱NTd)T]TNT(KP)×1{\mathbf{x}}=[{{{({{\mathbf{x}}_{1}^{\text{d}}})}^{T}},\ldots,{{({{\mathbf{x}}_{{N_{\text{T}}}}^{\text{d}}})}^{T}}}]^{T}\in{\mathbb{C}^{{N_{\text{T}}}({K-P})\times 1}}. Similarly, the corresponding channel vector 𝐡{\mathbf{h}} and noise vector 𝐰{\mathbf{w}} can be represented as 𝐡=[(𝐡11d)T,,(𝐡1NTd)T,,(𝐡NRNTd)T]TNRNT(KP)×1{\mathbf{h}}=[{{{({{\mathbf{h}}_{11}^{\text{d}}})}^{T}},\ldots,{{({{\mathbf{h}}_{1{N_{\text{T}}}}^{\text{d}}})}^{T}},\ldots,{{({{\mathbf{h}}_{{N_{\text{R}}}{N_{\text{T}}}}^{\text{d}}})}^{T}}}]^{T}\in{\mathbb{C}^{{N_{\text{R}}}{N_{\text{T}}}({K-P})\times 1}} and 𝐰=[(𝐰1d)T,,(𝐰NRd)T]TNR(KP)×1{\mathbf{w}}=[{{{({{\mathbf{w}}_{1}^{\text{d}}})}^{T}},\ldots,{{({{\mathbf{w}}_{{N_{\text{R}}}}^{\text{d}}})}^{T}}}]^{T}\in{\mathbb{C}^{{N_{\text{R}}}({K-P})\times 1}}, respectively.

Based on the rearrangement of the MIMO-OFDM system, the LMMSE principle can be utilized. Specifically, the following Wiener-Hopf equation is employed [39]

𝐡^LMMSE=𝐂𝐲𝐡H𝐂𝐲𝐲1𝐲,{\hat{\mathbf{h}}_{{\text{LMMSE}}}}={{\mathbf{C}}_{{\mathbf{yh}}}^{\mathrm{H}}}{{\mathbf{C}}_{{\mathbf{yy}}}^{-1}}{\mathbf{y}}, (16)

where 𝐂𝐲𝐡{{\mathbf{C}}_{{\mathbf{yh}}}} and 𝐂𝐲𝐲{{\mathbf{C}}_{{\mathbf{yy}}}} are defined as

𝐂𝐲𝐡=𝔼{𝐲𝐡H},𝐂𝐲𝐲=𝔼{𝐲𝐲H}.{{\mathbf{C}}_{{\mathbf{yh}}}}=\mathbb{E}\left\{{{\mathbf{y}}{{\mathbf{h}}^{\mathrm{H}}}}\right\},~{}~{}{{\mathbf{C}}_{{\mathbf{yy}}}}=\mathbb{E}\left\{{{\mathbf{y}}{{\mathbf{y}}^{\mathrm{H}}}}\right\}. (17)

The derivation involves three types of random variables: the channel coefficient hh, the transmitted symbol xx, and the noise variable ww according to (15). Therefore, we state the following assumptions before computing the second-order moments in (17):

  1. 1)

    The concerned random variables hh, xx and ww are mutually independent.

  2. 2)

    The correlation of channel coefficients, i.e., 𝔼{hihj}\mathbb{E}\{{{h_{i}}h_{j}^{*}}\}, is derived from the second-order statistics of MIMO-OFDM channels.

  3. 3)

    Different transmitted symbols are mutually independent, i.e., 𝔼{xixj}=𝔼{xi}𝔼{xj}\mathbb{E}\{{{x_{i}}x_{j}^{*}}\}=\mathbb{E}\{{{x_{i}}}\}\mathbb{E}\{{x_{j}^{*}}\} for any iji\neq j.

  4. 4)

    The signal detection error is defined as Δe=xx^\Delta e=x-\hat{x}, where the estimated symbol is obtained by the expectation of symbol, i.e., 𝔼{x}=x^\mathbb{E}\{x\}=\hat{x}. That is to say, the estimation of symbols is assumed to be unbiased.

Consequently, the following statistical properties are deduced:

  1. (a)

    Statistical property of noise variable: 𝔼{wi}=0\mathbb{E}\{{{w_{i}}}\}=0, 𝔼{wiwi}=σw2\mathbb{E}\{{{w_{i}}w_{i}^{*}}\}=\sigma_{w}^{2}, and 𝔼{wiwj}=0\mathbb{E}\{{{w_{i}}w_{j}^{*}}\}=0 for any iji\neq j.

  2. (b)

    Statistical property of detection error: 𝔼{Δei}=0\mathbb{E}\{{\Delta{e_{i}}}\}=0, 𝔼{ΔeiΔei}=vi\mathbb{E}\{{\Delta{e_{i}}\Delta e_{i}^{*}}\}={v_{i}}, and 𝔼{ΔeiΔej}=0\mathbb{E}\{{\Delta{e_{i}}\Delta e_{j}^{*}}\}=0 for any iji\neq j, where vi{v_{i}} is the given information in 𝐕p(T){\mathbf{V}}_{\text{p}}^{(T)} computed by (12).

  3. (c)

    Statistical property of transmitted symbol: 𝔼{xi}=x^i\mathbb{E}\{{{x_{i}}}\}={\hat{x}_{i}}, 𝔼{xixi}=x^ix^i+vi\mathbb{E}\{{{x_{i}}x_{i}^{*}}\}={{\hat{x}}_{i}}\hat{x}_{i}^{*}+{v_{i}}, and 𝔼{xixj}=x^ix^j\mathbb{E}\{{{x_{i}}x_{j}^{*}}\}={{{\hat{x}}_{i}}\hat{x}_{j}^{*}} for any iji\neq j.

According to these properties, the detailed derivation is presented in Appendix A. In general, the deduced form of LMMSE estimation in channel coefficients corresponding to data subcarriers, using estimated symbols derived in the previous JCD layer, is given by (16). The formulation is as follows

𝐂𝐲𝐡\displaystyle{{\bf{C}}_{{\bf{yh}}}} =𝐗^𝐂𝐡𝐡,\displaystyle={\hat{\bf{X}}}{{\bf{C}}_{{\bf{hh}}}}, (18a)
𝐂𝐲𝐲\displaystyle{{\bf{C}}_{{\bf{yy}}}} =𝐗^𝐂𝐡𝐡𝐗^H+𝐀𝐁𝐀H+σw2𝐈NR(KP)\displaystyle={\hat{\bf{X}}}{{\bf{C}}_{{\bf{hh}}}}{{\hat{\bf{X}}}^{\mathrm{H}}}+{\bf{AB}}{{\bf{A}}^{\mathrm{H}}}+\sigma_{w}^{2}{{\bf{I}}_{{N_{\text{R}}}\left({K-P}\right)}} (18b)

with 𝐀=𝐈NR𝟏1×NT𝐈KP{\mathbf{A}}={{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{K-P}} and 𝐁=𝐂𝐡𝐡(𝟏NR×NR𝐕){\mathbf{B}}={{\mathbf{C}}_{{\mathbf{hh}}}}\odot({{{\mathbf{1}}_{{N_{\text{R}}}\times{N_{\text{R}}}}}\otimes{\mathbf{V}}}). Here, 𝐂𝐡𝐡{{\mathbf{C}}_{{\mathbf{hh}}}} refers to the second-order statistics of MIMO-OFDM channels, which can be acquired through 𝐂𝐡𝐡=𝔼{𝐡𝐡H}NRNT(KP)×NRNT(KP){{\mathbf{C}}_{{\mathbf{hh}}}}=\mathbb{E}\{{{\mathbf{h}}{{\mathbf{h}}^{\mathrm{H}}}}\}\in{\mathbb{C}^{{N_{\text{R}}}{N_{\text{T}}}({K-P})\times{N_{\text{R}}}{N_{\text{T}}}({K-P})}}. 𝐕=diag(v1,,vNT(KP)){\mathbf{V}}={\text{diag}}({{v_{1}},\ldots,{v_{{N_{\text{T}}}({K-P})}}}) refers to the autocorrelation of signal detection error acquired in the EP detector in the previous JCD layer. Specifically, vi=𝔼{ΔeiΔei}{v_{i}}=\mathbb{E}\{{\Delta{e_{i}}\Delta e_{i}^{*}}\} corresponds to the ii-th diagonal elements in 𝐕p(T){\mathbf{V}}_{\text{p}}^{(T)}, which is computed according to (12).

III-B Complexity Analysis of MJCD-LMMSE

Before conducting experimental realization, the number of layers in the proposed JCD structure, i.e., II, is worth discussing, to provide the most effective performance promotion with the least rounds of JCD iteration. It is empirically observed that I=2I=2 is preferred, reaching the most efficient improvement compared to the original design, i.e., traditional LMMSE and EP. That is to say, after acquiring the original channel estimates and performing EP detection accordingly, only one extra JCD iteration is needed. The reason for the setting of I=2I=2 is discussed in Section V.

Even though the least number of JCD layers has been adopted to reduce complexity as much as possible, the proposed MJCD-LMMSE still involves substantial computational cost. Specifically, the complexity of this method is 𝒪(NR3NT2(KP)3)\mathcal{O}({N_{\text{R}}^{3}N_{\text{T}}^{2}{{({K-P})}^{3}}}). For common MIMO-OFDM configuration, for example, 8×88\times 8 MIMO, K=256K=256 and P=16P=16, the computational cost can be prohibitive.

The high complexity of the proposed MJCD-LMMSE can be intractable, where the cost is dominated by operations of matrix multiplication rather than matrix inversion. According to (18a), the computation of 𝐂𝐲𝐡{{\mathbf{C}}_{{\mathbf{yh}}}} and 𝐂𝐲𝐲{{\mathbf{C}}_{{\mathbf{yy}}}} involve the multiplications of two matrices with dimensions of NR(KP)×NRNT(KP){{N_{\text{R}}}({K-P})\times{N_{\text{R}}}{N_{\text{T}}}({K-P})} and NRNT(KP)×NRNT(KP){{N_{\text{R}}}{N_{\text{T}}}({K-P})\times{N_{\text{R}}}{N_{\text{T}}}({K-P})}, respectively. Therefore, common algorithms that substitute iterative approximation for direct matrix inversion, for example, Gauss-Seidel method [40], are not suitable for the target of reducing complexity under such circumstances.

On the other hand, there is an opportunity for further exploration into methods for reducing complexity in the derivation process of the proposed approach. Given the notable computational overhead associated with matrix multiplications, careful attention to dimensionality reduction is warranted. Fundamentally, the utilization of the LMMSE principle within OFDM subsystems emerges as a potential solution. This approach eliminates the requirement for large-dimension equivalence and serves to mitigate concerns surrounding computational costs in matrix multiplications. A detailed discussion of this concept is provided in the next section.

IV Low-Complexity Equivalent of Proposed Data-aided Method

In this section, another equivalent representation of LMMSE-based data-aided method is proposed, namely, OJCD-LMMSE, aiming at reducing computational complexity. The proposed equivalent algorithm is deduced in separate OFDM subsystems, which mitigates the high-dimensional computations involved in the MJCD-LMMSE algorithm.

IV-A OJCD-LMMSE

The orthogonality principle for LMMSE-based channel estimation in OFDM systems has been applied in the traditional estimator in JCD-1 as shown in (5)-(6). Similarly, as for application in the second JCD layer, preliminary LS estimation at data subcarriers is

𝐡m,nLS,new=(𝐗nd)1𝐲m,nd.{\mathbf{h}}_{m,n}^{{\text{LS,new}}}={\left({{\mathbf{X}}_{n}^{\text{d}}}\right)^{-1}}{\mathbf{y}}_{m,n}^{\text{d}}. (19)

However, the computation in (19) analogous to (5) is intractable, not only because the transmitted data symbols are unknown for detection, but also because the output at the mm-th receiving antenna corresponding to the nn-th transmitted data block 𝐲m,nd{\mathbf{y}}_{m,n}^{\text{d}} is not available. Instead, the mm-th received component corresponding to the nn-th transmitted data block can be estimated [18] through

𝐲^m,nd=𝐲mdn=1nnNT𝐗^nd𝐡^m,nd,{\mathbf{\hat{y}}}_{m,n}^{\text{d}}={\mathbf{y}}_{m}^{\text{d}}-\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}\hat{\mathbf{h}}_{m,n^{\prime}}^{\text{d}}}, (20)

under which circumstance the data estimates error should be considered in the derivation of LMMSE channel estimates. A principle is presented in [35] for measuring the influence of symbol error through a weighting matrix. However, the decision of the matrix elements is made through a fixed threshold and is exclusively deduced for BEM-based methods under the Gaussian assumption of expansion coefficients. Therefore, this scheme does not apply to the general form of LMMSE estimates, let alone the potential inaccuracy induced by the nonuse of true data error information.

In our proposed method, the estimated received component is equivalently represented as

𝐲^m,nd=𝐗^nd𝐡m,nd+𝐙m,n,{\mathbf{\hat{y}}}_{m,n}^{\text{d}}={\hat{\mathbf{X}}}_{n}^{\text{d}}{\mathbf{h}}_{m,n}^{\text{d}}+{{\mathbf{Z}}_{m,n}}, (21)

where 𝐙m,n{{\mathbf{Z}}_{m,n}} includes all interference and is treated as the equivalent noise term

𝐙m,n=n=1nnNT𝐗^nd𝚫𝐡m,nd+n=1NT𝚫𝐄n𝐡m,nd+𝐰md,{{\mathbf{Z}}_{m,n}}=\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}{\mathbf{\Delta h}}_{m,n^{\prime}}^{\text{d}}}+\sum\limits_{n^{\prime}=1}^{{N_{\text{T}}}}{{\mathbf{\Delta}}{{\mathbf{E}}_{n^{\prime}}}{\mathbf{h}}_{m,n^{\prime}}^{\text{d}}}+{\mathbf{w}}_{m}^{\text{d}}, (22)

among which 𝚫𝐡m,nd{{\mathbf{\Delta h}}_{m,n^{\prime}}^{\text{d}}} and 𝚫𝐄n{{\mathbf{\Delta}}{{\mathbf{E}}_{n^{\prime}}}} denote the channel estimation error and signal detection error, respectively

𝚫𝐡m,nd\displaystyle{{\mathbf{\Delta h}}_{m,n^{\prime}}^{\text{d}}} =𝐡m,nd𝐡^m,nd,\displaystyle={\mathbf{h}}_{m,n^{\prime}}^{\text{d}}-\hat{\mathbf{h}}_{m,n^{\prime}}^{\text{d}}, (23a)
𝚫𝐄n\displaystyle{\mathbf{\Delta}}{{\mathbf{E}}_{n^{\prime}}} =𝐗nd𝐗^nd.\displaystyle={\mathbf{X}}_{n^{\prime}}^{\text{d}}-{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}. (23b)

Consequently, the LS computation in (19) is now replaced by

𝐡m,nLS,new=(𝐗^nd)1𝐲^m,nd=𝐡m,nd+(𝐗^nd)1𝐙m,n,{\mathbf{h}}_{m,n}^{{\text{LS,new}}}={\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)^{-1}}{\mathbf{\hat{y}}}_{m,n}^{\text{d}}={\mathbf{h}}_{m,n}^{\text{d}}+{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)^{-1}}{{\mathbf{Z}}_{m,n}}, (24)

and the LMMSE estimation is denoted by

𝐡m,nLMMSE,new=𝐖LMMSEnew𝐡m,nLS,new,{\mathbf{h}}_{m,n}^{{\text{LMMSE,new}}}={\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}}{\mathbf{h}}_{m,n}^{{\text{LS,new}}}, (25)

which requires the derivation of weight 𝐖LMMSEnew{\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}} defined as follows

𝐖LMMSEnew\displaystyle{\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}} =𝐑𝐡d𝐡LS,new𝐑𝐡LS,new𝐡LS,new1,\displaystyle={{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}}{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}^{-1}, (26a)
𝐑𝐡d𝐡LS,new\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}} =𝔼{𝐡m,nd(𝐡m,nLS,new)H},\displaystyle=\mathbb{E}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right)}^{\mathrm{H}}}}\right\}, (26b)
𝐑𝐡LS,new𝐡LS,new\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}} =𝔼{(𝐡m,nLS,new)(𝐡m,nLS,new)H}.\displaystyle=\mathbb{E}\left\{{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right){{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right)}^{\mathrm{H}}}}\right\}. (26c)

The proposed algorithm is summarized in Algorithm 2, and the detailed derivation process is written in Appendix B. Note that 𝐕n=diag(v1,,vKP){{\mathbf{V}}_{n}}={\text{diag}}({{v_{1}},\ldots,{v_{K-P}}}) refers to the autocorrelation of signal detection error at the nn-th transmitted data block acquired in EP detector in the first layer. Similarly, vi=𝔼{ΔeiΔei}{v_{i}}=\mathbb{E}\{{\Delta{e_{i}}\Delta e_{i}^{*}}\} corresponds to the ii-th diagonal elements in 𝐕p(T){\mathbf{V}}_{\text{p}}^{(T)}, which is acquired through (12).

Input: 𝐂𝐡𝐡{{\mathbf{C}}_{{\mathbf{hh}}}}, {𝐲md}m=1NR\{{{\mathbf{y}}_{m}^{\text{d}}}\}_{m=1}^{{N_{\text{R}}}}, {𝐡^m,nd}m,n=1,1NR,NT\{{\hat{\mathbf{h}}_{m,n}^{\text{d}}}\}_{m,n=1,1}^{{N_{\text{R}}},{N_{\text{T}}}}, {𝐗^nd}n=1NT\{{{\hat{\mathbf{X}}}_{n}^{\text{d}}}\}_{n=1}^{{N_{\text{T}}}}, {𝐗np}n=1NT\{{{\mathbf{X}}_{n}^{\text{p}}}\}_{n=1}^{{N_{\text{T}}}}, {𝐕n}n=1NT\{{{{\mathbf{V}}_{n}}}\}_{n=1}^{{N_{\text{T}}}}, 𝐖LMMSE{{\mathbf{W}}_{{\text{LMMSE}}}} in JCD-1, σw2\sigma_{w}^{2}
Output: {𝐡m,nLMMSE,new}m,n=1,1NR,NT\{{{\mathbf{h}}_{m,n}^{{\text{LMMSE,new}}}}\}_{m,n=1,1}^{{N_{\text{R}}},{N_{\text{T}}}}
Initialize: Compute 𝐑𝐡d𝐡d(n1,n2){{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({{n_{1}},{n_{2}}}\right), 𝐑𝐡d𝐡p(n1,n2){{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({{n_{1}},{n_{2}}}\right) and 𝐑𝐡p𝐡p(n1,n2){{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}\left({{n_{1}},{n_{2}}}\right) from 𝐂𝐡𝐡{{\mathbf{C}}_{{\mathbf{hh}}}} according to (37), where n1,n2{1,,NT}{n_{1}},{n_{2}}\in\left\{{1,\ldots,{N_{\text{T}}}}\right\}. Compute 𝐖1=𝐖LMMSEd{{\mathbf{W}}_{1}}={\mathbf{W}}_{{\text{LMMSE}}}^{\text{d}};
Compute 𝐕D=𝐑𝐡d𝐡dn=1NT𝐕n{{\mathbf{V}}_{\text{D}}}={{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\odot\sum\limits_{n=1}^{{N_{\text{T}}}}{{{\mathbf{V}}_{n}}};
Compute 𝐕x(n1,n2)=𝐱^n1d(𝐱^n2d)H{{\mathbf{V}}^{\text{x}}}\left({{n_{1}},{n_{2}}}\right)={\hat{\mathbf{x}}}_{{n_{1}}}^{\text{d}}{\left({{\hat{\mathbf{x}}}_{{n_{2}}}^{\text{d}}}\right)^{\mathrm{H}}};
for n=1,,NTn=1,\ldots,{N_{\text{T}}} do
       Compute 𝐁n{{\mathbf{B}}_{n}} according to (41);
       Compute 𝚺n{\bm{\Sigma}_{n}} according to (43);
       Compute 𝐑𝐡d𝐡LS,new(n){{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}\left(n\right)} according to (38);
       Compute 𝐑𝐡LS,new𝐡LS,new(n){{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}\left(n\right)} according to (39);
       Calculate the weight matrix: 𝐖LMMSEnew(n)=𝐑𝐡d𝐡LS,new(n)𝐑𝐡LS,new𝐡LS,new1(n){\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}}\left(n\right)={{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}\left(n\right)}{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}^{-1}\left(n\right)};
       for m=1,,NRm=1,\ldots,{N_{\text{R}}} do
             Compute 𝐲^m,nd{\mathbf{\hat{y}}}_{m,n}^{\text{d}} according to (20);
             Perform LS estimation 𝐡m,nLS,new{\mathbf{h}}_{m,n}^{{\text{LS,new}}} according to (24);
             Perform LMMSE estimation: 𝐡m,nLMMSE,new=𝐖LMMSEnew(n)𝐡m,nLS,new{\mathbf{h}}_{m,n}^{{\text{LMMSE,new}}}={{\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}}\left(n\right)}{\mathbf{h}}_{m,n}^{{\text{LS,new}}}.
       end for
      
end for
Algorithm 2 Low-Complexity OJCD-LMMSE Estimator for JCD-2

IV-B Complexity Comparison

With the acquisition of two proposed equivalent representations of the LMMSE-based data-aided method, namely MJCD-LMMSE and OJCD-LMMSE, it is essential to conduct a comparative analysis of the computational complexity. The comparison using 𝒪()\mathcal{O}(\cdot) notation is considered. Furthermore, for a more intuitive comparison, the floating point operations (FLOPs) 111We adopt the widely used definition of FLOPs as the number of multiply-add operations. involved in the realizations of both algorithms are considered. According to Table I, it is obvious that the realization of MJCD-LMMSE suffers from high computational cost at the 4×44\times 4, K=128K=128, and P=8P=8 MIMO-OFDM configuration. In contrast, substituting the MJCD-LMMSE estimator with the OJCD-LMMSE estimator at JCD-2 effectively reduces the FLOPs by three orders of magnitude.

TABLE I: Complexity Analysis of proposed algorithms
Algorithm FLOPs Complexity
MJCD-LMMSE 2.66×1092.66\times 10^{9} 𝒪(NR3NT2(KP)3)\mathcal{O}({N_{\text{R}}^{3}N_{\text{T}}^{2}{{({K-P})}^{3}}})
OJCD-LMMSE 4.84×1064.84\times 10^{6} 𝒪(PNT(NT1)2(KP)2)\mathcal{O}({P{N_{\text{T}}}{{({{N_{\text{T}}}-1})}^{2}}{{({K-P})}^{2}}})

V Simulation Results

In this section, numerical results are presented. The detailed parameter settings in the MIMO-OFDM system are first shown. Subsequently, discussions on convergence and equivalence of the proposed JCD structure are presented. Moreover, the impact of pilot lengths is investigated. Finally, the bit error rate (BER) performance under various scenarios is evaluated.

V-A Parameter Settings

A MIMO-OFDM system configured with 4×44\times 4 or 8×88\times 8 antennas and K=128K=128 or 256256 subcarriers is considered. The modulation type for transmitted data streams is set as quadrature phase-shift keying (QPSK) or 16-QAM. Both block-fading and time-varying scenarios are implemented, utilizing different frame structures as illustrated in Fig. 3. For evaluations of performance improvements based on the proposed algorithms, the frame design depicted in Fig. 3(a), consistent with the assumption in Section II, is utilized in Sections V-B through V-D. Conversely, for the performance assessment of the proposed receiver under various time-selective fading environments, the pilot pattern shown in Fig. 3(b) is employed. Note that the figure takes the 4×44\times 4 with K=128K=128, P=8P=8 case as an example, and uses the corresponding pilot interval to represent the resource block. The number of JCD layers, as mentioned above, is I=2I=2. Besides, in the detection module, the number of EP iterations is fixed at T=5T=5, and the damping factor value is empirically set as β=0.2\beta=0.2.

Refer to caption
(a) Block-fading.
Refer to caption
(b) Time-varying, NpN_{\text{p}} OFDM symbols are selected
for pilot transmission.
Figure 3:  Frame structures under different scenarios.

The tapped delay line (TDL) channel model is adopted during the generation of MIMO-OFDM channel datasets, where TDL-C, the non-line-of-sight (NLOS) case profile with 24 taps, is utilized. The correlation between antennas is also taken into consideration. Specifically, the Kronecker model is adopted for the representation of MIMO characteristic, i.e., 𝐇corr=𝐑r1/2𝐇iid𝐑t1/2{{\mathbf{H}}_{{\text{corr}}}}={\mathbf{R}}_{\text{r}}^{1/2}{{\mathbf{H}}_{{\text{iid}}}}{\mathbf{R}}_{\text{t}}^{1/2}, where 𝐑t{\mathbf{R}}_{\text{t}} and 𝐑r{\mathbf{R}}_{\text{r}} denotes the spatial correlation of transmitter and receiver, which is illustrated by a correlation coefficient ρ\rho using exponential correlation model such that the element of matrices rij{r_{ij}} fulfills

rij={ρji,ij,rji,i>j.{r_{ij}}=\left\{{\begin{array}[]{*{20}{c}}{\rho^{j-i}},&i\leqslant j,\\ r_{ji}^{*},&i>j.\end{array}}\right. (27)

The corresponding spatial matrices are utilized for assignment in nrTDLChannel 222The MATLAB 5G Toolbox function.. The configurations concerned for MIMO-OFDM system and channel generation are summarized in Table II. Note that ρ=0\rho=0 is used for channel generation unless noted otherwise.

TABLE II: Parameters for MIMO-OFDM Simulation
Parameter Value
Antennas 4×4, 8×84\times 4,\ 8\times 8
Subcarriers 128, 256128,\ 256
Pilots 8, 16, 328,\ 16,\ 32
Modulation QPSK,  16-QAM
JCD Layers 22
EP Iterations 55
Damping Factor 0.20.2
Delay Profile TDL-C (NLOS)
Carrier Frequency 3.53.5 GHz
Delay Spread 200200 ns
Subcarrier Spacing 1515 kHz
MIMO Correlation ρ=0, 0.5\rho=0,\ 0.5

V-B Layers in MJCD-LMMSE Based JCD Structure

The high complexity of the proposed MJCD-LMMSE makes it necessary to avoid extra JCD iterations, such that the computational cost is reduced as much as possible. For discussions on the convergence of the MJCD-LMMSE-based JCD design, 4×44\times 4 MIMO with K=128K=128 and P=16P=16 is configured. Both estimation accuracy of 𝐡^LMMSE{\hat{\mathbf{h}}_{{\text{LMMSE}}}} and detection error of 𝐱^{\hat{\mathbf{x}}} are evaluated under the JCD setting at I=2I=2 and I=5I=5, respectively. The case of the traditional method, i.e., I=1I=1, is utilized as the benchmark under different signal-to-noise ratios (SNRs) so that the extent of performance promotion after different JCD iterations is observed intuitively. Notably, the channel estimation accuracy is measured by the mean square error (MSE)

MSE=12NtestNRNT(KP)i=1Ntest𝐡^i𝐡i2,{\text{MSE}}=\frac{1}{{2{N_{{\text{test}}}}{N_{\text{R}}}{N_{\text{T}}}\left({K-P}\right)}}\sum\limits_{i=1}^{{N_{{\text{test}}}}}{{{\left\|{\hat{\mathbf{h}}_{i}-{\mathbf{h}}_{i}}\right\|}^{2}}}, (28)

where 𝐡i{\mathbf{h}}_{i} denotes the MIMO-OFDM channels corresponding to data transmission during the ii-th test, and Ntest{{N_{{\text{test}}}}} is the number of testing realizations. The signal detection error is evaluated by BER.

Fig. 4 shows the performance comparison under QPSK modulation. From the figure, it is obvious that the gains in performance occur in JCD-2, while from JCD-3 to JCD-5, the performance tends to saturate. Moreover, according to Fig. 4(a), under SNR[4, 8]dB\text{SNR}\in[{4,\,8}]\ \text{dB}, the use of JCD design may lead to negative effects on estimation accuracy. This is reasonable, for the detection accuracy is poor in low SNRs according to Fig. 4(b), thus the estimated symbol 𝐗^{\hat{\mathbf{X}}} used in MJCD-LMMSE is inaccurate, which may deviate from the assumption of unbiased estimation according to Section III-A, 4). Despite the lower estimation accuracy compared to I=1I=1 in low SNRs, the corresponding detection performance does not visibly degrade, as shown in Fig. 4(b). As for SNR[12, 28]dB\text{SNR}\in[{12,\,28}]\ \text{dB}, the improvement of both estimation and detection accuracy can be observed in JCD-2. The comparisons under 16-QAM modulation showcase similar results, which are not exhibited. In general, it is empirically concluded that I=2I=2 provides the most efficient improvement, which is implemented in the rest of the simulation.

Refer to caption

(a) MSE of channel estimation

Refer to caption

(b) BER of signal detection

Figure 4:  Accuracy of channel estimation and signal detection at the output of JCD structure under different settings of II.

V-C Performance Comparison Between MJCD-LMMSE and OJCD-LMMSE

In this subsection, we evaluate the performance comparison between the proposed OJCD-LMMSE and MJCD-LMMSE. Theoretically, equivalence in performance is expected, as OJCD-LMMSE is derived equivalently using the LMMSE principle in OFDM subsystems. To further validate this, the following simulation is organized: Similar to the previous subsection, a MIMO-OFDM system configured with 4×44\times 4 antennas and K=128K=128, P=16P=16 is considered, and the detection error at the output of JCD-2 under different SNRs is evaluated, where the proposed algorithms are utilized at JCD-2 for performance comparison. Besides, the case of I=1I=1, i.e., traditional LMMSE and EP, is utilized as the baseline.

Refer to caption

Figure 5:  Detection performance comparison of JCD design using proposed algorithms.

Fig. 5 shows the comparison of the proposed methods under QPSK modulation. On the one hand, both of the JCD designs adopting the proposed algorithms show significant improvement compared to the benchmark with traditional algorithms. On the other hand, OJCD-LMMSE provides comparable performance to that of MJCD-LMMSE based JCD structure. In summary, simulation results in Fig. 5 further validate the performance equivalence of our proposed designs, yet OJCD-LMMSE based JCD structure significantly reduces the computational cost. Therefore, OJCD-LMMSE-based JCD structure is adopted in the remainder of the performance comparisons.

V-D Influences of Pilot Information

Another factor that influences the performance of JCD remains for discussion, which is the length of inserted pilot sequences for preliminary estimation in JCD-1. According to (5)-(7), using more subcarriers for inserting pilots naturally leads to more accurate channel estimation with traditional LMMSE, as more information becomes available. Consequently, it is predictable that if the number of inserted pilots is sufficient, utilizing the JCD structure to facilitate more reliable EP detection becomes unnecessary since traditional LMMSE can already provide accurate estimation results. Conversely, the fewer the pilots inserted, the more significant the performance improvement offered by the proposed JCD structure compared to the baseline scenario where I=1I=1. To provide empirical evidence for the aforementioned analysis, the following simulation is conducted.

V-D1 Performance Under Different Pilot Sequence Lengths

Consider both of the MIMO-OFDM configurations, that is, 4×44\times 4 MIMO with K=128K=128 and 8×88\times 8 MIMO with K=256K=256. Three different types of pilot settings, i.e., P{8,16,32}P\in\{8,16,32\} are considered. Under each scenario both the detection accuracy of I=1I=1 and I=2I=2 are presented. Moreover, the performance of EP detector when perfect CSI is available is also shown as a reference point.

Refer to caption

(a) BER under QPSK modulation

Refer to caption

(b) BER under 16-QAM modulation

Figure 6:  Detection performance of the proposed OJCD-LMMSE with different pilot lengths under 4×44\times 4 MIMO with K=128K=128.

Fig. 6 shows the performance comparison under different SNRs in MIMO-OFDM system with 4×44\times 4 antennas and 128128 subcarriers. According to Fig. 6(a), it is observed that our proposed JCD structure provides remarkable gains when P=8P=8 and significantly improves the performance saturation caused by inaccurate channel estimation under high SNR regions. As for P=16P=16, a performance gain of over 44 dB is achieved. A similar phenomenon can be observed for 16QAM modulation, as shown in Fig. 6(b), where P=16P=16 provides a gain of approximately 22 dB compared to I=1I=1. On the contrary, when P=32P=32, even though performance gain still exists in Fig. 6(a), the gain is less pronounced, mainly because the traditional design provides accurate channel estimation and consequently precise signal detection, leaving little room for improvement, as we refer to the ideal case denoted by Perfect CSI. In Fig. 6(b), the accuracy even tends to converge at I=1I=1.

Refer to caption

(a) BER under QPSK modulation

Refer to caption

(b) BER under 16-QAM modulation

Figure 7:  Detection performance of the proposed OJCD-LMMSE with different pilot lengths under 8×88\times 8 MIMO with K=256K=256.

The same comparisons are conducted in a MIMO-OFDM system with 8×88\times 8 antennas and 256256 subcarriers, as shown in Fig. 7. Under QPSK modulation, according to Fig. 7(a), similar findings are observed, that is, the fewer pilots inserted, the more improvement our proposed JCD provides. Notably, for P=8P=8, despite the apparent performance promotion compared to I=1I=1, the proposed JCD structure exhibits no enhancement of detection accuracy with the increase of SNR when SNR[20, 28]dB\text{SNR}\in[{20,\,28}]\text{dB}. The reason for such a problem, in simple terms, is that the estimated channel coefficients significantly deviate from the actual CSI in the abovementioned SNR region, making it difficult for EP detection to approximate the true posterior distribution in (8) [9]. Similar trends are observed for 16QAM modulation, as shown in Fig. 7(b).

In general, the proposed JCD shows substantial enhancement under inadequate pilot information. The setting of P=16P=16 presents a desirable compromise between detection accuracy and the extent of improvement, making it a reasonable choice for the JCD structure. Furthermore, to further explore the potential of our proposed OJCD-LMMSE when P=8P=8, the decoder is introduced at the output of the JCD structure to compensate for performance saturation, as discussed below.

V-D2 Incorporating Channel Decoder

According to the 8×88\times 8 case in Fig. 7, degradation or saturation caused by inadequate pilot information when P=8P=8 restricts the performance of our proposed JCD structure. Therefore, for a further evaluation of the performance enhancement, the Viterbi decoder is introduced according to Fig. 2. Specifically, the decoder utilizes the extrinsic information (𝐱e(T),𝐕e(T))({{\mathbf{x}}_{\text{e}}^{(T)},{\mathbf{V}}_{\text{e}}^{(T)}}) in (11) output by EP detector at JCD-II, and computes the corresponding pdf pe(𝐱|𝐲)𝒩(𝐱:𝐱e(T),𝐕e(T)){p_{\text{e}}}({{\mathbf{x}}|{\mathbf{y}}})\sim\mathcal{N}({{\mathbf{x}}:{\mathbf{x}}_{\text{e}}^{(T)},{\mathbf{V}}_{\text{e}}^{(T)}}), which is subsequently demapped as extrinsic LLRs and delivered for channel decoding [41].

Fig. 8 shows the performance with and without the decoding module, where QPSK modulation with (1984,1/2)(1984,1/2) convolutional code is considered for the coded case. Note that we use Eb/N0E_{b}/N_{0} as metric. Moreover, to ensure fairness, the Eb/N0E_{b}/N_{0} of the uncoded case is 3 dB more than that of the coded case. As shown in Fig. 8, our proposed JCD design exhibits better performance than the traditional design, whether channel decoding is considered or not. Furthermore, the tendency for performance saturation due to inadequate pilot information in the uncoded scenario is effectively mitigated upon incorporating the decoder. Consequently, the performance disparity between the ideal situation and our proposed JCD scheme is reduced. Overall, our proposed JCD receiver delivers satisfactory performance with minimal pilot redundancy.

Refer to caption

Figure 8:  BER performance of the proposed OJCD-LMMSE under 8×88\times 8 MIMO with K=256,P=8K=256,P=8.

V-E Performance Comparisons with BEM-based Receiver

The introduction of basis functions in [35] provides another baseline for conducting LMMSE-based data-aided estimation, using MtM_{t} B-Spline functions [37, 38] and MfM_{f} DPS sequences [36] to represent the time-frequency characteristics of fading channels. A weighting principle (i.e., WLMMSE) is designed under BEM to measure the influence of data detection error, which is also deployed in our proposed system. In this section, simulations are conducted under different time-varying scenarios to evaluate whether our proposed JCD receiver reaches comparable accuracy to that of BEM-based receiver, and complexity analysis is investigated.

The 4×44\times 4 MIMO system with K=128K=128 subcarriers is configured, and the spatial correlation coefficient is set to ρ=0.5\rho=0.5. The maximum Doppler shift for generating time-varying TDL channels is determined based on the velocity v{100,300}v\in\{100,300\} km/h. The transmission frame shown in Fig. 3(b) is adopted, where Np{N_{\text{p}}} out of 14 OFDM symbols are allocated for pilot transmission. Traditional LMMSE and EP methods are employed in the first layer, consistent with the previous evaluations. For BEM-based receivers,333BEM-WLMMSE integrates DPS and B-Spline basis functions to model fading across both time and frequency domains, utilizing time-frequency concatenation for data-aided computations. Conversely, the DPS-WLMMSE method applies DPS basis functions to model frequency-domain autocorrelation at each time instant, offering a significant reduction in computational complexity. the JCD loop requires I=11I=11 iterations,444Note that I=11I=11 is selected for BEM-based methods to achieve optimal performance. However, performance at I=2I=2 is also included in Fig. 10 to ensure a fair comparison of computational complexity. A total of Mf=9M_{f}=9 DPS sequences are chosen based on delay spread characteristics, while Mt=4M_{t}=4 is empirically selected to optimize the tradeoff between computational complexity and accuracy [38].

V-E1 Comparisons at Medium Speed

The time-varying scenario with a velocity of v=100v=100 km/h is considered first. A pilot size of P=4P=4 is selected to balance performance and transmission efficiency, while the remaining 112 subcarriers are reserved for data transmission. The detection accuracy in a coded system with QPSK modulation is presented in Fig. 9(a). In both OJCD-LMMSE and DPS-WLMMSE-based receivers, data-aided estimates are computed at Np=4{N_{\text{p}}}=4 symbols separately and subsequently interpolated in the time domain using cubic spline interpolation. As shown in Fig. 9(a), the proposed OJCD-LMMSE-based receiver outperforms the traditional method by more than 2.5 dB at a BER of 10310^{-3}. Additionally, the proposed receiver exhibits a performance advantage over the DPS-WLMMSE-based receiver, which is attributed to the decision principle leading to incomplete utilization of data error information in the weighting matrix.

In comparison to the BEM-WLMMSE-based receiver, which fully exploits time-frequency correlation, OJCD-LMMSE shows a performance gap of approximately 1.5 dB due to its use of an interpolator. While the BEM-WLMMSE method provides superior data-aided improvement, it incurs considerable computational complexity due to the concatenation of dimensions. As illustrated in Fig. 10, the BEM-WLMMSE method’s superior BER performance is accompanied by a four-order magnitude increase in computational overhead. At I=2I=2, the performance gap narrows to approximately 0.75 dB, but the FLOP count remains three orders of magnitude higher. In contrast, OJCD-LMMSE achieves a desirable balance between performance and complexity.

Refer to caption

(a) v=100v=100 km/h, P=4P=4, Np=4N_{\text{p}}=4.

Refer to caption

(b) v=300v=300 km/h, P=8P=8, Np=14N_{\text{p}}=14.

Figure 9:  Detection performance comparison between the proposed receiver and BEM-based receivers under different time-varying scenarios in a 4×44\times 4 MIMO system with K=128K=128 and ρ=0.5\rho=0.5.

V-E2 Comparisons at High Speed

To further demonstrate the applicability of the proposed OJCD-LMMSE-based receiver in high-mobility scenarios, it is evaluated under a time-varying condition with v=300v=300 km/h. With P=8P=8 and Np=14{N_{\text{p}}}=14, the detection accuracy at the decoder output is presented in Fig. 9(b). The results show that OJCD-LMMSE achieves a gain of approximately 1.3 dB over the traditional method at a target BER of 10410^{-4} and outperforms the DPS-WLMMSE-based receiver, validating the effectiveness of incorporating detection error statistics.

Notably, the BEM-WLMMSE method shows reduced performance at higher SNRs due to an inadequate Mt=4M_{t}=4 setting for high mobility. Nonetheless, the proposed OJCD-LMMSE-based receiver remains robust, performing computations for each OFDM symbol. As shown in Fig. 9(b), the performance gap between OJCD-LMMSE and BEM-WLMMSE narrows to 0.2 dB at a BER of 10310^{-3}. Fig. 10 further highlights the superior computational efficiency of OJCD-LMMSE.

Refer to caption


Figure 10:  Performance-complexity trade-off for data-aided receivers evaluated under a 4×44\times 4 MIMO system with K=128K=128 and ρ=0.5\rho=0.5. For the medium speed scenario (v=100v=100 km/h), P=4P=4 and Np=4N_{\text{p}}=4 are set. For the high speed scenario (v=300v=300 km/h), P=8P=8 and Np=14N_{\text{p}}=14 are set.

VI Conclusion

We derived the general form of the data-aided LMMSE channel estimation within a JCD structure. This approach, utilizing detected symbols output by the EP detector for refined channel estimates, constitutes the MJCD-LMMSE based structure and demonstrates remarkable performance improvement compared to traditional designs. A low-complexity equivalent algorithm, OJCD-LMMSE, has been proposed as a substitute, effectively reducing complexity without sacrificing performance. Simulation results under various conditions, including different MIMO-OFDM configurations, pilot information, and time-varying characteristics, validate the accuracy advancement that the OJCD-LMMSE-based receiver offers over traditional designs. Furthermore, our proposed OJCD-LMMSE based receiver exhibits superiority over BEM-based data-aided receivers in balancing computational overhead and detection accuracy.

Appendix A Derivation of MJCD-LMMSE

Given the assumptions on statistical properties of all concerned random variables listed in Section III-A, (a)-(c), the deduction can be operated as follows. The derivation of 𝐂𝐲𝐡{{\mathbf{C}}_{{\mathbf{yh}}}} is firstly operated:

𝐂𝐲𝐡\displaystyle{{\mathbf{C}}_{{\mathbf{yh}}}} =𝔼h,x,w{𝐲𝐡H}\displaystyle=\mathbb{E}_{h,x,w}\left\{{{\mathbf{y}}{{\mathbf{h}}^{\mathrm{H}}}}\right\}
=𝔼x{𝐗}𝔼h{𝐡𝐡H}+𝔼w{𝐰}𝔼h{𝐡H}\displaystyle=\mathbb{E}_{x}\left\{{\mathbf{X}}\right\}\mathbb{E}_{h}\left\{{{\mathbf{h}}{{\mathbf{h}}^{\mathrm{H}}}}\right\}+\mathbb{E}_{w}\left\{{\mathbf{w}}\right\}\mathbb{E}_{h}\left\{{{{\mathbf{h}}^{\mathrm{H}}}}\right\}
=𝐗^𝐂𝐡𝐡.\displaystyle={\hat{\mathbf{X}}}{{\mathbf{C}}_{{\mathbf{hh}}}}. (29)

Note that 𝐗^{\hat{\mathbf{X}}} is used to represent 𝔼{𝐗}\mathbb{E}\{{\mathbf{X}}\} since 𝔼{xi}=x^i\mathbb{E}\{{{x_{i}}}\}={\hat{x}_{i}}. Similarly, 𝐱^=𝔼{𝐱}{\hat{\mathbf{x}}}=\mathbb{E}\{{\mathbf{x}}\}. The derivation of 𝐂𝐲𝐲{{\mathbf{C}}_{{\mathbf{yy}}}}

𝐂𝐲𝐲\displaystyle{{\mathbf{C}}_{{\mathbf{yy}}}} =𝔼h,x,w{𝐲𝐲H}\displaystyle=\mathbb{E}_{h,x,w}\left\{{{\mathbf{y}}{{\mathbf{y}}^{\mathrm{H}}}}\right\}
=𝔼h,x{𝐗𝐡𝐡H𝐗H}+𝔼x{𝐗}𝔼h{𝐡}𝔼w{𝐰H}\displaystyle=\mathbb{E}_{h,x}\left\{{{\mathbf{Xh}}{{\mathbf{h}}^{\text{H}}}{{\mathbf{X}}^{\text{H}}}}\right\}+\mathbb{E}_{x}\left\{{\mathbf{X}}\right\}\mathbb{E}_{h}\left\{{\mathbf{h}}\right\}\mathbb{E}_{w}\left\{{{{\mathbf{w}}^{\text{H}}}}\right\}
+𝔼w{𝐰}𝔼h{𝐡H}𝔼x{𝐗H}+𝔼w{𝐰𝐰H}\displaystyle~{}~{}+\mathbb{E}_{w}\left\{{\mathbf{w}}\right\}\mathbb{E}_{h}\left\{{{{\mathbf{h}}^{\text{H}}}}\right\}\mathbb{E}_{x}\left\{{{{\mathbf{X}}^{\text{H}}}}\right\}+\mathbb{E}_{w}\left\{{{\mathbf{w}}{{\mathbf{w}}^{\text{H}}}}\right\}
=𝔼x{𝐗𝐂𝐡𝐡𝐗H}+σw2𝐈,\displaystyle=\mathbb{E}_{x}\left\{{{\mathbf{X}}{{\mathbf{C}}_{{\mathbf{hh}}}}{{\mathbf{X}}^{\mathrm{H}}}}\right\}+\sigma_{w}^{2}{\mathbf{I}}, (30)
𝔼x{𝐗𝐂𝐡𝐡𝐗H}\displaystyle\mathbb{E}_{x}\left\{{{\mathbf{X}}{{\mathbf{C}}_{{\mathbf{hh}}}}{{\mathbf{X}}^{\text{H}}}}\right\} =𝔼x{(𝐈NR((𝟏1×NT𝐈(KP))diag(𝐱)))𝐂𝐡𝐡(𝐈NR((𝟏1×NT𝐈(KP))diag(𝐱)))H}\displaystyle=\mathbb{E}_{x}\left\{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes\left({\left({{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\cdot{\text{diag}}\left({\mathbf{x}}\right)}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes\left({\left({{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\cdot{\text{diag}}\left({\mathbf{x}}\right)}\right)}\right)}^{\text{H}}}}\right\} (31)
=𝔼x{((𝐈NR𝟏1×NT𝐈(KP))(𝐈NRdiag(𝐱)))𝐂𝐡𝐡((𝐈NR𝟏1×NT𝐈(KP))(𝐈NRdiag(𝐱)))H}\displaystyle=\mathbb{E}_{x}\left\{{\left({\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\cdot\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{{\left({\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\cdot\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right)}\right)}^{\text{H}}}}\right\}
=(𝐈NR𝟏1×NT𝐈(KP))𝔼x{(𝐈NRdiag(𝐱))𝐂𝐡𝐡(𝐈NRdiag(𝐱))H}(𝐈NR𝟏1×NT𝐈(KP))H\displaystyle=\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\mathbb{E}_{x}\left\{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right)}^{\text{H}}}}\right\}{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)^{\text{H}}}
𝔼x{𝐗𝐂𝐡𝐡𝐗H}=𝐗^𝐂𝐡𝐡𝐗^H+(𝐈NR𝟏1×NT𝐈(KP))(𝐂𝐡𝐡(𝟏NR×NRdiag(𝐯)))(𝐈NR𝟏1×NT𝐈(KP))H\mathbb{E}_{x}\left\{{{\mathbf{X}}{{\mathbf{C}}_{{\mathbf{hh}}}}{{\mathbf{X}}^{\text{H}}}}\right\}={\hat{\mathbf{X}}}{{\mathbf{C}}_{{\mathbf{hh}}}}{{\hat{\mathbf{X}}}^{\text{H}}}+\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)\left({{{\mathbf{C}}_{{\mathbf{hh}}}}\odot\left({{{\mathbf{1}}_{{N_{\text{R}}}\times{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{v}}\right)}\right)}\right){\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{{\mathbf{1}}_{1\times{N_{\text{T}}}}}\otimes{{\mathbf{I}}_{\left({K-P}\right)}}}\right)^{\text{H}}} (32)

where 𝔼x{𝐗𝐂𝐡𝐡𝐗H}\mathbb{E}_{x}\{{{\mathbf{X}}{{\mathbf{C}}_{{\mathbf{hh}}}}{{\mathbf{X}}^{\mathrm{H}}}}\} in (30) is derived using the property of Kronecker product firstly, as shown in (31). The expectation term in (31) is equivalently represented using the partitioning of matrix as

(𝐈NRdiag(𝐱))𝐂𝐡𝐡(𝐈NRdiag(𝐱))H\displaystyle\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right)^{\mathrm{H}}}\hfill
=[diag(𝐱)𝐂ijdiag(𝐱)H]NR×NR,\displaystyle={\left[{{\text{diag}}\left({\mathbf{x}}\right){{\mathbf{C}}_{ij}}{\text{diag}}{{\left({\mathbf{x}}\right)}^{\mathrm{H}}}}\right]_{{N_{\text{R}}}\times{N_{\text{R}}}}},\hfill (33)

where 𝐂ijNT(KP)×NT(KP){{\mathbf{C}}_{ij}}\in{\mathbb{C}^{{N_{\text{T}}}({K-P})\times{N_{\text{T}}}({K-P})}} denotes the corresponding element after partitioning 𝐂𝐡𝐡{{\mathbf{C}}_{{\mathbf{hh}}}} into NR2N_{\text{R}}^{2} blocks such that 𝐂𝐡𝐡=[𝐂ij]NR×NR{{\mathbf{C}}_{{\mathbf{hh}}}}={[{{{\mathbf{C}}_{ij}}}]_{{N_{\text{R}}}\times{N_{\text{R}}}}}. Due to the statistical property of the transmitted symbols in (c), the expectation of the partitioned element is

𝔼x{diag(𝐱)𝐂ijdiag(𝐱)H}=diag(𝐱^)𝐂ijdiag(𝐱^)H+𝐂ijdiag(𝐯),\begin{gathered}\mathbb{E}_{x}\left\{{{\text{diag}}\left({\mathbf{x}}\right){{\mathbf{C}}_{ij}}{\text{diag}}{{\left({\mathbf{x}}\right)}^{\mathrm{H}}}}\right\}\hfill\\ ={\text{diag}}\left({\hat{\mathbf{x}}}\right){{\mathbf{C}}_{ij}}{\text{diag}}{\left({\hat{\mathbf{x}}}\right)^{\mathrm{H}}}+{{\mathbf{C}}_{ij}}\odot{\text{diag}}\left({\mathbf{v}}\right),\hfill\\ \end{gathered} (34)

where 𝐯=[v1,,vNT(KP)]{\mathbf{v}}=[{{v_{1}},\ldots,{v_{{N_{\text{T}}}({K-P})}}}]. Therefore, the expectation of the integral matrix in (31) can be expressed as

𝔼x{(𝐈NRdiag(𝐱))𝐂𝐡𝐡(𝐈NRdiag(𝐱))H}=(𝐈NRdiag(𝐱^))𝐂𝐡𝐡(𝐈NRdiag(𝐱^))H+𝐂𝐡𝐡(𝟏NR×NRdiag(𝐯)).\begin{gathered}\mathbb{E}_{x}\left\{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{x}}\right)}\right)}^{\mathrm{H}}}}\right\}\hfill\\ =\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\hat{\mathbf{x}}}\right)}\right){{\mathbf{C}}_{{\mathbf{hh}}}}{\left({{{\mathbf{I}}_{{N_{\text{R}}}}}\otimes{\text{diag}}\left({\hat{\mathbf{x}}}\right)}\right)^{\mathrm{H}}}\hfill\\ ~{}~{}+{{\mathbf{C}}_{{\mathbf{hh}}}}\odot\left({{{\mathbf{1}}_{{N_{\text{R}}}\times{N_{\text{R}}}}}\otimes{\text{diag}}\left({\mathbf{v}}\right)}\right).\hfill\\ \end{gathered} (35)

After substituting the above expression into (31), the expectation term to be deduced is concluded as (32), and the complete equation is summarized in (18a).

Appendix B Derivation of OJCD-LMMSE

According to (26), 𝐑𝐡d𝐡LS,new{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}} and 𝐑𝐡LS,new𝐡LS,new{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}} are required and defined for the computation of 𝐖LMMSEnew{\mathbf{W}}_{{\text{LMMSE}}}^{{\text{new}}}. Note that the assumptions and statistical properties concluded in Section III are still applicable. Besides, according to (23), the estimation error of 𝐡^m,nd\hat{\mathbf{h}}_{m,n}^{\text{d}} should be taken into consideration, and the estimated channel coefficients are calculated from traditional LMMSE algorithm adopted in JCD-1 as shown in (5)-(6), which can also be represented as

𝐡m,nLMMSE\displaystyle{\mathbf{h}}_{m,n}^{{\text{LMMSE}}} =𝐖LMMSE𝐡m,nLS\displaystyle={{\mathbf{W}}_{{\text{LMMSE}}}}{\mathbf{h}}_{m,n}^{{\text{LS}}}
=𝐖LMMSE(𝐡m,np+(𝐗np)1𝐰m,np).\displaystyle={{\mathbf{W}}_{{\text{LMMSE}}}}\left({{\mathbf{h}}_{m,n}^{\text{p}}+{{\left({{\mathbf{X}}_{n}^{\text{p}}}\right)}^{-1}}{\mathbf{w}}_{m,n}^{\text{p}}}\right).

Therefore, the following relation exists:

𝐡^m,nd=𝐖LMMSEd(𝐡m,np+(𝐗np)1𝐰m,np),\hat{\mathbf{h}}_{m,n}^{\text{d}}={\mathbf{W}}_{{\text{LMMSE}}}^{\text{d}}\left({{\mathbf{h}}_{m,n}^{\text{p}}+{{\left({{\mathbf{X}}_{n}^{\text{p}}}\right)}^{-1}}{\mathbf{w}}_{m,n}^{\text{p}}}\right), (36)

where 𝐖LMMSEd{\mathbf{W}}_{{\text{LMMSE}}}^{\text{d}} refers to extracting specific rows from 𝐖LMMSE{{\mathbf{W}}_{{\text{LMMSE}}}} according to the index set for data subcarriers {dk}k=1KP\{{{d_{k}}}\}_{k=1}^{K-P}. 𝐖LMMSEd{\mathbf{W}}_{{\text{LMMSE}}}^{\text{d}} and 𝐗np{{\mathbf{X}}_{n}^{\text{p}}} are treated as known constants. Moreover, for simplicity, 𝐖1=𝐖LMMSEd{\mathbf{W}}_{1}={\mathbf{W}}_{{\text{LMMSE}}}^{\text{d}} is defined. The correlation properties between OFDM channels corresponding to different transmitting antennas, which can all be computed from 𝐑=𝐑t𝐑Freq{{\mathbf{R}}={\mathbf{R}}_{\text{t}}\otimes{\mathbf{R}}^{\text{Freq}}}, are defined as follows:

𝐑𝐡d𝐡d(n1,n2)\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({{n_{1}},{n_{2}}}\right) =𝔼{𝐡m,n1d(𝐡m,n2d)H},\displaystyle=\mathbb{E}\left\{{{\mathbf{h}}_{m,{n_{1}}}^{\text{d}}{{\left({{\mathbf{h}}_{m,{n_{2}}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}, (37)
𝐑𝐡d𝐡p(n1,n2)\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({{n_{1}},{n_{2}}}\right) =𝔼{𝐡m,n1d(𝐡m,n2p)H},\displaystyle=\mathbb{E}\left\{{{\mathbf{h}}_{m,{n_{1}}}^{\text{d}}{{\left({{\mathbf{h}}_{m,{n_{2}}}^{\text{p}}}\right)}^{\mathrm{H}}}}\right\},
𝐑𝐡p𝐡p(n1,n2)\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}\left({{n_{1}},{n_{2}}}\right) =𝔼{𝐡m,n1p(𝐡m,n2p)H},\displaystyle=\mathbb{E}\left\{{{\mathbf{h}}_{m,{n_{1}}}^{\text{p}}{{\left({{\mathbf{h}}_{m,{n_{2}}}^{\text{p}}}\right)}^{\mathrm{H}}}}\right\},

where n1,n2{1,,NT}{n_{1}},{n_{2}}\in\{{1,\ldots,{N_{\text{T}}}}\}. Note that if n1=n2{n_{1}}={n_{2}}, 𝐑𝐡d𝐡d(n1,n2){{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}({{n_{1}},{n_{2}}}) can be simplified as 𝐑𝐡d𝐡d{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}.

The deduction is now operated. By plugging in (24), the derivation of 𝐑𝐡d𝐡LS,new{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}} is preliminarily operated as

𝐑𝐡d𝐡LS,new(n)\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{d}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}}\left(n\right) =𝔼h,x,w{𝐡m,nd(𝐡m,nLS,new)H}=𝐑𝐡d𝐡d+𝐁n,\displaystyle=\mathbb{E}_{h,x,w}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right)}^{\mathrm{H}}}}\right\}={{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}+{{\mathbf{B}}_{n}}, (38)
𝐁n\displaystyle{{\mathbf{B}}_{n}} 𝔼h,x,w{𝐡m,nd𝐙m,nH}((𝐗^nd)1)H.\displaystyle\triangleq\mathbb{E}_{h,x,w}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{\mathbf{Z}}_{m,n}^{\mathrm{H}}}\right\}{\left({{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}\right)^{\mathrm{H}}}.

And 𝐑𝐡LS,new𝐡LS,new{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}} is preliminarily deduced as

𝐑𝐡LS,new𝐡LS,new(n)\displaystyle{{\mathbf{R}}_{{{\mathbf{h}}^{{\text{LS,new}}}}{{\mathbf{h}}^{{\text{LS,new}}}}}}\left(n\right) =𝔼h,x,w{(𝐡m,nLS,new)(𝐡m,nLS,new)H}\displaystyle=\mathbb{E}_{h,x,w}\left\{{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right){{\left({{\mathbf{h}}_{m,n}^{{\text{LS,new}}}}\right)}^{\mathrm{H}}}}\right\} (39)
=𝐑𝐡d𝐡d+𝐁n+𝐁nH\displaystyle={{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}+{{\mathbf{B}}_{n}}+{\mathbf{B}}_{n}^{\mathrm{H}}
+(𝐗^nd)1𝚺n(𝐗^nd)1H\displaystyle~{}~{}+{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)^{-1}}{\bm{\Sigma}_{n}}{{{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}^{\mathrm{H}}}
𝚺n\displaystyle{\bm{\Sigma}_{n}} 𝔼h,x,w{𝐙m,n𝐙m,nH}.\displaystyle\triangleq\mathbb{E}_{h,x,w}\left\{{{{\mathbf{Z}}_{m,n}}{\mathbf{Z}}_{m,n}^{\mathrm{H}}}\right\}.

Consequently, for subsequent inference in (38) and (39), 𝐁n{{\mathbf{B}}_{n}} and 𝚺n{\bm{\Sigma}_{n}} must be deduced first. 𝐁n{{\mathbf{B}}_{n}} is unfolded according to (22), and is further simplified using the zero-mean property of ww and Δe\Delta e:

𝐁n\displaystyle{{\mathbf{B}}_{n}} =n=1nnNT𝔼{𝐡m,nd(𝚫𝐡m,nd)H}(𝐗^nd)H(𝐗^nd)1H\displaystyle=\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{\mathbb{E}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{{\left({{\mathbf{\Delta h}}_{m,n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}{{\left({{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}{{{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}^{\mathrm{H}}} (40)
=n=1nnNT𝐑𝐡d𝐡d(n,n)(𝐗^nd)H((𝐗^nd)1)H\displaystyle=\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({n,n^{\prime}}\right){{\left({{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}{\left({{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}\right)^{\mathrm{H}}}
n=1nnNT𝔼{𝐡m,nd(𝐡^m,nd)H}(𝐗^nd)H((𝐗^nd)1)H.\displaystyle~{}~{}-\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{\mathbb{E}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{{\left({\hat{\mathbf{h}}_{m,n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}{{\left({{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}{\left({{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}\right)^{\mathrm{H}}}.

The remaining expectation term in (40) is unfolded due to the representation in (36), and is consequently simplified using the zero-mean property of ww:

𝔼{𝐡m,nd(𝐡^m,nd)H}=𝐑𝐡d𝐡p(n,n)𝐖1H.\mathbb{E}\left\{{{\mathbf{h}}_{m,n}^{\text{d}}{{\left({\hat{\mathbf{h}}_{m,n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}={{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({n,n^{\prime}}\right){{\mathbf{W}}_{1}^{\mathrm{H}}}.

𝐁n{{\mathbf{B}}_{n}} can finally be represented as

𝐁n=n=1nnNT(𝐑𝐡d𝐡d(n,n)𝐑𝐡d𝐡p(n,n)𝐖1H)(𝐗^nd)H((𝐗^nd)1)H.{{\mathbf{B}}_{n}}=\sum\limits_{\begin{subarray}{c}n^{\prime}=1\\ n^{\prime}\neq n\end{subarray}}^{{N_{\text{T}}}}{\left(\begin{gathered}{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({n,n^{\prime}}\right)\hfill\\ -{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({n,n^{\prime}}\right){{\mathbf{W}}_{1}^{\mathrm{H}}}\hfill\\ \end{gathered}\right){{\left({{\hat{\mathbf{X}}}_{n^{\prime}}^{\text{d}}}\right)}^{\mathrm{H}}}}{\left({{{\left({{\hat{\mathbf{X}}}_{n}^{\text{d}}}\right)}^{-1}}}\right)^{\mathrm{H}}}. (41)

Likewise, 𝚺n{\bm{\Sigma}_{n}} is deduced as follows. The defined expression is firstly unfolded using (22), and subsequently represented according to the second-order statistical property of ww and Δe\Delta e:

𝚺n\displaystyle{\bm{\Sigma}_{n}} =n1=1n1nNTn2=1n2nNT𝐗^n1d𝔼{𝚫𝐡m,n1d(𝚫𝐡m,n2d)H}(𝐗^n2d)H\displaystyle=\sum\limits_{\begin{subarray}{c}{{n}_{1}^{\prime}}=1\\ {{n}_{1}^{\prime}}\neq n\end{subarray}}^{{N_{\text{T}}}}{\sum\limits_{\begin{subarray}{c}{{n}_{2}^{\prime}}=1\\ {{n}_{2}^{\prime}}\neq n\end{subarray}}^{{N_{\text{T}}}}{{\hat{\mathbf{X}}}_{{{n}_{1}^{\prime}}}^{\text{d}}\mathbb{E}\left\{{{\mathbf{\Delta h}}_{m,{{n}_{1}^{\prime}}}^{\text{d}}{{\left({{\mathbf{\Delta h}}_{m,{{n}_{2}^{\prime}}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}{{\left({{\hat{\mathbf{X}}}_{{{n}_{2}^{\prime}}}^{\text{d}}}\right)}^{\mathrm{H}}}}} (42)
+𝐑𝐡d𝐡dn=1NT𝐕n+σw2𝐈,\displaystyle~{}~{}+{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\odot\sum\limits_{n=1}^{{N_{\text{T}}}}{{{\mathbf{V}}_{n}}}+\sigma_{w}^{2}{\mathbf{I}},

and the expectation term in (42) is again expanded using (36)

𝔼{𝚫𝐡m,n1d(𝚫𝐡m,n2d)H}\displaystyle\mathbb{E}\left\{{{\mathbf{\Delta h}}_{m,{{n}_{1}^{\prime}}}^{\text{d}}{{\left({{\mathbf{\Delta h}}_{m,{{n}_{2}^{\prime}}}^{\text{d}}}\right)}^{\mathrm{H}}}}\right\}
=𝐑𝐡d𝐡d(n1,n2)𝐑𝐡d𝐡p(n1,n2)𝐖1H\displaystyle={{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)-{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right){\mathbf{W}}_{\text{1}}^{\mathrm{H}}
𝐖1𝐑𝐡p𝐡d(n1,n2)+𝐖1𝐑𝐡p𝐡p(n1,n2)𝐖1H\displaystyle~{}~{}-{{\mathbf{W}}_{1}}{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{d}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)+{{\mathbf{W}}_{1}}{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right){\mathbf{W}}_{\text{1}}^{\mathrm{H}}
+σw2𝐖1(𝐗n1p)1((𝐗n1p)1)H𝐖1H.\displaystyle~{}~{}+\sigma_{w}^{2}{{\mathbf{W}}_{1}}{\left({{\mathbf{X}}_{{{n}_{1}^{\prime}}}^{\text{p}}}\right)^{-1}}{\left({{{\left({{\mathbf{X}}_{{{n}_{1}^{\prime}}}^{\text{p}}}\right)}^{-1}}}\right)^{\mathrm{H}}}{\mathbf{W}}_{\text{1}}^{\mathrm{H}}.

𝚺n{\bm{\Sigma}_{n}} can be summarized as

𝚺n=n1=1n1nNTn2=1n2nNT(𝐑𝐡d𝐡d(n1,n2)𝐕A(n1,n2)+𝐕B(n1,n2))𝐕x(n1,n2)+σw2n=1nnNT𝐕C(n)𝐕x(n,n)+𝐕D+σw2𝐈,\begin{gathered}{\bm{\Sigma}_{n}}=\sum\limits_{\begin{subarray}{c}{{n}_{1}^{\prime}}=1\\ {{n}_{1}^{\prime}}\neq n\end{subarray}}^{{N_{\text{T}}}}{\sum\limits_{\begin{subarray}{c}{{n}_{2}^{\prime}}=1\\ {{n}_{2}^{\prime}}\neq n\end{subarray}}^{{N_{\text{T}}}}{{\left(\begin{gathered}{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)\hfill\\ -{{\mathbf{V}}^{\text{A}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)\hfill\\ +{{\mathbf{V}}^{\text{B}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)\hfill\\ \end{gathered}\right)}\odot{{\mathbf{V}}^{\text{x}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right)}}\\ ~{}~{}~{}~{}~{}~{}+\sigma_{w}^{2}\sum\limits_{\begin{subarray}{c}{{n^{\prime}}}=1\\ {{n^{\prime}}}\neq n\end{subarray}}^{{N_{\text{T}}}}{{{\mathbf{V}}^{\text{C}}}\left({{{n^{\prime}}}}\right)\odot{{\mathbf{V}}^{\text{x}}}\left({{{n^{\prime}}},{{n^{\prime}}}}\right)}+{{\mathbf{V}}_{\text{D}}}+\sigma_{w}^{2}{\mathbf{I}},\\ \end{gathered} (43)

where

𝐕A(n1,n2)\displaystyle{{\mathbf{V}}^{\text{A}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right) 𝐑𝐡d𝐡p(n1,n2)𝐖1H+𝐖1𝐑𝐡d𝐡pH(n1,n2),\displaystyle\triangleq{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right){\mathbf{W}}_{\text{1}}^{\mathrm{H}}+{{\mathbf{W}}_{1}}{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{p}}}}^{\mathrm{H}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right),
𝐕B(n1,n2)\displaystyle{{\mathbf{V}}^{\text{B}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right) 𝐖1𝐑𝐡p𝐡p(n1,n2)𝐖1H,\displaystyle\triangleq{{\mathbf{W}}_{1}}{{\mathbf{R}}_{{{\mathbf{h}}^{\text{p}}}{{\mathbf{h}}^{\text{p}}}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right){\mathbf{W}}_{\text{1}}^{\mathrm{H}},
𝐕x(n1,n2)\displaystyle{{\mathbf{V}}^{\text{x}}}\left({{{n}_{1}^{\prime}},{{n}_{2}^{\prime}}}\right) 𝐱^n1d(𝐱^n2d)H,\displaystyle\triangleq{\hat{\mathbf{x}}}_{{{n}_{1}^{\prime}}}^{\text{d}}{\left({{\hat{\mathbf{x}}}_{{{n}_{2}^{\prime}}}^{\text{d}}}\right)^{\mathrm{H}}},
𝐕C(n)\displaystyle{{\mathbf{V}}^{\text{C}}}\left({{{n^{\prime}}}}\right) (𝐖1(𝐗np)1)(𝐖1(𝐗np)1)H,\displaystyle\triangleq\left({{{\mathbf{W}}_{1}}{{\left({{\mathbf{X}}_{{{n^{\prime}}}}^{\text{p}}}\right)}^{-1}}}\right){\left({{{\mathbf{W}}_{1}}{{\left({{\mathbf{X}}_{{{n^{\prime}}}}^{\text{p}}}\right)}^{-1}}}\right)^{\mathrm{H}}},
𝐕D\displaystyle{{\mathbf{V}}_{\text{D}}} 𝐑𝐡d𝐡dn=1NT𝐕n.\displaystyle\triangleq{{\mathbf{R}}_{{{\mathbf{h}}^{\text{d}}}{{\mathbf{h}}^{\text{d}}}}}\odot\sum\limits_{n=1}^{{N_{\text{T}}}}{{{\mathbf{V}}_{n}}}.

References

  • [1] N.-N. Dao, N. H. Tu, T.-D. Hoang, T.-H. Nguyen, L. V. Nguyen, K. Lee, L. Park, W. Na, and S. Cho, “A review on new technologies in 3GPP standards for 5G access and beyond,” Comput. Netw., vol. 245, p. 110370, May 2024.
  • [2] 3GPP, “NR; Physical channels and modulation,” 3GPP TS 38.211, Tech. Rep., 2023.
  • [3] B. Song, L. Gui, and W. Zhang, “Comb type pilot aided channel estimation in OFDM systems with transmit diversity,” IEEE Trans. Broadcast., vol. 52, no. 1, pp. 50–57, Mar. 2006.
  • [4] I. Khan, M. Cheffena, and M. M. Hasan, “Data aided channel estimation for MIMO-OFDM wireless systems using reliable carriers,” IEEE Access, vol. 11, pp. 47 836–47 847, Apr. 2023.
  • [5] Y. Liu, Z. Tan, H. Hu, L. J. Cimini, and G. Y. Li, “Channel estimation for OFDM,” IEEE Commun. Surveys Tut., vol. 16, no. 4, pp. 1891–1908, May 2014.
  • [6] C. Jeon, R. Ghods, A. Maleki, and C. Studer, “Optimality of large MIMO detection via approximate message passing,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015, pp. 1227–1231.
  • [7] S. Wu, L. Kuang, Z. Ni, J. Lu, D. Huang, and Q. Guo, “Low-complexity iterative detection for large-scale multiuser MIMO-OFDM systems using approximate message passing,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 902–915, Oct. 2014.
  • [8] J. Céspedes, P. M. Olmos, M. Sánchez-Fernández, and F. Perez-Cruz, “Expectation propagation detection for high-order high-dimensional MIMO systems,” IEEE Trans. Commun., vol. 62, no. 8, pp. 2840–2849, Aug. 2014.
  • [9] K. Ghavami and M. Naraghi-Pour, “MIMO detection with imperfect channel state information using expectation propagation,” IEEE Trans. Veh. Technol., vol. 66, no. 9, pp. 8129–8138, Sept. 2017.
  • [10] H. Ye, G. Y. Li, and B.-H. Juang, “Power of deep learning for channel estimation and signal detection in OFDM systems,” IEEE Wireless Commun. Lett., vol. 7, no. 1, pp. 114–117, Feb. 2018.
  • [11] M. Honkala, D. Korpi, and J. M. J. Huttunen, “DeepRx: Fully convolutional deep learning receiver,” IEEE Trans. Wireless Commun., vol. 20, no. 6, pp. 3925–3940, Jun. 2021.
  • [12] Y. Xin, J. Peng, Z. Lu, Y. Lee, and Y. Yang, “DMCNET: Data-driven multi-pilot convolution neural network for MIMO-OFDM receiver,” in Proc. IEEE IC-NIDC, Beijing, China, Nov. 2023, pp. 202–206.
  • [13] G. Fu, Q. Wang, R. Zhu, and H. Wang, “Meta-learning based semi-blind data detection for cell-free systems,” in Proc. IEEE/CIC Int. Conf. Commun. China (ICCC), Dalian, China, Aug. 2023, pp. 1–6.
  • [14] M. Shang, Y. Zhang, L. Pang, Y. Ren, Y. Chen, and J. Li, “A design of transfer learning receiver for MIMO-OFDM systems,” IEEE Commun. Lett., vol. 28, no. 7, pp. 1564–1568, Jul. 2024.
  • [15] H. Ju, H. Zhang, L. Li, X. Li, and B. Dong, “A comparative study of deep learning and iterative algorithms for joint channel estimation and signal detection in OFDM systems,” Signal Process., vol. 223, p. 109554, Oct. 2024.
  • [16] S. L. Ariyavisitakul and Y. Li, “Joint coding and decision feedback equalization for broadband wireless channels,” IEEE J. Sel. Areas Commun., vol. 16, no. 9, pp. 1670–1678, Dec. 1998.
  • [17] N. Geng, X. Yuan, and L. Ping, “Dual-diagonal LMMSE channel estimation for OFDM systems,” IEEE Trans. Signal Process., vol. 60, no. 9, pp. 4734–4746, Sept. 2012.
  • [18] J. Ylioinas and M. Juntti, “Iterative joint detection, decoding, and channel estimation in turbo-coded MIMO-OFDM,” IEEE Trans. Veh. Technol., vol. 58, no. 4, pp. 1784–1796, May 2009.
  • [19] F. Huang, Q. Guo, Y. Zhang, and Y. V. Zakharov, “Message passing-based joint channel estimation and signal detection for OTFS with superimposed pilots,” IEEE Trans. Veh. Technol., vol. 73, no. 8, pp. 11 531–11 542, Aug. 2024.
  • [20] Y. Zhang, B. Li, N. Wu, Y. Ma, W. Yuan, and L. Hanzo, “Message passing-aided joint data detection and estimation of nonlinear satellite channels,” IEEE Trans. Veh. Technol., vol. 72, no. 2, pp. 1763–1774, Feb. 2023.
  • [21] A. Karataev, C. Forsch, and L. Cottatellucci, “Bilinear expectation propagation for distributed semi-blind joint channel estimation and data detection in cell-free massive MIMO,” IEEE Open J. Signal Process., vol. 5, pp. 284–293, Jan. 2024.
  • [22] L. V. Nguyen, A. L. Swindlehurst, and D. H. N. Nguyen, “Variational Bayes for joint channel estimation and data detection in few-bit massive MIMO systems,” IEEE Trans. Signal Process., vol. 72, pp. 3408–3423, Jul. 2024.
  • [23] Y. Wang, M. Zhang, X. Tu, Z. Li, F. Qu, and Y. Wei, “Joint channel estimation and turbo equalization of single-carrier systems over time-varying channels,” arXiv preprint arXiv:2305.09226, 2023.
  • [24] F. Weißer, N. Turan, D. Semmler, and W. Utschick, “Data-aided channel estimation utilizing Gaussian mixture models,” in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Seoul, Korea, Apr. 2024, pp. 8886–8890.
  • [25] H. He, C.-K. Wen, S. Jin, and G. Y. Li, “Model-driven deep learning for MIMO detection,” IEEE Trans. Signal Process., vol. 68, pp. 1702–1715, Feb. 2020.
  • [26] J. Zhang, H. He, X. Yang, C.-K. Wen, S. Jin, and X. Ma, “Model-driven deep learning based turbo-MIMO receiver,” in Proc. IEEE 21st Int. Workshop Signal Process. Adv. Wireless Commun. (SPAWC), Atlanta, GA, USA, May 2020, pp. 1–5.
  • [27] Y. Zhang, J. Sun, J. Xue, G. Y. Li, and Z. Xu, “Deep expectation-maximization for joint MIMO channel estimation and signal detection,” IEEE Trans. Signal Process., vol. 70, pp. 4483–4497, Sept. 2022.
  • [28] Y. Sun, H. Shen, B. Li, W. Xu, P. Zhu, N. Hu, and C. Zhao, “Trainable joint channel estimation, detection, and decoding for MIMO URLLC systems,” IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 12 172–12 188, Sept. 2024.
  • [29] S. Bhattacharya, K. V. S. Hari, and Y. C. Eldar, “Unfolding for joint channel estimation and symbol detection in MIMO communication systems,” arXiv preprint arXiv:2308.08917, 2023.
  • [30] Y. Yang, Z. Zhang, Z. Chen, and Z. Yang, “Semi-blind channel estimation leveraging frequency correlation,” in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Dubai, United Arab Emirates, Apr. 2024, pp. 1–5.
  • [31] Y. Li, F. Liu, Z. Du, W. Yuan, and C. Masouros, “ISAC-enabled V2I networks based on 5G NR: How much can the overhead be reduced?” in Proc. IEEE Int. Conf. Commun. Workshops (ICC Workshops), Rome, Italy, May 2023, pp. 691–696.
  • [32] C. Novak, G. Matz, and F. Hlawatsch, “IDMA for the multiuser MIMO-OFDM uplink: A factor graph framework for joint data detection and channel estimation,” IEEE Trans. Signal Process., vol. 61, no. 16, pp. 4051–4066, Aug. 2013.
  • [33] S. Wu, L. Kuang, Z. Ni, D. Huang, Q. Guo, and J. Lu, “Message-passing receiver for joint channel estimation and decoding in 3D massive MIMO-OFDM systems,” IEEE Trans. Wireless Commun., vol. 15, no. 12, pp. 8122–8138, Dec. 2016.
  • [34] G. E. Kirkelund, C. N. Manchón, L. P. B. Christensen, E. Riegler, and B. H. Fleury, “Variational message-passing for joint channel estimation and decoding in MIMO-OFDM,” in Proc. IEEE GLOBECOM, Miami, FL, USA, Dec. 2010, pp. 1–6.
  • [35] M. Kashoob and Y. Zakharov, “Data-aided iterative reweighted LMMSE channel estimation for MIMO-OFDM,” in Proc. IEEE Int. Symp. Signal Process. Inf. Technol. (ISSPIT), Abu Dhabi, United Arab Emirates, Dec. 2015, pp. 663–667.
  • [36] P. Hammarberg, F. Rusek, and O. Edfors, “Iterative receivers with channel estimation for multi-user MIMO-OFDM: Complexity and performance,” EURASIP J. Wireless Commun. Netw., vol. 2012, pp. 1–17, Mar. 2012.
  • [37] Y. V. Zakharov, V. M. Baronkin, and J. Zhang, “Optimal and mismatched detection of QAM signals in fast fading channels with imperfect channel estimation,” IEEE Trans. Wireless Commun., vol. 8, no. 2, pp. 617–621, Feb. 2009.
  • [38] R. N. Khal, Y. V. Zakharov, and J. Zhang, “B-spline based joint channel and frequency offset estimation in doubly-selective fading channels,” in Proc. IEEE ICASSP, Dallas, TX, USA, Mar. 2010, pp. 3214–3217.
  • [39] S. M. Kay, Fundamentals of statistical signal processing.   Upper Saddle River, NJ, USA: Prentice-Hall, 1993.
  • [40] L. Dai, X. Gao, X. Su, S. Han, C.-L. I, and Z. Wang, “Low-complexity soft-output signal detection based on Gauss–Seidel method for uplink multiuser large-scale MIMO systems,” IEEE Trans. Veh. Technol., vol. 64, no. 10, pp. 4839–4845, Oct. 2015.
  • [41] J. Zhang, Y. He, Y.-W. Li, C.-K. Wen, and S. Jin, “Meta learning-based MIMO detectors: Design, simulation, and experimental test,” IEEE Trans. Wireless Commun., vol. 20, no. 2, pp. 1122–1137, Feb. 2021.