### Abstract

An arithmetic processor based upon a rational representation scheme is examined. The key feature of this rational processor is its ability to efficiently reduce a result ratio to its irreducible form (the greatest common divisor of the numerator and denominator is unity). The reduction algorithm presented generates the reduced ratio in parallel with the evaluation of the ratio's greatest common divisor. Hardware designs for the reduction algorithm and the basic arithmetic operations are given.

Original language | English (US) |
---|---|

Pages | 241-244 |

Number of pages | 4 |

State | Published - Jan 1 1981 |

Event | Proc - Symp on Comput Arith, 5th - Ann Arbor, Mich Duration: May 18 1981 → May 19 1981 |

### Other

Other | Proc - Symp on Comput Arith, 5th |
---|---|

City | Ann Arbor, Mich |

Period | 5/18/81 → 5/19/81 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Engineering(all)

### Cite this

*RATIONAL ARITHMETIC PROCESSOR.*. 241-244. Paper presented at Proc - Symp on Comput Arith, 5th, Ann Arbor, Mich, .

}

**RATIONAL ARITHMETIC PROCESSOR.** / Irwin, Mary Jane; Smith, Dwight R.

Research output: Contribution to conference › Paper

TY - CONF

T1 - RATIONAL ARITHMETIC PROCESSOR.

AU - Irwin, Mary Jane

AU - Smith, Dwight R.

PY - 1981/1/1

Y1 - 1981/1/1

N2 - An arithmetic processor based upon a rational representation scheme is examined. The key feature of this rational processor is its ability to efficiently reduce a result ratio to its irreducible form (the greatest common divisor of the numerator and denominator is unity). The reduction algorithm presented generates the reduced ratio in parallel with the evaluation of the ratio's greatest common divisor. Hardware designs for the reduction algorithm and the basic arithmetic operations are given.

AB - An arithmetic processor based upon a rational representation scheme is examined. The key feature of this rational processor is its ability to efficiently reduce a result ratio to its irreducible form (the greatest common divisor of the numerator and denominator is unity). The reduction algorithm presented generates the reduced ratio in parallel with the evaluation of the ratio's greatest common divisor. Hardware designs for the reduction algorithm and the basic arithmetic operations are given.

UR - http://www.scopus.com/inward/record.url?scp=0019660880&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019660880&partnerID=8YFLogxK

M3 - Paper

SP - 241

EP - 244

ER -