<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.0.4" -->
<rss version="0.92">
<channel>
	<title>Computer Science, Information Technology : Engineering Notes</title>
	<link>http://koolkampus.com/engineering-notes-1</link>
	<description>Computer Science, Information Technology : Engineering Notes</description>
	<lastBuildDate>Tue, 31 Oct 2006 09:21:31 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Logic Gates</title>
		<description><![CDATA[The basic building blocks of a computer are called logical gates or just gates.
Gates are basic circuits that have at least one (and usually more) input and exactly one output. Input and output values are the logical values true and false. In computer architecture it is common to use 0 for false and 1 for [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/logic-gates/</link>
			</item>
	<item>
		<title>Different types of Logic Gates</title>
		<description><![CDATA[The and-gate

An and-gate has an arbitrary number of inputs. The output value is 1 if and only if all of the inputs are 1. Otherwise the output value is 0. The name has been chosen because the output is 1 if and only if the first input and the second input, and, &#8230;, and the [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/different-types-of-logic-gates/</link>
			</item>
	<item>
		<title>Truth Table</title>
		<description><![CDATA[Introduction
To specify the exact way in which a combinatorial circuit works, we might use different methods, such as logical expressions, or as in this section, truth tables.
A truth table is a complete enumeration of all possible combinations of input values, each one with its associated output value.
Describing existing circuits
When used to describe an existing circuit, [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/truth-table/</link>
			</item>
	<item>
		<title>Combinatorial Circuits</title>
		<description><![CDATA[Introduction
A combinatorial circuit is a generalized gate. In general such a circuit has m inputs and n outputs.
Such a circuit can always be constructed as n separate combinatorial circuits, each with exactly one output. For that reason, some texts only discuss combinatorial circuits with exactly one output. In reality, however, some important sharing of intermediate [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/combinatorial-circuits/</link>
			</item>
	<item>
		<title>Logic expressions</title>
		<description><![CDATA[Introduction
To define what a combinatorial circuit does, we can use a logic expression or an expression for short. Such an expression uses the two constants 0 and 1, variables such as x, y, and z (sometimes with suffixes) as names of inputs and outputs, and the operators + (which stands for or), * (which stands [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/logic-expressions/</link>
			</item>
	<item>
		<title>Different types of gates</title>
		<description><![CDATA[A valid question at this point is how many different kinds of gates there are, and what they are called.
Let us limit ourselves to gates with n inputs. The truth tables for such gates have 2n lines. Such a gate is completely defined by the output column in the truth table. The output column can [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/different-types-of-gates/</link>
			</item>
	<item>
		<title>Multiplexer</title>
		<description><![CDATA[A multiplexer is a combinatorial circuit that is given a certain number (usually a power of two) data inputs, let us say 2n, and n address inputs used as a binary number to select one of the data inputs. The multiplexer has a single output, which has the same value as the selected data input.
In [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/multiplexer/</link>
			</item>
	<item>
		<title>Decoder</title>
		<description><![CDATA[In both the multiplexer and the demultiplexer, part of the circuits decode the address inputs, i.e. it translates a binary number of n digits to 2n outputs, one of which (the one that corresponds to the value of the binary number) is 1 and the others of which are 0.
It is sometimes advantageous to separate [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/decoder/</link>
			</item>
	<item>
		<title>Demultiplexer</title>
		<description><![CDATA[The demultiplexer is the inverse of the multiplexer, in that it takes a single data input and n address inputs. It has 2n outputs. The address input determine which data output is going to have the same value as the data input. The other data outputs will have the value 0.
Here is an abbreviated truth [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/demultiplexer/</link>
			</item>
	<item>
		<title>Binary arithmetic</title>
		<description><![CDATA[Introduction
An important part of the use of logic circuits is for computing various mathematical operations such as addition, multiplication, trigonometric operations, etc.
We must therefore have a way of representing numbers as binary data.
Nonnegative integers
The easiest numbers to represent are the nonnegative integers. To see how this can be done, recall how we represent number in [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/binary-arithmetic/</link>
			</item>
	<item>
		<title>Ten&#8217;s complement</title>
		<description><![CDATA[Infinite-precision ten&#8217;s complement
Imagine the odometer of an automobile. It has a certain number of wheels, each with the ten digits on it. When one wheel goes from 9 to 0, the wheel immediately to the left of it, advances by one position. If that wheel already showed 9, it too goes to 0 and advances [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/tens-complement/</link>
			</item>
	<item>
		<title>Two&#8217;s Complement</title>
		<description><![CDATA[So far, we have studied the representation of negative numbers using ten&#8217;s complement. In a computer, we prefer using base two rather than base ten. Luckily, the exact method described in the previous section works just as well for base two. For an n-bit adder (n is usually 32 or 64), we can represent positive [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/twos-complement/</link>
			</item>
	<item>
		<title>Circuits for binary arithmetic</title>
		<description><![CDATA[Introduction
Binary arithmetic is a combinatorial problem. It may seem trivial to use the methods we have already seen for designing combinatorial circuits to obtain circuits for binary arithmetic.
However, there is a problem. It turns out that the normal way of creating such circuits would often use up way too many gates. We must search for [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/circuits-for-binary-arithmetic/</link>
			</item>
	<item>
		<title>Latches and flip-flops</title>
		<description><![CDATA[Latches and flip-flops
In the same way that gates are the building blocks of combinatorial circuits, latches and flip-flops are the building blocks of sequential circuits.
While gates had to be built directly from transistors, latches can be built from gates, and flip-flops can be built from latches. This fact will make it somewhat easier to understand [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/latches-and-flip-flops/</link>
			</item>
	<item>
		<title>State Table</title>
		<description><![CDATA[Where truth tables are used to describe combinatorial circuits, state tables are used to describe sequential circuits.
A state table looks similar to a truth table, except that in addition to the inputs, the left part of the table also contains the values of the outputs. The right part of the table does not contain the [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/state-table/</link>
			</item>
	<item>
		<title>Binary multiplication</title>
		<description><![CDATA[As we mentioned in the section on circuits for binary arithmetic, multiplication are (currently, at least) too complicated for a combinatorial circuit.
The solution to this problem is going to be to use a sequential circuit and to divide the work into several stages, one stage for each clock pulse.
The algorithm we are going to use [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/binary-multiplication/</link>
			</item>
	<item>
		<title>Buses</title>
		<description><![CDATA[With tri-state logic we can use a single wire to connect all the sources and all the destinations of some common signal. This wire may save a significant amount of space on the chip and also make the distance a signal has to travel considerably shorter.
Such a wire, or in general, a collection of wires [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/buses/</link>
			</item>
	<item>
		<title>Counters</title>
		<description><![CDATA[A counter is a sequential circuit with 0 inputs and n outputs. Thus, the value after the clock transition depends only on old values of the outputs. For a counter, the values of the outputs are interpreted as a sequence of binary digits (see  the section on binary arithmetic).
We shall call the outputs o0, [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/counters/</link>
			</item>
	<item>
		<title>Memories</title>
		<description><![CDATA[A memory is neither a sequential circuit (since we require sequential circuits to be clocked, and memories are not clocked), nor a combinatorial circuit, since its output values depend on past values.
In general, a memory has m inputs that are called the address inputs that are used to select exactly one out of 2m words, [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/memories/</link>
			</item>
	<item>
		<title>Register</title>
		<description><![CDATA[A register is a sequential circuit with n + 1 (not counting the clock) inputs and n output. To each of the outputs corresponds an input. The first n inputs will be called x0 trough xn-1 and the last input will be called ld (for load). The n outputs will be called y0 trough yn-1.
When [...]]]></description>
		<link>http://koolkampus.com/engineering-notes-1/computer-science/register/</link>
			</item>
</channel>
</rss>
