Introduction to Computer Organization |
From inside the book
Results 1-3 of 92
Page 7
... example 1.4 , the difference is positive ; difference 00111 is correct . In example 1.5 , the difference is negative , since difference 1100l is regarded as a positive number and it could not be correct . However , if one recognizes ...
... example 1.4 , the difference is positive ; difference 00111 is correct . In example 1.5 , the difference is negative , since difference 1100l is regarded as a positive number and it could not be correct . However , if one recognizes ...
Page 40
... example shows the use of Theorems 7a and 9b for factoring . Example 1.19 F ( A , B , C , D , E ) = A * B D + BC ( DE ) + A * B * E = A * B * ( D + E ) + BC ( D + E ) Th ( 7a ) , Th ( 9b ) = = ( A B + B C ) * ( D + E ) Th ( 9b ) = B ...
... example shows the use of Theorems 7a and 9b for factoring . Example 1.19 F ( A , B , C , D , E ) = A * B D + BC ( DE ) + A * B * E = A * B * ( D + E ) + BC ( D + E ) Th ( 7a ) , Th ( 9b ) = = ( A B + B C ) * ( D + E ) Th ( 9b ) = B ...
Page 41
... example shows the use of theorems 7a and 9b for changing a boolean function in the AND - OR logic into one in the OR - AND logic . Example 1.22 F ( A , B , C , D ) = A * B + C⭑D Simplification = = ( A * B + C ) * ( A * B + D ) = ( C + ...
... example shows the use of theorems 7a and 9b for changing a boolean function in the AND - OR logic into one in the OR - AND logic . Example 1.22 F ( A , B , C , D ) = A * B + C⭑D Simplification = = ( A * B + C ) * ( A * B + D ) = ( C + ...
Contents
Introduction | 1 |
Computer Elements | 51 |
Microoperations | 73 |
Copyright | |
12 other sections not shown
Common terms and phrases
1's complement accumulator ADD sequence addend addition address register AQ(M augend binary point block representation boolean function cards casregister Chapter clear register clock pulses computer operation conditional micro-statement configuration contents of register control sequence control signals countup decoder described digital computer dividend division overflow divisor end-around carry ERRORSTOP example execution sequence execution statement fetch sequence FINI flipflop flow chart format Fortran statements full adder indicated input integer light load location at address logic diagram logic network manual memory address memory location memory word micro-operations minuend multiplicand multiplication negative zero octal ON,OFF op-code operand address output parallel adder position quotient random access memory reset ring counter RUN1 RUN2 sequence chart shift shown in Figure sign bit signed binary numbers signed magnitude simulation single-bit START(ON Step stop stored subregister subroutine subtraction subtrahend switch symbolic program theorems transfer truth table variable Y₁