English | 2016 | ISBN: 1443889474 | 482 Pages | PDF | 3.57 MB
The Internet of Things is a great new challenge for the development of digital systems. In addition to the increasing number of classical unconnected digital systems, more people are regularly using new electronic devices and software that are controllable and usable by means of the internet. All such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to Moore's Law, the complexity of digital systems approximately doubles every 18 months. This requires comprehensive knowledge and techniques to solve complex Boolean problems. This book summarizes both new problems and solutions in the Boolean domain in solving such issues.Part 1 describes powerful new approaches in solving exceptionally complex Boolean problems. Efficient methods contribute to solving problems of extreme complexity. New algorithms and programs utilize the huge number of computing cores of the Graphical Processing Unit and improve the performance of calculations by several orders of magnitude. Part 2 represents several applications of digital systems. Due to the crucial role of the internet, both solutions and open problems regarding the security of these systems are discussed. The exploration of certain properties of such systems leads to a number of efficient solutions, which can be reused in a wide field of applications. Part 3 discusses the scientific basis of future circuit technologies, investigating the need for completely new design methods for the atomic level of quantum computers. This part also concerns itself with reversible circuits as the basis for quantum circuits and specifies important issues regarding future improvements.