Channel Identification Algorithm Research Articles

A Novel Kernel Algorithm for Finite Impulse Response Channel Identification


 
 
 
 Over the last few years, kernel adaptive filters have gained in importance as the kernel trick started to be used in classic linear adaptive filters in order to address various regression and time-series prediction issues in nonlinear environments.In this paper, we study a recursive method for identifying finite impulse response (FIR) nonlinear systems based on binary-value observation systems. We also apply the kernel trick to the recursive projection (RP) algorithm, yielding a novel recursive algorithm based on a positive definite kernel. For purposes, our approach is compared with the recursive projection (RP) algorithm in the process of identifying the parameters of two channels, with the first of them being a frequency-selective fading channel, called a broadband radio access network (BRAN B) channel, and the other being a a theoretical frequency-selective channel, known as the Macchi channel. Monte Carlo simulation results are presented to show the performance of the proposed algorithm.
 
 
 

Recursive adaptive filtering algorithms for sparse channel identification and acoustic noise reduction

Recursive adaptive filtering algorithms for sparse channel identification and acoustic noise reduction

A new combination of adaptive channel estimation methods and TORC equalizer in MC‐CDMA systems

SummaryAdaptive systems identification has been widely studied, but most studies have focused on the convergence of these methods. Applications of equalization systems have also received much attention. This paper presents a new combination of adaptive Broadband Radio Access Networks (BRAN) channel identification algorithms for multicarrier code division multiple access (MC‐CDMA) systems downlink equalization. In fifth‐generation (5G) wireless communications, MC‐CDMA is expected to support the associated networks. The BRAN E channel parameters, representing an outdoor scenario normalized for MC‐CDMA systems, are identified using a recursive least mean pth power algorithm with logarithmic transformation (RlogLMP). For validity and test aim, this algorithm is compared with the existing recursive least square (RLS) and least mean square (LMS) algorithms. Moreover, we use the estimated coefficients in the adaptive equalization problem. We give a review of the threshold orthogonality restoring combining (TORC) equalizer, which is coupled with the presented algorithms to counteract channel fading, as evaluated by the bit error rate (BER). Our performance results show that the RlogLMP algorithm can estimate the measured BRAN E channel with good efficiency for various values of the signal‐to‐noise ratio (SNR), as compared with the classical algorithms RLS and LMS. In adaptive equalization problems, the achieved results demonstrate that two thresholds ρTH in the TORC equalizer minimize the performance degradation, in terms of the BER, of the MC‐CDMA system under multipath channel fading with very good accuracy, especially if the coefficients are estimated with the specific case of the power p in the RlogLMP algorithm.

Robust blind identification algorithm in stationary noise environments

Blind channel identification aims to extract the channel impulse response with little prior statistical knowledge of the source signal. In this study, a novel blind channel identification algorithm is proposed based on second-order statistics. This algorithm utilises the special structure of the covariance matrix to identify the channel impulse responses. The proposed algorithm also outperforms the conventional blind identification algorithm with a low signal-to-noise ratio (SNR) and a few observations. Theoretically, the performance of this algorithm is independent of the SNR. This algorithm can be used in both white or coloured noise environments provided that the noise is stationary. This algorithm is robust to parameter estimation errors and has a simple and efficient implementation. Simulation examples are provided to demonstrate the superior performance of this algorithm.

Fractional-Order System Identification and Equalization in Massive MIMO Systems

In this paper, a new methodology for the identification and equalization of massive Multiple-Input Multiple-Output (MIMO) channels in fifth generation (5G) wireless communications is proposed. Channel equalization is performed in state-space, having estimated the channel using the fractional-order Multivariable Output Error State Space (MOESP) system identification algorithm. The proposed fractional-order algorithm is an improvement over its integer-order counterpart that is currently used for state-space channel identification/estimation and state-space channel equalization. When dealing with fractional-order calculus our work adopts the Riemann-Liouville definition. Our numerical results of channel identification having used a chirp signal to excite our massive MIMO system show a lower mean square error (MSE) in channel estimation using the proposed fractional-order MOESP identification algorithm when compared to integer-order MOESP identification algorithm of increased order. Furthermore, following equalization, transmission using Binary phase shift keying (BPSK), Quadrature phase shift keying (QPSK) and 256-Quadrature amplitude modulation (256-QAM) signals show that the symbol error rate (SER) as a function of signal to noise ratio (SNR) performance of the fractional-order equalization algorithm compares to that of the integer-order equalization algorithm. The proposed channel identification algorithm also provides a more parsimonious solution for modelling multipath fading, thus enabling the design of fractional-order equalizers. In addition, they may be used in other applications where high order filtering and more complex control algorithms which are difficult to tune would be needed. Finally, the work has other technological applications where there is a requirement for modelling and control of propagation processes in dispersive media.

