VLSI module for high-performance multiply, square root and divide


Autoria(s): McQuillan, S.E.; McCanny, J.V.
Data(s)

01/11/1992

Resumo

A high-performance VLSI architecture to perform multiply-accumulate, division and square root operations is proposed. The circuit is highly regular, requires only minimal control and can be pipelined right down to the bit level. The system can also be reconfigured on every cycle to perform any one of these operations. The gate count per row has been estimated at (27n+70) gate equivalents where n is the divisor wordlength. The throughput rate, which equals the clock speed, is the same for each operation and is independent of the wordlength. This is achieved through the combination of pipelining and redundant arithmetic. With a 1.0 µm CMOS technology and extensive pipelining, throughput rates in excess of 70 million operations per second are expected.

Identificador

http://pure.qub.ac.uk/portal/en/publications/vlsi-module-for-highperformance-multiply-square-root-and-divide(25087f58-8437-4e79-9c95-c5187353f852).html

http://www.scopus.com/inward/record.url?partnerID=yv4JPVwI&eid=2-s2.0-0026942846&md5=d5937ac225c6801705b2672430202485

Idioma(s)

eng

Direitos

info:eu-repo/semantics/restrictedAccess

Fonte

McQuillan , S E & McCanny , J V 1992 , ' VLSI module for high-performance multiply, square root and divide ' IEE Proceedings E: Computers and Digital Techniques , vol 139 , no. 6 , pp. 505-510 .

Tipo

article