Efficient VLSI Implementation of Modulo (2^n=B11) Addition and Multiplication

Reto Zimmermann. Efficient VLSI Implementation of Modulo (2^n=B11) Addition and Multiplication. In 14th IEEE Symposium on Computer Arithmetic (Arith-14 99), 14-16 April 1999, Adelaide, Australia. pages 158-167, IEEE Computer Society, 1999. [doi]

Abstract

Abstract is missing.