MIMO OFDM channel estimation based on RLS algorithm: the time- versus frequency-domain implementations

In high‐mobility scenarios, the time variation of mobile radio channels leads to a loss of orthogonality among subcarriers in orthogonal frequency division multiplexing (OFDM) systems, resulting in intercarrier interference (ICI) and performance deterioration. Conventional channel estimation schemes are usually based on pilot tones, which are distributed in each OFDM symbol to estimate the channel variation. Hence, the channel estimator itself suffers from ICI. In this study, a new estimation scheme, which does not suffer from ICI, is proposed to estimate the channel variation within OFDM symbols. The main idea is to zero‐pad (ZP) the OFDM symbol in the time domain. Then, in the middle of the ZP interval, an impulse signal is inserted as a pilot sample, which is used to estimate the channel at the pilot signal in the OFDM symbol. Finally, a linear model is used to estimate the channel variation over an OFDM symbol. Additionally, we derive the mean squared error (MSE) of the proposed estimation technique under the constraint that the channel varies linearly within OFDM symbols. Simulation results show that our scheme can achieve a substantial improvement in the bit error rate (BER) performance of OFDM, in spite of the OFDM symbol length being increased. Moreover, in many cases, the new scheme can achieve the same BER performance as the perfect knowledge of channel state information (CSI). Theoretical analysis and numerical simulations show that our scheme achieves excellent performance with much lower computational complexity.

Orthogonal frequency division multiplexing (OFDM) is adopted in most wireless communication systems, and the performance of OFDM is affected by impulse noise (IN). Better channel estimation (CE) performance is required to detect the channel information on the receiving side. The OFDM system is considered with the number of subcarriers carrying the data and pilot symbols. In the OFDM modulator, the symbols of the frequency domain are transformed into the signals of the time domain using inverse discrete Fourier transformation (IDFT). Effective impulsive noise mitigation is crucial for improving the effectiveness of OFDM communication systems, and it improves the signal-to-noise ratio (SNR) at the receiver. A cyclic prefix is then appended before transmission through the channel. In the receiver noise, the effect of IN is mitigated jointly with CE using the Bayesian matching pursuit (BMP) and Moth-flame algorithm (MFA). In this approach, the IN and channel information is considered as a sparse vector. Here, the data symbols used are considered an unknown parameter. The approach incorporating all subcarriers has a lower mean square error (MSE) of IN estimate for impulsive noise reduction. The MFA algorithm is used to optimize the sensor matrix in BMP. The sparsity of the channel and the impulse response are observed in the time domain to represent the channel and IN together. It exactly recovers the sparse signal for finding the convex objectives of the sparse minimizer, and the sparse solution is obtained with fixed point updates. The proposed BMP algorithm improves the CE by explicitly considering the existence of IN. The BMP is a greedy algorithm that selects the most correlated residuals at each column. Under mutual incoherence, it recovers the signal with a higher probability. The simulated outcomes proved that the proposed CE and noise mitigation model achieved better performance based on the bit error rate (BER), throughput and MSE.

In orthogonal frequency division multiplexing (OFDM) systems, channel variations within an OFDM block destroy orthogonality between subcarriers, resulting in intercarrier interference (ICl), which increases an error floor in proportional to normalized Doppler frequency. To mitigate the effects of channel variations, many schemes have been proposed, but they are computationally complex or at the price of sacrificing spectral efficiency. In this paper, we first provide an ICI analysis in both time- and frequency-domain while existing literatures analyze the ICI effects mainly in the frequency domain. Based on this analysis, we then propose a novel ICI suppression technique, which uses iterative ICI cancellation in time domain and has a computational complexity that is linear in the OFDM symbol length. Channel estimation in rapidly time-varying scenarios is critical for ICl suppression and coherent demodulation. We also propose a scheme for estimating the channel parameters varying within an OFDM block. Along with the channel estimation scheme, we investigate the issue of optimum pilot tone placement. Theoretical analysis and simulation results show that the proposed ICl suppression method and channel estimation scheme have low computational complexity and good performance for most Doppler frequency of practical importance.

Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high data rate transmission with good bandwidth efficiency. OFDM system utilize the cyclic prefix (CP) to mitigate the effect of inter symbol interference (ISI) produced by the multipath effect of wireless channel. The CP insertion only mitigates the effect of inter block interference of OFDM symbols, whereas the intra block interference remain present in the OFDM symbol. The intra block OFDM symbol interference degrades the error performance of the OFDM system. In order to improve the error performance of the OFDM system forward error correction scheme can be utilized. Many FEC schemes for single carrier and multicarrier systems have been proposed in the literature. Convolution and LDPC codes are two popular coding schemes for FEC. In this paper we have considered Convolution and LDPC codes for improving the error performance of OFDM system. The BER performance of convolution ally coded a LDPC coded OFDM is evaluated for various code rates in AWGN and fading channel. We have also compared the performance of coded OFDM system with an OFDM system without FEC.

