Paper
29 December 1999 VHDL design optimization for two-dimensional filters
Nelson Luiz Passos, Jian Song, Robert P. Light, Ranette Halverson, Richard P. Simpson
Author Affiliations +
Proceedings Volume 3970, Media Processors 2000; (1999) https://doi.org/10.1117/12.375245
Event: Electronic Imaging, 2000, San Jose, CA, United States
Abstract
Multi-dimensional applications, such as image processing and seismic analysis, usually require the high computer performance obtained from the implementation of Application Specific Integrated Circuits (ASICs). The critical sections of such applications consist of nested loops with the possibility of embedded conditional branch instructions. Current commercial systems use branch predication techniques, which can also be applied in the design of ASIC systems. Those techniques utilize predicate registers to control the validity of computed results. The optimized design and allocation of such registers becomes then a significant factor in the performance of the system. By using branch prediction to transform control dependencies in data dependencies, the application of a multi-dimensional retiming to an MDFG permit the iterations of the original loop body to be naturally overlapped, making the existent parallelism explicit. Based on the retiming information, predicate registers are designed as shift registers that allow the correct execution of the filter function.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nelson Luiz Passos, Jian Song, Robert P. Light, Ranette Halverson, and Richard P. Simpson "VHDL design optimization for two-dimensional filters", Proc. SPIE 3970, Media Processors 2000, (29 December 1999); https://doi.org/10.1117/12.375245
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Clocks

Image processing

Edge detection

Filtering (signal processing)

Sensors

Image filtering

Legal

Back to Top