Andre Tkacenko

Learn More
The advent of discrete multitone modulation (DMT) systems in recent years has brought to light the importance of channel shortening equalizers. In this paper, we present a method for the design of one such equalizer for multiple-input multiple-output (MIMO) linear dispersive channels. This method is a generalization of one that was used for shortening of(More)
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a para-Hermitian (PH) system. Here, the approximate diag-onalization is carried out successively by applying degree-1 finite impulse response (FIR) paraunitary (PU) transformations. The(More)
—In this paper, a method for approximating a multi-input multi-output (MIMO) transfer function by a causal finite-impulse response (FIR) paraunitary (PU) system in a weighted least-squares sense is presented. Using a complete parameterization of FIR PU systems in terms of Householder-like building blocks, an iterative algorithm is proposed that is greedy in(More)
– The design of time-domain equalizers or TEQs for discrete multitone modulation (DMT) systems has recently received much attention. In this paper, we present a generalization of one such design method which takes into account the noise observed in a DMT channel. Furthermore, we show how this generalization can be used for the design of fractionally spaced(More)
—We present a new low-complexity method for the design of channel shortening equalizers for discrete multitone modulation systems using the eigenfilter approach. In contrast to other such methods which require a Cholesky decomposition for each delay parameter value used, ours requires only one such decomposition. Simulation results show that our method(More)
—Starting with the maximum a posteriori (MAP) estimation approach, this paper derives the optimum (in the MAP estimation sense) means for performing symbol-timing recovery in the absence of carrier-phase information (i.e., prior to carrier-phase recovery). Specifically, we examine the necessary modification of a well-known form of coherent symbol(More)
[3] G. V. Moustakides and S. Theodoridis, " Fast newton transversal filters a new class of adaptive estimation algorithms, " IEEE Trans. [4] B. F. Boroujeny, " Fast LMS/newton algorithms based on autoregres-sive modeling and their application to acoustic echo cancellation, " IEEE Trans. The fast subsampled-updating recur-sive least-square (FSU-RLS)(More)
With the advent of wavelets for lossy data compression came the notion of representing signals in a certain vector space by their projections in well chosen subspaces of the original space. In this paper , we consider the subspace of signals generated by an overdec-imated rational nonuniform filter hank and find the optimal conditions under which the(More)
Recently, much attention has been given to the design of optimal finite impulse response (FIR) compaction filters. Such filters, which arise in the design of optimal signal-adapted orthonormal FIR filter banks, satisfy a magnitude squared Nyquist constraint in addition to the inherent FIR assumption. In this paper, we focus on the least squares optimal(More)