In this paper, an integrated Orthogonal Frequency Division Multiplexing (OFDM) system is developed to improve Bit Error Rate (BER) performance of communication systems in order to meet the requirements of advanced communication systems like long term evaluation advanced (LTE –A). The proposed OFDM system consists of channel estimation using comb type pilot arrangement and convolution encoder with the best known Coding Bounds and Maximum A Posteriori (MAP) decoder. Using pilot symbols, the channel quality is estimated. The BER performance of OFDM system is improved using pilot carriers, channel estimation schemes and MAP decoder at the best known coding bounds. The system performance is analyzed with recursive systematic and non-systematic convolution codes, ML and MAP decoders. From the results, it is evident that the proposed OFDM system with channel estimation and MAP decoder at the best known coding bounds improves the system performance significantly.

To improve the performance of the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, this letter proposes a novel channel estimation method using virtual pilot tones in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Assuming that the superimposed virtual pilot tones at the data locations over the specific sub-carriers are transmitted from all transmit antennas, the corresponding virtual received pilot signals at the same locations are obtained from the neighboring real received pilot signals over the same sub-carriers by Wiener filter. Based on the least squares (LS) channel estimation, the channel parameters can be obtained from the combination of the virtual and real received pilot signals over one OFDM symbol. Simulation results show that the proposed channel estimation method greatly outperforms the previous method for the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, as well as approaches the method for the comb-type optimal pilot sequences in performance.

Signal-to-noise ratio (SNR) is an important parameter for adaptive orthogonal frequency division multiplexing (OFDM) systems as it serves as a standard measure of signal quality. In this work, we present a novel SNR per subcarrier estimation scheme for wireless OFDM systems in frequency selective channels. The novel scheme can operate both in time and frequency, requiring only one previously known OFDM symbol. Firstly the noise variance per subcarrier estimate is obtained using the estimated channel coefficients and a novel analysis of its estimation error is provided. The noise variance per subcarrier estimate is used to obtain the SNR per subcarrier estimate. The estimation scheme takes under consideration the frequency selectivity of the channel and the variation of the noise statistics across the OFDM subcarrier index. The estimator's performance, in means of normalized mean square error (NMSE), is evaluated through simulations on a variety of channel models and is compared with another estimation scheme. The NMSE of the proposed scheme demonstrates its ability to identify the local statistics of the noise efficiently resulting into a reliable estimator in contrast with other similar approaches.

Correct time and frequency synchronization is important for the performance of orthogonal frequency-division multiplexing (OFDM) system. While using the partial power training sequences to synchronize in orthogonal frequency-division multiplexing (OFDM) system, the received data signals will be interfered by the training sequences. In this paper, we give a method for suppressing the interference caused by the training sequence, and introduce an optimized formula for the partial interference canceling factor of partial power training sequence. The above technique is evaluated by means of pilot assistant coherent OFDM system under time-varying multipath Rayleigh fading channels, and the linear interpolation channel estimator is employed to exploit the frequency domain correlation. Especially we focus on only one OFDM symbol in a packet transmission, that is, both the OFDM data and the training sequences are included in one OFDM symbol, and there are no other symbols before or after it. Both theoretical and simulated results of the above technique are presented. It has been shown that the better BER performance can be achieved as compared with no separation, and only the one OFDM symbol can accomplish user data communication assignment.

