Addendum to “A fully parallel algorithm for residue to binary conversion”

Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT lower bound for the residue-to-binary conversion was derived. It has been proved that not only do the proposed structures compare favorably wit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 55; číslo 1; s. 25 - 26
Hlavní autoři: Barsi, Ferrucio, Perotti, M.Cristina
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 07.07.1995
Elsevier Science
Elsevier Sequoia S.A
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science
Computer science; control theory; systems
Exact sciences and technology
Parallel algorithms
Parallel processing
Studies
Theoretical computing
Parallel algorithms
Integer
Lower bound
Parallel algorithm
VLSI circuit
Data conversion
Binary system
ISSN:0020-0190, 1872-6119
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í:Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT lower bound for the residue-to-binary conversion was derived. It has been proved that not only do the proposed structures compare favorably with the previous results presented in the literature, but they also achieve the optimal AT figure for some choices of the residue system parameters.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(95)00034-A