Provided by: International Journal of Computer & Organization Trends(IJCOT)
Interval arithmetic provides reliability and accuracy by computing a lower and upper bound in which result is guaranteed to reside. Concept of carry look ahead for 11 bit exponent adder is used which reduces the delay. Concept of carry save adder in array multiplication is used instead of half adders and full adders which reduces the number of gates and delay. 334140 kilobytes memory is required. 421.563 ns is the maximum critical path delay for 64 bit interval arithmetic array multiplier. 64 bit interval arithmetic array multiplier requires almost twice real time delay compared to 64 bit floating point array multiplier.