By Topic

Synthesis for Reed-Muller directed acyclic graph network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Wu ; Dept. of Electr. Eng., Portland State Univ., OR, USA ; N. Zhuang ; M. A. Perkowski

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.<>

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:140 ,  Issue: 6 )