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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník C-35; číslo 9; s. 829 - 830
Hlavní autoři:	MIRSALEHI, M. M, GAYLORD, T. K
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.09.1986 Institute of Electrical and Electronics Engineers
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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