Description of Class Projects

Slides:



Advertisements
Similar presentations
Reversible Gates in various realization technologies
Advertisements

UNC Pixel Planes designed by Prof. Henry Fuchs et al.
IN2305-II Embedded Programming Lecture 2: Digital Logic.
Spring 07, Jan 16 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.
CS 584 Lecture 11 l Assignment? l Paper Schedule –10 Students –5 Days –Look at the schedule and me your preference. Quickly.
ECE Lecture 1 1 ECE 3561 Advanced Digital Design Department of Electrical and Computer Engineering The Ohio State University.
Final project requirement
Maria-Cristina Marinescu Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology A Synthesis Algorithm for Modular Design of.
Exercise problems for students taking the Programming Parallel Computers course. Janusz Kowalik Piotr Arlukowicz Tadeusz Puzniakowski Informatics Institute.
The Art of Scientific Writing. Goals of Scientific Writing  Making a clear presentation of a complex scientific problem/accomplishment  Addressing a.
CSCE 430/830 Course Project Guidelines By Dongyuan Zhan Feb. 4, 2010.
THE ESSAY: THE 3 LEVELS OF COMPOSITION. AN OVERVIEW OF THE 3 LEVELS  I. LEVEL ONE = MOST THEORETICAL (INCLUDES YOUR THESIS)  II. LEVEL TWO = DEFINED.
1/8/ L20 Project Step 8 - Data Path Copyright Joanne DeGroat, ECE, OSU1 State Machine Design with an HDL A methodology that works for documenting.
ELEC692/04 course_des 1 ELEC 692 Special Topic VLSI Signal Processing Architecture Fall 2004 Chi-ying Tsui Department of Electrical and Electronic Engineering.
Lecture 16: Reconfigurable Computing Applications November 3, 2004 ECE 697F Reconfigurable Computing Lecture 16 Reconfigurable Computing Applications.
8th Sakai Conference4-7 December 2007 Newport Beach POCS – Content Sequencing for Sakai Mark J. Norton Nolaria Consulting.
Module 1.2 Introduction to Verilog
Anurag Dwivedi. Basic Block - Gates Gates -> Flip Flops.
CSM06: Information Retrieval Notes about writing coursework reports, revision and examination.
Computer Architecture Lecture 7: Microprogrammed Microarchitectures Prof. Onur Mutlu Carnegie Mellon University Spring 2013, 1/30/2013.
EECE 320 L8: Combinational Logic design Principles 1Chehab, AUB, 2003 EECE 320 Digital Systems Design Lecture 8: Combinational Logic Design Principles.
1 Introduction to Engineering Spring 2007 Lecture 18: Digital Tools 2.
State Machine Design with an HDL
SUBJECT : DIGITAL ELECTRONICS CLASS : SEM 3(B) TOPIC : INTRODUCTION OF VHDL.
EGR 2131 Unit 4 Combinational Circuits: Analysis & Design
System-on-Chip Design
A Level Computing – a2 Component 2 1A, 1B, 1C, 1D, 1E.
ASIC Design Methodology
Keywords: Capstone design course, business plan, interdisciplinary collaboration Integration of Real-life Engineering Design Problems into Engineering.
Hiba Tariq School of Engineering
HDL simulation and Synthesis (Marks16)
Working in Groups in Canvas
ELEC 7770 Advanced VLSI Design Spring 2016 Introduction
EMT 351/4 DIGITAL IC DESIGN Week # Synthesis of Sequential Logic 10.
Design-Space Exploration
Project. Memristive Systolic Sorter
Homework number One You have two weeks to complete this homework
Lesson 10: Building an App: Color Sleuth
ELEC 7770 Advanced VLSI Design Spring 2014 Introduction
from classroom to research: providing different
Join Processing in Database Systems with Large Main Memories (part 2)
Parallelizing Dynamic Time Warping
EEL4930/5934 Reconfigurable Computing
Pipelining and Vector Processing
Field Programmable Gate Array
Field Programmable Gate Array
Field Programmable Gate Array
Why ISO 27001? Subtitle or presenter
ELEC 7770 Advanced VLSI Design Spring 2012 Introduction
T Computer Architecture, Autumn 2005
EGR 2131 Unit 8 VHDL for Combinational Circuits
Academic Communication Lesson 3
SYNTHESIS OF SEQUENTIAL LOGIC
ELEC 7770 Advanced VLSI Design Spring 2010 Introduction
Triangular Sorter Using Memristive Architecture.
Chapter 1 Introduction.
State Machine Design with an HDL
Lecture 2 The Art of Concurrency
General recommendations
THE ECE 554 XILINX DESIGN PROCESS
Description of Class Projects
Lesson 21: Timed writing About this lesson
EGR 2131 Unit 12 Synchronous Sequential Circuits
Project Journal Title Slide
Digital Designs – What does it take
THE ECE 554 XILINX DESIGN PROCESS
Modeling Tangible User Interfaces
NOTICE! These materials are prepared only for the students enrolled in the course Distributed Software Development (DSD) at the Department of Computer.
Elsevier Publishers Without Borders: Malawi Medical Journal:
EEL4930/5934 Reconfigurable Computing
Presentation transcript:

