Now showing items 111-120 of 128
An Algorithm to Factor Polynomial Matrices
A new algorithm for factoring polynomial matrices, based on concept of elementary factors, is presented in this report. This algorithm does not use numerically unsatisfactory Euclidean type operations.
Computation of a Unimodular Matrix
An algorithm for computing a unimodular matrix U(λ) satisfying the equation [A(λ) B(λ)] U(λ) = [1 0] is presented where A(λ) and B(λ) are relatively left prime polynomial matrices. ...
APL Programs for Singular Value Decomposition and Generalized Eigenvalue Problems
This report contains descriptions and listings of APL functions for singular value decomposition and solution of the generalized eigenvalue problem.
APL Programs for Polynomial Matrix Manipulations
This report contains descriptions and listings of APL programs.
Digital Signal Processing Structures: Block and Multidemensional Formulation and Distributed Arithmetic
In this report we will consider a special class of digital filter structure; and by structure we mean the particular arrangement and sequence of arithmetic and storage operations to realize a desired signal processing ...
A recursive algorithm for digital Image Processing using Local Statistics
An algorithm is presented for digital image processing based on local statistics. The algorithm constitutes a recursive implementaiton of an approach proposed and implemented nonrecursively by J.S. Lee (Naval Research ...
A Fourier-Prony Tauberian Approach to the Analysis of a Mixture of Delayed Signals
Let x and y be signals (i.e. real-valued functions of time) of finite duration and energy. In the present paper, we develop a frequency domain Prony approach for interpolating, or in general, approximating y(t) by ....
Algorithms for Optimal Numerical Quadrature Based on Signal Class Models
A framework is presented for constructing various types of numerical quadrature algorithms which take into account the a-priori known or estimated properties of the signal being processed. This is done by appropriately ...
Lecture notes in mathematics: rudiments of Riemann surfaces
(Rice University, 1971)
On the Complexity of Vector Searching
The vector searching problem is, given k-vector A (a k-vector) is a vector that has k components, over the integers) and given a set B of n distinct k-vectors, to determine whether or not A is a member of set B. Comparisons ...