Processor suitable for recursive computations
US5243551A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Feb 12, 1992 |
| Grant date | Sep 7, 1993 |
| Priority date | — |
| Expiry date | Feb 12, 2012 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2207/3884
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.