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
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
The author completed his graduation in Computer Science (H); first class first, took his M.Sc from West Bengal State university. He is presently working as a PLP in ISI Kolkata. His research areas are algorithms, graph theory and cryptography.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Biswas BarunThe author completed his graduation in Computer Science (H) first class first, took his M.Sc from West Bengal State university. He is presently working as a PLP in ISI Kolkata. His research areas are algorithms, graph th. Codice articolo 5143892
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9783659261046
Quantità: 2 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. A Closer Look Towards Arithmetic Algorithms | With BKS Process | Barun Biswas (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659261046 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 106210675
Quantità: 5 disponibili