Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

WWW-based Boolean function minimization

Sebastian Tomaszewski;  Ilgaz Celik;  George Antoniou — 2003

International Journal of Applied Mathematics and Computer Science

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful...

Transfer function computation for 3-D discrete systems

George E. Antoniou — 2000

Kybernetika

A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3–D) state space model of Fornasini–Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computer.

Page 1

Download Results (CSV)