Skip to main content
Have a personal or library account? Click to login
New Self-Checking Booth Multipliers Cover

References

  1. Al-Twaijry H. A. and Flynn M. J. (1995). Performance/area tradeoffs in Booth multipliers,, Stanford University.
  2. Booth A. D. (1951). A signed binary multiplication technique,(2): 236-240.
  3. Goessel M. and Graf F. (1993)., McGraw-Hill, London.
  4. Gorshe S. S. and Bose B. (1996). A self-checking ALU design with efficient codes,, IEEE Computer Society, Washington, DC, USA, p. 157.
  5. Hsiao M. and Sellers F. (1963). The carry dependent sum adder,,: 265-268.
  6. Hunger M. (2006). Self-checking Booth-3 multiplier,, Zielona Góra, Poland.
  7. Lala P. (Ed.) (2001)., Morgan Kaufmann Publishers Inc., San Francisco, CA.
  8. Lo J. C., Thanawastien S. and Rao T. R. N. (1993). Berger check prediction for array multipliers and array dividers,(7): 892-896.
  9. Marienfeld D., Sogomonyan E. S., Ocheretnij V. and Gossel M. (2004). A new self-checking multiplier by use of a code-disjoint sum-bit duplicated adder,, IEEE Computer Society, Washington, DC, USA, pp. 30-35.
  10. Marienfeld D., Sogomonyan E. S., Ocheretnij V. and Gossel M. (2005). New self-checking output-duplicated booth multiplier with high fault coverage for soft errors,, IEEE Computer Society, Los Alamitos, CA, USA, pp. 76-81.
  11. Nicolaidis M. and Duarte R. O. (1998). Design of fault-secure parity-prediction booth multipliers,, IEEE Computer Society, Washington, DC, USA, pp. 7-14.
  12. Nicolaidis M., Duarte R. O., Manich S. and Figueras J. (1997). Fault-secure parity prediction arithmetic operators,(2): 60-71.
  13. Ocheretnij V., Sogomonya E. S. and Goessel M. (2001). A new code-disjoint sum-bit duplicated carry look-ahead adder for parity codes,, IEEE Computer Society, Los Alamitos, CA, USA, pp. 365.
  14. Parhami B. (2001)., Vol. 2: Presentation Material, Oxford University Press, Oxford.
  15. Shivakumar P., Keckler S. W., Kistler M., Burger D. and Alvisi L. (2002). Modeling the effect of technology trends on the soft error rate of combinatorial logic,, pp. 389-398.
  16. Sparmann U. and Reddy S. M. (1994). On the effectiveness of residue code checking for parallel two's complement multipliers,, IEEE Computer Society Press, Austin, TX, USA, pp. 219-229.
  17. Sulistyo J. B. and Ha D. S. (2002). A new characterization method for delay and power dissipation of standard cells,(3): 667-678.
DOI: https://doi.org/10.2478/v10006-008-0029-4 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 319 - 328
Published on: Oct 6, 2008
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2008 Marc Hunger, Daniel Marienfeld, published by University of Zielona Góra
This work is licensed under the Creative Commons License.