|
[1] J.M. Muller, “A Few Results on Table-Based Methods,” Reliable Computing, Vol. 5, No. 3, pp. 279-288, Aug. 1999. [2] M.J. Schulte and J.E. Stine, “Symmetric Bipartite Tables for Accurate Function Approximation,” Proc. 13th Symp. Computer Arithmetic, pp. 175-183, 1997. [3] J.E. Stine and M.J. Schulte, “The Symmetric Table Addition Method for Accurate Function Approximation,” J. VLSI Signal Processing Systems for Signal Image and Video Technology, vol. 21, pp. 167-177, 1999. [4] M.J. Stine and J.E. Stine, “Approximating Elementary Functions with Symmetric Bipartite Tables,” IEEE Transactions on Computers, vol. 48, no. 8, pp. 842-847, Aug. 1999. [5] F-d Dinechin and A. Tisserand, “Some Improvements on Multipartite Table Methods,” Proc. 15th IEEE Symp. Computer Arithmetic, pp. 128-135, 2001. [6] F-d Dinechin and A. Tisserand, “Multipartite Table Method,” IEEE Transactions on Computers, vol. 54, no. 3, pp. 319-330, Mar. 2005. [7] T.B. Jung, S.F. Hsiao, and M.J. Tsai, “Para-CORDIC: Parallel CORDIC rotation algorithm,” IEEE Transactions on Circuits and System-I, vol. 51, no. 8, pp. 1515-1524, Aug. 2004. [8] E. Antelo and J. Villalba, “Low Latency Pipelined Circular CORDIC,” Proc. 17th IEEE Symp. Computer Arithmetic, pp. 280-287, 2005. [9] E. Antelo, J. Villalba, and E.L. Zapata, “Low-Latency Pipelined 2D and 3D CORDIC Processors,” IEEE Transactions on Computers, vol. 57, no. 3, pp.404-417, Mar. 2008. [10] M.J. Schulte and E.E. Swartzlander, “Hardware Designs for Exactly Rounded Elementary Functions,” IEEE Transactions on Computers, vol. 43, no. 8, Aug. 1994. [11] J. Cao, B. Wei, and J. Cheng, “High-Performance Architectures for Elementary Function Generation,” Proc. 15th IEEE Symp. Computer Arithmetic, pp. 136-144, 2001. [12] J.A. Pineiro, J.D. Bruguera, and J.M. Muller, “Faithful Powering Computation Using Table Look-Up and Fused Accumulation Tree,” Proc. IEEE 15th Symp. Computer Arithmetic, pp. 40-47, 2001. [13] J.M. Muller, “Partially rounded Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods,” Proc. IEEE 16th Symp. Computer Arithmetic, pp. 1-8, 2003. [14] E.G. Walters-III and M.J. Schulte, “Efficient Function Approximation Using Truncated Multipliers and Squarers,” Proc. IEEE 17th Symp. Computer Arithmetic, 2005. [15] J.A. Pineiro, J.M. Muller, and J.D. Bruguera, “High-Speed Function Approximation Using a Minimax Quadratic Interpolator,” IEEE Transactions on Computers, vol. 54, no. 3, pp. 304-318, Mar. 2005. [16] D-U Lee, W. Luk, J. Villasenor, and P.Y.K. Cheung, “Hierarchical Segmentation Schemes for Function Evaluation,” Proc. IEEE Conf. Field-Programmable Technology, pp. 92-99, Dec. 2003. [17] D-U Lee, W. Luk, J. Villasenor, and P.Y.K. Cheung, “Non-uniform Segmentation for Hardware Function Evaluation,” Proc. 11th Int’l Conf. Field Proframmable Logic and Applications, pp. 796-807, Sept. 2003. [18] T. Sasao, S. Nagayama, and J.T. Butler, “Numerical Function Generators Using LUT Cascades,” IEEE Transactions on Computers, vol. 56, no. 6, June 2007. [19] D-U Lee, R.C.C Cheung, W. Luk, and J.D. Villasenor, “Hardware Implementation Trad-Offs of Polynomial Approximations and Interpolations,” IEEE Transactions on Computers, vol. 57, no. 5, May 2008. [20] D-U Lee, A.A. Gaffar, O. Mencer, and W. Luk, “Adaptive Range Reduction for Hardware Function Evaluation,” Proc. IEEE Int’l Conf. Field-Programmable Technology, pp.169-176, 2004. [21] D-U Lee, A.A. Gaffar, O. Mencer, and W. Luk, “Optimizing Hardware Function Evaluation,” IEEE Transactions on Computers, vol. 54, no. 12, Dec. 2005. [22] Behroox Parhami, Computer Arithmetic (Algorithms and Hardware Designs), Oxford University Press, 2000 [23] L-D. Van and C.C. Yang, “Generalized Low-Error Area-Efficient Fixed-Width Multipliers,” IEEE Transactions on Circuits and System-I, vol. 52m no. 8, Aug. 2005. [24] K.C. Bickerstaff, M.J. Schulte, and E.E. Swartzlander,Jr., “Reduced Area Multipliers,” Proceedings 1993 Application Specific Array Processors, pp. 478-489, 1993.
|