DocumentCode
2363191
Title
An algorithm for reduct of Boolean functions based on primes
Author
Li, Xiongfei ; Liu, Hui ; Wang, Qiangqiang ; Zhang, Guilin
Author_Institution
Key Lab. & Symbolic Comput. & Knowledge Eng., Jilin Univ., Changchun, China
fYear
2005
fDate
7-9 Sept. 2005
Firstpage
1
Lastpage
4
Abstract
The reduct of Boolean functions is widely used in many applications, for example: digital circuits. In this paper, we present an approach, which is based on primes, to representing the Boolean system. We present an algorithm for reduct of Boolean functions based on primes, and the cost of the algorithm is analyzed to indicate that the algorithm is efficient.
Keywords
Boolean functions; decision diagrams; logic design; Boolean function reduct; digital circuits; ordered pairs; Algorithm design and analysis; Application software; Arithmetic; Artificial intelligence; Boolean functions; Cost function; Data structures; Digital circuits; Knowledge engineering; Laboratories; ordered pair; prime; reduct;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineering, 2005 2nd International Conference on
Print_ISBN
0-7803-9230-2
Type
conf
DOI
10.1109/ICEEE.2005.1529559
Filename
1529559
Link To Document