EE 118 Fall 2016 Lab C – TTL Specifications and Boolean Function Anthony Lam SJSU ID: 009971065 Instructor: Jiehuan Wang September 18, 2017 Abstract The purpose of this was to study the characteristics of TTL (Transistor to Transistor Logic) logic gates, their output types, and Boolean logic. Our first step was to test the output of the hex inverter gate and later, we connected more chips and measured the output of each individual chip. Introduction Transistors are the building blocks of logic design, and these transistors are used to form what is known as logic gates. There are logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR, where NAND and NOR are universal gates since they can be combined to form any gate. A gate functions
Old in the days, computers were huge in size, hence, not that powerful and relatively slow when compared to computers nowadays. A computer is a complex electrical integrated circuit connects multiple of electrical components together. These components could be summarized in the following; transistors, resistors, capacitors, and diodes. Therefore, when it comes to high tech computers, revolutionary quality is a serious matter. One of the computer quality standards, for example, is the speed at which a computer carries out calculations, this speed is determined by transistors speed. The faster the transistor the better the computer.
&& // is a logical and operator that if both the operands are non- zero, then the condition becomes TRUE.
but still resulting in a valid x. The x = z verification in the tag would be successful even though
Nowadays, Silicon CMOS is the ultimate winner for the high-speed and/or low power computations and logic race. It is the pillar of the semiconductor industry and the main driver for device scaling. The lithographic process advancement and the integration of new materials (like, SiGe and HfO) [2] with the conventional CMOS had helped in overcoming the key challenge of preserving the low power and high performance which was very hard to maintain due to aggressive scaling [3]–[9].
3. (TCO 2) The symbols used to describe the logic of a program are known as _____.
you will find that in any computer language you use. Here is how the “if” statement
the set of productions P consisting of: S → 0AB, S→ 1B, A → 1B01, B → 100.
Boolean-Boolean is a part of large algebra that is used for creating a true or false, Yes or no statement. A Boolean can be written in algorithm and coding.
The basic concept of the Digital Logic Families are needed to be understand first. Fan in, Fan out, Noise Margin, Propagation Delay, Voltage Threshold and Wire Delay are basic concepts out of which Fan out and Noise Margin is explained below.
When you do the math you come up with the “Binary Truth Line” which is :
Assembly language uses a mnemonic to represent each low-level machine operation or opcode. Some opcodes require one or more operands as part of the instruction, and most
Example is Patient. Patient can be in patient and out patient. We can give lots of different
Abstract— VLSI technology has been the cornerstone of every technological achievement in the past century, but as Gordon Moore predicted it is nearing its saturation. A lot of other technologies have been researched upon to fulfill the needs of the fast paced world; one of the potential replacements is Quantum Dots Cellular Automata technology which uses Nano-sized particles to realize real time digital operations. The advantage of QCA technology over its VLSI counterpart is a set of characteristics like drastic decrease in area consumed, less power consumption, reduced time taken for execution and higher overall efficiency. In this paper we discuss one of the many fundamental blocks of the digital technology that is a simple Serial register (SISO, SIPO). It finds its applications in every field be it medical where timer based equipment’s are used to monitor health or any day to day activity in which a memory unit is used.
A deterministic finite automata (DFA) is a machine that is the most simple to understand which will
TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false.