Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
- 137 Downloads
This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, suitable for fast and area-efficient FPGA implementation. It is based on a piecewise linear approximation methodology, implemented so that an arbitrary number of linear segments approximate the logarithm function. The achieved approximation accuracy depends on the number of segments used, which also affects the size of a ROM used for storing the parameters that control the computation. The implementation of the ROM using an FPGA BlockRAM allows the parameters to be updated without reconfiguration of the FPGA core. This provides the considerable advantage of data set adaptability to the proposed architecture over the other relevant architectures, as the parameters can be easily updated to minimize the approximation error for different data sets. Both real and synthetic datasets have been used for evaluation purposes. The results show that ALA adapts well to all data sets used and requires significantly less FPGA slices than the CORDIC architecture to achieve the same or higher approximation accuracy. Moreover, it provides a throughput of one result per cycle and up to four times lower latency than the CORDIC core.
KeywordsField programmable gate arrays Digital design
This work was realized under the framework of the Reinforcement Program of Human Research Manpower (“PENED 2003”—03ED324), co-funded by the General Secretariat for Research and Technology, Greece, and the European Social Fund.
- 1.Bariamis, D., Iakovidis, D. K., Maroulis, D. (2006) Dedicated hardware for real-time computation of second-order statistical features for high resolution images. Lecture Notes in Computer Science, Volume 4179 LNCS, pp. 67-77.Google Scholar
- 6.Detrey, J., de Dinechin, F. (2009) Parametrized floating-point logarithm and exponential functions for FPGA. Microprocessors Microsystems.Google Scholar
- 7.Pineiro, J.-A., Ercegovac, M. D., Bruguerax, J. D. (2002) High–Radix Logarithm with Selection by Rounding. Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP02, 101–110.Google Scholar
- 8.Starzyk, J.A., Guo, Y. (2001) An entropy-based learning hardware organization using FPGA, in Proc. Southeastern Symposium on System Theory (pp. 1–5), Athens, OH.Google Scholar
- 11.SanGregory, S. L., Siferd, R. E., Brother, C., Gallagher, D. (1999) A Fast, Low-Power Logarithm Approximation with CMOS VLSI Implementation. Proc. IEEE Midwest Symp. Circuits and Systems.Google Scholar
- 17.Walther, J. S. (1971). A unified algorithm for elementary functions. in Proceedings of the 38th Spring Joint Computer Conference (pp. 379–385).Google Scholar
- 18.Xilinx LogiCORE CORDIC v3.0 Product Specification DS249, Xilinx Inc., 2005Google Scholar
- 19.Stanford MicroArray Database: http://smd.stanford.edu/