Cumulant based identification approaches for nonminimum phase FIR systems

Cataloged from PDF version of article.In this paper, recursive and least squares methods for identification of nonminimum phase linear time-invariant (NMP-LTI) FIR systems are developed. The methods utilize the second- and third-order cumulants of the output of the FIR system whose input is an independent, identically distributed (i.i.d.) non-Gaussian process. Since knowledge of the system order is of utmost importance to many system identification algorithms, new procedures for determining the order of an FIR system using only the output cumulants are also presented. To illustrate the effectiveness of our methods, various simulation examples are presented

New approaches without postprocessing to FIR system identification using selected order cumulants

Version of RecordPublishe

System identification using a linear combination of cumulant slices

In this paper we develop a new linear approach to identify the parameters of a moving average (MA) model from the statistics of the output. First, we show that, under some constraints, the impulse response of the system can be expressed as a linear combination of cumulant slices. Then, this result is used to obtain a new well-conditioned linear method to estimate the MA parameters of a non-Gaussian process. The proposed method presents several important differences with existing linear approaches. The linear combination of slices used to compute the MA parameters can be constructed from dif- ferent sets of cumulants of different orders, providing a general framework where all the statistics can be combined. Further- more, it is not necessary to use second-order statistics (the autocorrelation slice), and therefore the proposed algorithm still provides consistent estimates in the presence of colored Gaussian noise. Another advantage of the method is that while most linear methods developed so far give totally erroneous estimates if the order is overestimated, the proposed approach does not require a previous estimation of the filter order. The simulation results confirm the good numerical conditioning of the algorithm and the improvement in performance with respect to existing methods.Peer Reviewe

Blind equalization

An equalizer is an adaptive filter that compensates for the non-ideal characteristics of a communication channel by processing the received signal. The adaptive algorithm searches for the inverse impulse response of the channel, and it requires knowledge of a training sequence, in order to generate an error signal necessary for the adaptive process. There are practical situations where it would be highly desirable to achieve complete adaptation without the use of a training sequence, hence the the term blind . Examples of these situations are multipoint data networks, high-capacity line-of-sight digital radio, and reflection seismology. A blind adaptive algorithm has been developed, based on simplified equalization criteria. These criteria are that the second- and fourth-order moments of the input and output sequences are equalized. The algorithm is entirely driven by statistics, only requiring knowledge of the variance of the input signal. Because of the insensitivity of higher-order statistics to Gaussian processes, the algorithm performs well when additive white Gaussian noise is present in the channel. Simulations are presented in which the new blind equalizer developed is compared to other equalization algorithms

Blind, MIMO system estimation based on PARAFAC decomposition of higher order output tensors

IEEE Transactions on Signal Processing, 54(11): pp. 4156-4168.We present a novel framework for the identification of a multiple-input multiple-output (MIMO) system driven by white, mutually independent unobservable inputs. Samples of the system frequency response are obtained based on parallel factorization (PARAFAC) of three- or four-way tensors constructed based on, respectively, third- or fourth-order cross spectra of the system outputs. The main difficulties in frequency-domain methods are frequency- dependent permutation and filtering ambiguities.We show that the information available in the higher order spectra allows for the ambiguities to be resolved up to a constant scaling and permutation ambiguities and a linear phase ambiguity. Important features of the proposed approach are that it does not require channel length information, needs no phase unwrapping, and unlike the majority of existing methods, needs no prewhitening of the system outputs

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