Minimal Square Rooting

Minimal Square Rooting

Binary square rooting algorithms which yield a root in a redundant representation using digits 1, -1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on electronic computers 1965-04, Vol.EC-14 (2), p.181-185
1. Verfasser: Metze, Gernot
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Boolean functions
Circuit synthesis
Combinational circuits
Digital arithmetic
Laboratories
Logic design
Minimization methods
Sufficient conditions
Switching circuits
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Binary square rooting algorithms which yield a root in a redundant representation using digits 1, -1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed.
ISSN:0367-7508
DOI:10.1109/PGEC.1965.263963