Fast-converging complex adaptive algorithm for diversity wireless receivers in linearly fading channels

This paper presents a blind multi-user detection technique for multi-antenna quadrature amplitude modulation (QAM) receivers with Inphase/Quadrature phase (I/Q) imbalances. The estimation of multiple users in the presence of I/Q imbalances is performed by Blind Source Separation (BSS) methods. While the complex-valued signal model for multi-antenna QAM receivers does not lend itself to BSS due to the effect of I/Q imbalances, reformulating the signal model to a real-valued equivalent form enables the application of BSS. The proposed method enables multiple users to share the same bandwidth simultaneously in different geographical locations, and avoids the need for the knowledge of the channel state information. In addition, despite of the presence of I/Q imbalances in all receiver branches, the number of antenna required in the receiver is equal to the number of users. Computer simulations are conducted using the popular Fast-ICA (Independent Component Analysis) algorithm, and the simulation results confirmed the effectiveness of the proposed technique.

The impact of outliers on signal separation performance of an independent component analysis (ICA) algorithm is an important factor when selecting an ICA algorithm. If an ICA estimator has the property of B-robustness, the influence of an extreme point is bounded, leading to good separation performance in the presence of outliers. Since this property is binary, it does not give the degree of influence an outlier has on the separation performance. To address this issue, a Mamdani-type fuzzy inference, based on the location of a potential outlier and on the skewness of the data set, has been developed. It creates an outlier sensitivity map for an ICA algorithm. The implication of this work is a criterion to switch from one ICA algorithm to another in real time, as determined by the algorithms sensitivity to the data set under consideration. This paper describes estimation of the outlier impact on the separation performance of the non-B-robust FastICA algorithm using a Mamdani-type fuzzy inference. In simulations with data sets contaminated by outliers, the FastICA sensitivity map resembles the separation performance measured by the Amari performance index.

An adaptive semiblind signal separation algorithm for the separation of a class of arbitrarily distributed but temporally correlated source signals is introduced in this paper. The proposed adaptive algorithm is based only on second-order statistical(SOS) information and exploits the assumption that the source signals are not strictly spatial statistically independent, and temporal do not identical distributed too. Furthermore, the novel adaptive batch blind signal separation(BSS) method give an adaptive algorithm for correlated source signals. In order to get the ideal separation, the source signals must have different power spectra shapes. Simulation results for real image recordings show that the proposed algorithm has the ability to restore source signals, and its performance is comparable to that of the BSS algorithm such as AMUSE and JADE algorithm. The proposed algorithm is also shown to alleviate the limitation that the classic independent component analysis(ICA) algorithm can separate at most one Gaussian distributed source.

The higher-order statistics based independent component analysis (ICA) algorithm can extract natural image features. Based on the maximum likelihood ICA criterion, and using the weighted orthogonal constrained natural gradient, a new ICA algorithm is proposed. Natural image feature extraction simulation results show that, compared with other ICA algorithms, the proposed algorithm has faster convergence rate, most of the extracted basis vectors are localized in space, frequency, and orientation, which can describe the features of the natural images well, and the corresponding coefficients are very sparse, obey stronger super-Gaussian distribution with very high kurtosis.

We apply the independent component analysis (ICA) algorithm to uncover intrinsic noise in the beam position monitor (BPM) system. Numerical simulations found that ICA is efficient in the BPM noise estimation. The ICA algorithm is applied to the turn-by-turn data at the Relativistic Heavy Ion Collider. We found the distribution of the BPM noise level, which is consistent with the Johnson-Nyquist thermal noise model. The ICA analysis of turn-by-turn data can be used in neuronetwork feasibility of monitoring a storage ring parasitically.

Our goal is to develop a novel BCI based on an eye movements system employing EEG signals on-line. Most of the analysis on EEG signals has been performed using ensemble averaging approaches. However,It is suitable to analyze raw EEG signals in signal processing methods for BCI. In order to process raw EEG signals, we used independent component analysis(ICA). However, we do not know which ICA algorithms have good performance. It is important to check which ICA algorithms have good performance to develop BCIs. Previous paper presented extraction rate of saccade-related EEG signals by five ICA algorithms and eight window size. However, three ICA algorithms, the FastICA, the NG-FICA and the JADE algorithms, are based on 4th order statistic and AMUSE algorithm has an improved algorithm named SOBI.Therefore, we must re-select ICA algorithms. In this paper, we add new algorithms; the SOBI and the MILCA. The SOBI is an improved algorithm based on the AMUSE and uses at least two covariance matrices at different time steps. The MILCA use the independency based on mutual information. Using the Fast ICA, the JADE, the AMUSE, the SOBI, and the MILCA, we extract saccade-related EEG signals and check extracting rates. Secondly, in order to get more robustness against EOG noise, we use improved FastICA with reference signals and check extracting rates.

