08.503 Computer Organization and Architecture
Module 1
Module 1 Functional units of a Computer: Functional Units
A computer consists of five functionally independent main parts: input, memory, arithmetic and logic, output, and control units, as shown below.
Input Unit
Computers accept coded information through input units. The most common input device is the keyboard. Whenever a key is pressed, the corresponding letter or digit is automatically translated into its corresponding binary code and transmitted to the processor. Many other kinds of input devices for human-computer interaction are: touchpad, mouse, joystick, trackball etc. These These are often often used as graphic input devices devices in conjunction conjunction with displays. displays. Microphones can be used to capture audio input which is then sampled and converted into digital codes for storage and processing. Cameras can be used to capture video input.
Digital communication facilities, such as the Internet, can also provide input to a computer from other computers and database servers. Output Unit The output unit is t he counterpart of the input unit.
It sends processed results to the outside world.
A familiar example of output device is a printer.
Some units, such as graphic displays, provide both an output function, showing text and graphics, and an input function, through touch screen capability. The dual role of such units is the reason for using the single name input/output (I/O) unit in many cases. Memory Unit The function of the memory unit is to store programs and data.
There are two classes of storage, called primary and secondary. Primary Memory Primary memory, also called main memory, is a fast memory that operates at electronic speeds.
Programs must be stored in this memory while they are being executed. The memory consists of a large number of semiconductor storage cells, each capable of storing one bit of information. These cells are rarely read or written individually. Instead, they are
Dept. of ECE, VKCET
Page 1
08.503 Computer Organization and Architecture
Module 1
handled in groups of fixed size called words. The memory is organize d so that one word can be stored or retrieved in one basic operation. The number of bits in each word is referred to as the word length of the computer, typically 16, 32, or 64 bits.
To provide easy access to any word in the memory, a distinct address is associated with each word location. Addresses are consecutive numbers, starting from 0, that identify successive locations. A memory in which any location can be accessed in a short and fixed amount of time after specifying its address is called a random-access memory (RAM).
The time required to access one word is called the memory access time. This time is independent of the location of the word being accessed. It typically ranges from a few nanoseconds (ns) to about 100 ns for current RAM units. Cache Memory: As an adjunct to the main memory, a smaller, faster RAM unit, called a cache, is used to hold sections of a program that are currently being executed, along with any associated data. The cache is tightly coupled with the processor and is usually contained on the same integrated-circuit chip. The purpose of the cache is to facilitate high instruction execution rates. Secondary Storage Although primary memory is essential, it tends to be expensive and does not retain information when power is turned off. Thus additional, less expensive, permanent secondary storage is used when large amounts of data and many programs have to be stored, particularly for information that is accessed infrequently.
Access times for secondary storage are longer than for primary memory.
A wide selection of secondary storage devices is available, including magnetic disks, optical disks (DVD and CD), and flash memory devices. Arithmetic and Logic Unit Most computer operations are executed in the arithmetic and logic unit (ALU) of the processor.
Any arithmetic or logic operation, such as addition, subtraction, multiplication division, or comparison of numbers, is initiated by bringing the required operands into the processor, where the operation is performed by the ALU. For example, if two numbers located in the memory are to be added, they are brought into the processor, and the addition addition is carried carried out by the the ALU. The sum sum may then be stored stored in the memory memory or retained in the processor for immediate immediate use. Control Unit
The memory, arithmetic and logic, and I/O units store and process information and perform input and output operations. The operation of these units must be coordinated by the control unit. The control unit is effectively the nerve center that sends control signals to other units and senses their states. Control circuits are responsible for generating the timing signals that govern the transfers and determine when a given action is to take place. Data transfers between the processor and the memory are also managed by the control unit through timing signals. Control unit as a well-defined, well-defined, physically separate unit that interacts with other parts of the computer.
Dept. of ECE, VKCET
Page 2
08.503 Computer Organization and Architecture
Module 1
Von-Neumann architecture
Only one bus which is used for both data transfers and instruction fetches, and therefore data transfers and instruction fetches must be scheduled - they cannot be performed at the same time
Only one memory, holds data and programs Need minimum minimum two cycles to complete complete memory memory fetching Poor memory throughput Pipelining is not possible Allows easy storing and loading of program between main memory and processor
Older architecture, only used for economic and general purpose processors Harvard architecture Separate data and instruction busses, allowing transfers to be performed simultaneously on both busses
Possible to have two separate memory systems for data and program
Allow two simultaneous memory fetching operations Greater memory bandwidth (throughput)
It is easier to pipeline instructions
Most of the DSP processor uses this architecture
Dept. of ECE, VKCET
Page 3
08.503 Computer Organization and Architecture
Module 1
Steps involved in Execution of an instruction
CPU executes binary representation of instruction called machine codes. Program Counter (PC) is used to determine which instruction is executed and based on the instruction it is updated accordingly to the next instruction to be run. Consider the connection between processor and main memory:
There are five major steps to execute a single instruction. They are: Step 1: Fetch instruction To fetch an instruction involves the following steps:
CPU place an address to the Memory Address Register (MAR) from PC.
CPU place MAR contents to the address bus.
CPU sends read signal to memory.
Memory unit puts instruction on the data bus.
Memory sends acknowledge signal to CPU. CPU loads the instruction to the Memory Data Register (MDR).
CPU transfers instruction from MDR to Instruction Register (IR).
CPU sends acknowledge signal to memory that fetching the instruction is over Step 2: Decode instruction and fetch operands: CPU decodes instruction in IR and if needed it fetches operands. To fetch an operand in memory involves the following steps:
CPU places the address of operand to MAR.
CPU place MAR content to address bus.
CPU sends read signal to memory.
Memory unit puts operand on the data bus.
Memory sends acknowledge signal to CPU.
Dept. of ECE, VKCET
Page 4
08.503 Computer Organization and Architecture
Module 1
CPU loads the operand to the Memory Data Register (MDR).
CPU moves the operand to ALU If one operand is in CPU, it is moved to ALU for operation Step 3: Perform operation CPU performs the operation encoded in instruction. If it is an ALU operation, CPU performs it using operands. Step 4: Store the result If the result is to store in memory, CPU involves the following steps:
CPU places the address of the result to MAR and to address bus.
CPU places the result to MDR.
CPU sends the write signal to memory.
Memory store the result to the address in address bus
Memory sends acknowledge signal to CPU. Step 5: Update Program Counter (PC). CPU update (either incremented by 1, 2 or 4) the PC content to point next instruction to be executed.
Instruction formats:
Defines the layout of bits in an instruction
Includes opcode and implicit or explicit operand(s)
Usually there are several instruction formats in an instruction set
Variety of instruction formats have been designed; they vary widely from processor to processor
The length of instruction depends on: ― Memory size ― Memory organization ― Bus structure ― CPU complexity ― CPU speed Using large instruction set, small programs can be created and small instruction set results large programs Fixed length instructions of same size or multiple of bus width results fast fetch
Variable length instructions may need extra bus cycles Survey of addressing modes: For a given instruction set architecture (ISA), addressing modes define how machine language instructions identify the operand (or operands) of each instruction. An addressing mode specifies how to calculate the effective memory address of an operand by using information held in registers and/or constants contained within a machine instruction or elsewhere. Different types of addresses involve tradeoffs between instruction length, addressing flexibility, and complexity of address calculation
Common addressing modes are: 1. Direct Addressing 2. Immediate Addressing
Dept. of ECE, VKCET
Page 5
08.503 Computer Organization and Architecture
Module 1
3. Indirect Addressing 4. Register Addressing 5. Register indirect Addressing 6. Displacement Addressing 7. Implied (stack) Addressing Direct Addressing The instruction tells where the value can be found, but the value itself is out in memory.
The address field contains the address of the operand
Effective address (EA) = address field (A)
In a high level language, direct addressing is frequently used for things like global variables.
Advantages: Single memory reference to access data and more flexible than immediate.
Immediate Addressing The instruction itself contains the operand to be used; located in the address field of the instruction The operand is stored in memory immediately after the instruction opcode in memory
Similar to using a constant in a high level language
Indirect Addressing The memory cell pointed to by the address field contains the address of (pointer to) the operand
Dept. of ECE, VKCET
Page 6
08.503 Computer Organization and Architecture
Module 1
Register Addressing Operands are registers
There is a limited number of registers
Very fast execution
Very limited address space Multiple registers can help performance
Requires good assembly programming or compiler writing
Register-Indirect Register-Indirect Addressing
Similar to memory-indirect addressing
Operand is in memory cell pointed to by contents of register R
Large address space
Displacement Addressing Combines register-indirect addressing and direct addressing
EA = A + (R) Address field holds two values: A = base value and R = register that holds displacement or vice-versa
Types of Displacement Addressing 1. Relative Addressing 2. Base-register Base-register addressing 3. Indexing
Dept. of ECE, VKCET
Page 7
08.503 Computer Organization and Architecture
Module 1
Relative Addressing EA = A + (PC)
Address field A is treated as 2’s complement integer to allow backward references
Fetch operand from PC+A
Can be very efficient because of locality of reference & cache usage. But in large programs code and data may be widely separated in memory Base-Register Base-Register Addressing A holds displacement
R holds pointer to base address
R may be explicit or implicit Indexed Addressing A = Base
R = displacement
EA = A + R Stack Addressing
Operand is implicitly on top of stack
Performance measurement and benchmarking:
The performance of computers can be differentiated by the response time - the time between the start and the completion of an event also referred to as execution time as well as throughput - the total amount of work done in a given time. To compare the relative performance of two different computers, X and Y. The phrase "X is faster than Y" is used to mean that the response time or execution time is lower on X than on Y for the given task. In particular, "X is n times faster than Y" will mean
The execution time is the reciprocal of performance, then
This shows that the performance of X is n times higher than Y.
The execution time can be defined in different ways clock time, response time, or elapsed time, which is the latency to complete a task, including disk accesses, memory accesses, input/output activities, operating system overhead etc. Processor Performance Equation 1
All computers are constructed using a clock running at a constant rate. These discrete time events are called ticks, clock ticks, clock periods, clocks, cycles, or clock cycles. Computer designers refer to the time of a clock period by its duration (e.g., 1 ns) or by its rate (e.g., 1 GHz). CPU time for a program can then be expressed as CPU time = CPU clock cycles for a program x Clock cycle time
Dept. of ECE, VKCET
Page 8
08.503 Computer Organization and Architecture
Module 1
This is referred as performance equation 1.
Problem: A program runs in 20 seconds on a computer A which has a 8GHz clock. Another computer B is built that will run this program in 12 seconds. For this, computer B requires 2.4 times as many as clock cycles as computer A for this program. What is the clock rate of B? Solution: CPU time of A = 20 seconds Clock rate of A = 8GHz CPU clock cycles for a program of A = CPU time of A x Clock rate of A = 20 x 8 x 10 9 CPU time of B = 12 seconds CPU clock cycles for the program of B = 2.4 x CPU clock cycles for the program of A = 2.4 x 20 x 8 x 10 9 Clock rate of B = CPU clock cycles for the program of B / CPU time of B 9 = (2.4 x 20 x 8 x 10 ) / 12 = 32GHz Processor Performance Equation 1 In addition to the number of clock cycles needed to execute a program, we can also count the number of instructions executed or instruction count (IC). If we know the number of clock cycles and the instruction count, we can calculate the average number of clock cycles per instruction (CPI).
It is easier to work with and designers sometimes also use instructions per clock (IPC), which is the inverse of CPI. CPI is computed as
This allows us to use CPI in the execution time formula and is, CPU time = Instruction count x CPI x Clock cycle time
This called performance equation 2 Expanding the performance equation 1 into the units of measurement shows how the pieces fit together:
This formula demonstrates, processor performance is dependent upon three characteristics: clock cycle (or rate), clock cycles per instruction (CPI), and instruction count
Dept. of ECE, VKCET
Page 9
08.503 Computer Organization and Architecture
Module 1
CPU time is equally dependent on these three characteristics: A 10% improvement in any one of them leads to a 10% improvement in CPU time.
It is difficult to change one parameter in complete isolation from others because the basic technologies involved in changing each characteristic are interdependent: Clock cycle time - Hardware technology and organization CPI - Organization and instruction set architecture Instruction count - Instruction set architecture and compiler technology Problem: C1 C2 Clock 3GHz 3GHz CPI 1.5 1 No. of instructions instructions 8 billion 9 billion Which computer is faster and by how much? Solution: 9 1 × 1 8 × 10 1 0 × 1 .5 .5 1 = = = 4 3 × 10 1 09 1 9 9 × 10 10 × 1 2 × 2 2 = = = 3 2 3 × 10 1 09 1 2 3
2 The computer C2 is 1.33 time faster than C 1
=
1
=
4
= 0.75
CISC and RISC: CISC (Complex Instruction Set Computer)
CISC chips that are easy to program and which make efficient use of memory. Since the earliest machines were programmed in assembly language and memory was slow and expensive, the CISC philosophy made sense, and was commonly implemented in such large computers as the PDP-11 and the DEC system 10 and 20 machines. Most common microprocessor designs such as the Intel 80x86 and Motorola 68K series followed the CISC philosophy. CISC was developed to make compiler development simpler. It shifts most of the burden of generating machine instructions to the processor. For example, instead of having to make a compiler write long machine instructions to calculate a square-root, a CISC processor would have a built-in ability to do this. Some common characteristics of CISC instruction instructi on are: 1. Two operand format, where instructions have a source and a destination. 2. Register to register, register to memory, and memory to register commands. 3. Multiple addressing modes for memory, including specialized modes for indexing through arrays 4. Variable length instructions where the length often varies according to the addressing mode 5. Instructions which require multiple clock cycles to execute. E.g. Pentium is considered a modern CISC processor
Dept. of ECE, VKCET
Page 10
08.503 Computer Organization and Architecture
Module 1
CISC hardware architectures have several characteristics in common and are: 1. Complex instruction-decoding logic, driven by the need for a single instruction to support multiple addressing modes. 2. A small number of general purpose registers. This is the direct result of having instructions which can operate directly on memory and the limited amount of chip space not dedicated to instruction decoding, execution, and microcode storage. 3. Several special purpose registers. Many CISC designs set aside special registers for the stack pointer, interrupt handling, and so on. This can simplify the hardware design somewhat, somewhat, at the expense of making the instruction set more complex. 4. A 'Condition code" register which is set as a side-effect of most instructions. This register reflects whether the result of the last operation is less than, equal to, or greater than zero and records if certain error conditions conditions occur. Advantages of CISC processors: 1. Microprogramming is as easy as assembly language to implement, and much less expensive than hardwiring a control unit. 2. The ease of micro-coding new instructions allowed designers to make CISC machines upwardly compatible: a new computer could run the same programs as earlier computers because the new computer would contain a superset of the instructions of the earlier earlier computers. 3. As each instruction became more capable, fewer instructions could be used to implement a given task. This made more efficient use of the relatively slow main memory. 4. Because microprogram instruction sets can be written to match the constructs of high-level languages, the compiler does not have to be as complicated.
Disadvantages of CSIC processors: 1. Earlier generations of a processor family generally were contained as a subset in every new version - so instruction set & chip hardware become more complex with each generation of computers. 2. So that as many instructions as possible could be stored in memory with the least possible wasted space, individual instructions could be of almost any length - this means that different instructions will take different amounts of clock time to execute, slowing down the overall performance of the machine. machine. 3. Many specialized instructions aren't used frequently enough to justify their existence approximately 20% of the available instructions are used in a typical program. 4. CISC instructions typically set the condition codes as a side effect of the instruction. Not only does setting the condition codes take time, but programmers have to remember to examine the condition code bits before a subsequent instruction changes them. RISC ( Reduced Instruction Set Computer) Computer) A type of microprocessor architecture that utilizes a small, highly-optimized set of instructions, rather than a more specialized set of instructions often found in other types of architectures. Some characteristic of most RISC processors are: 1. One cycle execution time: time : RISC processors have a CPI (clock per instruction) of one cycle. This is due to the optimization of each instruction on the CPU. 2. Pipelining : A technique that allows for simultaneous execution of parts, or stages, of instructions to more efficiently process instructions.
Dept. of ECE, VKCET
Page 11
08.503 Computer Organization and Architecture
Module 1
3. Large number of registers: registers: The RISC design philosophy generally incorporates a larger number of registers to prevent in large amounts of interactions with memory. In comparison with CISC, RISC processors have the following features: 1. Reduced instruction set. 2. Less complex, simple instructions. 3. Hardwired control unit and machine instructions. 4. Few addressing schemes for memory operands with only two basic instructions LOAD and STORE. 5. Many symmetric registers which are organized into a register file. Comparison between CISC and RISC processors is:
CISC
RISC
Emphasis on hardware
Emphasis on software
Includes multi-clock complex instructions
Single-clock, reduced instruction only
Memory-to-memory: "LOAD" and "STORE" incorporated in instructions
Register to register: "LOAD" and "STORE" are independent instructions
Small code sizes, high cycles per second
Low cycles per second, large code sizes
Transistors used for storing complex instructions
Spends more transistors on memory registers
Computer Arithmetic: Addition/Subtraction:
Addition and subtraction of two numbers are basic operations at the machine-instruction level in all computers. These operations, as well as other arithmetic and logic operations, are implemented in the arithmetic and logic unit (ALU) of the processor. Addition and Subtraction of Signed Numbers
The truth table for the sum and carry-out functions for adding equally weighted bits x i and yi in two numbers X and Y is shown below.
Dept. of ECE, VKCET
Page 12
08.503 Computer Organization and Architecture
The logic expressions for the sum and carry functions, along with an example of addition of the 4-bit unsigned numbers 7 and 6 is shown below.
The logic expression for sum bit s i can be implemented with a 3-input XOR gate, and is a part of the logic required for a single stage of binary addition.
The carry-out function, c i+1, is implemented with an AND-OR circuit.
This is called full adder (FA) and is shown below.
Module 1
A cascaded connection of n full-adder blocks can be used to add two n-bit numbers, as shown below. Since the carries must propagate, propagate, or ripple, through this cascade, the configuration configuration is also called a ripple-carry adder.
Addition/Subtraction Logical Unit:
The n- bit bit adder can be used to add 2’s-complement 2’s -complement numbers X and Y, where the x n−1 and yn−1 MSB bits are the sign bits. The carry-out bit c n is not part of the answer.
Dept. of ECE, VKCET
Page 13
08.503 Computer Organization and Architecture
Module 1
Arithmetic overflow occurs when the signs of the two operands are the same, but the sign of the result is different. A circuit to detect overflow can be added to the n-bit adder. It can also be shown that overflow occurs when the carry bits c n and cn−1 are different. Therefore, a simpler circuit for detecting overflow can be obtained by implementing the expression c n ⊕ cn−1 with an XOR gate. To perform the subtraction operation X − Y on 2’s -complement numbers X and Y , we form the 2’s-complement 2’s-complement of Y and add it to X The logic circuit shown below can be used to perform either addition or subtraction based on the value applied to the Add/Sub input control line.
The Add/Sub control line is set to 0 for addition, applying applying Y unchanged to one of the adder inputs along with a carry-in signal, c 0, of 0. When the Add/Sub control line is set to 1, the Y number is 1’s-complemented 1’s-complemented by the XOR gates and c 0 is set to 1 to complete the 2’s-complementation 2’s-complementation of Y. The 2’s-complementing 2’s-complementing a negative number is done in exactly the same manner as for a positive number. An XOR gate can be added to the above circuit to detect the overflow condition c n ⊕ cn−1.
(Work out more 4-bit examples: a) 7+2 b) 5+2 c) 7+(-2) d) (-7)+2 e) (-7)+(-2 f) 7 - 2 Fast Adders: An n-bit ripple-carry adder used for the addition/subtraction may have too much delay in developing its outputs, s 0 through sn−1 and cn Carry bit cn−1 is available in 2(n−1) gate delays, and sum bit s n−1 have one XOR gate delay. The final carry-out, carry-out, cn, is available after 2n gate delays. Therefore, if a ripple-carry adder is used to implement the addition/subtraction; all sum bits are available in 2n gate delays, including the delay through the XOR gates on the Y input.
Using the implementation c n ⊕ cn−1 for overflow, the indicator is available after 2n + 2 gate delays. Two approaches can be taken to reduce delay in adders. One is to use the fastest possible electronic technology. Another one is to use a logic gate network called a carry-lookahead adder.
Dept. of ECE, VKCET
Page 14
08.503 Computer Organization and Architecture
Module 1
Carry-Look Ahead Addition The logic expressions for s i (sum) and ci+1 (carry-out) of stage i are:
Factoring the second equation into
Also
Where
The expressions G i and Pi are called generate and propagate functions for stage i. If Gi is equal to 1, then c i+1 = 1, independent of the input carry, c i . This occurs when both x i and yi are 1. The propagate function Pi means that an input carry will produce an output carry when either x i is 1 or yi is 1. All Gi and Pi functions can be formed independently and in parallel in one logic-gate delay after the X and Y operands are applied to the inputs of an n-bit adder. Each bit stage contains an AND gate to form G i , an OR gate to form P i , and a three-input XOR gate to form s i . A simpler circuit can be derived by observing that P i can be realized as Pi = x i ⊕ yi , which differs from Pi = xi + yi only when xi = yi = 1. But, in this case G i = 1, so it does not matter whether Pi is 0 or 1. Then, using a cascade of two 2-input XOR gates to realize the 3-input XOR function for si , the basic B cell can be used in each bit stage is shown below.
Expanding ci in terms of i − 1 subscripted variables and substituting into the c i+1expression, we can obtain
Dept. of ECE, VKCET
Page 15
08.503 Computer Organization and Architecture
Then the final expression for any carry variable is
Let us consider the design of a 4-bit adder. The carries can be implemented as
The complete 4-bit adder is shown below.
Module 1
The carries are produced in the block labeled carry-lookahead logic. An adder implemented in this form is called a carry-lookahead adder. Delay through the adder is 3 gate delays for all carry bits and 4 gate delays for all sum bits. In comparison, a 4-bit ripple-carry adder requires 7 gate delays for s 3 and 8 gate delays for c 4.
Add/Subtraction implementation:
The elements of hardware used to implement Add/Subtraction are shown below.
A and B registers to hold operands, A s and Bs registers hold the sign of operands, AVF hold the overflow bit when A and B are added, E hold the carry during A and B addition and A register also hold the result.
Dept. of ECE, VKCET
Page 16
08.503 Computer Organization and Architecture
Module 1
Subtraction is done by adding A to 2’s complement of B using parallel adder, when the mode control bit M is 1. Addition is done through the parallel adder, by disabling complementer using M bit as 0.
Flow chart for Add/Subtraction:
Dept. of ECE, VKCET
Page 17
08.503 Computer Organization and Architecture
Module 1
Multiplication of Unsigned Numbers
The usual algorithm for multiplying integers by hand is illustrated below.
The product of two, unsigned, n-digit numbers can be accommodated in 2n digits, so the product of the two 4-bit numbers in above example is accommodated in 8 bits. In the binary system, multiplication of the multiplicand by one bit of the multiplier is easy. If the multiplier bit is 1, the multiplicand is entered in the appropriate shifted position. If the multiplier bit is 0, then then 0s are entered, entered, as as in the third row of the example. example. The product is computed computed one bit at a time by adding the bit columns from right to left and propagating carry values between columns. Array Multiplier
Binary multiplication of unsigned operands can be implemented in a combinational, 2-dimensional, 2-dimensional, logic array, as shown below f or the 4-bit operand case. Illustration
Dept. of ECE, VKCET
Page 18
08.503 Computer Organization and Architecture
Module 1
Block diagram
The main component in each cell is a full adder/half adder. The AND gate in each cell determines whether a multiplicand bit, m j , is added to the incoming partial-product bit, based on the value of the multiplier bit, q i . The circuit require 4 x 4 = 16 AND gates, 4 half adders and 8 full adders If tad is delay through adder and t g is longest AND gate delay, then maximum delay for completion of multiplication is 8t ad ad + t g g 2
In general n x n bit array multiplier require require n AND gates, n half adders and n(n-2) full adders and 2nt ad ad + t g g delay The worst-case signal propagation delay path is from the upper right corner of the array to the high-order product bit output at the bottom left corner of the array. This critical path consists of the staircase pattern that includes the two cells at the right end of each row, followed by all the cells in the bottom row (HA10 → FA11 → HA20 → FA21 → FA22 → FA23 → FA32 → FA33).
Dept. of ECE, VKCET
Page 19
08.503 Computer Organization and Architecture
Module 1
Sequential Circuit Multiplier:
The combinational array multiplier uses a large number of logic gates for multiplying numbers of practical size, such such as 32 bit or 64 bit. bit. Multiplication of two n-bit numbers can also be performed in a sequential circuit that uses a single n-bit adder.
The block diagram of the hardware arrangement for sequential multiplication is shown below.
This circuit performs multiplication by using a single n-bit adder only.
Registers A and Q are shift registers and they hold partial product PP i while multiplier bit q i generates the signal Add/Noadd The Add/Noadd signal causes the multiplexer MUX to select 0 when q i = 0, or to select the multiplicand M when q i = 1, to be added to PP i to generate PP (i + 1). The product is computed in n cycles. The partial product grows in length by one bit per cycle from the initial vector, PP0, of n 0s in register A.
The carry-out carry-out from the adder is stored in flip -flop C, shown at the left end of register A. Operation:
Initially, the multiplier is loaded into register Q, the multiplicand into register M, and C and A are cleared to 0. At the end of each cycle, C, A, and Q are shifted right one bit position to allow for growth of the partial product product PPi, as the multiplier is shifted out of register Q. Due to the shifting, multiplier bit q i appears at the LSB position of Q to generate the Add/Noadd signal at the correct time, starting with q 0 during the first cycle, q 1 during the second cycle, and so on. After using qi, the multiplier bits are discarded by the right-shift operation.
Dept. of ECE, VKCET
Page 20
08.503 Computer Organization and Architecture
Module 1
The carry-out from the adder is the leftmost bit of PP (i + 1), and it must be held in the C flip -flop to be shifted right with the the contents contents of A and Q. Q. After n cycles, the high-order half of the product is held in register A and the low-order half is in register Q. The multiplication example using the hardware is shown below.
Flow chart of sequential sequential multiplier:
Dept. of ECE, VKCET
Page 21
08.503 Computer Organization and Architecture
Module 1
Multiplication of Signed Numbers:
Different methods are there. Some common methods are: sign extension and booth algorithm.
1) Sign-extension method:
Consider the case of a positive multiplier and a negative multiplicand. When we add a negative multiplicand to a partial product, we must extend the sign-bit value of the multiplicand to the left as far as the product will extend. An example in which a 5- bit signed operand, −13, is the multiplicand multiplicand is multiplied by +11 to get the 10- bit bit product, −143 is shown below.
The sequential algorithm hardware can be used for negative multiplicands, if it is augmented to provide for sign extension extension of the partial products products PPi. This method is not possible for negative multiplier. Such a case, a straightforward solution is to form the 2’s-complement 2’s-complement of both the multiplier and the multiplicand and proceed as in the case of a positive multiplier. This technique is applicable for both operands are negative.
2) Booth algorithm:
This generates a 2n-bit product and works equally well for both positive and negative 2’s2’s complement n-bit operands uniformly. Consider a multiplication operation in which the multiplier is positive and has a single block of 1s, for example, 0011110. To derive the product, we could add four appropriately appropriately shifted versions of the multiplicand, as in the standard procedure. In Booth algorithm, −1 times the shifted multiplicand is selected when moving moving from 0 to 1, and +1 times the shifted multiplicand is selected when moving from 1 to 0, as the multiplier is scanned from right to left.
Dept. of ECE, VKCET
Page 22
08.503 Computer Organization and Architecture
Module 1
Illustration of the normal and the Booth algorithms for an example is shown.
Another example of recoding a multiplier is shown below.
The case when the least significant bit (LSB) of the multiplier is handled by assuming that an implied 0 lies to its right. The Booth algorithm can also be used directly for negative multipliers as shown.
Dept. of ECE, VKCET
Page 23
08.503 Computer Organization and Architecture
Booth multiplier recoding table:
The transformation 011 ... 110 ⇒ +100 ... 0 −10 is called skipping over 1s.
Module 1
Here only a few versions of the shifted multiplicand (the summands) need to be added to generate the product, thus speeding up the multiplication operation. A 16-bit worst-case multiplier, an ordinary multiplier, and a good multiplier is shown below.
Advantages of Booth algorithm: 1) It handles both positive and negative multipliers uniformly. 2) It achieves some efficiency in the number of additions required when the multiplier has a few large blocks of 1s. Fast Multiplication:
Two techniques for speeding up the multiplication operation. 1) Bit-Pair Recoding Recoding of Multipliers: The technique guarantees that the maximum number of summands (versions of the multiplicand) that must be added is n/2 for n-bit operands. 2) Carry-Save Addition of Summands: The technique leads to adding the summands in parallel. Bit-Pair Recoding of Multipliers:
It is derived directly from the Booth algorithm. It uses grouping of the Booth-recoded multiplier bits in pairs. pairs. For example, the pair (+1 −1) is equivalent to the pair (0 +1). That is, instead of adding −1 times the multiplicand multiplicand M at shift position i to +1 ×M at position i + 1. 1.
Dept. of ECE, VKCET
Page 24
08.503 Computer Organization and Architecture
Module 1
Bit-pair multiplier recoding table:
The multiplication operation by normal Booth algorithm and bit-pair algorithm are shown below.
Normal:
Dept. of ECE, VKCET
Page 25
08.503 Computer Organization and Architecture
Module 1
Bit-pair:
Carry-Save Addition of Summands:
Consider the 4 × 4 multiplication array shown below. Here all half adders are replaced by full adders with third input as 0.
Carry-save addition (CSA) can be used to speed up the process by introducing carry into the next row, at the correct weighted positions, as shown below.
Dept. of ECE, VKCET
Page 26
08.503 Computer Organization and Architecture
Module 1
This frees up an input to each of three full adders in the first row. These inputs can be used to introduce the third summand bits m 2q2 , m1q2 , and m0q2 . Then the two inputs of each of three full adders in the second row are fed by the sum and carry outputs from the first row. The third input is used to introduce the bits m 2q3, m1q3, and m0q3 of the fourth summand.
The high-order bits m3q2 and m3q3 of the third and fourth summands are introduced into the remaining free full-adder full-adder inputs at the left end in the second and third rows. The saved carry bits and the sum bits from the second row are now added in the third row, which is a ripple-carry ripple-carry adder, to produce the final product bits. The delay through this technique is somewhat less than the delay through the ripple-carry array. This is because the Sum and Carry vector outputs from each row are produced in parallel in one full-adder delay. Integer Division: Consider the examples of decimal division and binary division of the same values.
Consider the decimal version first. The 2 in the quotient is determined by the following reasoning: First, we try to divide 13 into 2, and it does not work. Next, we try to divide 13 into 27. We go through the trial exercise of multiplying 13 by 2 to get 26, and, observing that 27 − 26 = 1 is less than 13; we enter 2 as the quotient and perform the required subtraction. The next digit of the dividend, 4, is brought down, and we finish by deciding that 13 goes into 14 once, and the remainder is 1. Binary division in a similar way. Hardware for division is shown below.
Dept. of ECE, VKCET
Page 27
08.503 Computer Organization and Architecture
Module 1
An n-bit positive divisor is loaded into register M and an n-bit positive dividend is loaded into register Q at the start of the operation. Initially register register A is set to 0. After the division is complete, the n-bit quotient is in register Q and the remainder is in register A. The required subtractions are using 2’s complement complement arithmetic. The extra bit position at the left end of both A and M accommodates the sign bit during subtractions.
There are two types of algorithm for division using the above hardware: 1) Restoring division 2) Non-restoring division 1) Restoring division:
This operation is as follows: Positions the divisor appropriately with respect to the dividend and performs a subtraction. If the remainder remainder is zero or positive, a quotient bit of 1 is determined, the remainder is extended by another bit of the dividend, the divisor is repositioned, and another subtraction is performed. If the remainder is negative, a quotient bit of 0 is determined, the dividend is restored by adding back the divisor, and the divisor is repositioned for another subtraction. The steps for this algorithms algorithms are: (Do the steps for n times) 1. Shift A and Q left one bit position. 2. Subtract M from A, and place the answer back in A. 3. If the sign of A is 1, set q 0 to 0 and add M back to A, this is for restoring A; otherwise, otherwise, set q 0 to 1. A 4-bit example processed by restoring division is shown below:
Dept. of ECE, VKCET
Page 28
08.503 Computer Organization and Architecture
Module 1
2) Non-restoring division: This algorithm can be improved the speed of division by avoiding the need for restoring A after an unsuccessful subtraction (Subtraction is said to be unsuccessful if the result is negative). Consider the sequence of operations that takes place after the subtraction operation in the preceding algorithm algorithm.. If A is positive, shift left and subtract M, that is, we perform 2A−M. If A is negative, negative, restore it by performing A+M, and then shift it left and subtract M. This is equivalent equivalent to performing 2A+M. The q0 bit is appropriately set to 0 or 1 after the correct operation has been performed.
The algorithm has two stages: Stage 1 is f or getting quotient and requires n cycles. Stage 2 is for restoring reminder and is optional. At last q 0 is 0, no need for this stage, otherwise a restore operation is required for a valid reminder. The steps are following: Stage 1: Do the following two steps n times: 1. If the sign of A is 0, shift A and Q left one bit position and subtract M from A; otherwise, shift A and Q left and add M to A. 2. Now, if the sign of A is is 0, set q0 to 1; otherwise, otherwise, set q 0 to 0. Stage 2: If the sign of A is 1, add M to A. The division example executed by the non-restoring division algorithm is shown below:
Dept. of ECE, VKCET
Page 29
08.503 Computer Organization and Architecture
Module 1
The signed division can be performed by preprocessing the sign of the operands and obtain the sign of the result. Sign of the result can be obtained by XORing the sign of operands. The division is performed by above algorithms. Floating-Point Numbers and Operations Floating-Point Numbers: Floating point numbers are used to represent real numbers.
Using this number representation, a computer must be able to represent real numbers and operate on them. To represent real numbers, the position of the binary point is variable and is automatically adjusted adjusted as computation proceeds. This binary point is said to float, and the numbers are called floating-point floating-point numbers. For example: in decimal scientific notation, numbers may be written as 6.0247 × 10 23, 3.7291 × 10−27, −1.0341 × 10 2, −7.3000 × 10 −14, and so on. These numbers have been given to 5 significant digits of precision. The scale factors 10 23, 10−27, 102, and 10−14 indicate the actual position of the decimal decimal point with respect to the significant significant digits. The same approach is used to repr esent repr esent binary floating-point floating -point numbers in a computer, except that using 2 as the base of the scale factor. Because the base is fixed. fixed . A binary floating-point floating-point number can be represented by: 1) a sign for the number 2) some significant bits 3) a signed scale factor exponent for an implied base of 2.
Dept. of ECE, VKCET
Page 30
