Superimposed Training Based Channel Estimation for Uplink Multiple Access Relay Networks

This paper presents a novel iterative detection and channel estimation scheme that combines the effort of superimposed training (ST) and pilot-aided training (PAT) for multiple-input multiple-output (MIMO) flat fading channels. The proposed method, hereafter known as joint mean removal ST and PAT (MRST-PAT), implements an iterative detection and channel estimation that achieves the performance of data-dependent ST (DDST) algorithm, with the difference that the data arithmetic cyclic mean is estimated and removed from data at the receiver’s end. It is demonstrated that this iterative and cooperative detection and channel estimator algorithm surpasses the effects of data detection identifiability condition that DDST has shown when higher orders of modulation are used. Theoretical performance of the MRST-PAT scheme is provided and corroborated by numerical simulations. In addition, the performance comparison between the proposed method and different MIMO channel estimation techniques is analyzed. The joint effort between ST and PAT shows that MRST-PAT is a solid candidate in communications systems for multiamplitude constellations in Rayleigh fading channels, while achieving high-throughput data rates with manageable complexity and bit-error rate (BER) as a figure of merit.

In this paper, we consider bandwidth efficient design and channel estimation over time-varying frequency-selective environments, where the basis expansion model (BEM) is used to describe the time-varying channel. Superimposed training based channel estimation based affine precoding model is designed, where the data interference is eliminated from received data prior to performing channel estimation, while the training sequence is completely out in the symbol detection. Simulations results show that the proposed scheme can yield better detection performance with high bandwidth efficiency.

Massive multiple-input multiple-output (massive-MIMO) is foreseen as a potential technology for future 5G cellular communication networks due to its substantial benefits in terms of increased spectral and energy efficiency. These advantages of massive-MIMO are a consequence of equipping the base station (BS) with quite a large number of antenna elements, thus resulting in an aggressive spatial multiplexing. In order to effectively reap the benefits of massive-MIMO, an adequate estimate of the channel impulse response (CIR) between each transmit–receive link is of utmost importance. It has been established in the literature that certain specific multipath propagation environments lead to a sparse structured CIR in spatial and/or delay domains. In this paper, implicit training and compressed sensing based CIR estimation techniques are proposed for the case of massive-MIMO sparse uplink channels. In the proposed superimposed training (SiT) based techniques, a periodic and low power training sequence is superimposed (arithmetically added) over the information sequence, thus avoiding any dedicated time/frequency slots for the training sequence. For the estimation of such massive-MIMO sparse uplink channels, two greedy pursuits based compressed sensing approaches are proposed, viz: SiT based stage-wise orthogonal matching pursuit (SiT-StOMP) and gradient pursuit (SiT-GP). In order to demonstrate the validity of proposed techniques, a performance comparison in terms of normalized mean square error (NCMSE) and bit error rate (BER) is performed with a notable SiT based least squares (SiT-LS) channel estimation technique. The effect of channels’ sparsity, training-to-information power ratio (TIR) and signal-to-noise ratio (SNR) on BER and NCMSE performance of proposed schemes is thoroughly studied. For a simulation scenario of: 4 × 64 massive-MIMO with a channel sparsity level of 80 % and signal-to-noise ratio (SNR) of 10 dB , a performance gain of 18 dB and 13 dB in terms of NCMSE over SiT-LS is observed for the proposed SiT-StOMP and SiT-GP techniques, respectively. Moreover, a performance gain of about 3 dB and 2.5 dB in SNR is achieved by the proposed SiT-StOMP and SiT-GP, respectively, for a BER of 10 − 2 , as compared to SiT-LS. This performance gain NCME and BER is observed to further increase with an increase in channels’ sparsity.

This paper develops a novel data dependent superimposed training technique for channel estimation in generic block transmission (BT) systems comprising of single/multi-carrier (SC/MC) and zero-padded (ZP)/ cyclic prefix (CP) systems. The training sequence comprises of the summation of a known training sequence and a data-dependent sequence that is not known to the receiver. A unique aspect of the scheme is that the channel estimation is not affected by the use of a data-dependent sequence. The pilot design framework is conceived in order to minimize the Bayesian Cramér-Rao bound (BCRB) associated with channel estimation error. Simulation results are provided to exhibit the performance of the proposed scheme for single and multi carrier zero-padded and cyclic prefixed systems.

In this paper, we address the problems of super-imposed training (ST)-aided channel estimation for OFDM systems over rapidly time-varying (RTV) multi-path channels. Based on the piece-wise linear assumption, the superimposed training sequences are optimized with regard to minimizing the channel mean square error. Meanwhile, we derive a closed-form expression of channel estimation analysis. Simulation results show that the proposed design of training sequence outperforms that of the existing ST for RTV channel estimation.

