The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1986 vol.35)
pp: 829-830
M.M. Mirsalehi , School of Electrical Engineering, Georgia Institute of Technology
ABSTRACT
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.
INDEX TERMS
positional coding, Addition and multiplication mod M, complexity of residue addition and multiplication, content-addressable memory, optimal residue encoding
CITATION
M.M. Mirsalehi, T.K. Gaylord, "Comments on "Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach"", IEEE Transactions on Computers, vol.35, no. 9, pp. 829-830, September 1986, doi:10.1109/TC.1986.1676842
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool