2012Journal of Circuits Systems and ComputersRequires access

MULTIFUNCTION RNS MODULO 2n ± 1 MULTIPLIERS

Tso‐Bing Juang, Chao-Tsung Kuo, GO-LONG WU, Jian-Hao Huang

Open publisher page 5 citations

Abstract

In this paper, multifunction residue number system (RNS) modulo (2n ± 1) multipliers are proposed. By adopting common circuits for summing up the partial products with extra controls, our proposed multipliers could perform both modulo (2n + 1) and (2n - 1) multiplications. The levels for summation of partial products are n + 1, which are same as the conventional modulo multipliers which with only one kind of modulo multiplications. The proposed multifunction modulo (2n ± 1) multipliers can save at least about 42.5% area under the same delay constraints and above 65.8% Area × Delay Product (ADP) compared with the one composed of modulo (2n + 1) and modulo (2n - 1) multiplication operations. Our proposed multipliers could be applied to ease the tremendous computation overload in the real-time processing applications.

About this research paper

What this paper is about

In this paper, multifunction residue number system (RNS) modulo (2n ± 1) multipliers are proposed. By adopting common circuits for summing up the partial products with extra controls, our proposed multipliers could perform both modulo (2n + 1) and (2n - 1) multiplications. The levels for summation of partial products are n + 1, which are same as the conventional modulo multipliers which with only one kind of modulo multiplications. The proposed multifunction modulo (2n ± 1) multipliers can save at least about 42.5% area under the same delay constraints and above 65.8% Area × Delay Product (ADP) compared with the one composed of modulo (2n + 1) and modulo (2n - 1) multiplication operations. Our proposed multipliers could be applied to ease the tremendous computation overload in the real-time processing applications.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, multifunction residue number system (RNS) modulo (2n ± 1) multipliers are proposed. By adopting common circuits for summing up the partial products with extra controls, our proposed multipliers could perform both modulo (2n + 1) and (2n - 1) multiplications. The levels for summation of partial products are n + 1, which are same as the conventional modulo multipliers which with only one kind of modulo multiplications. The proposed multifunction modulo (2n ± 1) multipliers can save at least about 42.5% area under the same delay constraints and above 65.8% Area × Delay Product (ADP) compared with the one composed of modulo (2n + 1) and modulo (2n - 1) multiplication operations. Our proposed multipliers could be applied to ease the tremendous computation overload in the real-time processing applications.

Key concepts: Modulo, Modulo operation, Arithmetic, Primitive root modulo n, Residue number system, Mathematics, Multiplication (music), Computation

Related papers

Back to paper searchBrowse research topicsOriginal source
MULTIFUNCTION RNS MODULO 2n ± 1 MULTIPLIERS — Research Paper | ScholarLens