Modulo 2^ltP-1gt Arithmetic Hardware Algorithm Using Signed-Digit Number Representation

スポンサーリンク

概要

• 論文の詳細を見る

• To realize high-speed computations in a residue number system (RNS), an implementation method for residue arithmetic circuits using signed-digit (SD) number representation is proposed. Integers m^p = (2^P-1) known as Mersenne numbers are used as moduli, so that modulo m_p addition can be performed by an end-around-carry SD adder and the addition time is independent of the word length of operands. Using a binary modulo m_p SD adder tree, the modulo m_p multiplication can be performed in a time proportional to log_2p.

• 社団法人電子情報通信学会の論文
• 1996-03-25

著者

• Wei Shugang

  Faculty Of Engineering Gunma University

• Shimizu Kensuke

  Faculty Of Engineering Gunma University

• SHIMIZU Kensuke

  Faculty of Engineering, Gunma University

関連論文

• Compact Residue Arithmetic Multiplier Based on the Radix-4 Signed-Digit Multiple-Valued Arithmetic Circuits (Special Issue on Integrated Electronics and New System Paradigms)
• Fixed-Polarity OR-AND-EXOR Expressions and Their Minimization (特集 システムLSIの設計技術と設計自動化)
• Double Fixed-Polarity Reed-Muller Expressions:A New Class of AND-EXOR Expressions for Compact and Testable Realization (特集 システムLSIの設計技術と設計自動化)
• Easily Testable Realization Based on Single-Rail-Input OR-AND-EXOR Expressions
• Minimization of AND-EXOR Expressions for Symmetric Functions (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
• Lower Bounds on Size of Periodic Functions in Exclusive-OR Sum-of-Products Expressions (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)
• Dynamic Range Compression Characteristics Using an Interpolating Polynomial for Digital Audio Systems(Digital Signal Processing)
• Modulo 2^ltP-1gt Arithmetic Hardware Algorithm Using Signed-Digit Number Representation

スポンサーリンク