Symmetric complex-valued RBF receiver for multiple-antenna aided wireless systems

A nonlinear beamforming assisted detector is proposed for multiple-antenna-aided wireless systems employing complex-valued quadrature phase shift-keying modulation. By exploiting the inherent symmetry of the optimal Bayesian detection solution, a novel complex-valued symmetric radial basis function (SRBF)-network-based detector is developed, which is capable of approaching the optimal Bayesian performance using channel-impaired training data. In the uplink case, adaptive nonlinear beamforming can be efficiently implemented by estimating the system’s channel matrix based on the least squares channel estimate. Adaptive implementation of nonlinear beamforming in the downlink case by contrast is much more challenging, and we adopt a cluster-variationenhanced clustering algorithm to directly identify the SRBF center vectors required for realizing the optimal Bayesian detector. A simulation example is included to demonstrate the achievable performance improvement by the proposed adaptive nonlinear beamforming solution over the theoretical linear minimum bit error rate beamforming benchmark

Performance of adaptive bayesian equalizers in outdoor environments

Outdoor communications are affected by multipath propagation that imposes an upper limit on the system data rate and restricts possible applications. In order to overcome the degrading effect introduced by the channel, conventional equalizers implemented with digital filters have been traditionally used. A new approach based on neural networks is considered. In particular, the behavior of the adaptive Bayesian equalizer implemented by means of radial basis functions applied to the channel equalization of radio outdoor environments has been analyzed. The method used to train the equalizer coefficients is based on a channel response estimation. We compare the results obtained with three channel estimation methods: the least sum of square errors (LSSE) channel estimation algorithm, recursive least square (RLS) algorithm employed only to obtain one channel estimation and, finally, the RLS algorithm used to estimate the channel every decided symbol for the whole frame.Peer ReviewedPostprint (published version

Symmetric RBF classifier for nonlinear detection in multiple-antenna aided systems

In this paper, we propose a powerful symmetric radial basis function (RBF) classifier for nonlinear detection in the so-called “overloaded” multiple-antenna-aided communication systems. By exploiting the inherent symmetry property of the optimal Bayesian detector, the proposed symmetric RBF classifier is capable of approaching the optimal classification performance using noisy training data. The classifier construction process is robust to the choice of the RBF width and is computationally efficient. The proposed solution is capable of providing a signal-to-noise ratio (SNR) gain in excess of 8 dB against the powerful linear minimum bit error rate (BER) benchmark, when supporting four users with the aid of two receive antennas or seven users with four receive antenna elements. Index Terms—Classification, multiple-antenna system, orthogonal forward selection, radial basis function (RBF), symmetry

Bacterial Foraging Based Channel Equalizers

A channel equalizer is one of the most important subsystems in any digital communication receiver. It is also the subsystem that consumes maximum computation time in the receiver. Traditionally maximum-likelihood sequence estimation (MLSE) was the most popular form of equalizer. Owing to non-stationary characteristics of the communication channel MLSE receivers perform poorly. Under these circumstances ‘Maximum A-posteriori Probability (MAP)’ receivers also called Bayesian receivers perform better. Natural selection tends to eliminate animals with poor “foraging strategies” and favor the propagation of genes of those animals that have successful foraging strategies since they are more likely to enjoy reproductive success. After many generations, poor foraging strategies are either eliminated or shaped into good ones (redesigned). Logically, such evolutionary principles have led scientists in the field of “foraging theory” to hypothesize that it is appropriate to model the activity of foraging as an optimization process. This thesis presents an investigation on design of bacterial foraging based channel equalizer for digital communication. Extensive simulation studies shows that the performance of the proposed receiver is close to optimal receiver for variety of channel conditions. The proposed receiver also provides near optimal performance when channel suffers from nonlinearities

A NOVEL ALGORITHM BASED ON CASCADING OF NEURAL NETWORK MODELS AND WAVELET TRANSFORM FOR IMAGE ENHANCEMENT.

Image enhancement and restoration is pre-request of computer vision. The distortion and degradation of image suffered the process of pattern matching and quality of image. Wavelet is very important transform function play a role in image enhancement and image de-noising. The concept of wavelet used as soft thresholding and hard thresholding. A processing of data through wavelet is very efficient in process of neural network. In this paper we discuss the proposed algorithm for image enhancement based on self organized map network and wavelet transform. Basically self organized map network is unsupervised training mechanisms of pattern, due to this reason the processing of network is very fast in compression of another artificial neural network method. And the combination of wavelet and self organized map network have great advantage over conventional method such as histogram equalization and multi-point histogram equalization and another conventional technique of image enhancement

Extension of Wirtinger's Calculus to Reproducing Kernel Hilbert Spaces and the Complex Kernel LMS

Over the last decade, kernel methods for nonlinear processing have successfully been used in the machine learning community. The primary mathematical tool employed in these methods is the notion of the Reproducing Kernel Hilbert Space. However, so far, the emphasis has been on batch techniques. It is only recently, that online techniques have been considered in the context of adaptive signal processing tasks. Moreover, these efforts have only been focussed on real valued data sequences. To the best of our knowledge, no adaptive kernel-based strategy has been developed, so far, for complex valued signals. Furthermore, although the real reproducing kernels are used in an increasing number of machine learning problems, complex kernels have not, yet, been used, in spite of their potential interest in applications that deal with complex signals, with Communications being a typical example. In this paper, we present a general framework to attack the problem of adaptive filtering of complex signals, using either real reproducing kernels, taking advantage of a technique called \textit{complexification} of real RKHSs, or complex reproducing kernels, highlighting the use of the complex gaussian kernel. In order to derive gradients of operators that need to be defined on the associated complex RKHSs, we employ the powerful tool of Wirtinger's Calculus, which has recently attracted attention in the signal processing community. To this end, in this paper, the notion of Wirtinger's calculus is extended, for the first time, to include complex RKHSs and use it to derive several realizations of the Complex Kernel Least-Mean-Square (CKLMS) algorithm. Experiments verify that the CKLMS offers significant performance improvements over several linear and nonlinear algorithms, when dealing with nonlinearities.Comment: 15 pages (double column), preprint of article accepted in IEEE Trans. Sig. Pro