Result Details
The Finite-State Machines Simplified Booth Recodings
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.
finite-state machine, finite automaton, Mealy machine, Moore machine, two's complement multiplying, Booth recoding, signed digit number, canonical signed digit number
@inproceedings{BUT192217,
author="Miloš {Eysselt}",
title="The Finite-State Machines Simplified Booth Recodings",
booktitle="Proceedings of the 30th Spring International Conference Modelling and Simulation MOSIS'96",
year="1996",
pages="130--135",
publisher="unknown",
address="April 23-25, Krnov",
isbn="80-85988-03-8"
}