Skip to main content

Data representation and computer arithmetic

  • Chapter
Theory and Design of Digital Computer Systems
  • 149 Accesses

Abstract

We have said that the underlying principle of the stored-program computer is that a sequence of instructions contained in the memory in binary form is executed one by one. Programs written into the machine as groups of binary digits, such as the examples in Chapter 1, are called machine-code programs. Programs are very rarely written in this way since it is a tedious process leading to mistakes and making changes difficult. Fortunately, higher-level programming methods are available. They use high-level languages and programs written in one of these have to be compiled (translated) into machine code before they can be run. We shall consider them later.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Bibliography

  1. Lewin, D.L. and Protheroe, D. (1992) Design of Logic Systems 2nd edition. Chapman & Hall, London.

    Google Scholar 

  2. Wilkinson, B.R. (1987) Digital System Design ,Prentice-Hall International (UK).

    Google Scholar 

  3. Stephens, G. (1989) The what and how of CRCs. Electronics and Wireless World ,September.

    Google Scholar 

  4. Peterson, W.W. and Weldon, E.J. (1972) Error-Correcting Codes ,John Wiley, New York.

    MATH  Google Scholar 

  5. McCluskey, E.J. (1986) Logic Design Principles ,Prentice-Hall.

    Google Scholar 

  6. Hamming, R.W. (1950) Error-detecting and error-correcting codes. Bell System Technical Journal ,29, 147–60.

    MathSciNet  Google Scholar 

  7. Sterbenz, P.H. (1974) Floating-Point Computation ,Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  8. Stevenson, D. (1981) A proposed standard for binary floating-point arithmetic. IEEE Computer ,14 (3), March, 51–62.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1992 The Estate of Douglas Lewin and David Noaks

About this chapter

Cite this chapter

Lewin, D., Noaks, D. (1992). Data representation and computer arithmetic. In: Theory and Design of Digital Computer Systems. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1576-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-1576-6_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-412-42880-7

  • Online ISBN: 978-94-011-1576-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics