Più nero di un cielo senza stelleGuida Editori, 2004 - 396 páginas |
Dentro del libro
Resultados 1-5 de 62
Página ix
... Adder 30 3.7.2 The Ripple Carry Adder (RCA) 32 3.7.3 The Carry Look-ahead Adder (CLA) 34 3.7.4 The Conditional Sum Adder (CSA) 35 3.7.5 The Subtraction 37 3.7.6 The Arithmetic Unit 38 3.8 Cyclic Shifters 38 3.8.1 A Cyclic Left Shifter ...
... Adder 30 3.7.2 The Ripple Carry Adder (RCA) 32 3.7.3 The Carry Look-ahead Adder (CLA) 34 3.7.4 The Conditional Sum Adder (CSA) 35 3.7.5 The Subtraction 37 3.7.6 The Arithmetic Unit 38 3.8 Cyclic Shifters 38 3.8.1 A Cyclic Left Shifter ...
Página x
... Adder Implementations 71 5.3.5 Introducing a Separate Memory Cycle 72 5.3.6 Adding a New Instruction 73 5.3.7 Summary 74 5.4 Exercises 75 6 Design of thè DLX Machine 77 6.1 Instruction Set Architecture 77 6.1.1 Instruction Formats 78 ...
... Adder Implementations 71 5.3.5 Introducing a Separate Memory Cycle 72 5.3.6 Adding a New Instruction 73 5.3.7 Summary 74 5.4 Exercises 75 6 Design of thè DLX Machine 77 6.1 Instruction Set Architecture 77 6.1.1 Instruction Formats 78 ...
Página 2
... adders and counters. Thus, in our framework this chapter is the equivalent of a library of macros in a CAD System. Technically we proceed in a very quick way: 1. We usually specify circuits for n-bit wide inputs by a recursive ...
... adders and counters. Thus, in our framework this chapter is the equivalent of a library of macros in a CAD System. Technically we proceed in a very quick way: 1. We usually specify circuits for n-bit wide inputs by a recursive ...
Página 28
... adder design can be adapted to an incrementer circuit. The ripple carry incrementer of figure 3.10 3.7. ARITHMETIC CIRCUITS 29 is quite a cheap implementation with 28 CHAPTER 3. FUNCTIONAL MODULES. n=l n > 1 Y A {2m-l .. m] X[m -1..0] 1 ...
... adder design can be adapted to an incrementer circuit. The ripple carry incrementer of figure 3.10 3.7. ARITHMETIC CIRCUITS 29 is quite a cheap implementation with 28 CHAPTER 3. FUNCTIONAL MODULES. n=l n > 1 Y A {2m-l .. m] X[m -1..0] 1 ...
Página 30
... adder for binary numbers. The proofs of the two theorems can be found in [KP95]. Theorem 3.1 Let x e {0, 1}" thèn ... Adder Definiticn 3.9 (Adder) An n-bit adder is a circuit which computes thè fune- tion +„ : {0, 1}2"+1 - {0, 1}"+3, +n ...
... adder for binary numbers. The proofs of the two theorems can be found in [KP95]. Theorem 3.1 Let x e {0, 1}" thèn ... Adder Definiticn 3.9 (Adder) An n-bit adder is a circuit which computes thè fune- tion +„ : {0, 1}2"+1 - {0, 1}"+3, +n ...
Contenido
1 | |
10 | |
21 | |
43 | |
59 | |
Design of thè DLX Machine | 77 |
TradeOff Analyses | 123 |
Interrupt | 141 |
Microprogrammed Control | 179 |
Further Applications of thè Architecture Model | 199 |
A Register Transfer Language | 201 |
Bibliography | 263 |
Otras ediciones - Ver todas
Términos y frases comunes
accumulated delay active adder address architecture arithmetic unit benchmark binary bits carry look-ahead chapter circuit combinatorial components computation computes conditional sum control automaton control signals control unit cost and delay critical path current cycle time data paths decode decoder Diego directly DLX design DLX machine encoder environment extern int fanout fetch Figure first following formulae function gates generates guardò hardware hardwired control impact indicates inputs instruction set interrupt handling interrupt service routine inverter istante lists Load main memory mamma MARK Mealy implementation memory status time microcoded control microinstruction modified monomials Moore implementation Motorola Motorola technology multiplexer n-bit number occhi opcode order output overflow Paola papà path powerup printf program program counter provides purpose registers quality parameter R-type ragazzo read requires return rispose run time same section shift shifter stava Table thè three unary coding used Valerio value write zero tester