컴퓨터구조 (Booth 알고리즘)

소개

컴퓨터 구조수업중 Booth 알고리즘을 플로우 챠트와 도식으로 구현한 레포트입니다.

국제어 강의 수업 레포트 이므로 모두 영어로 되어있습니다.

Booth 알고리즘의 곱셈연산 기법, 나눗셈 연산기법이 수록되어 있습니다.

목차

A. Principles
1. Procedure
1. Flow Chart
1. Implemnent
A. Examples

 Binary Division Algorithm
A. Principles (Version 1)
1. Flow Chart
1. Procedure
A. Examples (Version 1)
A. Principles (Version 2)
1. Flow Chart
1. Procedure
A. Examples (Version 2)
A. Principles (Version 3)
1. Flow Chart
1. Procedure
A. Examples (Version 3)

본문내용

   Booth`s Algorithm

A. Principles

1. Procedure

Booth`s algorithm involves repeatedly adding one of two predetermined values A and S to a product P, then performing a rightward arithmetic shift on P. Let m and r be the multiplicand and multiplier, respectively; and let x and y represent the number of bits in m and r.

1 Determine the values of A and S, and the initial value of P. All of these numbers should have a length equal to (x + y + 1).

A: Fill the most significant (leftmost) bits with the value of m. Fill the remaining (y + 1) bits with zeros.
S: Fill the most significant bits with the value of (−m) in two`s complement notation. Fill the remaining (y + 1) bits with zeros.
P: Fill the most significant x bits with zeros. To the right of this, append the value of r. Fill the least significant (rightmost) bit with a zero.

2. Determine the two least significant (rightmost) bits of P.

If they are 01, find the value of P + A. Ignore any overflow.
If they are 10, find the value of P + S. Ignore any overflow.
If they are 00, do nothing. Use P directly in the next step.
If they are 11, do nothing. Use P directly in the next step.

3. Arithmetically shift the value obtained in the 2nd step by a single place to the right. Let P now equal this new value.
4. Repeat steps 2 and 3 until they have been done y times.
5. Drop the least significant (rightmost) bit from P. This is the product of m and r.

참고자료

· 없음