Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 83 views

    DONE Chapter3.3

    Uploaded by

    Satyam Anand
    The document discusses various types of microoperations used in computer systems including register transfer, arithmetic, logic, and shift microoperations. It provides details on common arithmetic microoperations such as addition, subtraction, increment, and decrement. Binary adders and adder-subtractors are also summarized, which can be implemented using full adders and allow both addition and subtraction using a mode input. Finally, binary incrementers are discussed as a simple way to increment the value in a register.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    DONE Chapter3.3

    Uploaded by

    Satyam Anand
    83 views10 pages
    The document discusses various types of microoperations used in computer systems including register transfer, arithmetic, logic, and shift microoperations. It provides details on common arithmetic microoperations such as addition, subtraction, increment, and decrement. Binary adders and adder-subtractors are also summarized, which can be implemented using full adders and allow both addition and subtraction using a mode input. Finally, binary incrementers are discussed as a simple way to increment the value in a register.

    Original Title

    DONE_Chapter3.3.ppt

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses various types of microoperations used in computer systems including register transfer, arithmetic, logic, and shift microoperations. It provides details on common arithmetic microoperations such as addition, subtraction, increment, and decrement. Binary adders and adder-subtractors are also summarized, which can be implemented using full adders and allow both addition and subtraction using a mode input. Finally, binary incrementers are discussed as a simple way to increment the value in a register.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    83 views10 pages

    DONE Chapter3.3

    Uploaded by

    Satyam Anand
    The document discusses various types of microoperations used in computer systems including register transfer, arithmetic, logic, and shift microoperations. It provides details on common arithmetic microoperations such as addition, subtraction, increment, and decrement. Binary adders and adder-subtractors are also summarized, which can be implemented using full adders and allow both addition and subtraction using a mode input. Finally, binary incrementers are discussed as a simple way to increment the value in a register.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 10

    Register Transfer and Micro-operations 1

    Overview

     Register Transfer Language

     Register Transfer

     Bus and Memory Transfers

     Arithmetic Micro-operations

     Logic Micro-operations

     Shift Micro-operations

     Arithmetic Logic Shift Unit

    CSE 211
    Register Transfer and Micro-operations 2

    MICROOPERATIONS

    Computer system microoperations are of four types:

     Register transfer microoperations


     Arithmetic microoperations
     Logic microoperations
     Shift microoperations

    CSE 211
    Register Transfer and Micro-operations 3

    Arithmetic MICROOPERATIONS
    • The basic arithmetic microoperations are
    – Addition
    – Subtraction
    – Increment
    – Decrement

    • The additional arithmetic microoperations are


    – Add with carry
    – Subtract with borrow
    – Transfer/Load `1
    – etc. …

    Summary of Typical Arithmetic Micro-Operations


    R3  R1 + R2 Contents of R1 plus R2 transferred to R3
    R3  R1 - R2 Contents of R1 minus R2 transferred to R3
    R2  R2’ Complement the contents of R2
    R2  R2’+ 1 2's complement the contents of R2 (negate)
    R3  R1 + R2’+ 1 subtraction
    R1  R1 + 1 Increment
    R1  R1 - 1 Decrement

    CSE 211
    Register Transfer and Micro-operations 4

    Binary Adder

    CSE 211
    Register Transfer and Micro-operations 5

    Binary Adder

    Working
    Add Micro operation can be implemented using Full adders. Each full adder takes
    2 inputs from 2 numbers and a third input as a previous carry.

    All the carries are connected in serial fashion to the next full adder.

    Number of full adders depends upon number of bits of data. When A0 B0 are
    added and initially C0 is 0 then as a result S0 gives the sum of A0 and B0 and so
    on.

    CSE 211
    Register Transfer and Micro-operations 6

    Binary Adder-Subtractor

    The arithmetic addition / subtract micro operation is given by the statements,

    R3  R1 + R2’+ 1 subtraction
    R3  R1 + R2 Contents of R1 plus R2 transferred to R3

    q performed in one common circuit by


    The addition and subtraction operations are
    including an exclusive-OR gate with each full adder.

    CSE 211
    Register Transfer and Micro-operations 7

    Binary Adder-Subtractor

    Binary Adder-Subtractor

    B3 A3 B2 A2 B1 A1 B0 A0

    FA C3 FA C2 FA C1 FA C0

    C4 S3 S2 S1 S0

     Mode input M controls the operation


     M=0 ---- adder
     M=1 ---- subtractor

    CSE 211
    Register Transfer and Micro-operations 8

    Binary Adder-Subtractor
    Working
    The addition and subtraction operations can be combined into one common circuit
    by including an XOR gate with each full-adder.

    With the help of a mode bit we can add or subtract.

    •M=0

    When M is 0 then Cin will be 0 and 0 B0 gives B0 then S0 will be the sum of A0 and
    B0. hence by M = 0 will perform addition.

    •M=1

    When M is 1 then Cin will be 1 and 1 B0 gives B0 then A0 + B0 + 1 = A0 – B0


    hence M = 1 will perform subtraction

    CSE 211
    Register Transfer and Micro-operations 9

    Binary Incrementer

    Binary Incrementer

    A3 A2 A1 A0 1

    x y x y x y x y
    HA HA HA HA
    C S C S C S C S

    C4 S3 S2 S1 S0

    CSE 211
    Register Transfer and Micro-operations 10

    Arithmetic Circuits
    Cin
    S1
    S0

    A0 X0 C0

    S1 D0
    S0
    Y0
    FAC1
    B0 0
    1 4x1
    2
    3
    MUX
    A1 X1 C1

    S1 D1
    S0 FA
    B1 0 Y1 C2
    1 4x1
    2
    3
    MUX
    A2 X2 C2

    S1 D2
    S0 FA
    B2 0 Y2 C3
    1 4x1
    2
    3
    MUX
    A3 X3 C3

    S1 D3
    S0 FA
    B3 0 Y3 C4
    1 4x1
    2
    3
    MUX Cout
    0 1

    CSE 211

    You might also like