Title
Novi topološki pristup simboličkoj analizi elektronskih polja : doktorska disertacija
Creator
Đorđević Srđan 1968-
Copyright date
2010
Object Links
Select license
Autorstvo-Nekomercijalno 3.0 Srbija (CC BY-NC 3.0)
License description
Dozvoljavate umnožavanje, distribuciju i javno saopštavanje dela, i prerade, ako se navede ime autora na način odredjen od strane autora ili davaoca licence. Ova licenca ne dozvoljava komercijalnu upotrebu dela. Osnovni opis Licence: http://creativecommons.org/licenses/by-nc/3.0/rs/deed.sr_LATN Sadržaj ugovora u celini: http://creativecommons.org/licenses/by-nc/3.0/rs/legalcode.sr-Latn
Language
Serbian
Cobiss-ID
Theses Type
Doktorska disertacija
Other responsibilities
mentor
Predrag Petković
član komisije
Vančo Litovski
član komisije
Branimir Reljin
član komisije
Milutin Jevtić
član komisije
Dragiša Milovanović
Academic Expertise
Tehničko-tehnološke nauke
University
Univerzitet u Nišu
Faculty
Elektronski fakultet
Group
Katedra za mikroelektroniku
Title translated
A new original method for symbolic analysis of electronic circuits
Publisher
Niš : [S. Đorđević]
Format
PDF/A (88 listova)
description
Umnoženo za odbranu.
Univerzitet u Nišu, Elektronski fakultet., 2010.
Summary.
Bibliografija: str. 81-83.
Abstract (en)
The main motivation of this dissertation is to contribute to the development of symbolic algebra in scope of electronic circuits analysis. A new original method for symbolic analysis of electronic circuits has been developed and implemented. In contrary to other commonly used methods for symbolic circuit analysis the specificity of this method lies in the fact that it is entirely topology oriented. The proposed procedure provides exact symbolic network function purely by inspecting the topology of the circuit. The method introduces a graph representation of the factorization process, that is constructed directly from a given circuit description. The dissertation is a synthesis of author's published results as well as more recent unpublished material that has emerged during the development of the dissertation.
Symbolic analysis is a procedure that generates a circuit function in the form of algebraic expressions such that some or all of the circuit elements and complex frequency are represented by symbolic variables. Unlike the numerical circuit analysis, which provides only quantitative information, symbolic circuit analysis (SCA) provides information of the qualitative contribution of each circuit parameter to the network function. Practically, SCA is mutually complementary to the numerical based electronic circuit analysis.
The main drawback of SCA is exponential growth of circuit function intricacy, memory and time requirements with the circuit complexity. Therefore, a hierarchical approach is advisable for treating complex circuits. The technique of hierarchical decomposition of complex circuits results with compact symbolic expressions in nested form. Several methods have been developed to generate nested symbolic expressions of the circuit function using hierarchical decomposition. Some of these methods are graph based and some are matrix based. The most of the modern procedures for symbolic analysis are matrix based. A good representative to the efforts that SCA community spends in this direction is Determinant Decision Diagram method (DDD). Recently presented results proved its efficiency.
Authors Key words
Elektronska kola, Mikroelektronika
Subject
621.3
Type
Elektronska teza
Abstract (en)
The main motivation of this dissertation is to contribute to the development of symbolic algebra in scope of electronic circuits analysis. A new original method for symbolic analysis of electronic circuits has been developed and implemented. In contrary to other commonly used methods for symbolic circuit analysis the specificity of this method lies in the fact that it is entirely topology oriented. The proposed procedure provides exact symbolic network function purely by inspecting the topology of the circuit. The method introduces a graph representation of the factorization process, that is constructed directly from a given circuit description. The dissertation is a synthesis of author's published results as well as more recent unpublished material that has emerged during the development of the dissertation.
Symbolic analysis is a procedure that generates a circuit function in the form of algebraic expressions such that some or all of the circuit elements and complex frequency are represented by symbolic variables. Unlike the numerical circuit analysis, which provides only quantitative information, symbolic circuit analysis (SCA) provides information of the qualitative contribution of each circuit parameter to the network function. Practically, SCA is mutually complementary to the numerical based electronic circuit analysis.
The main drawback of SCA is exponential growth of circuit function intricacy, memory and time requirements with the circuit complexity. Therefore, a hierarchical approach is advisable for treating complex circuits. The technique of hierarchical decomposition of complex circuits results with compact symbolic expressions in nested form. Several methods have been developed to generate nested symbolic expressions of the circuit function using hierarchical decomposition. Some of these methods are graph based and some are matrix based. The most of the modern procedures for symbolic analysis are matrix based. A good representative to the efforts that SCA community spends in this direction is Determinant Decision Diagram method (DDD). Recently presented results proved its efficiency.
“Data exchange” service offers individual users metadata transfer in several different formats. Citation formats are offered for transfers in texts as for the transfer into internet pages. Citation formats include permanent links that guarantee access to cited sources. For use are commonly structured metadata schemes : Dublin Core xml and ETUB-MS xml, local adaptation of international ETD-MS scheme intended for use in academic documents.