Residue Arithmetic and VLSI
1983 (English)Conference paper (Refereed)
In the residue number system arithmetic is carried out on each digit individually. There is no carry chain. This locality is of particular interest in VLSI. An evaluation of different implementations of residue arithmetic is carried out, and the effects of reduced feature sizes estimated. At the current state of technology the traditional table lookup method is preferable for a range that requires a maximum modulus that is represented by up to 4 bits, while an array of adders offers the best performance fur 7 or more bits. A combination of adders and tables covers 5 and 6 bits the best. At 0.5 mu m feature size table lookup is competitive only up to 3 bits, These conclusions are based on sample designs in nMOS.
Place, publisher, year, edition, pages
1983. 80-83 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65759OAI: oai:DiVA.org:kth-65759DiVA: diva2:483654
IEEE International Conference on Computer Design: VLSI in Computers
NR 201408052012-01-252012-01-25Bibliographically approved