Abstract
An efficient method for simplifying a multivalued SULM network is presented in this paper. This method employs a cascade decomposition on a multivalued sequential machineM. At first we decomposeM into two simpler machinesM/π andM′. Instead of the traditional normal tree type network, a simpler SULM network that can realizeM can be constructed by cascadingM/π andM′.
Similar content being viewed by others
References
T. Arnoid, C. Tan and M. Newborn, Iterratively realized sequential circuits,IEEE Trans. Comput., C-19:1(1970), 54–66.
A. Singh, F. Gray and J. Armstrong, Tree structured sequential multiple-valued logic design from universal modules,IEEE Trans. Comput., C-30: 10(1980), 671–674.
Xu Xiaoshu, The theory and synthesis of multiple-valued logic sequential networks based on T-ULM,Journal of Changsha Railway Institute, 1(1985), 35–46 (in Chinese).
A. E. Almaini, Sequential machine implementations using universal logic modules,IEEE Trans. Comput., C-27: 9(1978), 951–960.
R. A. Thompson and F. G. Gray, Universal modular tree: a design procedure,IEEE Trans. Comput., C-27:1(1978), 53–63.
A. Friedmen, Feedback in synchronous sequential switching circuits,IEEE Trans. Electron. Comput., EC-15: 6(1966), 354–367.
W. Holcombe, Algebraic Automata Theory, Cambrige University Press, 1982.
Xu Xiaoshu, The difference of the maximal closed sets in partial multivalued logic function set and their computation,Natural Science Journal of Xiangtan Uni. 2(1982), 14–22.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xu, X. Simplification of multivalued sequential SULM network by using cascade decomposition. J. of Compt. Sci. & Technol. 1, 84–95 (1986). https://doi.org/10.1007/BF02943311
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943311