Description of Class Projects Spring 2017 Marek Perkowski There is similarity between any two projects. They are much based on ideas from the previous lectures in the class. All information is given to you on memory stick and on my updated webpage for class. It is expected that the teams will collaborate and exchange information, both between teams and inside the team. Each team should have a team leader that should take more responsibility to guide other people and supervise them. Believe me this is a very useful skill if you want to survive in real life. Documentation should be of high quality. Presentations should use PPT and be of high quality. Each student has to speak. In partial (H2) and final reports, each student should have his/her own section. I wrote tasks for every team, but if you want, you can add your own ideas. Even if you will not implement them, I welcome new ideas as a sign of your creativity and a proof that you understand high-level design material from the class. You are welcome to ask questions during class or/and come to me with your questions .

Project 01. Memristive Euclidean Distance Architecture Spring 2017 Marek Perkowski

What is this project about? This project is more complex than other, therefore we need 5 students in each team. There will be several teams working in parallel. Who will do the best job? The results will be highly innovative and publishable. You will design innovative architectures for supervised and unsupervised associative memories learning, using stateful IMPLY memristors. There is a literature given to you on memory stick that shows how to realize the architecture. This is also available on the webpage of this class. The project will require: Understanding VHDL (but you can use class examples plus the software from Kamela Rahman). See 003. Rahman_dissertation2016_updated file Understanding how stateful IMPLY built from memristors works. See 005. Memristive FPGA – Kamela Rahman – defense2016_v4 file and 006. Anika davidson file for explanation. The last paper teaches you how to synthesize the circuit using various methods, and explains timing. 3. Understanding the architecture on high-software level – See the paper 000. Hasegawa = final GAM temporal ESOINN paper. Also other papers by Hasegawa, 001, 002 and 004 can help, but paper 000 is the most important.

What you have to do to get an A for homework 2. Create the controller and data path, to realize and simulate other 5 architectures (in addition to what Kamela has done). This design should be done for specific CMOS FPGA. Design, using CMOS FPGA data path circuit for finding two maximum elements using concepts from the class, as explained. Simulate= exactly the same as Kamela. Synthesize= exactly the same as Kamela. Calculate power, area and delay = exactly the same as Kamela. Present a good presentation using PPT in class, each student speaks. Slides should have complete VHDL code and experimental results on simulation, power, delay and area. This would be sufficient for Homework 2.

What you have to do to get an A for final project. Complete homework 2 Understand how to design circuits, both combinational and sequential using stateful IMPLY gates. Synthesize one complete algorithm, the same way as Kamela has designed the Euclidean Distance, but with complete control and data path. You can choose any algorithm from Hasegawa’s paper. Using VHDL, create the description of logic with stateful IMPLY gates. You should assume certain delay time t0 for each pulse. The cells are pipelined and executed in parallel. Use the same method as in Kamela’s stateful memristor design. Simulate the pipeline, the results should show both pipelining and parallelism. You should calculate the delay, area and power. Make a high quality presentation at the end of class, week of finals. Each student speaks. Write a high quality report that would be used by me to write a journal paper with all of you as authors and me as the last author. Contact me with any kind of questions.

Project 02. Liskay-Huntsman Image Processor Spring 2017 Marek Perkowski

What is this project about? This project is easy if you understand pipelining, synchronization and systolic processors. We need two people. The results will be innovative and publishable. You will design an innovative architecture for a Image Processor, similar in essence to those discussed in the class. There is a literature given to you on memory stick that shows how to realize the architecture. The project will require: Understanding how to use VHDL for pipelining. Read the previous student reports. 21. Huntsman ImageProcessorReport is very good design but in System verilog. Change to VHDL and do all simulations and calculations, but not for memristors. 22. imag proc SIMD Liskay 2012 is a very good design but not synthesizable. Read the criticism by Jan Fure. You must make it synthesizable. All VHD files are attached on stick and on my webpage for class.

What you have to do to get an A for homework 2. Create the data path, to realize and simulate this architecture. This design should be done for specific CMOS FPGA. Simulate for CMOS FPGA = exactly the same as Kamela. Calculate power, area and delay for CMOS FPGA = exactly the same as Kamela. Present a good presentation using PPT in class, each student speaks. Slides should have complete VHDL code and experimental results on simulation, power, delay and area. This would be sufficient for Homework 2.

