An efficient tree architecture for modulo 2 n +1 multiplication
Authors:
- 1 December 1996
- journal article
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 14 (3) , 241-248
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A new design technique for column compression multipliersIEEE Transactions on Computers, 1995
- Regular VLSI architectures for multiplication modulo (2/sup n/+1)IEEE Journal of Solid-State Circuits, 1991
- A high-speed high-density silicon 8×8-bit parallel multiplierIEEE Journal of Solid-State Circuits, 1987
- The VLSI design of a single chip for the multiplication of integers modulo a Fermat numberIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- The design of specialized residue classes for efficient recursive digital filter realizationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A VLSI Residue Arithmetic MultiplierIEEE Transactions on Computers, 1982
- Recent advances in residue number techniques for recursive digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- A simplified binary arithmetic for the Fermat number transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964