Computation of minimal unsatisfiable subformulas for SAT-based digital circuit error diagnosis

Author(s):  
Lamya Gaber ◽  
Aziza I. Hussein ◽  
Hanafy Mahmoud ◽  
M. Mourad Mabrook ◽  
Mohammed Moness
Author(s):  
Kosuke SHIOKI ◽  
Narumi OKADA ◽  
Toshiro ISHIHARA ◽  
Tetsuya HIROSE ◽  
Nobutaka KUROKI ◽  
...  

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1420
Author(s):  
Chuanfu Wang ◽  
Yi Di ◽  
Jianyu Tang ◽  
Jing Shuai ◽  
Yuchen Zhang ◽  
...  

Dynamic degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based pseudorandom sequence generators. The chaotic degradation shows complex periodic behavior, which is often ignored by designers and seldom analyzed in theory. Not knowing the exact period of the output sequence is the key problem that affects the application of chaos-based pseudorandom sequence generators. In this paper, two cubic chaotic maps are combined, which have symmetry and reconfigurable form in the digital circuit. The dynamic behavior of the cubic chaotic map and the corresponding digital cubic chaotic map are analyzed respectively, and the reasons for the complex period and weak randomness of output sequences are studied. On this basis, the digital cubic chaotic map is optimized, and the complex periodic behavior is improved. In addition, a reconfigurable pseudorandom sequence generator based on the digital cubic chaotic map is constructed from the point of saving consumption of logical resources. Through theoretical and numerical analysis, the pseudorandom sequence generator solves the complex period and weak randomness of the cubic chaotic map after digitization and makes the output sequence have better performance and less resource consumption, which lays the foundation for applying it to the field of secure communication.


2021 ◽  
Vol 13 (2) ◽  
pp. 27
Author(s):  
Chuanyan Hao ◽  
Anqi Zheng ◽  
Yuqi Wang ◽  
Bo Jiang

In the information age, MOOCs (Massive Open Online Courses), micro-classes, flipping classroom, and other blended teaching scenes have improved students learning outcomes. However, incorporating technologies into experimental courses, especially electronic and electrical experiments, has its own characteristics and difficulties. The focus of this paper is to introduce virtual technology into an electronic circuit experiment course and to explore its teaching strategy, thereby realizing the informatization of experiment teaching. First, this paper explores the design concepts and implementation details of the digital circuit virtual laboratory, which is then developed based on previous literature and a prequestionnaire to users. Second, the informatization process of the experiment learning model based on traditional custom lab benches is shown through a blended learning scheme that integrates the online virtual laboratory. Finally, the experiment information system is verified and analyzed with a control group experiment and questionnaires. The blended program turned out to be an effective teaching model to complement the deficiencies in existing physical laboratories. The research conclusions show that the virtual experiment system provides students with a rich, efficient, and expansive experimental experience, in particular, the flexibility, repeatability, and visual appeal of a virtual platform could promote the development of students’ abilities in active learning, reflective thinking, and creativity.


1996 ◽  
Vol 2 (4) ◽  
pp. 295-302 ◽  
Author(s):  
BRUCE W. WATSON

Finite automata and various extensions of them, such as transducers, are used in areas as diverse as compilers, spelling checking, natural language grammar checking, communication protocol design, digital circuit simulation, digital flight control, speech recognition and synthesis, genetic sequencing, and Java program verification. Unfortunately, as the number of applications has grown, so has the variety of implementations and implementation techniques. Typically, programmers will be confused enough to resort to their text books for the most elementary algorithms. Recently, advances have been made in taxonomizing algorithms for constructing and minimizing automata and in evaluating various implementation strategies Watson 1995. Armed with this, a number of general-purpose toolkits have been developed at universities and companies. One of these, FIRE Lite, was developed at the Eindhoven University of Technology, while its commercial successor, FIRE Engine II, has been developed at Ribbit Software Systems Inc. Both of these toolkits provide implementations of all of the known algorithms for constructing automata from regular expressions, and all of the known algorithms for minimizing deterministic finite automata. While the two toolkits have a great deal in common, we will concentrate on the structure and use of the noncommercial FIRE Lite. The prototype version of FIRE Lite was designed with compilers in mind. More recently, computation linguists and communications protocol designers have become interested in using the toolkit. This has led to the development of a much more general interface to FIRE Lite, including the support of both Mealy and Moore regular transducers. While such a toolkit may appear extremely complex, there are only a few choices to be made. We also consider a ‘recipe’ for making good use of the toolkits. Lastly, we consider the future of FIRE Lite. While FIRE Engine II has obvious commercial value, we are committed to maintaining a version which is freely available for academic use.


2008 ◽  
Vol 96 (2) ◽  
pp. 343-365 ◽  
Author(s):  
B.H. Calhoun ◽  
Yu Cao ◽  
Xin Li ◽  
Ken Mai ◽  
L.T. Pileggi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document