A survey of CORDIC algorithms for FPGA based computers
FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Modern Control Engineering
Division and Square Root: Digit-Recurrence Algorithms and Implementations
Division and Square Root: Digit-Recurrence Algorithms and Implementations
Sum Versus Vote Fusion in Multiple Classifier Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
High-speed parameterisable Hough transform using reconfigurable hardware
VIP '01 Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11
Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Efficient VLSI architectures for fast computation of the discreteFourier transform and its inverse
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
This paper presents a method to improve the calculation of functions that demand a great amount of computing resources. The fundamentals argue for an increase of the computing power of the primitive level in order to decrease the number of computing levels required to carry out calculations. A weighted primitive substitutes the usual primitives sum and multiplication and calculates the function values by successive iterations. The parametric architecture associated to the weighted primitive is particularly suitable in the case of combined trigonometric functions sine and cosine involved in the calculation of image transforms. The Hough Transform (HT) and the Fourier Transform (FT) are analyzed under this scope, obtaining a good performance and trade-off between speed and area requirements when comparing with other well-known proposals.