F(A,B,C,D) = A B +A(C+D)(A+D) G(A,B,C,D) = B(CD+AD +BD (1) In hierarchical approach, Boolean functions F and G are imp
Posted: Mon Mar 21, 2022 4:55 pm
- F A B C D A B A C D A D G A B C D B Cd Ad Bd 1 In Hierarchical Approach Boolean Functions F And G Are Imp 1 (5.6 KiB) Viewed 36 times
- F A B C D A B A C D A D G A B C D B Cd Ad Bd 1 In Hierarchical Approach Boolean Functions F And G Are Imp 2 (66.67 KiB) Viewed 36 times
(1) In hierarchical approach, Boolean functions F and G are implemented using three copies of a hierarchical component represented by Boolean function H(X,Y,Z). (6 marks) By identifying patterns in F and G (note that negated subexpressions may be part of the pattern), write down the Boolean expression for the hierarchical function H, and draw the logic circuit diagram of such hierarchical component. (ii) (4 marks) Express Fusing H. Do the same for G. (iii) (3 marks) Draw a schematic diagram to show the hierarchical implementation of F and G. (iv) (3 marks) Find the gate input cost (not counting the cost for inverters) for the implementation of F and G respectively using your results in part (iii) above.