2021 31st International Conference on Field-Programmable Logic and Applications (FPL) 2021
DOI: 10.1109/fpl53798.2021.00011
|View full text |Cite
|
Sign up to set email alerts
|

An FPGA-based MobileNet Accelerator Considering Network Structure Characteristics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Each PE undertakes a convolution computation, limiting the parallelism on sliding input windows' dimensions, such as channel dimension or vector dimension. Previous works [7], [8] designed configurable adder trees to support different convolutions and exploit the inherent parallelism in convolutions. The reconfigurable adder tree can be reconfigured to process x additions, each adding y input data simultaneously, making it compatible with the parallelism in various convolutions.…”
Section: A Architecture Overviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Each PE undertakes a convolution computation, limiting the parallelism on sliding input windows' dimensions, such as channel dimension or vector dimension. Previous works [7], [8] designed configurable adder trees to support different convolutions and exploit the inherent parallelism in convolutions. The reconfigurable adder tree can be reconfigured to process x additions, each adding y input data simultaneously, making it compatible with the parallelism in various convolutions.…”
Section: A Architecture Overviewmentioning
confidence: 99%
“…They have high computational complexity and tremendous parameters, leading to a large memory footprint and power budget and are difficult to be deployed on resource-constrained platforms. DNN compression methods [4] and dedicated, efficient hardware accelerators [5], [6], [7], [8] were explored to deal with this problem. Network compression methods include data quantization [9], [10], sparsity exploration [11], [12], and compact model design [13], [14].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Prior works have shown that FPGAs offer attractive performance and power efficiency for DNN inference applications [1], [2], [3], [4]. For mapping a DNN model to an FPGA, the quantization of weights and activations is the key optimization.…”
Section: Introductionmentioning
confidence: 99%