Inter-Carrier Interference-Aware Sparse Time-Varying Underwater Acoustic Channel Estimation Based on Fast Reconstruction Algorithm

In this paper,a fast orthogonal matching pursuit(OMP)algorithm based on optimized iterative process is proposed for sparse time-varying underwater acoustic(UWA)channel estimation.The channel estimation consists of calculating amplitude,delay and Doppler scaling factor of each path using the received multi-path signal.This algorithm,called as OIP-FOMP,can reduce the computationally complexity of the traditional OMP algorithm and maintain accuracy in the presence of severe inter-carrier interference that exists in the time-varying UWA channels.In this algorithm,repeated inner product operations used in the OMP algorithm are removed by calculating the candidate path signature Hermitian inner product matrix in advance.Efficient QR decomposition is used to estimate the path amplitude,and the problem of reconstruction failure caused by inaccurate delay selection is avoided by optimizing the Hermitian inner product matrix.Theoretical analysis and simulation results show that the computational complexity of the OIP-FOMP algorithm is reduced by about 1/4 compared with the OMP algorithm,without any loss of accuracy.

Improved smoothed L0 reconstruction algorithm for ISI sparse channel estimation

In this paper, the problem of inter symbol interference （ISI） sparse channel estimation in wireless communication with the application of compressed sensing is investigated. However, smoothed L0 norm algorithm （SL0） has ＇notched effect＇ due to the negative iterative gradient direction. Moreover, the property of continuous function in SL0 is not steep enough, which results in inaccurate estimations and low convergence. Afterwards, we propose the Lagrange multipliers as well as Newton method to optimize SL0 algorithm in order to obtain a more rapid and efficient signal reconstruction algorithm, improved smoothed L0 （ISL0）. ISI channel estimation will have a direct effect on the performance of ISI equalizer at the receiver. So, we design a pre-filter model which with no considerable loss of optimality and do analyses of the equalization methods of the sparse multi-path channel. Real-time simulation results clearly show that the ISL0 algorithm can estimate the ISI sparse channel much better in both signal noise ratio （SNR） and compression levels. In the same channel conditions, ISL0 algorithm has been greatly improved when compared with the SL0 algorithm and other compressed-sensing algorithms.

Sparse underwater acoustic OFDM channel estimation based on superimposed training

A superimposed training （ST） based channel estimation method is presented that provides accurate estimation of a sparse underwater acoustic orthogonal frequency-division multiplexing （OFDM） channel while improving bandwidth transmission efficiency. A periodic low power training sequence is superimposed on the information sequence at the transmitter. The channel parameters can be estimated without consuming any extra system bandwidth, but an unknown information sequence can interfere with the ST channel estimation method, so in this paper, an iterative method was adopted to improve estimation performance. An underwater acoustic channel＇s properties include large channel dimensions and a sparse structure, so a matching pursuit （MP） algorithm was used to estimate the nonzero taps, allowing the performance loss caused by additive white Gaussian noise （AWGN） to be reduced. The results of computer simulations show that the proposed method has good channel estimation performance and can reduce the peak-to-average ratio of the OFDM channel as well.

Sparsity-Aware Channel Estimation for mmWave Massive MIMO: A Deep CNN-Based Approach

The deep convolutional neural network(CNN)is exploited in this work to conduct the challenging channel estimation for mmWave massive multiple input multiple output(MIMO)systems.The inherent sparse features of the mmWave massive MIMO channels can be extracted and the sparse channel supports can be learnt by the multi-layer CNN-based network through training.Then accurate channel inference can be efficiently implemented using the trained network.The estimation accuracy and spectrum efficiency can be further improved by fully utilizing the spatial correlation among the sparse channel supports of different antennas.It is verified by simulation results that the proposed deep CNN-based scheme significantly outperforms the state-of-the-art benchmarks in both accuracy and spectrum efficiency.

Compressed sensing based channel estimation for fast fading OFDM systems

A compressed sensing（CS） based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel.A compressive basis expansion channel model with sparsity in both time and frequency domains is given.The pilots in accordance with a novel random pilot matrix in both time and frequency domains are sent to measure the delay-Doppler sparsity channel.The relatively nonzero channel coefficients are tracked by random pilots at a sampling rate significantly below the Nyquist rate.The sparsity channels are estimated from a very limited number of channel measurements by the basis pursuit algorithm.The proposed algorithm can effectively improve the channel estimation performance when the number of pilot symbols is reduced with improvement of throughput efficiency.

