A novel efficient time domain threshold based sparse channel estimation technique is proposed for orthogonal frequency division multiplexing (OFDM) systems. The proposed method aims to realize effective channel estimation without prior knowledge of channel statistics and noise standard deviation within a comparatively wide range of sparsity. Firstly, classical least squares (LS) method is used ...

We propose a noise cancellation technique that performs robustly in the presence of poor channel estimates and channel synchronization errors. The technique is based on the assumption that the signals have a sparse representation in a chosen signal basis, in this case, the time-frequency domain. Moreover, we assume the components of the signal of interest that contain a majority of its power ov...

The sign least mean square with reweighted L1-norm constraint (SLMS-RL1) algorithm is an attractive sparse channel estimation method among Gaussian mixture model (GMM) based algorithms for use in impulsive noise environments. The channel sparsity can be exploited by SLMS-RL1 algorithm based on appropriate reweighted factor, which is one of key parameters to adjust the sparse constraint for SLMS...

Based on the assumption of Gaussian noise model, conventional adaptive filtering algorithms for reconstruction sparse channels were proposed to take advantage of channel sparsity due to the fact that broadband wireless channels usually have the sparse nature. However, state-of-the-art algorithms are vulnerable to deteriorate under the assumption of non-Gaussian noise models (e.g., impulsive noi...

We examine the use of a structured thresholding algorithm for sparse underwater channel estimation using compressed sensing. This method shows some improvements over standard algorithms for sparse channel estimation such as matching pursuit, iterative detection and least squares. 1. Haupt and Nowak’s Algorithm In Ref. [1], Haupt and Nowak propose a method to recover signals corrupted with noisy...

This thesis introduces and explores a new type of representation for low and medium level vision operations called channel representation. The channel representation is a more general way to represent information than e.g. as numerical values, since it allows incorporation of uncertainty, and simultaneous representation of several hypotheses. More importantly it also allows the representation o...

Channels with a sparse impulse response arise in a number of communication applications. Exploiting the sparsity of the channel, we show how an estimate of the channel may be obtained using a matching pursuit (MP) algorithm. This estimate is compared to thresholded variants of the least squares (LS) channel estimate. Among these sparse channel estimates, the MP estimate is computationally much ...

The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions. In this paper, we have developed an algorithm based on Iterative Alternating Minimization technique which iteratively detects the location and the value of the channel taps. In fact, at each iteration we use an appr...

tec (M lea cha des exp ada LM two sig To a n (AS AS alg cha me sim est tha K nor (AS (M tec ma wa mu MI im effi rec to fre cha eac em MI Tim Abstract—Cha chnical issues MSIO) commun ast mean squ annel estimati scribed by sp ploited and th aptive sparse c MS algorithms o main drawb gnal and 2) uns o overcome the novel ASCE m SCE-NLMS). SCE method gorithm (ASCE annel sparsity ethods is conf mulat...