New memoryless, mod (2n+or-1) residue multiplier

A mod (2ⁿ+or-1) residue multiplier is introduced. This multiplier does not use any memory. Using VLSI components, a very high speed multiplier is achieved. The whole implementation consists of a binary multiplier, adder and a few logic gates. This implies a reduced hardware requirement.