| ¬ì¥Ø¡G¼Æ ¦ì ¨t ²Î¡@¡]¹q¤l¨t¹q¤l²Õ¡^¡@ | ¸Û¹ê¬O§Ú̬õøªº¬ü¼w¡A §Ú̳߷R¡u©Úµ´§@¹ú¡A°í¦u¥¿ª½¡vªº§A¡I |
| ¡]¦@1¶²Ä1¶¡^ |
| 1. | (a) | Simplify the following Boolean function
in (1) sum of products and (2) product of sums. F(A, B, C, D) = |
|||||||||||
| (b) | Implement the answers in (a) with (1) two-level NAND and (2) two-level NOR gates circuits | ||||||||||||
| (c) | Implement the above Boolean function in (a) with an 8„e1 Multiplexer and inverters. | ||||||||||||
| (d) | If we implement the above circuits with CMOS process, please compare the transistor counts and specify which way, two-level NAND, NOR or Multiplexer, meets the minimum number of MOS transistors? | ||||||||||||
| (Hint: 8x1 Multiplexer is implemented with CMOS transmission gates.) | |||||||||||||
| (40%) | |||||||||||||
| 2. | A Mealy sequential network has 2 inputs X1, X2 and 1 output Z. If the total number of 1¡¦s received is „d 2 in the previous and present pairs of inputs, then the output should be ¡§1¡¨ coincident with the present pair of inputs. | ||||||||||||
| (a) | Derive its state graph and state table. | ||||||||||||
| (b) | Using your answer in (a), implement this network with D Flip-Flops and Logic Gates. | ||||||||||||
| Please draw the circuit diagrams of this network. | (35%) | ||||||||||||
|
|||||||||||||
| 3. | Analyze the following Flip-Flop circuit using a flow table. According to the flow table, please specify what kind of Flip-Flop is this circuit? And, it is positive-edge-triggered or negative-edge-triggered? | ||||||||||||
| Please write down your reasons. | (25%) | ||||||||||||
![]() |
|||||||||||||
|
--- END---
|
|||||||||||||