Introduction to Computer Organization |
From inside the book
Results 1-3 of 23
Page 31
Yaohan Chu. boolean variable . Let F represent a boolean function of two boolean variables A and B as follows , F ( A , B ) = A ' B + A B ' ( 1.13 ) The quantity A ' * B , or A * B , or A * B ' , is called a term which is the logical AND ...
Yaohan Chu. boolean variable . Let F represent a boolean function of two boolean variables A and B as follows , F ( A , B ) = A ' B + A B ' ( 1.13 ) The quantity A ' * B , or A * B , or A * B ' , is called a term which is the logical AND ...
Page 32
... boolean function . Conversely , a boolean function can be obtained from a truth table . Consider the truth table of Table 1.9 , which states that the truth value of boolean function F is 1 , when or when By relation ( 1.8 ) , these ...
... boolean function . Conversely , a boolean function can be obtained from a truth table . Consider the truth table of Table 1.9 , which states that the truth value of boolean function F is 1 , when or when By relation ( 1.8 ) , these ...
Page 36
... boolean function may have a logical relation of more than two levels . Consider the boolean function F ( A , B , C ) = ( A * C ' + A ' * B ) * ( A + B ) ( 1.23 ) whose block representation is shown in Figure 1.11 ( a ) . Some signals go ...
... boolean function may have a logical relation of more than two levels . Consider the boolean function F ( A , B , C ) = ( A * C ' + A ' * B ) * ( A + B ) ( 1.23 ) whose block representation is shown in Figure 1.11 ( a ) . Some signals go ...
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₁