Performance Comparison of High Order Moments Blind Channel Identification

In this paper, we compare different order of statistical moments to blindly estimate the propagation channel in an OFDM based wireless network. We first derive the theoretical expression of the channel estimation error and we compare it to simulation results in different scenarios. These simulation results show a good agreement with the theoretical expression. Furthermore, we show that blind channel identification algorithms, based on different moment's order, exhibit similar performance in terms of the Normalized Mean Square Error (NMSE) and in terms of the Bit Error Rate (BER). We conclude that the choice of the moment's order is uniquely based on the ambiguity solving stage in the algorithm. The proposed study shows that the choice of the 4 th moment is a trade-off between channel estimation performance and ambiguity solving complexity.

Distributed and recursive blind channel identification to sensor networks

In this paper, the distributed and recursive blind channel identification algorithms are proposed for single-input multi-output (SIMO) systems of sensor networks (both time-invariant and time-varying networks). At any time, each agent updates its estimate using the local observation and the information derived from its neighboring agents. The algorithms are based on the truncated stochastic approximation and their convergence is proved. A simulation example is presented and the computation results are shown to be consistent with theoretical analysis.

Wireless Channel Identification Algorithm Based on Feature Extraction and BP Neural Network

Wireless Channel Identification Algorithm Based on Feature Extraction and BP Neural Network

Detection of Multiple Innervation Zones from Multi-Channel Surface EMG Recordings with Low Signal-to-Noise Ratio Using Graph-Cut Segmentation.

Knowledge of the location of muscle Innervation Zones (IZs) is important in many applications, e.g. for minimizing the quantity of injected botulinum toxin for the treatment of spasticity or for deciding on the type of episiotomy during child delivery. Surface EMG (sEMG) can be noninvasively recorded to assess physiological and morphological characteristics of contracting muscles. However, it is not often possible to record signals of high quality. Moreover, muscles could have multiple IZs, which should all be identified. We designed a fully-automatic algorithm based on the enhanced image Graph-Cut segmentation and morphological image processing methods to identify up to five IZs in 60-ms intervals of very-low to moderate quality sEMG signal detected with multi-channel electrodes (20 bipolar channels with Inter Electrode Distance (IED) of 5 mm). An anisotropic multilayered cylinder model was used to simulate 750 sEMG signals with signal-to-noise ratio ranging from -5 to 15 dB (using Gaussian noise) and in each 60-ms signal frame, 1 to 5 IZs were included. The micro- and macro- averaged performance indices were then reported for the proposed IZ detection algorithm. In the micro-averaging procedure, the number of True Positives, False Positives and False Negatives in each frame were summed up to generate cumulative measures. In the macro-averaging, on the other hand, precision and recall were calculated for each frame and their averages are used to determine F1-score. Overall, the micro (macro)-averaged sensitivity, precision and F1-score of the algorithm for IZ channel identification were 82.7% (87.5%), 92.9% (94.0%) and 87.5% (90.6%), respectively. For the correctly identified IZ locations, the average bias error was of 0.02±0.10 IED ratio. Also, the average absolute conduction velocity estimation error was 0.41±0.40 m/s for such frames. The sensitivity analysis including increasing IED and reducing interpolation coefficient for time samples was performed. Meanwhile, the effect of adding power-line interference and using other image interpolation methods on the deterioration of the performance of the proposed algorithm was investigated. The average running time of the proposed algorithm on each 60-ms sEMG frame was 25.5±8.9 (s) on an Intel dual-core 1.83 GHz CPU with 2 GB of RAM. The proposed algorithm correctly and precisely identified multiple IZs in each signal epoch in a wide range of signal quality and is thus a promising new offline tool for electrophysiological studies.

Variational Bayesian Inference for Multichannel Dereverberation and Noise Reduction

