Modular Multiplication without Carry Propagation (Algorithm Description)

07/27/2022

∙

This paper describes a sufficiently simple modular multiplication algorithm, which uses only carry-save addition with bit inspection Boolean logic and without number comparison or carry propagation.

READ FULL TEXT

Modular Multiplication without Carry Propagation (Algorithm Description)

Ternary and Quaternary CNTFET Full Adders are less efficient than the Binary Ones for Carry-Propagate Adders

A Multi-layer Recursive Residue Number System

An Approach to Incremental and Modular Context-sensitive Analysis of Logic Programs

An Approach to Incremental and Modular Context-sensitive Analysis

Two New CNTFET Quaternary Full Adders for Carry-Propagate Adders

Multipliers: comparison of Fourier transformation based method and Synopsys design technique for up to 32 bits inputs in regular and saturation arithmetics

An Approximate Carry Estimating Simultaneous Adder with Rectification

Modular Multiplication without Carry Propagation (Algorithm Description)

Related Research

Ternary and Quaternary CNTFET Full Adders are less efficient than the Binary Ones for Carry-Propagate Adders

A Multi-layer Recursive Residue Number System

An Approach to Incremental and Modular Context-sensitive Analysis of Logic Programs

An Approach to Incremental and Modular Context-sensitive Analysis

Two New CNTFET Quaternary Full Adders for Carry-Propagate Adders

Multipliers: comparison of Fourier transformation based method and Synopsys design technique for up to 32 bits inputs in regular and saturation arithmetics

An Approximate Carry Estimating Simultaneous Adder with Rectification