2011 IEEE 6th International Design and Test Workshop (IDT) 2011
DOI: 10.1109/idt.2011.6123108
|View full text |Cite
|
Sign up to set email alerts
|

An area-efficient 2-D convolution implementation on FPGA for space applications

Abstract: The 2-D Convolution is an algorithm widely used in image and video processing. Although its computation is simple, its implementation requires a high computational power and an intensive use of memory. Field Programmable Gate Arrays (FPGA) architectures were proposed to accelerate calculations of 2-D Convolution and the use of buffers implemented on FPGAs are used to avoid direct memory access. In this paper we present an implementation of the 2-D Convolution algorithm on a FPGA architecture designed to suppor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7
2
1

Relationship

3
7

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…The frequency of the clock is set to 250MHz, and the first ten pixels of the input image are set to 1,2,3,4,5,6,7,8,9,10; then the rest pixels of the image are all set to 0. The first ten elements of the convolution kernel are all set to 1, the rest are all set to 0.…”
Section: Experiments Simulation Resultsmentioning
confidence: 99%
“…The frequency of the clock is set to 250MHz, and the first ten pixels of the input image are set to 1,2,3,4,5,6,7,8,9,10; then the rest pixels of the image are all set to 0. The first ten elements of the convolution kernel are all set to 1, the rest are all set to 0.…”
Section: Experiments Simulation Resultsmentioning
confidence: 99%
“…Since kernel factors have been internally represented through constants, 49 constant multipliers are instantiated. After that, an adder tree (similar to the one presented in [24]) adds the 49 multiplication results to produce the filtered pixel.…”
Section: Sa-femip Architecturementioning
confidence: 99%
“…The arithmetic stage performs the 7 × 7 matrix convolution using the MUL/ADD tree architecture, similar to the one presented in [43]. The tree executes 49 multiplications in parallel and then adds all 49 results.…”
Section: Fpga Subsystemmentioning
confidence: 99%