A Novel Training Sequence Applied to DCS-Based Channel Estimation

Studies have indicated that the distributed compressed sensing based(DCSbased) channel estimation can decrease the length of the reference signals effectively. In block transmission, a unique word(UW) can be used as a cyclic prefix and reference signal. However, the DCS-based channel estimation requires diversity sequences instead of UW. In this paper, we proposed a novel method that employs a training sequence(TS) whose duration time is slightly longer than the maximum delay spread time. Based on proposed TS, the DCS approach perform perfectly in multipath channel estimation. Meanwhile, a cyclic prefix construct could be formed, which reduces the complexity of the frequency domain equalization(FDE) directly. Simulation results demonstrate that, by using the method of simultaneous orthogonal matching pursuit(SOMP), the required channel overhead has been reduced thanks to the proposed TS.

Compressed SNR-and-Channel Estimation for Beam Tracking in 60-GHz WLAN

Signal-to-noise ratio （SNR） and channel estimations are critical for 60-GHz communications to track the optimal trans- mission and reception beam pairs. However, the excessive pilot overhead for the estima- tions severely reduces system throughput in fast-rotation scenarios. In order to address this problem, we firstly demonstrate the potential sparseness property of 60-GHz channel in beam tracking; subsequently, via exploiting this property, we propose a novel compressed SNR-and-channel estimation. The estimation is conducted in a three-stage fashion, includ- ing the unstructured estimation, nonzero-tap detection, and structured estimation with non- zero-tap location. Numerical simulations show that, in the case of substantial reduction of the pilot overhead, the proposed estimator still reveals a significant improvement in terms of estimation performance over the scheme in IEEE 802.1 lad. Furthermore, it is also demon- strated that the proposed SNR and channel estimators can approach the lower bounds in sparse channels so long as SNR exceeds 8 dB.

Compressed sensing based channel estimation using group random unit pilot for OFDM systems in fast moving environment~

A compressed sensing （CS） based channel estimation algorithm is proposed in the fast moving environment. A sparse basis expansion channel model in both time and frequency domain is given.Pilots are placed according to a novel random unit pilot matrix （RUPM） to measure the delay- Doppler sparse channel. The sparse channels are recovered by an extension group orthogonal matching pursuit （GOMP） algorithm, enjoying the diversity gain from multi-symbol processing. The relatively nonzero channel coefficients are estimated from a very limited number of pilots at a sampling rate significantly below the Nyquist rate. The simulation results show that the new channel estimator can provide a considerable performance improvement for the fast fading channels. Three significant reductions are achieved in the required number of pilots, memory requirements and computational complexity.

Rank-defective millimeter-wave channel estimation based on subspace-compressive sensing

Millimeter-wave communication （mmWC） is considered as one of the pioneer candidates for 5G indoor and outdoor systems in E-band. To subdue the channel propagation characteristics in this band, high dimensional antenna arrays need to be deployed at both the base station （BS） and mobile sets （MS）. Unlike the conventional MIMO systems, Millimeter-wave （mmW） systems lay away to employ the power predatory equipment such as ADC or RF chain in each branch of MIMO system because of hardware constraints. Such systems leverage to the hybrid precoding （combining） architecture for downlink deployment. Because there is a large array at the transceiver, it is impossible to estimate the channel by conventional methods. This paper develops a new algorithm to estimate the mmW channel by exploiting the sparse nature of the channel. The main contribution is the representation of a sparse channel model and the exploitation of a modified approach based on Multiple Measurement Vector （MMV） greedy sparse framework and subspace method of Multiple Signal Classification （MUSIC） which work together to recover the indices of non-zero elements of an unknown channel matrix when the rank of the channel matrix is defected. In practical rank-defective channels, MUSIC fails, and we need to propose new extended MUSIC approaches based on subspace enhancement to compensate the limitation of MUSIC. Simulation results indicate that our proposed extended MUSIC algorithms will have proper performances and moderate computational speeds, and that they are even able to work in channels with an unknown sparsity level.