Open Access. Powered by Scholars. Published by Universities.®

Computational Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 151 - 153 of 153

Full-Text Articles in Computational Engineering

A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous Apr 1980

A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous

Computational Modeling & Simulation Engineering Theses & Dissertations

The Karhunen Loeve Transform has conclusively been shown to be the optimum data compression algorithm for signals belonging to the same second order stationary process. Consequently, researchers have been searching for a fast implementation for the transform. Fast imple­mentation methods similar to those developed for other orthogonal transforms are generally not applicable to the Karhunen Loeve Transform (KLT). Also, since the basis vectors composing the transformation matrix of the KLT are the eigenvectors of the covariance matrix of the input process, they must be computed first. The research re­ ported here is an attempt to reduce the dimensionality of the …


An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim Apr 1976

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).


Computer Solution To Inverse Problems Of Elliptic Form: V²U(X,Y) = G(A,U,X,Y), Frederick Alvin Jeter Dec 1971

Computer Solution To Inverse Problems Of Elliptic Form: V²U(X,Y) = G(A,U,X,Y), Frederick Alvin Jeter

Dissertations and Theses

One important aspect of our present age of monolithic high speed computers is the computer's capability to solve complex problems hitherto impossible to tackle due to their complexity. This paper explains how to use a. digital computer to solve a specific type of problem; specifically, to find the inverse solution of a in the elliptical equation V2U(x,y) = g(a,U,x,y), with appropriate boundary conditions. This equation is very useful in the electronics field. The knowns are the complete set of boundary values of U(x,y) and a set of observations taken on internal points of U(x,y). Given this information, plus …