Skip to main content

Part of the book series: Communications and Control Engineering ((CCE))

  • 148 Accesses

Abstract

In classical analysis, the two Finite Word Length effects due, respectively, to coefficient truncation and to arithmetic roundoff are investigated separately. We have seen in Chapter 3 that, when the L1/L2 measure is adopted as a transfer function sensitivity measure, the realizations that minimize this L1/L2 measure are not the same as those that minimize the roundoff noise gain, G. However, under an l2 constraint on the states, the realizations that minimize G also minimize the upper bound of the L1/L2 measure. It is not clear what the connection might be — if any — between realizations that minimize the roundoff noise gain G (under l2 constraints) and those that minimize the more realistic L2 sensitivity measure.

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

Access this chapter

eBook
USD 16.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag London Limited

About this chapter

Cite this chapter

Gevers, M., Li, G. (1993). A synthetic sensitivity — roundoff design. In: Parametrizations in Control, Estimation and Filtering Problems: Accuracy Aspects. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-2039-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2039-1_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2041-4

  • Online ISBN: 978-1-4471-2039-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics