1,278 research outputs found
Modified Fast ICA for Blind Signal separation
The Fast ICA or fixed-point algorithm is one of the most widely known algorithm for Blind Signal Separation (BSS) in terms of accuracy speed and computational complexity. Two versions of the algorithm are made available in literature: a one unit (deflation) algorithm and a symmetric algorithm. Both algorithms provide four standard contrast functions namely Skew, Pow3, Gauss and Tanh for selection to have better performance. In general, the selection of the contrast function depends on the data and the application. In Biomedical applications Electro Cardio Graph (ECG) data is problematic due to heart rate variation and several interferences such as muscle activity, respiration , thermal/electronic noise and noise from electrode-skin contact that corrupt the signal. We propose modified Fast ICA algorithm employing different data-adaptive contrast functions that are obtained from the underlying pdf of source signal distribution. We test the performance of modified Fast ICA algorithm for ECG application ECG data set is simulated and then added with four different types of noise distributions, white Gaussian, Flicker, Impulse and Rayleigh. We compare performance across the standard contrast functions in Fast ICA and modified Fast ICA using Signal Mean Square Error (SMSE) and Signal Noise Ratio (SNR) of estimated sources.. We show that the performance of modified Fast ICA is superior to standard contrasts in case of noisy ECG data
Superresolution without Separation
This paper provides a theoretical analysis of diffraction-limited
superresolution, demonstrating that arbitrarily close point sources can be
resolved in ideal situations. Precisely, we assume that the incoming signal is
a linear combination of M shifted copies of a known waveform with unknown
shifts and amplitudes, and one only observes a finite collection of evaluations
of this signal. We characterize properties of the base waveform such that the
exact translations and amplitudes can be recovered from 2M + 1 observations.
This recovery is achieved by solving a a weighted version of basis pursuit over
a continuous dictionary. Our methods combine classical polynomial interpolation
techniques with contemporary tools from compressed sensing.Comment: 23 pages, 8 figure
Independent Component Analysis and Time-Frequency Masking for Speech Recognition in Multitalker Conditions
When a number of speakers are simultaneously active, for example in meetings or noisy public places, the sources of interest need to be separated from interfering speakers and from each other in order to be robustly recognized. Independent component analysis (ICA) has proven a valuable tool for this purpose. However, ICA outputs can still contain strong residual components of the interfering speakers whenever noise or reverberation is high. In such cases, nonlinear postprocessing can be applied to the ICA outputs, for the purpose of reducing remaining interferences. In order to improve robustness to the artefacts and loss of information caused by this process, recognition can be greatly enhanced by considering the processed speech feature vector as a random variable with time-varying uncertainty, rather than as deterministic. The aim of this paper is to show the potential to improve recognition of multiple overlapping speech signals through nonlinear postprocessing together with uncertainty-based decoding techniques
Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases
Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems
A unified approach to sparse signal processing
A unified view of the area of sparse signal processing is presented in tutorial form by bringing together various fields in which the property of sparsity has been successfully exploited. For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly. The common potential benefits of significant reduction in sampling rate and processing manipulations through sparse signal processing are revealed. The key application domains of sparse signal processing are sampling, coding, spectral estimation, array processing, compo-nent analysis, and multipath channel estimation. In terms of the sampling process and reconstruction algorithms, linkages are made with random sampling, compressed sensing and rate of innovation. The redundancy introduced by channel coding i
- …