Title :
Comments on "Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach"
Author :
Mirsalehi, M.M. ; Gaylord, T.K.
Author_Institution :
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.
Keywords :
Addition and multiplication mod M; complexity of residue addition and multiplication; content-addressable memory; optimal residue encoding; positional coding; Binary codes; Encoding; Equations; Error correction; Frequency; Modems; Optical computing; Programmable logic arrays; Addition and multiplication mod M; complexity of residue addition and multiplication; content-addressable memory; optimal residue encoding; positional coding;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1986.1676842