When the independent sources are known to be nonnegative and well-grounded, which means that they have a non-zero pdf in the region of zero, a few nonnegative independent component analysis (ICA) algorithms have been proposed to separate these positive sources. In this paper, by using the property of skew-symmetry matrix, rigorous convergence proof of a nonnegative ICA algorithm on Stiefel manifold is given. And sufficient convergence conditions are presented. Simulations are employed to confirm our convergence theory. Our techniques may be useful to analyze general ICA algorithms on Stiefel manifold.

As an important factor in the fast fixed-point algorithm of independent component analysis (ICA), noise has a significant influence on the separate performance of ICA. Unfortunately, the traditional algorithm of noisy ICA did not address the influence of impulsive components. Because the sources were signals mixed with impulsive noise, the Gaussian noisy algorithm will be invalid for separating the sources. In general, those measurements that significantly deviate from the normal pattern of sensed data are considered impulses. In this paper, we introduce a non-linear function based on the S-estimator to identify the impulsive components in the observed data. This approach guarantees that the impulse noise can be detected from the observed signal. Furthermore, a threshold for the impulse components and methods to remove impulse noise and reconstruct the signal is proposed. The proposed technique improves the separate performance of the traditional algorithm for Gaussian noisy ICA. With the proposed method, the fast fixed-point algorithm of ICA is more reliable for noisy situations. The simulation results show the effectiveness of the proposed method.

Current analytical techniques applied to functional magnetic resonance imaging (fMRI) data require a priori knowledge or specific assumptions about the time courses of processes contributing to the measured signals. Here we describe a new method for analyzing fMRI data based on the independent component analysis (ICA) algorithm of Bell and Sejnowski ([1995]: Neural Comput 7:1129-1159). We decomposed eight fMRI data sets from 4 normal subjects performing Stroop color-naming, the Brown and Peterson work/number task, and control tasks into spatially independent components. Each component consisted of voxel values at fixed three-dimensional locations (a component "map"), and a unique associated time course of activation. Given data from 144 time points collected during a 6-min trial, ICA extracted an equal number of spatially independent components. In all eight trials, ICA derived one and only one component with a time course closely matching the time course of 40-sec alternations between experimental and control tasks. The regions of maximum activity in these consistently task-related components generally overlapped active regions detected by standard correlational analysis, but included frontal regions not detected by correlation. Time courses of other ICA components were transiently task-related, quasiperiodic, or slowly varying. By utilizing higher-order statistics to enforce successively stricter criteria for spatial independence between component maps, both the ICA algorithm and a related fourth-order decomposition technique (Comon [1994]: Signal Processing 36:11-20) were superior to principal component analysis (PCA) in determining the spatial and temporal extent of task-related activation. For each subject, the time courses and active regions of the task-related ICA components were consistent across trials and were robust to the addition of simulated noise. Simulated movement artifact and simulated task-related activations added to actual fMRI data were clearly separated by the algorithm. ICA can be used to distinguish between nontask-related signal components, movements, and other artifacts, as well as consistently or transiently task-related fMRI activations, based on only weak assumptions about their spatial distributions and without a priori assumptions about their time courses. ICA appears to be a highly promising method for the analysis of fMRI data from normal and clinical populations, especially for uncovering unpredictable transient patterns of brain activity associated with performance of psychomotor tasks.

A kind of blind polarization demultiplexing algorithm based on low-complexity and fast-converging independent component analysis (ICA) for quadrature amplitude modulation (QAM) coherent optical communications systems is proposed. The polarization demultiplexing is achieved by maximizing the signal’s non-Gaussianity measured by the information theoretic quantity of negentropy. We demonstrate that some approximate nonlinear functions can be substituted for the negentropy and this greatly reduces the computational complexity. An adaptive gradient optimization algorithm and a fast-converging quasi-Newton algorithm are employed to maximize the negentropy. The numerical simulation and experimental results for polarization division multiplexing quadrature phase shift keying/16QAM without neglecting polarization mode dispersion reveal that the proposed ICA demultiplexing algorithms are feasible and effective for coherent optical receivers.

We propose a new algorithm for blind source separation (BSS), in which independent component analysis (ICA) and beamforming are combined to resolve the low-convergence problem through optimization in ICA. The proposed method consists of the following three parts: (1) frequency-domain ICA with direction-of-arrival (DOA) estimation, (2) null beamforming based on the estimated DOA, and (3) integration of (1) and (2) based on the algorithm diversity in both iteration and frequency domain. The inverse of the mixing matrix obtained by ICA is temporally substituted by the matrix based on null beamforming through iterative optimization, and the temporal alternation between ICA and beamforming can realize fast- and high-convergence optimization. The results of the signal separation experiments reveal that the signal separation performance of the proposed algorithm is superior to that of the conventional ICA-based BSS method, even under reverberant conditions.

This paper presents an adaptive on-line algorithm whose optimization criterion is based on maximum likelihood to perform Independent Component Analysis (ICA). A fast density estimation method is introduced , it can quickly achieve the true score functions of the unknown sources by estimating from the sample. In the meantime, the careful selection of the step size is often necessary to obtain good performance for the source separation tasks. We carry out the global minimum of the contrast function with the gradient adaptive step size. The results of simulation experiment show that the provided algorithm can perform the adaptive separation of real digital signal efficiently.

The major challenge facing NMR spectroscopic mixture analysis is the overlapping of signals and the arising impossibility to easily recover the structures for identification of the individual components and to integrate separated signals for quantification. In this paper, various independent component analysis (ICA) algorithms [mutual information least dependent component analysis (MILCA); stochastic non-negative ICA (SNICA); joint approximate diagonalization of eigenmatrices (JADE); and robust, accurate, direct ICA algorithm (RADICAL)] as well as deconvolution methods [simple-to-use-interactive self-modeling mixture analysis (SIMPLISMA) and multivariate curve resolution-alternating least squares (MCR-ALS)] are applied for simultaneous (1)H NMR spectroscopic determination of organic substances in complex mixtures. Among others, we studied constituents of the following matrices: honey, soft drinks, and liquids used in electronic cigarettes. Good quality spectral resolution of up to eight-component mixtures was achieved (correlation coefficients between resolved and experimental spectra were not less than 0.90). In general, the relative errors in the recovered concentrations were below 12%. SIMPLISMA and MILCA algorithms were found to be preferable for NMR spectra deconvolution and showed similar performance. The proposed method was used for analysis of authentic samples. The resolved ICA concentrations match well with the results of reference gas chromatography-mass spectrometry as well as the MCR-ALS algorithm used for comparison. ICA deconvolution considerably improves the application range of direct NMR spectroscopy for analysis of complex mixtures.

Massive multiple input multiple output (MIMO) is the key technology in the 5G communication network. Blind source separation (BSS) plays an important role in MIMO communication when information about the transmitted signals or channel is not available. Independent component analysis (ICA) is one of the well-known BSS technique applied in MIMO wireless communication. Existing BSS techniques like ICA assumes number of receiving antennas to be greater than or equal to the number of transmit antennas and hence cannot be applied to multiple input single output (MISO) communication scenario, that happens during downlink massive MIMO communication. In single channel blind source separation (SCBSS) the source signals are retrieved from a single observed mixture (single channel or single receiving antenna) of the source signals. In this paper, we investigate the application of SCBSS to MISO communication system. Using ensemble empirical mode decomposition (EEMD), the MISO communication system is converted to a pseudo MIMO system followed by the application of principal component analysis (PCA) and ICA algorithms to separate the transmitted signals. The algorithm is successfully applied to 2 X 1 MISO system and with a slight modification to n X 1 MISO system. Simulation results are provided to validate the performance of the algorithm.

The performance of a conventional single user DS-CDMA receiver is severely limited by multiple access interference (MAI) and near---far effects. This severity has motivated research into adaptive filtering, near---far resistant detectors and power control strategies for DS-CDMA systems. In this paper, we propose a near---far resistant detector based on independent component analysis (ICA) of the received signal. Since ICA is a blind technique, the proposed ICA based detector has the potential to combat the near---far problem. The ICA is a higher order statistical technique based on the assumption of independence of source signals. The assumptions in ICA algorithm are the realistic conditions in a DS-CDMA system and therefore ICA algorithm can be applied successfully to detect the signal of the desired user. The focus of this paper is to illustrate the near---far resistance capability of the ICA based detector. Simulation studies performed on the proposed detector show that it is resistant to the near-far problem and has low bit error rate.