Compiling ATR Probing Codes for Execution on FPGA Hardware

13 years 9 months ago

Download www.cs.colostate.edu

This paper describes the implementation of an automatic target recognition ATR Probing algorithm on a recon gurable system, using the SA-C programming language and optimizing compiler. The recon gurable system is 800 times faster than a comparable Pentium running a C implementation of the same probing task. The reasons for this are analyzed.

A. P. Wim Böhm, J. Ross Beveridge, Bruce A. D

Real-time Traffic

Automatic Target Recognition | FCCM 2002 | Probing Task | Recon Gurable System | VLSI |

claim paper

» Performance Study of a CompilerHardware Approach to Embedded Systems Security

» Efficient hardware code generation for FPGAs

» CAPSULE HardwareAssisted Parallel Execution of ComponentBased Programs

» Compiling PCRE to FPGA for accelerating SNORT IDS

» FCUDA Enabling efficient compilation of CUDA kernels onto FPGAs

» Compiler generated systolic arrays for wavefront algorithm acceleration on FPGAs

» Modular Compilation of a Synchronous Language

» Reactive parallel processing for synchronous dataflow

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	FCCM
Authors	A. P. Wim Böhm, J. Ross Beveridge, Bruce A. Draper, Charlie Ross, Monica Chawathe, Walid A. Najjar

Comments (0)

Sciweavers

Compiling ATR Probing Codes for Execution on FPGA Hardware

Automatic Target Recognition | FCCM 2002 | Probing Task | Recon Gurable System | VLSI |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers