Informatica

In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach and provides optimal results. For the implementation, C++ was used on the CodeWarrior for Palm Operating System environment. In order to make the overall implementation efficient, the object oriented approach was used. Two step‐by‐step examples are presented to illustrate the efficiency of the proposed algorithm. The proposed application can be used by students and professors in the fields of electrical and computer engineering and computer science.

The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n‐order singular linear systems, Ex⁽ⁿ⁾=Σi=1ⁿAix⁽ⁿ⁻¹⁾+Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step‐by‐step examples illustrating the application of the algorithm are presented.