Course Instructor:  Vlad Ciobanu

Syllabus:

1. Reconfigurable computer systems.
• Introduction.
• Von Neumann Computer.
• New computing paradigms.
2. Reconfigurable devices-
• Introduction.
• Field Programmable Logic Arrays _FPGAs.
• FPGA’s components.
• Blocks interconnection.
• Structural organization.
• FPGA based design flow.
3. Associative memories (Content Associative Memories – CAM).
• Associative processors. Algorithms.
• CAMs: principles, organization, technologies, architectures.
• ASIC and FPGA CAM implementations.
• CAM applications: data compression, network switch, ATM switch, Memory mapping, Associative processors.
• A classic associative processor features.
• FPGA based classic associative processor.
• FPGA based special purpose associative processor.
• Generic associative processor.
• Associative algorithms implementation on programmable associative processors.
• Arithmetic algorithms, data base algorithms, symbolic processing algorithms.
• Reconfigurable structures based associative algorithms implementation of: max, min, sort, sel.
4. FPGA attached coprocessors based speedup implementation of intensive computations algorithms.
• FPGA circuits speedup computation
5. Some high performance reconfigurable computing system implementations.
• Experimental platforms for reconfigurable FPGA based computing systems.
• Platform organization, PS/2 and VGA interfaces.
• Arithmetic processor: partitioned and nonpartitioned execution and control units implementations.
• CORDIC algorithms FPGA implementations.
• CORDIC algorithms fundamentals.
• Trigonometric functions implementations.
• Iterative and non-iterative CORDIC processors.
• FPGA iterative CORDIC algorithm implementation.
• Some application specific oriented associative processors implementations.
• FPGA based reconfigurable computing systems implementations conclusions.