Symbolic circuit-matrix processor and evaluator

Edited by Vladimir V. Filaretov
Authors: Filaretov V.V., Shein D.V.

LICENSING AGREEMENT

The SYMBOL software product contained on this disk is copyright by the authors. It may be freely used and copies may be given to other users as long as the following conditions are met:

1. This licensing agreement must accompany any copies which are distributed.
2. No charge may be made for the copies.
3. All applications and usage of the program must be non-commercial.

This software has been developed as the result of SYMBOLsoft Group projects in the Department of Electrical Engineering of the Ulyanovsk State Technical University. Correctness of any results obtained from using the software is provided by big set of benchmark circuits (for the last ten years 1991-2000 [1]). This software is reliable over the range of benchmark circuit complexity (both *.CIR and *.MAT file). Otherwise we will send (E-mail) you our corrected version of software by return instead of CIR (MAT) file for "bad" benchmark circuit (matrix).

PURPOSE

SYMBOL is a symbolic-algebra package which in contrast to REDUCE, MACSYMA, MAPLE, MATHEMATICA, MathLAB, MathCAD and other known multi-purpose systems is especially intended for analysis of any lumped, linear, time-invariant circuit. This new product has surpassed
other the known systems in terms of circuits dimension and characteristics of efficiency [2,p. 154]:

"Nowadays symbolic analysis are more widely used due to packages of computer algebra (MAPLE, MathCAD, MATHEMATICA, etc.). However, in certain cases of considerable practical value the usage of electric circuits topology peculiarities allows one to obtain better results than with the help of computer algebra packages. For example, the authors does not know of any programs of computer algebra which can obtain a linear formula of full graphs determinant [3]: with 5 nodes consisting of 50 operations of addition and 29 of multiplication, that is {+}=50, {*}=29, with 6 nodes - {+}=237, {*}=122."

IMPORTANCE

The use of symbolic expressions to characterize input-output relations is an important analytic tool with a wide range of applications in the analysis and synthesis of network and system. Among the important applications of symbolic analysis are [4]:

1) the development of insight into system properties which is difficult to obtain from numerical analysis methods;
2) the use of optimization techniques to determine the values of symbolic variables in order to improve system performance and better meet specifications;
3) the determination of sensitivity measures which can be used to evaluate system quality; and
4) the improvement of accuracy in the evaluation of expressions which are numerically ill-conditioned.

THEORY

The basic theory is described in papers [3, 5 - 9].

SOFTWARE REQUIREMENTS

SYMBOL component programs may be run on all personal computers compatible with IBM PC. Operation system requirement is MS DOS version 2.0 and above.

HARDWARE REQUIREMENTS

To run the CALCSYM program you must be able math coprocessor.

SPECIFICATIONS

The following files are provided in release 2000 of SYMBOL.

CIRSYM - SYMbolic CIRcuit processor used to format ASCII text file *.out for CALCSYM.
MATSYM - SYMbolic MATrix processor used to format ASCII text file *.out for CALCSYM.
CALCSYM - complex evaluator for both CIRSYM and MATSYM programs.

CONFIRMATION

SYMBOL software [1] proved good in 14 design organizatoins and higher education institutions of Moscow, Kiev, Tallinn, Sankt-Petersburg, Kharkov, Lviv and Ulyanovsk. SYMBOL software was applied [7, 8] for symbolic analysis of the
famous band-pass filter by Starzyk and Konczykowska [10]. Three additional sequences of expressions were obtained, one of which is presented in Fig. 2 [11]. A total of 3 sequences have been tested [2, 11] and included in the Library of Benchmark Circuit by names: FILARETOV1, FILARETOV2 and SYMBOL [12]. This symbolic formulae were occupied second place on computational efficiency among 10 optimal expressions.

REFERENCES

1. Filaretov V.V. SYMBOL program of transfer network generation for any electronic circuit // Algorithms and signal treatment devices and computer-aided design.- Tallin: Estonian Akademya nauk, 1991.- P. 130-166. (In Russian).

2. Dmytryshyn R., Kubaszek A. Sequence of expressions generation for the repetitive analysis acceleration // Proceedings of the 5th international workshop on symbolic methods and applications in circuit design.- Kaiserslautern (Germany), 1998.- P. 154-159.

3. Filaretov V.V. Improved decoding method for electrical network analysis // Electrical technology.- 1996.- N 4.- P. 41-53.

4. Huelsman L.P. Personal computer symbolic analysis programs for undergraduate engineering courses // IEEE Proceedings of the international symposium on circuits and systems.- 1989.- P. 798-801.

5. Filaretov V.V. A unistor signal flow graph for an electronic circuit and its analysis // Electrical Technology.- 1989.- N 3.

6. Filaretov V.V. Topological analysis of electronic circuits using branches and edges extraction // Elektrichestvo.- Moskow, 1992.- N 7.- P. 31-37. (In Russian). {encouraged by Pergamon Press's prize - Elektrichestvo.- 1993.- N 5.- P. 79.}

7. Filaretov V.V., Shein D.V. Optimal synthesis of symbolic network functions for large circuits with operational amplifiers // Problems of phisical and biomedical electronics: Proceedings of international conference.- Kiev: Polytechnic institute, 1995.- P. 132-136. (In Russian).

8. Filaretov V.V. A hierarchical approach to symbolic analysis of large electronic circuits // Problems of phisical and biomedical electronics: Proceedings of international conference.- Kiev: National technical university of Ukraina, 1996.- P. 132-136. (In Russian).

9. Filaretov V.V. A topological analysis of electronic circuits by a parameter extraction method // Electrical Technology Russian.- 1998.- N 2.- P. 46-61.

10. Starzyk J.A., Konczykowska A. Flowgraph analysis of large electronic networks // IEEE Transactions on circuits and systems.- 1986.- Vol. CAS-33, N 3.- P. 302-315.

11. Rodanski B.S. Computational efficiency of symbolic sequential formulae // Proceedings of the 6th international workshop on symbolic methods and applications in circuit design.- Lisbon (Portugal), 2000.- P. 45-50.

12. Rodanski B.S. Symbolic circuit analysis: Library of benchmark circuits (http://www.eng.uts.edu.au/~benr/symbolic)

V.V. Filaretov
Department of Electrical Engineering
Ulyanovsk State Technical University
Ulyanovsk, Russia 432700

Further details (particulars) can be obtained on request:

Address: Filaretov Vladimir Valentinovich
ul. Lokomotivnaya, 203, kv. 5
Ulyanovsk, Russia
ZIP code: 432035

Phone: (8422) 38-17-34

E-mail: vvfil@mail.ru

Back to main page