[图书][B] Fundamentals of switching theory and logic design

J Astola, RS Stankovic - 2006 - Springer
Information Science and Digital Technology form an immensely complex and wide subject
that extends from social implications of technological development to deep mathematical …

RTLRewriter: Methodologies for Large Models aided RTL Code Optimization

X Yao, Y Wang, X Li, Y Lian, R Chen, L Chen… - arXiv preprint arXiv …, 2024 - arxiv.org
Register Transfer Level (RTL) code optimization is crucial for enhancing the efficiency and
performance of digital circuits during early synthesis stages. Currently, optimization relies …

Transformation of a mealy finite-state machine into a moore finite-state machine by splitting internal states

AS Klimovich, VV Solov'ev - Journal of Computer and Systems Sciences …, 2010 - Springer
The problem of transformation of a Mealy finite-state machine (FSM) into an equivalent
Moore FSM is considered. This problem often arises in the practice of engineering design …

A method for minimizing Moore finite-state machines by merging two states

AS Klimovich, VV Solov'ev - Journal of Computer and Systems Sciences …, 2011 - Springer
The problem of minimization of Moore finite-state machines (FSMs) is considered. This
problem often arises in designing digital devices based on programmable logic devices. The …

FSM decomposition for low power in FPGA

G Sutter, E Todorovich, S Lopez-Buedo… - Field-Programmable Logic …, 2002 - Springer
In this paper, the realization of low power finite state machines (FSMs) on FPGAs using
decomposition techniques is addressed. The original FSM is divided into two submachines …

Orthogonal partitioning and gated clock architecture for low power realization of FSMs

RS Shelar, H Narayanan… - Proceedings of 13th …, 2000 - ieeexplore.ieee.org
In this paper we address the issue of low power realization of FSMs using decomposition
and gated clock architecture. We decompose the N state machine into two interacting …

Reconfigurable finite-state machine based IP lookup engine for high-speed router

M Desai, R Gupta, A Karandikar… - IEEE Journal on …, 2003 - ieeexplore.ieee.org
Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-
end routers. This paper presents an architecture for an IP address lookup engine based on …

Bi-decomposition analysis and algorithm of automata based on semi-tensor product

Z Yanqiong, X Xiangru… - Proceedings of the 31st …, 2012 - ieeexplore.ieee.org
In this paper, we study the bi-decomposition of automata in two standard ways. With semi-
tensor product, the matrix-based expression of automata is given and then the …

[HTML][HTML] The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

MP Desai, H Narayanan, SB Patkar - Discrete Applied Mathematics, 2003 - Elsevier
In this paper, some problems that arise in the realization of finite state machines (FSM) are
shown to be strongly related to the theory of submodular functions. Specifically, we use the …

Hardware reduction in FPGA-based Moore FSM

A Barkalov, L Titarenko, R Malcheva… - Journal of Circuits …, 2013 - World Scientific
The methods are proposed targeting to reduce the numbers of both look-up table elements
and embedded memory blocks in the logic circuit of a Moore finite state machine. The …