DocumentCode :
2100230
Title :
Making complex timing relationships readable: Presburger formula simplification using don´t cares
Author :
Amon, Tod ; Borriello, Gaetano ; Liu, Jiwen
Author_Institution :
Dept. of Comput. Sci., Southwest Texas State Univ., San Marcos, TX, USA
fYear :
1998
fDate :
19-19 June 1998
Firstpage :
586
Lastpage :
590
Abstract :
Solutions to timing relationship analysis problems are often reported using symbolic variables and inequalities which specify linear relationships between the variables. Complex relationships can be expressed using Presburger formulas which allow Boolean relations to be specified between the inequalities. This paper develops and applies a highly effective simplification approach for Presburger formulas based on logic minimization techniques.
Keywords :
Boolean functions; logic design; minimisation of switching nets; timing; Boolean relations; Presburger formula simplification; complex timing relationships; don´t cares; highly effective simplification approach; logic minimization techniques; symbolic variables; Computer science; Delay; Design automation; Humans; Libraries; Logic design; Minimization; Permission; Processor scheduling; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1998. Proceedings
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-89791-964-5
Type :
conf
Filename :
724539
Link To Document :
بازگشت