Theory of discrete devices

2019 ◽  
Author(s):  
Виктор Филиппов ◽  
Viktor Filippov ◽  
Иван Чертков ◽  
Ivan Chertkov

The textbook presents the basic concepts of integrated digital devices, codes, the basics of logic algebra, electronic component base of digital chips, circuit implementations of integrated circuits of combinational and sequential types, examples of synthesis of contactless and relay-contact circuits and finite state machines, the principles of functioning of pulse generators and generators, arithmetic logic and memory devices. Is intended for students of internal and correspondence forms of education of specialty "power and electrical engineering" and the specialty "system of trains", it may be useful to students of other technical specialties and areas of training related to the study of circuit design, students of additional vocational programs, engineering staff range of power supply involved in the operation of systems of telemechanics, relay protection and automation.

1982 ◽  
Vol 19 (3) ◽  
pp. 265-270
Author(s):  
H. E. Hanrahan ◽  
S. J. West

Recent advances in VLSI digital circuit design methods and the silicon foundry concept has put the design of such circuits within reach of students. This paper discusses the design of linear integrated circuits by students. The basic concepts, tools and techniques are reviewed. The areas of common ground and differences between analogue and digital design techniques are highlighted.


Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1110
Author(s):  
Jiwoon Park ◽  
Hoyoung Yoo

A differential fault tolerance encoding is presented for finite state machines (FSMs) to improve their area efficiency. As the manufacturing technology for semiconductors continues to scale down, the probability of the occurrence of unexpected faults in integrated circuits has been increasing. Because an FSM controls an entire digital circuit, the faults in FSMs should be carefully addressed. Whereas the previous encoding applies a fault tolerance scheme to all the states in an FSM, the proposed encoding applies a fault tolerance scheme to only specific states depending on their importance. Compared with the previous complete fault tolerance encoding, the proposed encoding provides a comparable failure probability with a small hardware by applying the fault tolerance scheme differently to each state. The proposed method improves the area efficiency by 36.1%, 43.8%, 49.2%, and 74.6% compared with that by the non-fault tolerance, previous hardware redundancy, information redundancy, and time redundancy methods, respectively. Consequently, the proposed method can provide a flexible solution by applying the fault tolerance differently depending on the importance of the states.


2014 ◽  
Vol 886 ◽  
pp. 505-508
Author(s):  
Chun Juan Han ◽  
Fa Cheng Rui ◽  
Sheng Liu ◽  
Shou Qin Tang

Uninterruptible Power Supply plays an important role in critical load, such as: computer, communication system and hospital. They can provide reliable and pure power supply for loads neither power good or not. With the best performance, on- Line UPS provider most sufficient protection for loads power failure in various UPS. With the continuous development of power electronics technology and information industry, this article design a high quality and reliability UPS to meet modern development of science and technology.


Author(s):  
Lauri Karttunen

The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.


Sign in / Sign up

Export Citation Format

Share Document