1VivadoHLS简介

1、用用vivado-hls实现低实现低latency 除法器除法器george wang xilinx dsp specialisttable of contents1vivado hls 简介简介.32创建一个创建一个vivado-hls工程工程.42.1打开vivado hls gui .42.2创建新工程.52.3添加源文件.62.4添加测试文件 .82.5创建solution.103c validation.124c synthesis.135explore 不同新的不同新的solution.151vivado hls 简介简介xilinx vivado high-level synth

2、esis (hls) 工具将 c, c+,或者 systemc 设计规范，算法转成 register transfer level （rtl）实现，可综合到xilinx fpga。将dsp算法快速转到rtl fpga 实现将c 至 rtl时间缩短 4 倍基于 c 语言的验证时间缩短100倍rtl 仿真时间缩短 3 倍2创建一个创建一个vivado-hls工程工程2.1打开vivado hls gui双击桌面上vivado hls gui 图标， 或从start all programs vivado vivado hls gui打开gui之后，vivado-hls welcome界面如下所示：

3、2.2创建新工程在 welcome page, 选择create new project2.3添加源文件指定顶层需要综合的源文件名,并添加文件.本除法器设计采用移位算法#include radix2div.hquotient_t radix2div (dividend_t dividend, / (numerator)divisor_t divisor, / (denominator)remainder_t *remainder / ) #pragma ap latency max=3#pragma ap pipeline quotient_i_t quo, y; / +1 bits unsi

4、gned subtract_t sub_out, rem_r; / +1 bits signed boolean_t last_bit, next_bit; loop_cnt_t i; / last_bit = 0; rem_r = 0; if (loop_max 32) quo = 0ull; else quo = 0; / div_booth_label0: for (i = 0; i loop_max; i = i+1) / concurrent blocks sub_out = rem_r - divisor; y = dividend & 1 (loop_max-i-2);

5、if ( y = 0 ) next_bit = 0; elsenext_bit = 1;if (sub_out 0) / remainder - denominator is negative quo = quo 1;if (i != loop_max-1) rem_r = rem_r 1;rem_r = rem_r | next_bit; else / remainder - denominator is positivequo = quo 1;quo = quo | 1;if (i != loop_max-1) rem_r = sub_out 1;rem_r = rem_r | next_

6、bit; else rem_r = sub_out; / end for*remainder = rem_r;return quo; 2.4添加测试文件添加测试文件.#include #include #include radix2div.h/quotient_t radix2div (dividend_t dividend, / (numerator)divisor_t divisor, / (denominator)remainder_t *remainder / );/int test_divider (dividend_t dividend, divisor_t divisor )qu

7、otient_t quotient;remainder_t remainder;quotient = radix2div(dividend,divisor,&remainder);fprintf(stdout, dividend = %u, divisor = %u quotient = %u remainder = %u n, dividend, divisor, quotient, remainder);fprintf(stdout, - n);if (quotient = dividend/divisor) & (remainder = dividend-(divisor*quotient) ) printf (pass n);else printf (fail n);return 1;/int main () int i,