This work pertains to the use of superimposed training (ST) for channel estimation in orthogonal frequency division multiplexing (OFDM) based systems. A time domain coherent averaging based channel estimator is derived from the least squares criterion. By exploiting the periodicity of the training sequences in the time domain and inserting zeros instead of data at some of the training sequence subcarrier locations depending on the desired estimation accuracy, a controlled superimposition technique is proposed. This method includes the flexibility to trade off between bandwidth efficiency and performance. The mean squared estimation error (MSEE) performance of such a system is mathematically analyzed and a training sequence selection criterion optimizing the same is proposed. The simulation performance of the scheme is presented in terms of the MSEE and the bit error rate (BER) of the OFDM system. Such a scheme is attractive in high data rate scenarios in closed loop OFDM systems.

ABSTRACTWhile inter-symbol interference is not of concern, inter-carrier interference that is caused by carrier frequency offset (CFO) is more concerned in orthogonal frequency division multiplexing (OFDM) systems. The estimation of channel impulse response (CIR) is another important parameter of interest in the system. Recently, a number of approaches for the joint estimation of CFO and CIR in OFDM systems have been proposed in the literature, and most of them are traditional maximum-likelihood-based approaches. In this paper, we propose a number of mixture cost-reference particle filtering (CRPF) approaches for joint estimation of CIR and CFO, and a couple of them can be applied without the knowledge of both state and measurement noise statistics. Conventional least mean squares algorithm or recursive least squares algorithm is jointly employed with recently developed CRPF for nonlinear and multiple parameters estimation in OFDM systems. The computer simulation results show that mixture CRPFs are more robust against particle impoverishment (PI) problem than standard mixture particle filtering (PF) and mixture regularized PF (RPF) approaches although RPF was particularly developed to tackle the PI problem. In this paper, we investigate a number of mixture PF approaches including ones that do not need the information of noise statistics for the joint estimation of CFO and channel in OFDM systems.

In orthogonal frequency-division multiplexing (OFDM) systems, it is generally assumed that the channel response is static in an OFDM symbol period. However, the assumption does not hold in high-mobility environments. As a result, intercarrier interference (ICI) is induced and the system performance is degraded. A simple remedy for this problem is the application of the zero-forcing (ZF) and minimum mean square error (MMSE) equalizers. Unfortunately, the direct ZF method requires the inversion of an NxN ICI matrix, where N is the number of subcarriers. When N is large, the computational complexity can become prohibitively high. As for the direct MMSE method, in addition to an NxN matrix inverse, it requires an extra NxN matrix multiplication, making the required computational complexity higher compared to the direct ZF method. In this dissertation, we first propose a low-complexity ZF method to solve the problem in single-input-single-output (SISO) OFDM systems. The main idea is to explore the special structure inherent in the ICI matrix and to apply Newton's iteration for matrix inversion. With our formulation, fast Fourier transforms (FFTs) can be used in the iterative process, reducing the complexity from O(N^3) to O(Nlog_2 N) . Also, the required number of the iteration is typically one or two. We also analyze the convergence behavior of the proposed method and derive the theoretical output signal-to-interference-noise-ratio (SINR). For the MMSE method, we first reformulate the MMSE solution in a way that the extra matrix multiplication can be avoided. Similar to the ZF method, we then exploit the structure of the ICI matrix and apply Newton's iteration to reduce the complexity of the matrix inversion. For a multiple-input-multiple-output (MIMO) OFDM system, the required complexity of the ZF and MMSE methods becomes more intractable. We then manage to extend the proposed ZF and MMSE methods for SISO-OFDM systems to MIMO-OFDM systems. It turns out that the computational complexity can be reduced even more significantly. Simulation results show that the performance of the proposed methods is almost as good as that of the direct ZF and MMSE methods, while the required computational complexity is reduced dramatically. Finally, we explore the application of the proposed methods in mobility-induced ICI mitigation for OFDM multiple access (OFDMA) systems, and in carrier frequency offset (CFO) induced ICI mitigation for OFDMA uplink systems. As that in OFDM systems, the proposed methods can reduce the required computational complexity, effectively.

