Comments on "Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach"

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. C-35; H. 9; S. 829 - 830
Hauptverfasser: MIRSALEHI, M. M, GAYLORD, T. K
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.09.1986
Institute of Electrical and Electronics Engineers
Schlagworte:
Addition and multiplication mod M
Applied sciences
Circuit properties
complexity of residue addition and multiplication
content-addressable memory
Digital circuits
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Exact sciences and technology
optimal residue encoding
positional coding
Logic circuit
Coding
Programmable logic array
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9340
DOI:10.1109/TC.1986.1676842