Modulo (2n+1) arithmetic logic

Abstract
A novel format for representing modulo (2n + 1) numbers is shown to be helpful in achieving modular addition and complementation. Logic for fast addition using carry-look-ahead and modular complementation is also presented.

This publication has 1 reference indexed in Scilit: