文件列表:

LICENSE (1067, 2018-11-29)
hls (0, 2018-11-29)
hls\cat.jpg (140391, 2018-11-29)
hls\cnn.cpp (26202, 2018-11-29)
hls\cnn.h (909, 2018-11-29)
hls\coco.names (625, 2018-11-29)
hls\dog.jpg (163759, 2018-11-29)
hls\kite.jpg (1415684, 2018-11-29)
hls\labels (0, 2018-11-29)
hls\labels\100_0.png (320, 2018-11-29)
hls\labels\100_1.png (377, 2018-11-29)
hls\labels\100_2.png (451, 2018-11-29)
hls\labels\100_3.png (508, 2018-11-29)
hls\labels\100_4.png (577, 2018-11-29)
hls\labels\100_5.png (631, 2018-11-29)
hls\labels\100_6.png (697, 2018-11-29)
hls\labels\100_7.png (753, 2018-11-29)
hls\labels\101_0.png (321, 2018-11-29)
hls\labels\101_1.png (388, 2018-11-29)
hls\labels\101_2.png (458, 2018-11-29)
hls\labels\101_3.png (514, 2018-11-29)
hls\labels\101_4.png (581, 2018-11-29)
hls\labels\101_5.png (654, 2018-11-29)
hls\labels\101_6.png (726, 2018-11-29)
hls\labels\101_7.png (804, 2018-11-29)
hls\labels\102_0.png (305, 2018-11-29)
hls\labels\102_1.png (340, 2018-11-29)
hls\labels\102_2.png (354, 2018-11-29)
hls\labels\102_3.png (371, 2018-11-29)
hls\labels\102_4.png (398, 2018-11-29)
hls\labels\102_5.png (411, 2018-11-29)
hls\labels\102_6.png (422, 2018-11-29)
hls\labels\102_7.png (442, 2018-11-29)
hls\labels\103_0.png (333, 2018-11-29)
hls\labels\103_1.png (415, 2018-11-29)
hls\labels\103_2.png (521, 2018-11-29)
hls\labels\103_3.png (586, 2018-11-29)
... ...

# yolov2_xilinx_fpga A demo for accelerating YOLOv2 in xilinx's fpga PYNQ You can follow the step: HLS -> VIVADO -> PYNQ or just jump to PYNQ Every repo has some steps to help further evaluate or study. 2018/10/20: Nearly,we will use new architecture to optimize this design. 2018/11/29: The idea of new architecture has stopped, and we will further optimize this design until it can process nearly 1 FPS in PYNQ.(Actually, we have optimized our design, and tested YOLOv2 in Zedboard with only 1.27s in 150MHz, but the part of python in PYNQ still has some problems.) # Design and Optimization of YOLOv2 Accelerator Based on FPGA According to the analysis of the YOLOv2 network, most layers are serially processed, except for the routing layer. The routing layer can be implemented by setting a specific address in advance. From an accelerator perspective, the work required is to interact with memory in order (reading memory data, processing data, and then writing back memory data). Since the amount of data input and output is very large, loop tiling technique is always applied to reuse data and reduce memory access times, which tiles the convolution loop R, C, M, N to Tr, Tc, Tm ,Tn[8]. The overall architecture of the accelerator is shown below:  Similar to [4,5,8], the accelerator has two AXI4 master interfaces and one AXI4-Lite slave interface. AXI-Lite slave interface is responsible for reading and writing control, data and status register sets. The input feature maps and weights are read concurrently by two master interfaces, and the output feature maps are written back simultaneously through write channel. The Data Scatter module is designed to generate the corresponding write address and distribute the data read from the DRAM to the on-chip buffers. The Data Gather module is designed to generate the DRAM write-back address and write the data in the output buffer back to the DRAM. The other red modules are responsible for the processing of the convolutional layer (Conv and Leaky ReLU), the maximum pooling layer (Pool) and the reorg layer (Reorg). ## Weight Arrangement The effective FPGA bandwidth goes up with the increase of burst length and finally flattens out above some burst length threshold[7]. The data tiling technique usually results in a discontinuous DRAM access for the row-major data layout in DRAM. To reduce the number of memory accesses and increase the effective memory bandwidth, we arrange the kernel weights for an entire tile to a continuous block to ensure a high utilization of the bandwidth of external memory [3]. ## Parallel Convolution Engine The acceleration strategy of convolutional layer is similar to [5][6], which utilizes input and output parallelism to accelerate the computation. By designing multiple parallel multiplication units and add trees to achieve input parallelism (Tn parallelism) and output parallelism (Tm parallelism) in convolution calculation. The Tm*Tn multiplication units are calculated in parallel. The add trees of Log2 (Tn) depth are accumulated by pipeline, and generate the partial sums. ## Ping-Pong operation Similar to [8], the design implements ping-pong buffers to overlap the delay of reading input feature maps and weights, writing output feature maps and calculation, which greatly improves the dynamic utilization of the computing engines. # Evaulate Experiments show that floating point addition in HLS requires three DSP resources, floating point multiplication requires two DSPs; fixed point 16-bit multiplication requires one DSP, and fixed-point 16-bit addition can be implemented only using LUT. After placing and routing, resource consumptions of fixed-16 (Tn=2, Tm=32, Tr=26, Tc=26) are shown as follows: | Resource | DSP | BRAM | LUT | FF | Freq | | ----- | ----- | ----- | ----- | ----- | ----- | |Fixed-16(n2m32)| 106(48%) | 100(72%) | 27495(52%) | 30118(28%) | 130MHz | According to the current design, DSP and BRAM are more expensive. The cost of DSP can be further reduced (there are many bit-width redundant multiplications), and the BRAM cost can be reduced. (As Shen [1] said, BRAM allocates an exponential size of 2 in HLS. Actually, many BRAMs are redundant. ). The performance comparison in the two cases is shown in the following table: | Performance | | | ----- | ----- | |CNN models |YOLO v2 | |Board | PYNQ | |Clock(MHz) | 130 | |Precision |Fixed-16| |Power (W) | 2.71 | |Operations (GOP) |29.47 | |Performance(GOP/s) |11.39 | |Power Efficiency(GOP/s/W) | 4.20 | # Result  # References: [1] Maximizing CNN Accelerator Efficiency Through Resource Partitioning [2] PLACID: A Platform for FPGA-Based Accelerator Creation for DCNNs [3] Going Deeper with Embedded FPGA Platform for Convolutional Neural Network [4] DianNao A Small-Footprint High-Throughput Accelerator for Ubiquitous Machine-Learning [5] An Automatic RTL Compiler for High-Throughput FPGA Implementation of Diverse Deep Convolutional Neural Networks [6] A Dynamic Multi-precision Fixed-Point Data Quantization Strategy for Convolutional Neural Network [7] Caffeine: Towards Uniformed Representation and Acceleration for Deep Convolutional Neural Networks [8] Optimizing FPGA-based Accelerator Design for Deep Convolutional Neural Networks

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：