Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
A Closer Look Towards Arithmetic Algorithms
Details
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
Autorentext
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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09783659261046
- Sprache Englisch
- Genre Technik
- Anzahl Seiten 64
- Größe H220mm x B220mm x T150mm
- Jahr 2012
- EAN 9783659261046
- Format Kartonierter Einband (Kt)
- ISBN 978-3-659-26104-6
- Titel A Closer Look Towards Arithmetic Algorithms
- Autor Barun Biswas , Krishnendu Basuli , Samar Sen Sarma
- Untertitel With BKS Process
- Herausgeber LAP Lambert Academic Publishing