Description of Class Projects

1. Description of Class Projects 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 . Spring 2016 Marek Perkowski

2. Project 01.Memristive Euclidean Distance Architecture Spring 2016 Marek Perkowski

3. What is this project about? • This project is more complex than other, therefore we need 6 students. Or even more students would be OK. • 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. • 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.

4. 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.

5. 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’sstatefulmemristor 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.

6. Project 02.Memristive Systolic Sorter Spring 2016 Marek Perkowski

7. What is this project about? • This project is easy if you understand pipelining, synchronization and memristors. We need two people. • The results will be innovative and publishable. • You will design an innovative architecture for a sorter, as discussed in the class, based on triangular systolic processor. • 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 report, Paul Long, for help to understand the concept , but VHDL will be your contribution. His software is in System Verilog, your will be in VHDL. He has done good design, but did not report correctly the information about power, delay, area, etc that Verilog tool would not give but VHDL will. Your work will be very similar in essence to Project 01. • 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.

8. What you have to do to get an A for homework 2. • Create the data path, to realize and simulate this systolic architecture. This design should be done for specific CMOS FPGA. You should use the System Verilog code at the beginning just to understand the problem. • Simulate for CMOS FPGA = exactly the same as Kamela. You can discuss this with other student teams. • 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.

9. 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 the complete systolic circuit using Stateful IMPLY memristors, the same way as Kamela has designed the Euclidean Distance, but you design only the data path as this circuit does not require external control. • 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’sstatefulmemristor design. • 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.

10. Project 03.Liskay-Huntsman Image Processor Spring 2016 Marek Perkowski

11. 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 classs. • 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 ImageProcessorReportis very good design but in System verilog. Change to VHDL and do all simulations and calculations, but not for memristors. 22. imag proc SIMD Liskay2012 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.

12. 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.

13. 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.

14. Project 04.Kalman Filter Processor that internally uses Faddeev Algorithm Spring 2016 Marek Perkowski

15. 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 TejasTapsale. His work was OK but was never completed. I want you to complete his work correctly

16. 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.

17. 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.

18. Project 05.Sumitha-Fure Image Processor Spring 2016 Marek Perkowski

19. 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.

20. 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.

21. 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.