What you have to do to get an A for final project. Complete homework 2 Synthesize for CMOS FPGA = exactly the same as Kamela. The Huntsman and Liskay et al ideas must be used, but the design must be synthesizable, even if some functionality for color etc will be lost. Discuss this in class. You should calculate the delay, area and power. Demonstrate with simulation that your synthesized design works. Discuss timing. Make a high quality presentation at the end of class, week of finals. Each student speaks. Write a high quality report that would be used by me to write a journal paper with all of you as authors and me as the last author. Contact me with any kind of questions.

Spring 2017 Marek Perkowski Project 03. Kalman Filter Processor that internally uses Faddeev Algorithm Spring 2017 Marek Perkowski

What is this project about? You have to understand pipelining, synchronization and Kalman and Faddeev algorithms. We need at least three people. Four is even better. The results will be innovative and publishable. You will design an innovative architecture for a Kalman Filter processor that will use internally Faddeev algorithm There is a literature given to you on memory stick that shows how to realize the architecture. The project will require: Understanding how to use VHDL for pipelining and systolic architecture. Read the previous students report and slides. I give you 13 files with papers and slides from previous students and other authors. Especially look to report from Tejas Tapsale. His work was OK but was never completed. I want you to complete his work correctly

What you have to do to get an A for homework 2. Create the data path, to realize and simulate the systolic architecture for FADDEEV ALGORITHM ONLY. This design should be done for specific CMOS FPGA. Simulate for CMOS FPGA = exactly the same as Kamela. Synthesize for CMOS FPGA = exactly the same as Kamela. Calculate power, area and delay for CMOS FPGA = exactly the same as Kamela. Present a good presentation using PPT in class, each student speaks. Slides should have complete VHDL code and experimental results on simulation, power, delay and area. This would be sufficient for Homework 2. You have to explain to the class how the Faddeev algorithm works, you can use previous slides and papers. There is also a complete thesis of Hai Van Dinh Le from PSU Library.

What you have to do to get an A for final project. Complete homework 2 Using VHDL, create the description of complete Kalman Processor. Simulate the circuit, the results should show both pipelining and parallelism. You should calculate the delay, area and power. Demonstrate with simulation how timing works here. Make a high quality presentation at the end of class, week of finals. Each student speaks. Write a high quality report that would be used by me to write a journal paper with all of you as authors and me as the last author. Contact me with any kind of questions.

Project 04. Sumitha-Fure Image Processor Spring 2017 Marek Perkowski

What is this project about? This project can be three or even four people. You have to understand the designs of Sumitha et al and Jan Fure. Sumitha’s code is in Verilog, not VHDL . Fure’s design is in VHDL. Fure’s design of median filter was done for Liskay’s Image Processor, but now I want you to add it as component of Sumitha’s processor. It is your creative task to think how these two should be combined. Combine the two designs to one architecture. The whole combined processor can be in VHDL or in Verilog, but must be completely integrated, simulated and synthesized as one processor. I suggest VHDL because I know what was done by previous students in VHDL for this and similar projects, we need to characterize power, area and delay. Simulate. Discuss in class. The results will be innovative and publishable. There is a literature given to you on memory stick that shows how to realize the architecture. Many similar architectures are on Internet The project will require: Understanding how to use VHDL for systolic and SIMD architectures. Read the previous students report and slides. I give you files with papers and slides from previous students. Especially look to report from Sumitha. Her work was perfect and it worked. Incorporate work of Jan Fure. His work was OK but was never completed. I want you to complete his work correctly and integrate.

What you have to do to get an A for homework 2. Create the data path, to realize and simulate the architecture for Sumitha Image Processor. This design should be done for specific CMOS FPGA. Simulate for CMOS FPGA = exactly the same as Kamela. Synthesize for CMOS FPGA = exactly the same as Kamela. Calculate power, area and delay for CMOS FPGA = exactly the same as Kamela. Present a good presentation using PPT in class, each student speaks. Slides should have complete VHDL code and experimental results on simulation, power, delay and area. This would be sufficient for Homework 2. YOU have to explain to the class how Sumitha Architecture works, and what exactly was done by Ian Fure.

What you have to do to get an A for final project. Complete homework 2 Using VHDL, create the description of complete new processor that will have combined functionality of Sumitha and Fure processors. Synthesize the circuit, the results should show both pipelining and parallelism. You should calculate the delay, area and power. Demonstrate with simulation how timing works here. Make a high quality presentation at the end of class, week of finals. Each student speaks. Write a high quality report that would be used by me to write a journal paper with all of you as authors and me as the last author. Contact me with any kind of questions.