Diferență între revizuiri ale paginii „Advanced FPGA Design”

De la WikiLabs
Jump to navigationJump to search
Linia 40: Linia 40:
 
! Name
 
! Name
 
! HW1
 
! HW1
 +
! HW2
 
|-
 
|-
 
| Balaban Valeriu
 
| Balaban Valeriu
 
| 4
 
| 4
 +
| 0
 
|-
 
|-
 
| Catrina Andrei
 
| Catrina Andrei
 +
| 5
 
| 5
 
| 5
 
|-
 
|-
 
| Gheolbanoiu Alexandru
 
| Gheolbanoiu Alexandru
 
| 5
 
| 5
 +
| 4
 
|-
 
|-
 
| Grigoras Gabriel
 
| Grigoras Gabriel
 
| 5
 
| 5
 +
| 0
 
|-
 
|-
 
| Mocanu Dan
 
| Mocanu Dan
 +
| 4
 
| 4
 
| 4
 
|-
 
|-
 
| Popescu Vlad
 
| Popescu Vlad
 
| 2
 
| 2
 +
| 5
 
|-
 
|-
 
| Prajinariu Sebastian
 
| Prajinariu Sebastian
 
| 2
 
| 2
 +
| 5
 
|-
 
|-
 
| Rusu Andrei
 
| Rusu Andrei
 +
| 5
 
| 5
 
| 5
 
|-
 
|-
 
| Stanculescu Sergiu
 
| Stanculescu Sergiu
 
| 5
 
| 5
 +
| 4
 
|-
 
|-
 
| Yang Haining
 
| Yang Haining
 
| 5
 
| 5
 +
| 3
 
|}
 
|}

Versiunea de la data 3 noiembrie 2014 12:29

Overview

The Advanced FPGA Design course covers topics related to the efficient implementation of digital circuits on FPGA devices, including combinatorial and sequential logic, memory, high-speed arithmetic, clocking and IOs.

Grading

Points will be awarded for the following activities:

  • 25 points for 5 homework assigments in weeks 2-6
  • 50 points for a System-on-Chip project in weeks 7-11
  • 25 points for final exam (multiple choice test)

Course Material

Slides will be uploaded as they are presented in class.

Fișier:FPGA Intro.pdf

Fișier:FPGA Logic.pdf

Fișier:FPGA SRL DistRAM.pdf

Fișier:FPGA BlockRAM.pdf

Homework Assignments

Assignments will be issued during the class and the deadline is the beginning of the next week's class. Homework assigments will be submitted via email, with the subject AM_FPGA_HWn where n is the number of the assignment. Attach all source code and other materials required for grading.

The following assignments have been presented:

  • Assignment 1 - implement a 16-bit population count circuit which outputs the number of '1' bits of the 16-bit input number. Implement this circuit with ripple carry adders (RCA) and note synthesis results: resource utilization and estimated delay. Implement the same circuit utilizing carry save adders (CSA) and compare synthesis results to the RCA implementation.
  • Assignment 2 - implement a synchronous FIFO utilizing SRL (LUT shift registers) for data storage. The FIFO is 16 bits wide. Implement the FIFO and evaluate resource utilization and top frequency for depths from 4 to 64 bits. The FIFO will be reset through the GSR.
  • Assignment 3 - implement an 8-bit population count as a Block RAM. Define a read-only RAM port and utilize the RAM initialization procedure to make sure the memory is initialized at configuration time. The implementation will target the Xilinx Virtex-6 architecture.
  • Bonus Assignment - implement an instruction decoder (to be provided as source code) fully in Block RAM, targeting the Xilinx Zynq architecture. 10 points will be awarded for this assignment, and the deadline is the end of the semester. Please ask for the decoder source code by e-mail if interested.
Name HW1 HW2
Balaban Valeriu 4 0
Catrina Andrei 5 5
Gheolbanoiu Alexandru 5 4
Grigoras Gabriel 5 0
Mocanu Dan 4 4
Popescu Vlad 2 5
Prajinariu Sebastian 2 5
Rusu Andrei 5 5
Stanculescu Sergiu 5 4
Yang Haining 5 3