The Community for Technology Leaders
Green Image
Issue No. 09 - September (1986 vol. 35)
ISSN: 0018-9340
pp: 829-830
M.M. Mirsalehi , School of Electrical Engineering, Georgia Institute of Technology
An analytic expression for the lower bound on the complexity of residue multiplication is developed. Significant reduction of the required stored logic in a content-addressable memory is noted. Errors in Figs. 5(a), 7, and 8 of the above paper1 are corrected.
positional coding, Addition and multiplication mod M, complexity of residue addition and multiplication, content-addressable memory, optimal residue encoding

T. Gaylord and M. Mirsalehi, "Comments on "Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach"," in IEEE Transactions on Computers, vol. 35, no. , pp. 829-830, 1986.
82 ms
(Ver 3.3 (11022016))