A Closer Look Towards Arithmetic Algorithms: With Bks Process

Biswas, Barun; Basuli, Krishnendu; Sen Sarma, Samar; Biswas, Barun; Basuli, Krishnendu; Sen Sarma, Samar

ISBN 10: 3659261041 ISBN 13: 9783659261046
Edité par Lap Lambert Academic Publishing, 2012
Neuf(s) Paperback

Vendeur Revaluation Books, Exeter, Royaume-Uni Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Vendeur AbeBooks depuis 6 janvier 2003


A propos de cet article

Description :

64 pages. 8.66x5.91x0.15 inches. In Stock. N° de réf. du vendeur 3659261041

Signaler cet article

Synopsis :

Computer of the day deals with binary digits. When the project started we were initially with complexity of arithmetic algorithm. Classical Booth‟s algorithm is universally accepted as it is not prone to sign changing. However we must remember that computer can do whatever we ask to do. We basically observed that Strassen matrix multiplication algorithm where there is any place to play with it. We started thinking. We know that no finite state machine can multiply arbitrarily large pair of binary numbers. We compromise and consider binary number n to be adjustable according to machine consideration both in time and space. We started our experiment with checking shift operation in multiplication by considering multiple shift at the same time. The result was encouraging. Our effort is supported by detailed performance profile analysis. The work is an initial effort. The extension of the work is possible and we are sure we will preside to new revolution in near future

Présentation de l'éditeur: Computer of the day deals with binary digits. When the project started we were initially with complexity of arithmetic algorithm. Classical Booth‟s algorithm is universally accepted as it is not prone to sign changing. However we must remember that computer can do whatever we ask to do. We basically observed that Strassen matrix multiplication algorithm where there is any place to play with it. We started thinking. We know that no finite state machine can multiply arbitrarily large pair of binary numbers. We compromise and consider binary number n to be adjustable according to machine consideration both in time and space. We started our experiment with checking shift operation in multiplication by considering multiple shift at the same time. The result was encouraging. Our effort is supported by detailed performance profile analysis. The work is an initial effort. The extension of the work is possible and we are sure we will preside to new revolution in near future

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Détails bibliographiques

Titre : A Closer Look Towards Arithmetic Algorithms:...
Éditeur : Lap Lambert Academic Publishing
Date d'édition : 2012
Reliure : Paperback
Etat : Brand New

Meilleurs résultats de recherche sur AbeBooks