Lecture001 Intro
Lecture001 Intro
GRADING
HOMEWORKS
PROJECTS
REVIEW OF DIGITAL LOGIC
Introduction
Administration
About Review
RASSP Program
Why VHDL?
Flip-Flops (see ECE 271 class slides)
Shift Registers
Generalized Register
Pipelined Sorter
Administration
Instructor: Prof. Marek A. Perkowski
Course Information
My home page http://ee.pdx.edu/~mperkows
Computer Engineering web site
http://ece.pdx.edu
Administrative
Office
FAB room 160-05
Office Hours
Fridays 6 pm - 10 pm - meetings in FAB, room 150
Other Times by Appointment
Office Phone
(503)725-5411 (Answering Machine)
Administrative
Email
[email protected]
Grading
HW
35%
Final Project
You will present it in class
No exams
65%
Grading
Attendance at Lecture
Not graded, but recommended.
Attendance at Friday meetings not graded, come if you
can.
Makeup Exams
Makeup homeworks or exams are not given.
Project should be completed before end of the class
Homeworks
Homeworks Require Use of VHDL
Always you have to simulate the circuit
You may be asked to synthesize it also.
Mentor Graphics Tools
Slides
My slides are based on at least 5 books, slides from
Internet and my industrial experience, on top of
teaching this class since 1989. You can learn all you
need if you read slides in detail.
Not always I will cover all slides in class. In such
case you have to complete reading slides for this
week at home.
You can learn a lot from previous homeworks and
projects that are posted.
Additional
The Designers Guide to VHDL
Peter J. Ashenden
Morgan-Kaufman
ISBN 1-55860-270-4 (paperback)
LOC TK7888.3.A863
Dewey Decimal 621.392--dc20
1996
Resources
IEEE Standard 1076-1993
find using search engines on WWW
Resources
Our Book
Cypress Semiconductor (Warp release 5.x)
PC-based
$99 with textbook
Oriented towards Their PLD & FPGA devices
VHDL Subset simulator
Xilinx FPGA
Student edition
Schematic, FSM, VHDL
Honor Code
You Are Encouraged to Collaborate With Other
Students in Projects.
Final VHDL code for each Homework should be
done by yourself.
In Final Project, each file should have at the top
student name of the student responsible for this part
of code.
Homework 1
1.
2.
3.
4.
5.
6.
7.
8.
These are just examples, more projects will be added, you can
propose your own project.
Hough Transforms
Radon Transforms
Fast Fourier Transform
Hadamard
Haar
Adding
Arithmetic
Gabor
These are just examples, more projects will be added, you can
propose your own project.
These are just examples, more projects will be added, you can
propose your own project.
These are just examples, more projects will be added, you can
propose your own project.
These are just examples, more projects will be added, you can
propose your own project.
Review
Mealy and
Moore
Registered
Output
Rabin-Scott
Discuss
generator
of all
functions
of certain
type, use
MUX as
example
Full Adder
Full Adder
Realization
D Flip-Flop
Sequential Adder
To discuss on white-board
Sorting data flow
Pipelined circuit from it
Butterfly combinational circuit from it
Sequential controller from it
The concepts:
Combinational circuit
Finite State machine
Shifting circuits, starting from Moebius Counter. (Johnson)
Cooperating FSMs.
Iterative Circuit
Pipelined circuit
Systolic circuit
Cellular automaton