Proceedings Article10.1109/FPL.2008.4629984
Numerical function generators using bilinear interpolation
Shinobu Nagayama,Tsutomu Sasao,Jon T. Butler +2 more
- 23 Sep 2008
- pp 463-466
TL;DR: Experimental results show that the bilinear interpolation method can significantly reduce the memory size needed for two-variable functions, and the speed of NFGs based on the bil inear method is comparable to that of N FGs basedon tangent plane approximation.
read more
Abstract: Two-variable numerical functions are widely used in various applications, such as computer graphics and digital signal processing. Fast and compact hardware implementations are required. This paper introduces the bilinear interpolation method to produce fast and compact numerical function generators (NFGs) for two-variable functions. This paper also introduces a design method for symmetric two-variable functions. This method can reduce the memory size needed for symmetric functions by nearly half with small speed penalty. Experimental results show that the bilinear interpolation method can significantly reduce the memory size needed for two-variable functions, and the speed of NFGs based on the bilinear method is comparable to that of NFGs based on tangent plane approximation. For a complicated function, our NFG is faster and more compact than a circuit designed using a one-variable NFG.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On Modeling RCS of Aircraft for Flight Simulation
Björn Persson,Martin Norsell +1 more
TL;DR: High-resolution RCS matrices were used in an investigation of RCS matrix resolution, and an evaluation of different bilinear interpolation methods is presented, finding that the smallest RCS interpolation error was obtained using splines.
21
Programmable Architectures and Design Methods for Two-Variable Numeric Function Generators
TL;DR: Two planar segmentation algorithms that efficiently partition a domain of a two-variable function and a design method that can reduce the memory size needed for symmetric functions by nearly half with small speed penalty are introduced.
9
Programmable Architectures and Design Methods for Two-Variable Numeric Function Generators (IPSJ Transactions on System LSI Design Methodology Vol.3)
Shinobu Nagayama,Tsutomu Sasao,Jon T. Butler +2 more
- 01 Apr 2010
TL;DR: In this article, the authors propose programmable architectures and design methods for numeric function generators (NFGs) of two-variable functions, where a given domain of the function is partitioned into segments, and approximate the function by a polynomial in each segment.
8
A Design Method for Programmable Two-Variable Discrete Function Generators Using Spline and Bilinear Interpolations
Satoru Nakano,Yoichi Wakaba,Shinobu Nagayama,Shin'ichi Wakabayashi +3 more
- 31 Aug 2011
TL;DR: The proposed method can significantly reduce memory size needed to implement a two-variable discrete function by accepting a small approximation error, and thus it can be used to explore design space taking into account a trade-off between memory size and approximation error.
1
References
Approximating elementary functions with symmetric bipartite tables
TL;DR: In this paper, a high-speed method for function approximation that employs symmetric bipartite tables is presented, which uses less memory by taking advantage of symmetry and leading zeros in one of the two tables.
181
Edge-valued binary decision diagrams for multi-level hierarchical verification
Y.-T. Lai,S. Sastry +1 more
- 01 Jul 1992
TL;DR: It is shown that an EV is a compact and canonical representation for arbitrary integer functions that can be at a higher level than the implementation, and the variable ordering strategy can be derived from a hi her level functional specification instead of the gate fevel specification.
162
High-speed function approximation using a minimax quadratic interpolator
TL;DR: The use of an enhanced minimax approximation which takes into account the effect of rounding the polynomial coefficients to a finite size allows for a further reduction in the size of the look-up tables to be used, making the method very suitable for the implementation of an elementary function generator in state-of-the-art DSPs or graphics processing units (GPUs).
Hierarchical segmentation schemes for function evaluation
Dong-U Lee,Wayne Luk,John D. Villasenor,Peter Y. K. Cheung +3 more
- 15 Dec 2003
TL;DR: An algorithm to find the optimum number of segments and the placement of their boundaries is described, which is used to analyze the properties of a function and to benchmark out approach.
72
Numerical Function Generators Using LUT Cascades
TL;DR: The architecture is based on the lookup table (LUT) cascade, which results in a significant reduction in circuit complexity compared to traditional approaches, suitable for automatic synthesis and a synthesis method that converts a Matlab-like specification into an LUT cascade design is shown.