click below

click below

Normal Size Small Size show me how

# digital hardware des

Question | Answer |
---|---|

microprogramming | Writing microcode is often called microprogramming and the microcode in a particular processor implementation is sometimes called a microprogram. |

Hardwired control units | Hardwired control units are implemented through use of sequential logic units, featuring a finite number of gates that can generate specific results based on the instructions that were used to invoke those responses. Hardwired control units are generally |

Reduced instruction set computing | Reduced instruction set computing, or RISC /ˈrɪsk/, is a CPU design strategy based on the insight that simplified (as opposed to complex) instructions can provide higher performance if this simplicity enables much faster execution of each instruction. |

programmable logic array (PLA) | A programmable logic array (PLA) is a kind of programmable logic device used to implement combinational logic circuits. The PLA has a set of programmable AND gate planes, which link to a set of programmable OR gate planes, which can then be conditionally |

canonical form. | Definition: Any Boolean function that is expressed as a sum of minterms or as a product of maxterms is said to be in its canonical form. |

Maxterms | For a boolean function of n variables {x_1,\dots,x_n}, a sum term in which each of the n variables appears once (in either its complemented or uncomplemented form) is called a maxterm. Thus, a maxterm is a logical expression of n variables that employs on |

Half adder | The half adder adds two single binary digits A and B. It has two outputs, sum (S) and carry (C). The carry signal represents an overflow into the next digit of a multi-digit addition. The value of the sum is 2C + S. The simplest half-adder design, picture |

Full adder | A full adder adds binary numbers and accounts for values carried in as well as out. A one-bit full adder adds three one-bit numbers, often written as A, B, and Cin; A and B are the operands, and Cin is a bit carried in from the next less significant stage |

Ripple-carry adder | It is possible to create a logical circuit using multiple full adders to add N-bit numbers. Each full adder inputs a Cin, which is the Cout of the previous adder. This kind of adder is called a ripple-carry adder, since each carry bit "ripples" to the nex |

datapath | A datapath is a collection of functional units, such as arithmetic logic units or multipliers, that perform data processing operations. It is a central part of many central processing units (CPUs) along with the control unit, which largely regulates inter |