DocumentCode :
1495939
Title :
Adaptive exact optimisation of minimally testable FPRM expansions
Author :
Chang, C.H. ; Falkowski, B.J.
Author_Institution :
Electron. Design Centre, Nanyang Polytech., Singapore
Volume :
145
Issue :
6
fYear :
1998
fDate :
11/1/1998 12:00:00 AM
Firstpage :
385
Lastpage :
394
Abstract :
An adaptive method to minimise fixed-polarity Reed-Muller expansions, combining the advantages of efficient data structures in form of both lookup tables and ternary decision trees, is presented. The algorithm developed converts arrays of cubes to exact solutions based on the desired cost criteria for the systems of completely specified functions. The method also allows one to combine the design for testability together with minimisation of hardware realisation. The algorithm shown is fast, efficient and requires smaller space and time complexity than known algorithms
Keywords :
data structures; Boolean functions; algebraic ternary decision tree; complexity; data structures; design for testability; fixed-polarity Reed-Muller expansions; lookup tables; minimisation of hardware; ternary decision trees;
fLanguage :
English
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2387
Type :
jour
DOI :
10.1049/ip-cdt:19982342
Filename :
756450
Link To Document :
بازگشت