Room reverberation and background noise severely degrade the quality of hands-free speech communication systems. In this work, we address the problem of combined speech dereverberation and noise reduction using a variational Bayesian (VB) inference approach. Our method relies on a multichannel state-space model for the acoustic channels that combines frame-based observation equations in the frequency domain with a first-order Markov model to describe the time-varying nature of the room impulse responses. By modeling the channels and the source signal as latent random variables, we formulate a lower bound on the log-likelihood function of the model parameters given the observed microphone signals and iteratively maximize it using an online expectation-maximization approach. Our derivation yields update equations to jointly estimate the channel and source posterior distributions and the remaining model parameters. An inspection of the resulting VB algorithm for blind equalization and channel identification (VB-BENCH) reveals that the presented framework includes previously proposed methods as special cases. Finally, we evaluate the performance of our approach in terms of speech quality, adaptation times, and speech recognition results to demonstrate its effectiveness for a wide range of reverberation and noise conditions.

An Improved Subspace-Based Algorithm for Blind Channel Identification Using Few Received Blocks

In the last decade, several subspace-based algorithms for blind channel identification in zero-padded systems were introduced. These subspace-based methods are attractive because highly accurate estimates of the channel can be obtained by using only a few received blocks. However, they do not work when applied to the zero-padded orthogonal frequency division multiplexing systems (ZP-OFDM) with virtual carriers. In this paper, we propose two improvements on an earlier subspace-based blind channel estimation method for such systems. Firstly, we introduce a simple noise weighting approach. Unlike most of the earlier methods, the proposed weighting matrix is diagonal and it is independent of the channel noise variance and SNR. By doing so, the performance of previous work is significantly enhanced. Secondly, we extend the blind estimation method to ZP-OFDM systems with virtual carriers. Simulations are carried out to demonstrate the merits of the proposed method.

Blind Identification of Transmission Channel with the method of Higher-OrderCummulants

The modern telecommunication systems require very high transmission rates, in this context, the problem of channels identification is a challenge major. The use of blind techniques is a great interest to have the best compromise between a suitable bit rate and quality of the information retrieved.
 In this paper, we are interested to learn the algorithms for blind channel identification. We propose a hybrid method that performs a trade-off between two existing methods in order to improve the channel estimation.

Sparse-representation algorithms for blind estimation of acoustic-multipath channels

Acoustic channel estimation is an important problem in various applications. Unlike many existing channel estimation techniques that need known probe or training signals, this paper develops a blind multipath channel identification algorithm. The proposed approach is based on the single-input multiple-output model and exploits the sparse multichannel structure. Three sparse representation algorithms, namely, matching pursuit, orthogonal matching pursuit, and basis pursuit, are applied to the blind sparse identification problem. Compared with the classical least squares approach to blind multichannel estimation, the proposed scheme does not require that the channel order be exactly determined and it is robust to channel order selection. Moreover, the ill-conditioning induced by the large delay spread is overcome by the sparse constraint. Simulation results for deconvolution of both underwater and room acoustic channels confirm the effectiveness of the proposed approach.

Performance and Complexity Analysis of Blind FIR Channel Identification Algorithms Based on Deterministic Maximum Likelihood in SIMO Systems

We analyze two algorithms that have been introduced previously for Deterministic Maximum Likelihood (DML) blind estimation of multiple FIR channels. The first one is a modification of the Iterative Quadratic ML (IQML) algorithm. IQML gives biased estimates of the channel and performs poorly at low SNR due to noise induced bias. The IQML cost function can be “denoised” by eliminating the noise contribution: the resulting algorithm, Denoised IQML (DIQML), gives consistent estimates and outperforms IQML. Furthermore, DIQML is asymptotically globally convergent and hence insensitive to the initialization. Its asymptotic performance does not reach the DML performance though. The second strategy, called Pseudo-Quadratic ML (PQML), is naturally denoised. The denoising in PQML is furthermore more efficient than in DIQML: PQML yields the same asymptotic performance as DML, as opposed to DIQML, but requires a consistent initialization. We furthermore compare DIQML and PQML to the strategy of alternating minimization w.r.t. symbols and channel for solving DML (AQML). An asymptotic performance analysis, a complexity evaluation and simulation results are also presented. The proposed DIQML and PQML algorithms can immediately be applied also to other subspace problems such as frequency estimation of sinusoids in noise or direction of arrival estimation with uniform linear arrays.

Generalized Robust Multichannel Frequency-Domain LMS Algorithms for Blind Channel Identification

Recently, several noise-robust adaptive multichannel LMS algorithms have been proposed based on the spectral flatness of the estimated channel coefficients in the presence of additive noise. In this work, we propose a general form for the algorithms that integrates the existing algorithms into a common framework. Computer simulation results are presented and demonstrate that a new proposed algorithm gives better performance compared to existing algorithms in noisy environments.

