Posted by chrislego88 on Sep 29, 2009 in
Basic Computer Engineering Concepts
Karnaugh maps or K-maps for short are used for simplifying Boolean expressions. K-maps are constructed depending on the number of variables, or bits, in the expression. For example if the expression is f(A,B,C,D) = A + D, there are 4 bits to consider. Before starting to construct the K-Map you should first create the truth [...]
Tags: Binary, Boolean expressions, K Maps, Karnaugh Maps, Truth Tables
A Finite State Machine (FSM), or just state machine, is a model of behavior composed of a finite number of states. We use these in computer engineering to model a “machine” with primitive memory. Based on the signals we recieve, we go to a certain state where information is processed, and then we wait for [...]
Tags: Finite state machines, mealy machines, moore machines, state machines
ABEL Logic is the simpliest way to turn an idea in your brain to a working digital circuit. It is very easy to understand, works like english and functions like a digital circuit so you can easily turn any idea into a working PLD chip that’ll do exactly what you want. To get started writing [...]
Tags: ABEL, ABEL Logic, ABEL Logic Simplified, Digital Logic
Binary numbers work exactly like our decimal system. It’s called Decimal because it has 10 total combinations per digit. For instance we count 0-1-2-3-4-5-6-7-8-9 which gives us 10 total numbers we can use in a single digit. When we run out of digits we add one to the leading digit and switch the current digit [...]
Tags: Binary
Basics
A complex number can be represented graphically in the complex plane.
This point can be described in several different ways:
Note that the third relationship is derived when substituting these trigonometric functions into the first relationship:
Also:
Addition/Subtraction of Complex Numbers:
Rectangular:
Polar: There is no simple way of doing this. The best method would be to convert to rectangular [...]
Tags: Complex Number, Complex Numbers