Introducing Flexibility in Digital Circuit Evolution: Exploiting Undefined Values in Binary Truth Tables

2010 ◽  
pp. 25-36
Author(s):  
Ricky D. Ledwith ◽  
Julian F. Miller
Keyword(s):  
Digital Circuit ◽  
Truth Tables

scholarly journals A Digital Device for Automatic Checking of Homework Assignments in the Digital Circuits Course

2020 ◽  
Vol 35 ◽  
pp. 04009
Author(s):  
Sergey I. Gavrilenkov ◽  
Elizaveta O. Petrenko ◽  
Evgeny V. Arbuzov
Keyword(s):  
Digital Circuits ◽  
Logic Gates ◽  
Digital Circuit ◽  
Education Quality ◽  
Output Variable ◽  
Digital Device ◽  
Digital Electronics ◽  
Logical Expression ◽  
Manual Testing ◽  
Truth Tables

This paper considers a digital device for automatic checking of homework assignments in the digital circuits course. The assignment is to make a digital circuit corresponding to a given logical expression; the circuit is comprised of elementary logic gates. The process of manual testing the built circuit is very labor-intensive because checking a circuit with N inputs variables requires checking the correctness of the output variable for 2N cases. We propose automating this pro-cess with a special digital device. The device is comprised of a microcontroller connected to the circuit tested. The microcontroller is connected to a personal computer with an application written in C# for executing the main operations of the testing process. During testing, the student chooses from a database or enters the logical expression corresponding to the circuit tested. For the expression, the software generates truth tables where actual and required responses of the circuit are given. Actual circuit responses are acquired by probing the circuit via the microcontroller, and the expected values are calculated from the logical expression. The truth tables are then presented to the student with a message of whether the circuit works correctly or not. The device was integrated into the process of checking homework assignments in the digital electronics course, and it significantly sped up the process of checking homework assignment circuits, resulting in better education quality.

Security of Cyber-Physical Systems: A Generalized Algorithm for Intrusion Detection and Determining Security Robustness of Cyber Physical Systems using Logical Truth Tables

2013 ◽  
Vol 9 ◽  
Author(s):  
Curtis G. Northcutt
Keyword(s):  
Intrusion Detection ◽  
Cyber Security ◽  
Logical Truth ◽  
Cyber Physical Systems ◽  
Security Model ◽  
Security Measures ◽  
Physical Systems ◽  
Multiple Signal ◽  
Security Attack ◽  
Truth Tables

The recent proliferation of embedded cyber components in modern physical systems [1] has generated a variety of new security risks which threaten not only cyberspace, but our physical environment as well. Whereas earlier security threats resided primarily in cyberspace, the increasing marriage of digital technology with mechanical systems in cyber-physical systems (CPS), suggests the need for more advanced generalized CPS security measures. To address this problem, in this paper we consider the first step toward an improved security model: detecting the security attack. Using logical truth tables, we have developed a generalized algorithm for intrusion detection in CPS for systems which can be defined over discrete set of valued states. Additionally, a robustness algorithm is given which determines the level of security of a discrete-valued CPS against varying combinations of multiple signal alterations. These algorithms, when coupled with encryption keys which disallow multiple signal alteration, provide for a generalized security methodology for both cyber-security and cyber-physical systems.

scholarly journals The Dynamic Analysis of a Novel Reconfigurable Cubic Chaotic Map and Its Application in Finite Field

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1420
Author(s):  
Chuanfu Wang ◽  
Yi Di ◽  
Jianyu Tang ◽  
Jing Shuai ◽  
Yuchen Zhang ◽  
...  
Keyword(s):  
Secure Communication ◽  
Chaotic Map ◽  
Digital Circuit ◽  
Pseudorandom Sequence ◽  
Periodic Behavior ◽  
Output Sequence ◽  
Digital Devices ◽  
Theoretical And Numerical Analysis ◽  
Dynamic Degradation ◽  
Sequence Generator

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.

scholarly journals Experiment Information System Based on an Online Virtual Laboratory

2021 ◽  
Vol 13 (2) ◽  
pp. 27
Author(s):  
Chuanyan Hao ◽  
Anqi Zheng ◽  
Yuqi Wang ◽  
Bo Jiang
Keyword(s):  
Information System ◽  
Online Courses ◽  
Teaching Strategy ◽  
Information Age ◽  
Digital Circuit ◽  
Virtual Laboratory ◽  
Control Group ◽  
Virtual Technology ◽  
Design Concepts ◽  
Virtual Platform

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.

Implementing and using finite automata toolkits

1996 ◽  
Vol 2 (4) ◽  
pp. 295-302 ◽  
Author(s):  
BRUCE W. WATSON
Keyword(s):  
Flight Control ◽  
Program Verification ◽  
Finite Automata ◽  
Circuit Simulation ◽  
Implementation Strategies ◽  
Digital Circuit ◽  
General Purpose ◽  
Genetic Sequencing ◽  
Java Program ◽  
Fire Engine

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.

Sign in / Sign up

Export Citation Format

Share Document