## A Functional Approach to Structured Combinational-logic Design |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

in Ten Levels | 4 |

Structures for LoopFree Sorting | 19 |

Structures for Arbitrary Switching Functions | 52 |

Copyright | |

16 other sections not shown

### Common terms and phrases

Adjacent Sequences algorithm AND's arbitrary functions bases basic module binary tree Bitonic Sort Bubble Sort building blocks chapter choice of module class of functions construction features decoder stage Encoder example exist EXOR EXOR's expansion formulae form constants function set functional approach Gj(l hardware Hence inputs interconnection pattern k'th stage L S L S largest Left-Right Sort levels linear algebra linear combination logic design method of merging module types n variables n-1 variables number of modules number of variables numbers is merged Odd-Even Sort ordered set outputs P-sorters partitioning path Rectangular Sort relationship sequences of modules set of numbers Shannon expansion smallest sorter sorting methods sorting nets sorting networks stage of merging standard functional standard structure subsets symmetric functions Symmetric Minterms symmetric threshold task Theorem thesis three-sorters Three-Variable Transistor-Transistor Logic tree sequences tree-sequence of modules Triangular Sort two-input modules two-sorters vector space