1992
DOI: 10.1049/ip-e.1992.0048
|View full text |Cite
|
Sign up to set email alerts
|

Automated synthesis of digital multiplexer networks

Abstract: A programmed algorithm is presented for the synthesis and optimisation of networks implemented with multiplexer universal logic modules. The algorithm attempts level by level optimisation selecting the control variables that result in minimum number of continuing branches. Cascaded networks, if realisable, are always found and given preference over tree networks, though mixtures of cascade and tree configurations are permitted. The algorithm is programmed in Fortran and tested for single and double control var… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1993
1993
2020
2020

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…The use of RM-ULM for realization of logic functions has already been explored by researchers. A programmed algorithm was developed by L. Xu [2], which is analogous to the algorithm in [6], for optimization of number of modules at sub-system level in a tree network. The algorithm looks for possible cascade networks, and if it is not found a tree structure is implemented.…”
Section: Sreela Sasimentioning
confidence: 99%
See 2 more Smart Citations
“…The use of RM-ULM for realization of logic functions has already been explored by researchers. A programmed algorithm was developed by L. Xu [2], which is analogous to the algorithm in [6], for optimization of number of modules at sub-system level in a tree network. The algorithm looks for possible cascade networks, and if it is not found a tree structure is implemented.…”
Section: Sreela Sasimentioning
confidence: 99%
“…The delivered network has 3 modules using only 2 levels in the proposed approach, as shown in the Figure 2, while in the tree implementation [2,3] the synthesized network will have 3 modules in 3 levels as shown in Figure 3. Exhaustive branched implementation for F =® L (5,6,9,10) x4 Figure 5. Tree implementation for function F =>L (5,6,9,10) Example 3: Implementation of the 3-variable function, F = @ L (0, 1, 2, 4, 6) is given in Figure 6.…”
Section: Number Of Zeros > Number Of Ones (Ii)mentioning
confidence: 99%
See 1 more Smart Citation
“…Louis 11 w as one of the rst researchers who reported this class of work. Further work has been reported by Koza 1 However, none of these approaches has concentrated on the exclusive use of multiplexers to design combinational circuits using evolutionary techniques, although some researchers such as Miller 12 have used multiplexers as another permissible gate which can be combined with the traditional Boolean functions to design circuits.…”
Section: Previous Workmentioning
confidence: 97%