Publication | Closed Access
Modulo (2n+1) arithmetic logic
41
Citations
0
References
1978
Year
EngineeringSubstructural LogicAutomated ReasoningModular ComplementationFormal MethodsComputer EngineeringModular AdditionComputer ScienceArithmetic LogicResidue SystemModal LogicModulus ProblemNovel Format
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.