IS
Алексей
Or building FPGA for concrete algorithm.
For example quick sort (or another simple algorithm) - I would like to build FPGA realization and compare running time with desktop.
I need some practice.
For example quick sort (or another simple algorithm) - I would like to build FPGA realization and compare running time with desktop.
I need some practice.
1. Write your algorithm on RTL code (verilog/vhdl) or use come HLS.
2. Simulate code on modelsim/other simulator on your PC - check for bugs, etc
3. Find out how many clock cycles does you algorithm work. For example, to sort 100 values in ram you need 800 clock cycles.
4. Compile your project for target fpga device (Intel/Xilinx).
5. Find out what clock frequency you get for this code - for example it is 100 MHz - so clock cycle is 10 ns.
6. Calculate fpga time as: 10 ns * 800 clock cycles = 8000 ns for sorting.
so, you don't need hardware and fpga board to get estimated algorithm performance
2. Simulate code on modelsim/other simulator on your PC - check for bugs, etc
3. Find out how many clock cycles does you algorithm work. For example, to sort 100 values in ram you need 800 clock cycles.
4. Compile your project for target fpga device (Intel/Xilinx).
5. Find out what clock frequency you get for this code - for example it is 100 MHz - so clock cycle is 10 ns.
6. Calculate fpga time as: 10 ns * 800 clock cycles = 8000 ns for sorting.
so, you don't need hardware and fpga board to get estimated algorithm performance
