|
[1] Oehler, R.R., Blasgen, M.W., “IBM RISC System/6000: Architecture and Performance,” IEEE Micro Volume: 11 3 , June 1991 , Page(s): 14 -17, 56-62.[2] White, S.W., Hester, P.D., Kemp, J.W. and McWilliams, G.J., ”How Does Processor MHz Relate to End-User Performance? I. Pipelines and Functional Units,“ IEEE Micro Volume: 13 4 , Aug. 1993 , Page(s): 8 -16[3] White, S.W., Hester, P.D., Kemp, J.W. and McWilliams, G.J., ”How Does Processor MHz Relate to End-User Performance? II. Memory Subsystem and Instruction Set,“ IEEE Micro Volume: 13 5, Oct. 1993, Page(s): 79 —89.[4] Beaumont-Smith, A.; Burgess, N.; Lefrere, S.; Lim, C.C., “Reduced latency IEEE floating-point standard adder architectures,” Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on, Page(s): 35 -42[5] Jessani, R.M. and Putrino, M., “Comparison of Single- and Dual-pass Multiply-Add Fused Floating Point Units,” Computers, IEEE Transactions on Volume: 47 9, Sept. 1998, Page(s): 927 —937.[6] Santoro, M.R.; Bewick, G.; Horowitz, M.A., “Rounding algorithms for IEEE multipliers,” Computer Arithmetic, 1989, Proceedings of 9th Symposium on, Page(s): 176 -183[7] Beaumont-Smith, A.; Lim, C.-C., “Parallel prefix adder design,” Computer Arithmetic, 2001. Proceedings. 15th IEEE Symposium on, Page(s): 218 -225[8] Naofumi Takagi, Hiroto Yasuura and Shuzo Yajima, “High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree,” IEEE Transactions on Computer Volume, C-34, no. 9, Sept. 1985, Page(s): 789 - 796.[9] Y. HARATA et al., ”A High-Speed Multiplier Using a Redundant Binary Adder Tree,” IEEE Journal of Solid-State Circuit, vol. SC-22, Feb. 1987, Page(s): 28-33.[10] Suzuki, H., orinaka, H., akino, H., Nakase, Y., Mashiko, K. and Sumi, T., “Leading-Zero Anticipatory Logic for High-Speed Floating Point Addition,” Solid-State Circuits, IEEE Journal of Volume: 31 8, Aug. 1996 , Page(s): 1157 —1164.[11] Bruguera, J.D., Lang, T., “Leading-one prediction with concurrent position correction,” Computers, IEEE Transactions on, Volume: 48 Issue: 10, Oct. 1999, Page(s): 1083 -1097[12] Stouraitis, T. and Chen, C., ”Fast digit-parallel conversion of signed digit into conventional representations,” Electronics Letters Volume: 27 11, 23 May 1991, Page(s): 964 —965.[13] Chichyang Chen; Liang-An Chen; Jih-Ren Cheng, “Architectural design of a fast floating-point multiplication-add fused unit using signed-digit addition,” Digital Systems, Design, 2001. Proceedings. Euromicro Symposium on, Page(s): 346 -353[14] Neil Burgess, “The Flagged Prefix adder for Dual Additions,” in Proc. SPIC ASPAAI-7, volume 3461, San Diego, Jul. 1998, pages 567-575[15] Behrooz Parhami, Computer Arithmetic Algorithms and Hardware Designs, New York, Oxford, 2000.[16] Israel Koren, Computer Arithmetic Algorithm, Eaglewood Cliffs, New York, 1993.[17] Makino, H.; Nakase, Y., Suzuki, H., Morinaka, H., Shinohara, H., Mashiko, K., “An 8.8-ns 54x54-Bit Multiplier with High Speed Redundant Binary Architecture,” Solid-State Circuits, IEEE, Volume: 31 Issue: 6, June 1996, Page(s): 773 -783[18] IEEE standard for binary floating-point arithmetic, ANSI/IEEE 754-1985, also in Computer 14(Mar. 1981), 51-62.[19] Kayed, S.I.; Ragaie, H.F. “A new efficient design of the 2-to-1 multiplexer,” International Conference on Microelectronics, 1995, pages 817-822
|