Processor suitable for recursive computations

Details Processor suitable for recursive computations Processor suitable for recursive computations

1992-02-12

1993-09-07

Nguyen, Long T.

Boots, shoes, and leggings

3647462, G06F 738

Patent

active

052435512

ABSTRACT:
A processor suitable for recursive computations is arranged to multiply successive input data words by a co-efficient word to produce results. It incorporates multiplier cells connected to form rows and columns. Each row is arranged to multiply a respective input data digit by the co-efficient. It begins with accumulator cells and continues with multiplier cells each arranged to multiply by an individual co-efficient digit and disposed in the row in descending order of digit significance. Columns other than the first column begin with a multiplier cell, and the higher significance columns terminate at respective accumulator cells. Any intervening multiplier cells are arranged in ascending order of multiplier digit significance. The processor employs radix 2 arithmetic. Each accumulator cell employs redundant radix 2 arithmetic, and each adds the highest significance transfer digit output of its row to at least three digits of equal and higher significance output from a preceding row. Operation of the multiplier and accumulator cells generates sum and transfer digits for output down and between columns in the direction of increasing digit significance in the case of transfer digits. An accumulator cell's computed digit of higher significance becomes the respective row's output result digit. Each result digit is recycled in redundant radix 2 form to provide an input data digit for all multiplier cells of a respective row selected in accordance with result digit significance.

REFERENCES:
patent: 4493048 (1985-01-01), Kung et al.
patent: 4639857 (1987-01-01), McCanny et al.
patent: 4686645 (1987-08-01), McCanny et al.
patent: 4701876 (1987-10-01), McCanny et al.
patent: 4777614 (1988-10-01), Ward
patent: 4823299 (1989-04-01), Chang et al.
patent: 4833635 (1989-05-01), McCanny et al.
patent: 4864528 (1989-09-01), Nishiyama et al.
patent: 4885715 (1989-12-01), McCanny et al.
R. F. Lyon, "Filters, An Integrated Digital Filter Subsystem", published by Addison-Wesley in 1985, pp. 253-262.
Bit Level Pipelining of Recursive Computations, J. V. McCanny et al, Lisbon Conference, Apr. 1988.
Bit-Level Systolic Arrays for IIR Filtering, S. C. Knowles et al, Systolic Array Conference, May 1988.
Efficient Bit-Level Systolic Arrays for Inner Product Computation, R. B. Urquhart et al, 645 G.E.C. Journal of Research 2 (1984), No. 1, Rugby, GB.
Systolic Matrix and Vector Multiplication Methods for Signal Processing R. B. Urquhart et al, IEEE Proceedings, vol. 131, Pt. F, No. 6, Oct., 1984.
An Approach to the Implementation of Digital Filters, Leland B. Jackson et al IEEE Transactions on Audio and Electroacoustics, vol. Au-16, No. 3, Sep. 1968.
Systolic Building Block for High Performance Recursive Filtering, R. F. Woods et al, pp. 1 through 4, Jun. 9, 1988, Helsinki.
IEEE Int. Conference on Acoustsics, Speech & Signal Processing, 1988 "Systolic IIR Filters with Bit Level Pipelining", Woods et al, Apr. 11, 1988.
Look-Ahead Computation, Improving Iteration Bound in Linear Recursions, Keshab Kumar Parhi et al, Depart. of Electrical Eng. & Computer Sciences, Copyright date of 1987.
On A Flexible Implementation of Digital Computer Arithmetic, A. Avizienis Jet Propulsion Laboratory, Calif. Institute of Tech., Pasadena, Calif., USA Aug. 27, 1962.

Affiliated with

Also associated with

Rating

Processor suitable for recursive computations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Processor suitable for recursive computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processor suitable for recursive computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-492935