This paper focuses on a novel orthogonal frequency division multiplexing (OFDM) receiver architecture, which uses a low-resolution analog-to-digital converter (ADC) to oversample the received signal in time domain. Although attractive in terms of power consumption and hardware cost, low-resolution ADC incurs severe nonlinear quantization distortion and thus destroys the orthogonality between the OFDM subcarriers. The loss of orthogonality, together with the oversampling-caused correlation in noise samples, poses a great challenge to the OFDM receiver design. This paper aims to tackle this challenge. For the proposed receiver, we consider an often-used two-phase transmission protocol. In the first phase, training OFDM symbols are transmitted for channel estimation. In the second phase, information-conveying OFDM symbols are transmitted and detected using the previously obtained channel estimate. Therefore, the proposed receiver consists of two key components: channel estimator and data detector. These components are elaborately derived in the framework of Bayesian inference. Due to the diversity gain resulting from the oversampling operation, the proposed receiver can remarkably outperform the counterparts, including the conventional OFDM receiver with perfect infinite-precision quantization.

We present a blind recursive algorithm for tracking rapidly time-varying wireless channels in precoded multiple-input-multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. Subspace-based tracking is normally considered for slowly time-varying channels only. Due to the frequency correlation of the wireless channels, the proposed scheme can collect data not only from the time but from the frequency domain as well to speed up the update of the required second-order statistics. After each such update, the subspace information is recomputed using the orthogonal iteration, and then, a new channel estimate is obtained. We also investigate choices of precoder in terms of the tradeoff between the symbol recovery capability and the channel estimation performance and demonstrate the convergence properties of our approach. The proposed algorithm is evaluated in a Third-Generation Partnership Project (3GPP) Spatial Channel Model suburban macro scenario, in which a mobile station is allowed to move in any direction with a speed up to 100 km/h, corresponding to a maximum Doppler shift of about 230 Hz in this case. Numerical experiments show that the normalized mean square error of the channel estimates converges to a level of -30 dB within less than five OFDM symbols when the signal-to-noise ratio (SNR) (per symbol) is ≥ 20 dB.

Simulation and Comparison of Channel Estimation Based on Block-type Pilot Frequency in OFDM System

FBMC is a pivotal system in 5G, serving as a cornerstone for efficient use of available bandwidth while simultaneously meeting stringent requirements for high spectral efficiency. Notably, FBMC harnesses the power of multicarrier modulation (MC), a good alternative to orthogonal frequency division multiplexing (OFDM) technology that supports fourth-generation (4G) systems. The wireless communications field is full of challenges, the most important of which are channel estimation and interference cancellation, both of which deserve comprehensive study to increase the efficiency of data transmission. In this paper, our investigation takes a deliberate step towards the convergence of two prominent modulation models: OFDM and FBMC. We specifically contrast these modulation techniques with the intricate field of joint channel estimation and interference cancellation (JCEIC). In this research study, we take advantage of recurrent neural networks' (RNNs') efficiency as a vehicular channel to perform precise channel estimation and recovery of uncorrupted transmitted signals, thereby lowering the bit error rate (BER). Our channel estimation for a dual selective channel is based on the thoughtful placement of pilots scattered over the temporal and frequency dimensions, and is further improved by the interference cancellation method of low complexity that was selected. Our JCEIC proposal aims to integrate RNNs carefully, using the output sequences of JCEIC algorithms as useful inputs to this neural architecture. By clearly demonstrating a decrease in BER as compared to traditional approaches, it is evident that the performance of the novel approach is near to that of a perfect channel. Additionally, a comparison of the performance of FBMC and OFDM systems at various signal-to-noise ratios reveals a clear performance divide that favors the former in terms of system efficiency. The BER is restricted by FBMC to a commendable threshold of less than 0.1 at a modest 5 dB, continuing the higher trend started by its improved RNN-based channel estimate. The accuracy of channel estimation is clearly improved by this paradigm shift, and the computing complexity typical of 5G networks is also clearly reduced.