Title :
Synthesis for Reed-Muller directed acyclic graph network
Author :
Wu, H. ; Zhuang, N. ; Perkowski, M.A.
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
fDate :
11/1/1993 12:00:00 AM
Abstract :
A synthesis algorithm for Reed-Muller directed acyclic graph (DAG) networks is presented. Based on the circuit cost matrix, the algorithm grows the DAG network from inputs to output, and thus allows the formulation of more accurate criteria for variable selection. By using this algorithm, the quasiminimum DAG network can be found with (n+2)(n-1)/2 variable assignments.
Keywords :
directed graphs; logic CAD; logic arrays; Reed-Muller directed acyclic graph network; circuit cost matrix; synthesis algorithm;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings E
