Blind identification of FIR MIMO channels by decorrelating subchannels

We study blind identification and equalization of finite impulse response (FIR) and multi-input and multi-output (MIMO) channels driven by colored signals. We first show a sufficient condition for an FIR MIMO channel to be identifiable up to a scaling and permutation using the second-order statistics of the channel output. This condition is that the channel matrix is irreducible (but not necessarily column-reduced), and the input signals are mutually uncorrelated and of distinct power spectra. We also show that this condition is necessary in the sense that no single part of the condition can be further weakened without another part being strengthened. While the above condition is a strong result that sets a fundamental limit of blind identification, there does not yet exist a working algorithm under that condition. In the second part of this paper, we show that a method called blind identification via decorrelating subchannels (BIDS) can uniquely identify an FIR MIMO channel if a) the channel matrix is nonsingular (almost everywhere) and column-wise coprime and b) the input signals are mutually uncorrelated and of sufficiently diverse power spectra. The BIDS method requires a weaker condition on the channel matrix than that required by most existing methods for the same problem.

A new blind-equalization algorithm for an FIR SIMO system driven by MPSK signal

We consider the problem of blind equalization of a finite impulse response and single-input multiple-output system driven by an M-ary phase-shift-keying signal. The existing single-mode algorithms for this problem include the constant modulus algorithm (CMA) and the multimodulus algorithm (MMA). It has been shown that the MMA outperforms the CMA when the input signal has no more than four constellation points, i.e., Mles4. In this brief, we present a new adaptive equalization algorithm that jointly exploits the amplitude and phase information of the input signal. Theoretical analysis shows that the proposed algorithm has less mean square error, i.e., better equalization performance, at steady state than the CMA regardless of the value of M. The superior performance of our algorithm to the CMA and the MMA is validated by simulation examples

Stability and convergence analysis of transform-domain LMS adaptive filters with second-order autoregressive process

In this paper, the stability and convergence properties of the class of transform-domain least mean square (LMS) adaptive filters with second-order autoregressive (AR) process are investigated. It is well known that this class of adaptive filters improve convergence property of the standard LMS adaptive filters by applying the fixed data-independent orthogonal transforms and power normalization. However, the convergence performance of this class of adaptive filters can be quite different for various input processes, and it has not been fully explored. In this paper, we first discuss the mean-square stability and steady-state performance of this class of adaptive filters. We then analyze the effects of the transforms and power normalization performed in the various adaptive filters for both first-order and second-order AR processes. We derive the input asymptotic eigenvalue distributions and make comparisons on their convergence performance. Finally, computer simulations on AR process as well as moving-average (MA) process and autoregressive-moving-average (ARMA) process are demonstrated for the support of the analytical results.

On performance of transform domain adaptive filters with Markov-2 inputs

In this paper, the analysis for the performance of the discrete Fourier transform LMS adaptive filter (DFT-LMS) and the discrete cosine transform LMS adaptive filter (DCT-LMS) for the Markov-2 inputs is presented. To improve the convergence property of the least mean squares (LMS) adaptive filter, the DFT-LMS and DCT-LMS preprocess the inputs with the fixed orthogonal transforms and power normalization. We derive the asymptotic results for the eigenvalues and eigenvalue distributions of the preprocessed input autocorrelation matrices with DFT-LMS and DCT-LMS for Markov-2 inputs. These results explicitly show the superior decorrelation property of DCT-LMS over that of DFT-LMS, and also provide the upper bounds for the eigenvalue spreads of the finite-length DFT-LMS and DCT-LMS adaptive filters. Simulation results are demonstrated to support the analytic results.

An approach to nonirreducible MIMO FIR channel equalization

It is known that a nonirreducible multiple-input– multiple-output finite-impulse-response channel driven by colored signals that are mutually uncorrelated and of sufficiently diverse power spectra can be identified blindly by exploiting only the second-order statistics of the measured data. In this brief, we propose an approach to dealing with the equalization of a nonirreducible channel, provided that the estimate of the channel matrix is available. Both zero-forcing and minimum-mean-square-error equalizers are developed to perform the channel equalization. The effectiveness of the approach and equalizers is demonstrated by simulation examples.

An iterative equalization method for nonirreducible MIMO FIR channels

This paper deals with the equalization of a nonirreducible multiple-input multiple-output (MIMO) finite-impulse-response (FIR) channel provided that the estimate of the channel matrix is available. An iterative method is developed to perform the channel equalization. The effectiveness of the proposed equalization method is demonstrated by simulation examples.

Design and optimization of LNA topologies with image rejection filters

An important problem in designing RFIC in CMOS technology is the parasitic elements of passive and active devices that complicate design calculations. This article presents three LNA topologies including cascode, folded cascade, and differential cascode and then introduces image rejection filters for low-side and high-side injection. Then, a new method for design and optimization of the circuits based on a Pareto-based multiobjective genetic algorithm is proposed. A set of optimum device values and dimensions that best match design specifications are obtained. The optimization method is layout aware, parasitic aware, and simulation based. Circuit simulations are carried out based on TSMC 0.18 um CMOS technology by using Hspice.

Application of floating medium filters for aquaculture wastewater treatment

Filtration is an effective process in removing particles of various nature and sizes that are present in water and wastewater. It has been used as a final clarifying step in water treatment since the19th century. It is becoming increasingly important in the tertiary treatment step of wastewater to produce effluent of superior quality for the purpose of reuse. Filtration is particularly applied when high flow rates of water with relatively low contents of suspended solids have to be treated. In a conventional water or wastewater treatment system, the filters are usually placed after sedimentation units to remove suspended particles, which escape without settling in the sedimentation units. When chemically pretreated and flocculated water is applied to a filter without a prior-solid liquid separation it is called direct filtration.

CM-based blind equalization of time-varying SIMO-FIR channel with single pulsation estimation

It is known that the constant modulus (CM) property of the source signal can be exploited to blindly equalize time-invariant single-inputmultiple-output (SIMO) and finite-impulse-response (FIR) channels. However, the time-invariance assumption about the channel cannot be satisfied in several practical applications, e.g., mobile communication. In this paper, we show that, under some mild conditions, the CM criterion can be extended to the blind equalization of a time-varying channel that is described by the complex exponential basis expansion model (CE-BEM). Although several existing blind equalization methods that are based on the CE-BEM have to employ higher order statistics to estimate all nonzero channel pulsations, the CM-based method only needs to estimate one pulsation using second-order statistics, which yields better estimation results. It also relaxes the restriction on the source signal and is applicable to some classes of signals with which the existing methods cannot deal.