A comparison of interval methods in symbolic circuit analysis applications

Thanigaivelan, Balavelan, Hamilton, Tara Julia and Postula, Adam (2010). A comparison of interval methods in symbolic circuit analysis applications. In: Proceedings of the 15th Computational Techniques and Applications Conference. 15th Biennial Computational Techniques and Applications Conference, Sydney, NSW Australia, (C1084-C1101). 28 November - 1 December 2010.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ317343_OA.pdf Full text (open access) application/pdf 424.99KB 0
Author Thanigaivelan, Balavelan
Hamilton, Tara Julia
Postula, Adam
Title of paper A comparison of interval methods in symbolic circuit analysis applications
Conference name 15th Biennial Computational Techniques and Applications Conference
Conference location Sydney, NSW Australia
Conference dates 28 November - 1 December 2010
Proceedings title Proceedings of the 15th Computational Techniques and Applications Conference   Check publisher's open access policy
Journal name ANZIAM Journal   Check publisher's open access policy
Place of Publication Cambridge, United Kingdom
Publisher Cambridge University Press
Publication Year 2010
Year available 2010
Sub-type Fully published paper
Open Access Status File (Publisher version)
ISSN 1446-1811
1446-8735
Volume 52
Start page C1084
End page C1101
Total pages 18
Collection year 2011
Language eng
Abstract/Summary Symbolic circuit analysis involves deriving symbolic expressions for performance measures, such as voltage gain, input impedance, and evaluating them to obtain more insight into the behaviour of a circuit. In modern semiconductor technologies, it is more useful to evaluate the symbolic expressions using interval methods in order handle variations in parameter values. We compare the performance of different interval methods in evaluating symbolic expressions. Our experiments show that Generalised Interval Arithmetic is the most efficient method in affne form for our application. However, this method should be modified to suit long chains of computation. Our modification yields tighter interval bounds compared with other interval methods.
Subjects 2601 Mathematics (miscellaneous)
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Thu, 28 Nov 2013, 10:20:19 EST by System User on behalf of School of Information Technol and Elec Engineering