loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second IEEE International Workshop on Electronic Design, Test and Applications
Optimization of Multipartite Table Methods to Approximate the Elementary Functions
Perth, Australia
January 28-January 30
ISBN: 0-7695-2081-2
ASCII Text
x 
 
Liu Huaping, Han Chengde, "Optimization of Multipartite Table Methods to Approximate the Elementary Functions," Electronic Design, Test and Applications, IEEE International Workshop on, pp. 261, Second IEEE International Workshop on Electronic Design, Test and Applications, 2004.
 
 
BibTex
x
 
@article{ 10.1109/DELTA.2004.10051,
author = {Liu Huaping and Han Chengde},
title = {Optimization of Multipartite Table Methods to Approximate the Elementary Functions},
journal ={Electronic Design, Test and Applications, IEEE International Workshop on},
volume = {0},
year = {2004},
isbn = {0-7695-2081-2},
pages = {261},
doi = {http://doi.ieeecomputersociety.org/10.1109/DELTA.2004.10051},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Electronic Design, Test and Applications, IEEE International Workshop on
TI - Optimization of Multipartite Table Methods to Approximate the Elementary Functions
SN - 0-7695-2081-2
SP
EP
A1 - Liu Huaping,
A1 - Han Chengde,
PY - 2004
KW - null
VL - 0
JA - Electronic Design, Test and Applications, IEEE International Workshop on
ER -
 
Liu Huaping, Institute of Computing Technology The Chinese Academy of Sciences, Beijing, China
Han Chengde, Institute of Computing Technology The Chinese Academy of Sciences, Beijing, China
This paper presents the optimized methodology of the table-lookup-and-addition methods to approximate the elementary functions. Compared to the previously published methods including SBTM, STAM and their improved method in the paper [1], our method uses three small look-up tables to replace the biggest look-up tables in the previous methods and shortens the number of address bits to some look-up tables in the previous methods to reduce the memory requirements significantly. For example, when both our method and the method in the paper [1] require the least number of bits, the compression ratio can reach to 1.57 using 16 bits operand for function 1/x. The data in this paper have been validated by using a set of C programs; and the designs have been synthesized with EDA tools.
Citation:
Liu Huaping, Han Chengde, "Optimization of Multipartite Table Methods to Approximate the Elementary Functions," delta, pp.261, Second IEEE International Workshop on Electronic Design, Test and Applications, 2004
Usage of this product signifies your acceptance of the Terms of Use.