B.Steiner channel estimation algorithm is commonly used in TD-SCDMA system, The algorithm is simple. However, due to the impact of background noise Makes the channel impulse response of the amplitude and delay relative to the true value have the error, reducing the system performance. Based on the B.Steiner channel estimation algorithm a channel estimation algorithm for using threshold value processing the channel impulse response has been proposed. The algorithm can effectively reduce the doppler frequency shift and noise. This article discusses the channel estimation based training sequence In the TD-SCDMA system. The mathematical model of the channel estimation is given, And describes the composition of the training sequence, the simulation model of the Channel estimation is given. using joint detection technology to simulation the channel estimation method. Experimental results showed that, based on training sequence channel estimation algorithm is close to the true value, Can significantly improve system performance. And reached the standard call.

In cellular communications, recently Multi In Multi Out (MIMO) and Massive MIMO research is getting attention for the need of high data rates in Long Term Evolution Advanced(LTE-A) and 5G Communications. In MIMO baseband signal processing at physical layer, both the channel estimation and the detection algorithms play a crucial role. In this paper it is discussed the estimation algorithms least square (LS) and minimum mean square error (MMSE) and the channel detection algorithms Zero Forcing (ZF) and MMSE. Currently none of the channel estimation algorithms of LTE-A offers twin advantages of low battery consumption and very low latency, which is a key requirement of 5G. It is expected the massive MIMO with 128 or more antennas will be a norm at 5G base stations. To achieve the ultra-low latency, the matrix computations for massive MIMO are the very big bottleneck in realizing the channel estimation and massive MIMO detection algorithms. For the optimization of the 5G Massive MIMO channel estimation and detection algorithms, the prerequisite is massive complex matrix inversion speed. In this paper, a parallel processing based coding scheme is proposed by using Gauss-Jordan elimination kernel algorithm on a single instruction multiple data (SIMD) stream vector processor to realize a complex matrix inverse with optimum speed which is the need of 5G channel estimation and detection.

Recent advances in multiple-input multiple-output (MIMO) systems have renewed the interests of researchers to further explore this area for addressing various dynamic challenges of emerging radio communication networks. Various measurement campaigns reported recently in the literature show that physical multipath MIMO channels exhibit sparse impulse response structure in various outdoor radio propagation environments. Therefore, a comprehensive physical description of sparse multipath MIMO channels is presented in first part of this paper. Superimposing a training sequence (low power, periodic) over the information sequence offers an improvement in the spectral efficiency by avoiding the use of dedicated time/frequency slots for the training sequence, which is unlike the traditional schemes. The main contribution of this paper includes three superimposed training (SiT) sequence based channel estimation techniques for sparse multipath MIMO channels. The proposed techniques exploit the compressed sensing theory and prior available knowledge of channel's sparsity. The proposed sparse MIMO channel estimation techniques are named as, SiT based compressed channel sensing (SiT-CCS), SiT based hardlimit thresholding with CCS (SiT-ThCCS), and SiT training based match pursuit (SiT-MP). Bit error rate (BER) and normalized channel mean square error are used as metrics for the simulation analysis to gauge the performance of proposed techniques. A comparison of the proposed schemes with a notable first order statistics based SiT least squares (SiT-LS) estimation technique is presented to establish the improvements achieved by the proposed schemes. For sparse multipath time-invariant MIMO communication channels, it is observed that SiT-CCS, SiT-MP, and SiT-ThCCS can provide an improvement up to 2, 3.5, and 5.2 dB in the MSE at signal to noise ratio (SNR) of 12 dB when compared to SiT-LS, respectively. Moreover, for $$\mathrm {BER}=10^{-1.9}$$BER=10-1.9, the proposed SiT-CCS, SiT-MP, and SiT-ThCCS, compared to SiT-LS, can offer a gain of about 1, 2.5, and 3.5 dB in the SNR, respectively. The performance gain in MSE and BER is observed to improve with an increase in the channel sparsity.

After a few decades’ evolution of wireless communication systems, to ensure reliable highspeed communication over unreliable wireless channels is still one of the major challenges facing researchers and engineers. The use of multiple antennas at transmitter and receiver, known as multiple-input multiple-output (MIMO) communications, is one promising technology delivering desired wireless services. The main goal of this thesis is to study two important issues in wireless MIMO communication systems: receiver design for coded MIMO systems, and diversity-multiplexing tradeoff analysis in general fading channels. In the first part of this thesis, we decompose the receiver design problem into two subproblems: MIMO channel estimation and MIMO detection. For the MIMO channel estimation, we develop an expectation-maximization (EM) based semi-blind channel and noise covariance matrix estimation algorithm for space-time coding systems under spatially correlated noise. By incorporating the proposed channel estimator into the iterative receiver structure, both the channel estimation and the error-control decoding are improved significantly. We also derive the modified Cramer-Rao bounds (MCRB) for the unknown parameters as the channel estimation performance metric, and demonstrate that the proposed channel estimation algorithm can achieve the MCRB after several iterations. For the MIMO detection, we propose a novel lowcomplexity MIMO detection algorithm, which has only cubic order computational complexity, but with near-optimal performance. For a 4×4 turbo-coded system, we show that the proposed detector had the same performance as the maximum a posteriori (MAP) detector for BPSK modulation, and 0.1 dB advantage over the approximated MAP detector (list sphere decoding algorithm) for 16-QAM modulation at BER = 10−4. In the second part of this thesis, we derive the optimal diversity-multiplexing tradeoff for

