Work

An Analysis and Implementation of the Switching Sequence Table Method

Year: 2025

Type: conference-paper

Abstract: This paper details the algorithm implementation of the Switching Sequence Table method in asynchronous sequential circuit Boolean switching system design. The algorithm is theoretically analysed in terms of its computational complexity and validated through actual experiments. It discusses the multidimensional problem of various parameters and their impact on performance. It then presents analytical evidence that reducing this multidimensional problem to a standard, one-dimensional problem is feasible. The authors consider method challenges when implementing computing modules for the Switching Sequence Table method.

Source: Procedia Computer Science

DOI: 10.1016/j.procs.2025.09.158

Authors: Piotr Czekalski, Mirosław Borowiecki, Bolesław Pochopień, Godlove Suila Kuaban

Institutions: Silesian University of Technology, Institute of Theoretical and Applied Informatics, Polish Academy of Sciences

Language: English

Topic: VLSI and FPGA Design Techniques

Subfield: Electrical and Electronic Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: diamond

Funder: Silesian University of Technology

Award: G3972934574