
參考文獻 [1]S.F. Oberman and M.J. Flynn, “Division Algorithms and Implementations,” IEEE Trans. on Computers, vol. 46, no. 8, Aug. 1997, pp. 833854. [2]S.F. Oberman and M.J. Flynn, “Minimizing the Complexity of SRT Tables,” IEEE Trans. on VLSI, vol. 6, no. 1, Mar. 1998, pp. 141149. [3]J.E. Robertson, “A New Class of Digital Division Methods,” IRE Trans. on Electronic Computers, vol. 7, Sep. 1958, pp. 218222. [4]T.D. Tocher, “Techniques of Multiplication and Division for Automatic Binary Computers,” Quarterly J. Mech. App. Math., vol. 2, pt. 3, 1958, pp. 364384. [5]A. Svoboda, “An Algorithm for Division,” Information Processing Machines, vol. 9, Mar. 1963, pp. 183190. [6]C. Tung, “A Division Algorithm for SignedDigit Arithmetic,” IEEE Trans. on Computers, vol. 17, Sep. 1968, pp. 887889. [7]D.E. Atkins, “HigherRadix Division Using Estimates of The Divisor and Partial Remainders,” IEEE Trans. on Computers, vol. 17, no. 10, Oct. 1968, pp. 933937. [8]M.D. Ercegovac, T. Lang, and P. Montuschi, “Very High Radix Division with Selection by Rounding and Prescaling,” Proc. 11th IEEE Symp. Computer Arithmetic, July 1993, pp. 112119. [9]A. Avizienis, “Signed Digit Number Representation for Fast Parallel Arithmetic,” IRE Trans. on Electronic Computers, vol. 10, Sep. 1961, pp. 389400. [10]S.F. Oberman and M.J. Flynn, “Design Issues in Division and Other FloatingPoint Operations,” IEEE Trans. on Computers, vol. 46, no. 2, Feb. 1997, pp.154161. [11]L.A. Montalvo, K.K. Parhi, and A. Guyot, “New SvobodaTung Division,” IEEE Trans. on Computers, vol. 47, no. 9, Sep. 1998, pp. 10141020. [12]H.R. Srinivas and K.K. Parhi, “A Fast Radix4 Division Algorithm and Its Architecture,” IEEE Trans. on Computers, vol. 44, no. 6, June 1995, pp. 826831. [13]H.R. Srinivas, K.K. Parhi, and L.A, Montalvo, “Radix 2 Division with OverRedundant Quotient Selection,” IEEE Trans. on Computers, vol. 46, no. 1, Jan. 1997, pp. 8592. [14]N. Burgess, “Prescaled MaximallyRedundant Radix4 SRT Divider,” Electronics Letters, vol. 30, no. 23, Nov. 1994, pp. 19261928. [15]M.D. Ercegovac and T. Lang, “Simple Radix4 Division with Operands Scaling,” IEEE Trans. on Computers, vol. 39, no. 9, Sep. 1990, pp. 12041208. [16]M.D. Ercegovac, T. Lang, and P. Montuschi, “VeryHigh Radix Division with Prescaling and Selection by Rounding,” IEEE Trans. on Computers, vol. 43, no. 8, Aug. 1994, pp. 909918. [17]“IEEE Standard for Binary Floating Point Arithmetic,” ANSI/IEEE Standard 7541985, IEEE Computer Society, 1987. [18]P. Montuschi and L. Ciminiera, “OverRedundant Digit Sets and the Design of DigitbyDigit Units,” IEEE Trans. on Computers, vol. 43, no. 3, Mar. 1994, pp. 269279. [19]P. Montuschi and L. Ciminiera, “Design of a Radix4 Division Unit with Simple Selection Table,” IEEE Trans. on Computers, vol. 41, no. 12, Dec. 1992, pp. 16061611. [20]S. Kuninobu, H.E.T. Nishiyama, T. Tanaguchi, and N. Takagi, “Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation,” Proc. 8th Symp. Computer Arithmetic, Como, Italy, 1987, pp. 8086. [21]M.D. Ercegovax and T. Lang, Division and Square Root. Norwell, Mass.: Kluwer Academic, 1994. [22]N. Burgess, “A Fast Division Algorithm for VLSI,” in Proc. IEEE Int’l Conf. Computer Design: VLSI in Computers and Processors, Boston, Oct. 1991, pp. 560563. [23]J.S. Chiang and M.S. Tsai, “A Radix4 New SvobotaTung Divider with Constant Timing Complexity for Prescaling,” Kluwer Academic, vol. 33, no. 12, Jan. 2003, pp.117124. [24]M.C. Mekhallalati and M.K. Ibrahim, “New High Radix MaximallyRedundant Signed Digit Adder,” IEEE International Symp. on Circuit and System, vol. 1, June 1999, pp. 459462. [25]A. Nannarelli and T. Lang, “LowPower Division: Comparison among Implementation of Radix 4, 8 and 16,” 14th IEEE Symp. on Computer Arithmetic, 1999, pp. 60. [26]A. Nannarelli and T. Lang, “LowPower Radix8 Divider,” Proc. of International Conference on Computer Design, Oct. 1998, pp. 420426. [27]M.S. Tsai, “The Design and Implementation of a High Speed Radix4 Carry Free Division Architecture,” Master Thesis, Tamkang University, June, 2000. [28]S.C. Tsai, “Design of a Fast Radix8 Divider with Operands Scaling,” Master Thesis, National Chung Hsing University, June, 1998. [29]J.R. Huag, “High Performance Radix8 Divider,” Master Thesis, National Tsing Hua University, May, 1997. [30]C.H. Liu, “A Comparative Study of Short WordLength FixedPoint, FloatingPoint, and LNS Arithmetic Units,” Master Thesis, Feng Chia University, June, 2005. [31]M. Flynn, “On Division by Functional Iteration,” IEEE Transactions on Computers, Aug. 1970, pp. 702706. [32]D.L. Flower and J.E. Smith, “An Accurate High Speed Implementation of Division by Reciprocal Approximation,” Proc. 9th Symp. on Computer Arithmetic, 1989, pp. 6067. [33]Y.L. Chen, “Design of a Fast SignedDigit Divider for FloatingPoint Arithmetic,” Master Thesis, Feng Chia University, June, 2000. [34]C.L. Wey and C.P. Wang, “Design of A Fast Radix4 SRT Divider and Its VLSI Implementation,” IEEE Proc. Comput. Digit. Tech., vol. 146, no. 4, July 1999, pp. 205210. [35]T. Coe, T. Mathisen, C. Moler and V. Pratt, “Computational Aspects of the Pentium Affair,” IEEE Computational Science and Engineering, Mar. 1995, pp. 1831. [36]T.H. Pan, H.S. Kay, Y. Chun and C.L. Wey, “HighRadix SRT Division with Speculation of Quotient Digits,” IEEE International Conference on Computer Design (ICCD''95)., Oct. 1995, pp. 479484. [37]M.A. Thornton, “Signed Binary Addition Circuitry with Inherent Even Parity Outputs,” IEEE Trans. on Computers, vol. 46, no. 7, July 1997, pp. 811816. [38]B. Parhami, “Generalized SignedDigit Number Systems: A Unifying Framework for Redundant Number Representations,” IEEE Trans. on Computers, vol. 39, no. 1, Jan. 1990, pp. 8998. [39]T. Carter and J. Robertson, “Radix16 SignedDigit Division,” IEEE Trans. on Computers, vol. 39, no. 12, Dec. 1990, pp. 14241433. [40]S.F. Anderson, J.G. Earle, R.E. Goldschmidt, and D.M. Powers, “The IBM System/360 Model 91:FloatingPoint Execution Unit,” IBM J. Research and Development, vol. 11, Jan. 1967, pp. 3452. [41]R.E Goldschmidt, “Applications of Division by Convergence,” Master Thesis, Dept. of Electrical Eng., Massachusetts Inst. Of Technology, June 1964. [42]P. Soderquist and M. Leeser, “Area and Performance Tradeoffs in FloatingPoint Divide and SquareRoot Implementation,” ACM Computing Surveys, vol. 28, no. 3, 1996, pp. 518564. [43]T.J. Kwon, J.S. Moon, Jeff Sondeen and Jeff Draper, “A 0.18mm Implementation of a FloatingPoint Unit for a ProcessingInMemory System,” IEEE International Symp. on Circuit and System, vol. 2, May 2004, pp. 453456. [44]X. Wang and B.E. Nelson, “Tradeoffs of Designing FloatingPoint Division and Square Root on Virtex FPGAs,” Proc. 11th Annual IEEE Symposium on FieldProgrammable Custom Computing Machines, vol. 2, Apr. 2003, pp. 195203. [45]P. Montuschi and T. Lang, “Boosting VeryHigh Radix Division with Prescaling and Selection by Rounding,” IEEE Trans. on Computers, vol. 50, no. 1, Jan. 2001, pp. 1327. [46]J.S. Moon, T.J. Kwon, J. Sondeen and J. Draper, “An AreaEfficient StandardCell FloatingPoint Unit Design for a ProcessingInMemory System,” Proc. of the Conference on European SolidState Circuits, Sep. 2003, pp. 5760. [47]E. Rice and R. Hughey, “A New Iterative Structure for Hardware Division: The Parallel Paths Algorithm,” 16th IEEE Symposium on Computer Arithmetic (ARITH’03), June 2003, pp. 5462. [48]A.A. Liddicoat and M.J. Flynn, “HighPerformance Floating Point Divide,” Euromicro Symposium on Digital Systems Design (DSD''01), Sept. 2001, pp. 354361. [49]E. Antelo, T. Lang, P. Montuschi and A. Nannarelli, “DigitRecurrence Dividers with Reduced Logical Depth,” IEEE Transactions on Computers, vol. 54, no. 7, July 2005, pp. 837851.
