Publication Details

The Finite-State Machines Simplified Booth Recodings

EYSSELT Miloš. The Finite-State Machines Simplified Booth Recodings. In: Proceedings of the 30th Spring International Conference Modelling and Simulation MOSIS'96. April 23-25, Krnov: unknown, 1996, pp. 130-135. ISBN 80-85988-03-8.
Type
conference paper
Language
english
Authors
Eysselt Miloš, Ing., CSc. (DCSE FEECS BUT)
Keywords

finite-state machine, finite automaton, Mealy machine, Moore machine, two's complement multiplying, Booth recoding, signed digit number, canonical signed digit number

Abstract

The paper presents quite an original use of the Mealy machine diagram for modelling a decoder that transforms the two's complement numbers into the signed digit numbers or canonical signed digit numbers. This approach permits to lower the number of input variables entering the transformation process, which results in hardware simplification of the central processor unit of a microprogrammed computer, if some of the Booth signed numbers multiplying method is utilized. The transformation of the Mealy machine diagram into Moore machine diagram then makes the implementation of the corresponding microprogram easy.

Published
1996
Pages
130-135
Proceedings
Proceedings of the 30th Spring International Conference Modelling and Simulation MOSIS'96
Conference
30th Spring International Conference Modelling and Systems Simulation MOSIS'96, Krnov, CZ
ISBN
80-85988-03-8
Place
April 23-25, Krnov, CZ
BibTeX 
@INPROCEEDINGS{FITPUB5718,
   author = "Milo\v{s} Eysselt",
   title = "The Finite-State Machines Simplified Booth Recodings",
   pages = "130--135",
   booktitle = "Proceedings of the 30th Spring International Conference Modelling and Simulation MOSIS'96",
   year = 1996,
   location = "April 23-25, Krnov, CZ",
   ISBN = "80-85988-03-8",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/5718"
}
Back to top