loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97)
On-the-Fly Algorithms and Sequential Machines
Asilomar, CA
March 06-March 09
ISBN: 0-8186-7846-1
Christiane Frougny, L.I.A.F.A (L.I.T.P.)
It is shown that a function is computable by an on-the-fly algorithm processing data in the most significant digit first fashion with a finite number of registers if and only if it is computable by a right subsequential finite state machine processing data in the less significant digit first fashion. Applications to conversion of redundant into conventional representations and to the canonical Booth recoding are given. We also indicate some applications to negative or complex radix number systems.
Index Terms:
on-line arithmetic, on-the-fly algorithms, subsequential finite state machine.
Citation:
Christiane Frougny, "On-the-Fly Algorithms and Sequential Machines," arith, pp.260, 13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.