This paper addresses the problem of optimal training for joint carrier frequency offset (CFO) and channel estimation in multiuser MIMO OFDM systems, where each user can utilize all available subcarriers. To choose the training sequence with the goal of providing the smallest estimation mean square error (MSE), the Cramer-Rao bound (CRB) is derived in close-form. However, little insight on the sequence selection can be obtained from the CRB directly due to its complicated dependence on training sequence and channel parameters. To proceed, asymptotic CRB, which has a much simpler dependence on the training, is derived. It is found that the optimal training sequences should be individually white and uncorrelated with each other. Simulation results illustrate the merits of the proposed training design.

Two previously proposed training sequence optimization techniques for channel estimation are compared. One method is based on a frequency-domain (FD) based channel estimation method and the other is based on a time-domain (TD) channel estimation technique. The FD method produces a lower complexity search strategy, but does not always result in the optimal training sequences in terms of the mean-squared channel estimation error. A proof of the superiority of the TD method over the FD method is presented. Based on the proof, an alternative search criterion is proposed, which, in general, provides equivalent or better performance than the FD method while still enjoying the low search complexity.

Achieving accurate channel estimation and adaptive communications with moving transceivers is challenging due to rapid changes in the underwater acoustic channels. We achieve an accurate channel estimation of fast time-varying underwater acoustic channels by using the superimposed training scheme with a powerful channel estimation algorithm and turbo equalization, where the training sequence and the symbol sequence are linearly superimposed. To realize this, we develop a ‘global’ channel estimation algorithm based on Gaussian likelihood, where the channel correlation between (among) the segments is fully exploited by using the product of the Gaussian probability-density functions of the segments, thereby realizing an ideal channel estimation of each segment. Moreover, the Gaussian-likelihood-based channel estimation is embedded in turbo equalization, where the information exchange between the equalizer and the decoder is carried out in an iterative manner to achieve an accurate channel estimation of each segment. In addition, an adaptive communication algorithm based on constellation aggregation is proposed to resist the severe fast time-varying multipath interference and environmental noise, where the encoding rate is automatically determined for reliable underwater acoustic communications according to the constellation aggregation degree of equalization results. Field experiments with moving transceivers (the communication distance was approximately 5.5 km) were carried out in the Yellow Sea in 2021, and the experimental results verify the effectiveness of the two proposed algorithms.

Based on the knowledge of instantaneous channel state information (CSI), the optimal source and relay pre-coding matrices have been developed recently for multiple-input multiple-output (MIMO) relay communication systems. However, in real communication systems, the instantaneous CSI is unknown and needs to be estimated at the destination node. In this paper, we propose a superimposed channel training method for MIMO relay communication systems. It is shown that to minimize the mean-squared error (MSE) of channel estimation, the optimal training sequence at each node matches the eigenvector matrix of the transmitter correlation matrix of the forward MIMO channel. Then we optimize the power allocation among different streams of the training sequence at the source node and the relay node. Simulation results show that the proposed algorithm leads to a smaller MSE of channel estimation compared with the conventional MIMO relay channel estimation algorithm.

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.

Conventional time-division duplex (TDD) orthogonal frequency division multiplexing (TDD-OFDM) system is vulnerable to the pilot spoofing attack as it mainly relies on employing the deterministic pilot to capture the channel state information (CSI). To solve the abovementioned issue, we in this paper propose an independent component analysis (ICA) based channel identification and estimation (ICA-CIE) mechanism which uses randomized pilot to paralyze the pilot spoofing attack. Specifically, we first convert the pilot spoofing attack to the pilot jamming attack by exploiting pilot randomization. Then, an eigenstructure-based detector (EID) is proposed to realize efficient pilot jamming attack detection. In particular, on one hand, Least Square (LS) method is adopted if no jamming attack is detected. On the other hand, if jamming attack is detected, we further design a channelseparation oriented joint approximate diagonalization of eigenmatrices (CS-JADE) algorithm for channel estimation and identification. Therein, an optimization problem is first formulated to optimize the fourth-order statistical information of the observation data, after which a pilot signal reconstruction scheme is further developed to help identify true sub-channels from the optimization output. Simulation results demonstrate that our proposed ICA-CIE mechanism can achieve highly-accurate channel estimation for the legitimate transceiver pair only by using 6 OFDM symbols within the coherence time. Moreover, we also observe that the estimation accuracy of our proposed mechanism is immune to Eve's transmit power, which further verifies superiority of our proposed mechanism.