Arithmetic - Signal Processing Systems - page 623

25. P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class
of recurrence equations,” IEEE Trans. Comput. , vol. 22, pp. 786-793, 1973.
26. I. Koren, Computer Arithmetic Algorithms , 2nd edition, A. K. Peters, Natick, MA, 2002.
27. R. E. Ladner and M. J. Fischer, “Parallel prefix computation,” J. ACM , vol 27, pp. 831-838.
Oct. 1980.
28. J. Liang and T. D. Tran, “Fast multiplierless approximations of the DCT with the lifting
scheme,” IEEE Trans. Signal Processing , vol. 49, no. 12, pp. 3032-3044, Dec. 2001.
29. Y.-C. Lim, “Single-precision multiplier with reduced circuit complexity for signal processing
applications,” IEEE Trans. Comput. , vol. 41, no. 10, pp. 1333-1336, Oct. 1992.
30. Y.-C. Lim, R. Yang, D. Li, and J. Song, “Signed power-of-two term allocation scheme for the
design of digital filters,” IEEE Trans. Circuits Syst. II , vol. 46, no. 5, pp. 577-584, May 1999.
31. B. Liu, “Effect of finite word length on the accuracy of digital filters - a review,” IEEE Trans.
Circuit Theory , vol. 18, pp. 670-677, Nov. 1971.
32. B. Liu and T. Kaneko, “Error analysis of digital filters realized with floating-point arithmetic,”
Proc. IEEE , vol. 57, pp. 1735-1747, Oct. 1969.
33. O. L. MacSorley, “High-speed arithmetic in binary computers,” Proc. IRE , vol. 49, no. 1,
pp. 67-91, Jan. 1961.
34. P. K. Meher, J. Valls, T.-B. Juang, K. Sridharan, and K. Maharatna, “50 years of CORDIC:
Algorithms, architectures and applications,” IEEE Trans. Circuits Syst. I , vol. 56, no. 9,
pp. 1893-1907, Sept. 2009.
35. Z.-J. Mou and F. Jutand, “'Overturned-Stairs' adder trees and multiplier design,” IEEE Trans.
Comput. , vol. 41, no. 8, pp. 940-948, Aug. 1992.
36. J.-M. Muller, Elementary Functions: Algorithms and Implementation , 2nd Edition, Birkhauser
Boston, 2006.
37. J.-M. Muller, N. Brisebarre, F. de Dinechin, C.-P. Jeannerod, V. Lefevre, G. Melquiond,
N. Revol, D. Stehle, and S. Torres, Handbook of Floating-Point Arithmetic ,Birkhauser Boston,
2010.
38. V. G. Oklobdzija, D. Villeger, and S. S. Liu, “A method for speed optimized partial product
reduction and generation of fast parallel multipliers using an algorithmic approach,” IEEE
Trans. Comput. , vol. 45, no. 3, Mar. 1996.
39. A. Omondi and B. Premkumar, Residue Number Systems: Theory and Implementation ,
Imperial College Press, 2007.
40. S. T. Oskuii, P. G. Kjeldsberg, and O. Gustafsson, “A method for power optimized partial
product reduction in parallel multipliers,” in Proc. IEEE Norchip Conf. , 2007.
41. B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs , 2nd edition, Oxford
University Press, New York, 2010.
42. N. Petra, D. De Caro, V. Garofalo, E. Napoli, and A. G. M. Strollo, “Truncated binary
multipliers with variable correction and minimum mean square error,” IEEE Trans. Circuits
Syst. I , 2010.
43. M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan, “Multiple constant multiplications:
efficient and versatile framework and algorithms for exploring common subexpression elimi-
nation,” IEEE Trans. Computer-Aided Design , vol. 15, no. 2, pp. 151-165, Feb. 1996.
44. M. P uschel, J. M. F. Moura, J. Johnson, D. Padua, M. Veloso, B. Singer, J. Xiong, F. Franchetti,
A. Gacic, Y. Voronenko, K. Chen, R. W. Johnson, and N. Rizzolo, “SPIRAL: Code generation
for DSP transforms,” Proc. IEEE , vol. 93, no. 2, pp. 232-275, Feb. 2005.
45. B. D. Rao, “Floating point arithmetic and digital filters,” IEEE Trans. Signal Processing ,
vol. 40, no. 1, pp. 85-95, Jan. 1992.
46. H. Samueli and A. N. Willson Jr., “Nonperiodic forced overflow oscillations in digital filters,”
IEEE Trans. Circuits Syst. , vol. 30, no. 10, pp. 709-722, Oct. 1983.
47. M. J. Schulte and J. E. Stine, “Approximating elementary functions with symmetric bipartite
tables,” IEEE Trans. Comput. , no. 8, vol. 48, pp. 842-847, Aug. 1999.
48. P. F. Stelling and V. G. Oklobdzija, “Design strategies for optimal hybrid final adders in a
parallel multiplier,” J. VLSI Signal Processing , vol. 14, no. 3, pp. 321-331, Dec. 1996.