Accelerated Topk-sort Algorithm with Vitis HSL

files

• topk_sort.h, topk_sort.cpp: Vitis HLS implementation
• topk_sort_tb.cpp: Testbench to run simulation on Vitis HLS

report

• you can see report of C synthesis at csynth.rpt
  • it says that this algorithm needs 1212 cycles for sorting (with array size N = 1000, and k = 100), which means that time complexity is O(N), while usual sorting algorithms requires time complexity O(NlogN).
• you can check timing summary at topk_sort_csynth.rpt