Hard-wiring interval arithmetic
Floating point arithmetic has become prevalent in virtually every scientific computation, yet suffers from rounding, truncation and catastrophic cancellation errors to the extent that the result may be completely inaccurate. Whilst modern processors do not have the capabilities to natively support i...
Main Author: | |
---|---|
Published: |
University of Ulster
2008
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.554235 |
id |
ndltd-bl.uk-oai-ethos.bl.uk-554235 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bl.uk-oai-ethos.bl.uk-5542352015-03-20T05:36:24ZHard-wiring interval arithmeticMalins, E. J.2008Floating point arithmetic has become prevalent in virtually every scientific computation, yet suffers from rounding, truncation and catastrophic cancellation errors to the extent that the result may be completely inaccurate. Whilst modern processors do not have the capabilities to natively support interval arithmetic, it can be implemented in software though such a method of implementation results in larger program size and often more than doubles execution times. Embedded systems do not have the luxury of utilising software implementations of interval arithmetic and so a hardware based alternative must be sought. This thesis examines the algorithms traditionally used for interval multiplication and proposes a new method, free of the caveats which plague traditional multiplication computation. The inherent parallelism of these algorithms is examined to determine their throughput and latency characteristics, given a selection of platforms which exhibit variations in the number of input buses, FPUs and result buses. A software implementation of each method of interval multiplication is described, alongside their relative performances. Given the data-dependant nature of interval computation and the current trend towards vector processing architectures, these software implementations include reformulations of both tradi- tional methods of interval multiplication to provide vectorisation of the software and thus completely eliminate branching. Realised as co-processors to the Altera Nios Il, this thesis describes the design decisions, specification, area requirements, power utilisation and per-cycle performance of hardware implementations of the brute-force, nine case and herein presented integer-based interval multipliers.571.42University of Ulsterhttp://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.554235Electronic Thesis or Dissertation |
collection |
NDLTD |
sources |
NDLTD |
topic |
571.42 |
spellingShingle |
571.42 Malins, E. J. Hard-wiring interval arithmetic |
description |
Floating point arithmetic has become prevalent in virtually every scientific computation, yet suffers from rounding, truncation and catastrophic cancellation errors to the extent that the result may be completely inaccurate. Whilst modern processors do not have the capabilities to natively support interval arithmetic, it can be implemented in software though such a method of implementation results in larger program size and often more than doubles execution times. Embedded systems do not have the luxury of utilising software implementations of interval arithmetic and so a hardware based alternative must be sought. This thesis examines the algorithms traditionally used for interval multiplication and proposes a new method, free of the caveats which plague traditional multiplication computation. The inherent parallelism of these algorithms is examined to determine their throughput and latency characteristics, given a selection of platforms which exhibit variations in the number of input buses, FPUs and result buses. A software implementation of each method of interval multiplication is described, alongside their relative performances. Given the data-dependant nature of interval computation and the current trend towards vector processing architectures, these software implementations include reformulations of both tradi- tional methods of interval multiplication to provide vectorisation of the software and thus completely eliminate branching. Realised as co-processors to the Altera Nios Il, this thesis describes the design decisions, specification, area requirements, power utilisation and per-cycle performance of hardware implementations of the brute-force, nine case and herein presented integer-based interval multipliers. |
author |
Malins, E. J. |
author_facet |
Malins, E. J. |
author_sort |
Malins, E. J. |
title |
Hard-wiring interval arithmetic |
title_short |
Hard-wiring interval arithmetic |
title_full |
Hard-wiring interval arithmetic |
title_fullStr |
Hard-wiring interval arithmetic |
title_full_unstemmed |
Hard-wiring interval arithmetic |
title_sort |
hard-wiring interval arithmetic |
publisher |
University of Ulster |
publishDate |
2008 |
url |
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.554235 |
work_keys_str_mv |
AT malinsej hardwiringintervalarithmetic |
_version_ |
1716793058778939392 |