The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with-a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the ...

Linear Time Varying Precoder Applied to an ISI Channel Nader Sheikholeslami and Peter Kabal Department of Electrical Engineering McGill University, Montreal, Quebec, Canada [email protected] [email protected] Abstract A linear time varying precoding structure for data transmission over ISI channels is investigated. This precoding scheme is capable of stabilizing the inverse channel lter witho...

Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by recursion is, of course, forbidden, but some sort of iteration still is possible and the purpose of this paper is to show that enough computing power remains so that elementary recursive functions can be implemented. Actually, the whole paper can be considered an exerci...

Thin elastic rods such as cables, phone coils, tree branches, or hair, are common objects in the real world but computing their dynamics accurately remains challenging. The recent Super-Helix model, based on the discrete equations of Kirchhoff for a piecewise helical rod, is one of the most promising models for simulating non-stretchable rods that can bend and twist. However, this model suffers...

A linear time algorithm is presented for nding dominators in control ow graphs.