Generalized Robust Multichannel Frequency-Domain LMS Algorithms for Blind Channel Identification

Recently, several noise-robust adaptive multichannel LMS algorithms have been proposed based on the spectral flatness of the estimated channel coefficients in the presence of additive noise. In this work, we propose a general form for the algorithms that integrates the existing algorithms into a common framework. Computer simulation results are presented and demonstrate that a new proposed algorithm gives better performance compared to existing algorithms in noisy environments.

Cross-Relation-Based Blind SIMO Identifiability in the Presence of Near-Common Zeros and Noise

The blind identification of single-input multiple-output (SIMO) systems is often performed by exploiting a cross-relation (CR) between channel pairs. It has been shown that this property allows an estimation of channel impulse responses up to a common gain factor if certain identifiability conditions are met. In this case, the estimated channels can be evaluated by a gain-compensated system distance known as normalized projection misalignment (NPM). Current algorithms for blind channel identification, however, suffer in the presence of insufficient channel diversity and observation noise. In this paper, we first demonstrate that in the absence of noise the CR identification error for channels with exact common zeros is given by a single-channel pole-zero transfer function. Next, we extend our analysis to the realistic case of near-common zeros and noise for which we show that the effective error can still be approximated by a common transfer function as long as the distance between the channel zeros remains below a signal-to-noise ratio-dependent threshold. A finite impulse response (FIR) modeling of the error then enables us to define a common-filter-error-compensated system distance, termed normalized filter-projection misalignment (NFPM), which establishes a natural extension to the NPM analysis. By finally considering realistic channels, which we blindly estimate with the adaptive multichannel least mean-square (MCLMS) algorithm, we demonstrate that the NFPM reliably reaches the noise floor, confirming that the effective error can be approximated by a common FIR filter.

Channel identification machines.

We present a formal methodology for identifying a channel in a system consisting of a communication channel in cascade with an asynchronous sampler. The channel is modeled as a multidimensional filter, while models of asynchronous samplers are taken from neuroscience and communications and include integrate-and-fire neurons, asynchronous sigma/delta modulators and general oscillators in cascade with zero-crossing detectors. We devise channel identification algorithms that recover a projection of the filter(s) onto a space of input signals loss-free for both scalar and vector-valued test signals. The test signals are modeled as elements of a reproducing kernel Hilbert space (RKHS) with a Dirichlet kernel. Under appropriate limiting conditions on the bandwidth and the order of the test signal space, the filter projection converges to the impulse response of the filter. We show that our results hold for a wide class of RKHSs, including the space of finite-energy bandlimited signals. We also extend our channel identification results to noisy circuits.

Covert Flow Graph Approach to Identifying Covert Channels

In this paper, the approach for identifying covert channels using a graph structure called Covert Flow Graph is introduced. Firstly, the construction of Covert Flow Graph which can offer information flows of the system for covert channel detection is proposed, and the search and judge algorithm used to identify covert channels in Covert Flow Graph is given. Secondly, an example file system analysis using Covert Flow Graph approach is provided, and the analysis result is compared with that of Shared Resource Matrix and Covert Flow Tree method. Finally, the comparison between Covert Flow Graph approach and other two methods is discussed. Different from previous methods, Covert Flow Graph approach provides a deep insight for system’s information flows, and gives an effective algorithm for covert channel identification.

Bi-iterative least squares algorithms for blind channel identification and equalization with second-order statistics

We present an adaptive algorithm for blind identification and equalization of single-input multiple-output (SIMO) FIR channels with second-order statistics. We first reformulate the blind channel identification problem into a low-rank matrix approximation solution based on the QR decomposition of the received data matrix. Then, a fast recursive algorithm is developed based on the bi-iterative least squares (Bi-LS) subspace tracking method. The new algorithm requires only a computational complexity of O(md2) at each iteration, or even as low as O(md) if only equalization is necessary, where m is the dimension of the received data vector (or the row rank of channel matrix) and d is the dimension of the signal subspace (or the column rank of channel matrix). To overcome the shortcoming of the back substitution, an inverse QR iteration algorithm for subspace tracking and channel equalization is also developed. The inverse QR iteration algorithm is well suited for the parallel implementation in the systolic array. Simulation results are presented to illustrate the effectiveness of the proposed algorithms for the channel identification and equalization.