Numerical Function Generators Using LUT Cascades
Authors:
- 30 April 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 56 (6) , 826-838
Abstract
This paper proposes an architecture and a synthesis method for high-speed computation of fixed-point numerical functions such as trigonometric, logarithmic, sigmoidal, square root, and combinations of these functions. Our architecture is based on the lookup table (LUT) cascade, which results in a significant reduction in circuit complexity compared to traditional approaches. This is suitable for automatic synthesis and we show a synthesis method that converts a Matlab-like specification into an LUT cascade design. Experimental results show the efficiency of our approach as implemented on a field-programmable gate array (FPGA)Keywords
This publication has 33 references indexed in Scilit:
- Optimizing Hardware Function EvaluationIEEE Transactions on Computers, 2005
- A Gaussian noise generator for hardware-based simulationsIEEE Transactions on Computers, 2004
- Non-uniform Segmentation for Hardware Function Evaluation2003
- Approximating elementary functions with symmetric bipartite tablesIEEE Transactions on Computers, 1999
- Fast evaluation of the elementary functions in single precisionIEEE Transactions on Computers, 1995
- Hardware designs for exactly rounded elementary functionsIEEE Transactions on Computers, 1994
- Interleaved memory function interpolators with application to an accurate LNS arithmetic unitIEEE Transactions on Computers, 1994
- A universal nonlinear component and its application to WSIIEEE Transactions on Components, Hybrids, and Manufacturing Technology, 1993
- Redundant CORDIC methods with a constant scale factor for sine and cosine computationIEEE Transactions on Computers, 1991
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica, 1973