1 Vivado HLS 简介

1、author: george wangdocument number: date document revision: page 1 of 15 revision: 1.0 用用vivado-hls实现低实现低latency 除法器除法器 george wang xilinx dsp specialist author: george wangdocument number: date document revision: page 2 of 15 revision: 1.0 table of contents 1vivado hls 简介简介.3 2创建一个创建一个vivado-hls工程工

2、程 .4 2.1打开vivado hls gui .4 2.2创建新工程.5 2.3添加源文件.6 2.4添加测试文件 .8 2.5创建solution.10 3c validation .12 4c synthesis.13 5explore 不同新的不同新的solution.15 author: george wangdocument number: date document revision: page 3 of 15 revision: 1.0 1vivado hls 简介简介 xilinx vivado high-level synthesis (hls) 工具将 c, c+,或者

3、 systemc 设计规范，算 法转成 register transfer level （rtl）实现，可综合到xilinx fpga。 将dsp算法快速转到rtl fpga 实现 将c 至 rtl时间缩短 4 倍 基于 c 语言的验证时间缩短100倍 rtl 仿真时间缩短 3 倍 author: george wangdocument number: date document revision: page 4 of 15 revision: 1.0 2创建一个创建一个vivado-hls工程工程 2.1打开vivado hls gui 双击桌面上vivado hls gui 图标， 或从s

4、tart all programs vivado vivado hls gui 打开gui之后，vivado-hls welcome界面如下所示： author: george wangdocument number: date document revision: page 5 of 15 revision: 1.0 2.2创建新工程 在 welcome page, 选择create new project author: george wangdocument number: date document revision: page 6 of 15 revision: 1.0 2.3添加源

5、文件 指定顶层需要综合的源文件名,并添加文件. 本除法器设计采用移位算法 #include radix2div.h quotient_t radix2div ( dividend_t dividend, / (numerator) divisor_t divisor, / (denominator) remainder_t *remainder / ) #pragma ap latency max=3 #pragma ap pipeline author: george wangdocument number: date document revision: page 7 of 15 revi

6、sion: 1.0 quotient_i_t quo, y; / +1 bits unsigned 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 - d

7、ivisor; y = dividend if ( y = 0 ) next_bit = 0; else next_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 positive quo = quo 1; quo = quo | 1; if (i != loop_max-1) rem_r = sub

8、_out 1; rem_r = rem_r | next_bit; else rem_r = sub_out; / end for *remainder = rem_r; return quo; author: george wangdocument number: date document revision: page 8 of 15 revision: 1.0 2.4添加测试文件 添加测试文件. #include #include #include radix2div.h / quotient_t radix2div ( dividend_t dividend, / (numerator

9、) divisor_t divisor, / (denominator) remainder_t *remainder / author: george wangdocument number: date document revision: page 9 of 15 revision: 1.0 ); / int test_divider (dividend_t dividend, divisor_t divisor ) quotient_t quotient; remainder_t remainder; quotient = radix2div(dividend,divisor, fprintf(stdout, dividend = %u, divisor = %u quotient = %u remainder = %u n, dividend, divisor, quotient, remainder); fprintf(stdout, - n); if (quotient = dividend/divisor) else printf (fail n)