Using of method of replacement of input variables in microprogram finite-state machine with datapath of transitions
DOI:
https://doi.org/10.15587/2312-8372.2017.108845Keywords:
microprogram finite state machine, datapath of transitions, replacement of input variables, optimization of hardware amountAbstract
The object of research is a microprogram finite-state machine with datapath of transitions. In its structure, the input signals are fed to the input of the block that forms the codes for the transition operations. A large number of inputs of this unit does not allow to realize it in the basis of memory blocks. The only available basis is the basis of LUT elements of FPGA or similar.
To reduce the number of LUT elements used by the circuit of FSM, it is proposed to use the known method of replacement of input variables. Its application leads to the fact that an additional block is added into the structure of the FSM, which converts the input signals of the FSM into special intermediate signals, the number of which is much less than the number of input signals. This leads to a decrease in the input signals of the block that forms the codes of the transition operations, and makes it possible to synthesize it in the basis of the memory blocks without the use of LUT elements.
An additional unit that converts input signals into intermediate ones can be synthesized in the basis of multiplexers, which are standard functional blocks of modern FPGAs. This makes it possible to use a smaller number of LUT elements in the structure of the FSM with replacement of input variables than in the prototype structure. Saved in this way LUT elements can be used to implement other units of the FSM or elements of projected computing system.
The proposed approach contributes to the saving of hardware amount in the logical circuit of the microprogram finite-state machine with datapath of transitions. This makes this structure more preferable in comparison with the prototype structure from the point of view of hardware amount affecting the final cost of the control unit and the computing system as a whole.
References
- Glushkov, V. M. (1962). Sintez tsifrovyh avtomatov. Moscow: Fizmatgiz, 476.
- Baranov, S. I. (1979). Sintez mikroprogrammnyh avtomatov. Leningrad: Energiia, 232.
- Drozdov, E. A. (1975). Optimizatsiia struktur tsifrovyh avtomatov. Moscow: Soetskoe radio, 352.
- Barkalov, A. A., Palagin, A. V. (1997). Sintez mikroprogrammnyh ustroistv upravleniia. Kyiv: Institute of Cybernetics of NAS of Ukraine, 135.
- Barkalov, A. A. (2002). Sintez ustroistv upravleniia na programmiruemyh logicheskih ustroistvah. Donetsk: Donetsk National Technical University, 262.
- Baranov, S. I., Skliarov, V. A. (1986). Tsifrovye ustroistva na programmiruemyh BIS s matrichnoi strukturoi. Moscow: Radio i sviaz', 272.
- Barkalov, A. A., Babakov, R. M. (2011). Operational formation of state codes in microprogram automata. Cybernetics and Systems Analysis, 47 (2), 193–197. doi:10.1007/s10559-011-9301-y
- Babakov, R., Barkalov, A., Titarenko, L. (2017). Research of efficiency of microprogram final-state machine with datapath of transitions. 2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM). IEEE, 203–206. doi:10.1109/cadsm.2017.7916115
- Babakov, R. M., Barkalov, A. A. (2016). Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions. Cybernetics and Systems Analysis, 52 (2), 191–198. doi:10.1007/s10559-016-9814-5
- Grushvitskii, R. I., Mursaev, A. H., Ugriumov, E. P. (2002). Proektirovanie sistem na mikroshemah programmiruemoi logiki. St. Pererburg: BHV-Peterburg, 608.
- Barkalov, A. A., Titarenko, L. A., Barkalov, A. A. (2012). Structural decomposition as a tool for the optimization of an FPGA-based implementation of a mealy FSM. Cybernetics and Systems Analysis, 48 (2), 313–322. doi:10.1007/s10559-012-9410-2
- Kania, D. (2000). Decomposition-based synthesis and its application in PAL-oriented technology mapping. Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future. Maastricht: IEEE Compuetr Society Press, 138–145. doi:10.1109/eurmic.2000.874626
- Rawski, M., Luba, T., Jachna, Z., Tomaszewicz, P. (2005.). The Influence of Functional Decomposition on Modern Digital Design Process. Design of Embedded Control Systems. Boston: Springer US, 193–204. doi:10.1007/0-387-28327-7_17
- Amann, R., Baitinger, U. G. (1989). Optimal state chains and state codes in finite state machines. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 8 (2), 153–170. doi:10.1109/43.21834
- Bacchetta, P., Daldoss, L., Sciuto, D., Silvano, C. (2000). Low-power state assignment techniques for finite state machines. 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2, 641–644. doi:10.1109/iscas.2000.856410
- Czerwinski, R., Kania, D. (2004). B09: State assignment method for high speed FSMS. IFAC Proceedings Volumes, 37 (20), 216–221. doi:10.1016/s1474-6670(17)30599-2
- Barkalov, A. A., Wegrzyn., M., Wisniewski, R. (2006). Partial reconfiguration of compositional microprogram control units implemented on FPGAs. IFAC Proceedings Volumes, 39 (21), 116–119. doi:10.1016/s1474-6670(17)30169-6
- Bomar, B. W. (2002). Implementation of microprogrammed control in FPGAs. IEEE Transactions on Industrial Electronics, 49 (2), 415–422. doi:10.1109/41.993275
- Solovjev, V. (2001). Synthesis of sequential circuits on programmable logic devices based on new models of finite state machines. Proceedings Euromicro Symposium on Digital Systems Design. IEEE Compuetr Society Press, 170–173. doi:10.1109/dsd.2001.952274
- Babakov, R. M. (2015). Intermediate algebra of transitions in microprogram final-state machine. Radio Electronics, Computer Science, Control, 1, 64–73. doi:10.15588/1607-3274-2016-1-8
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Roman Babakov
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.