DocumentCode
3288748
Title
On-the fly algorithms and sequential machines
Author
Ougn, Chris Ti ane Fr
Author_Institution
LIAFA, Paris, France
fYear
1997
fDate
6-9 Jul 1997
Firstpage
260
Lastpage
265
Abstract
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 the conversion of redundant into conventional representations and to canonical Booth recoding are given. The author also indicates some applications to negative or complex radix number systems
Keywords
algorithm theory; computability; finite state machines; redundant number systems; canonical Booth recoding; complex radix number systems; data processing; finite register number; function computability; most significant digit first method; negative radix number systems; on-the-fly algorithm; redundant-conventional representation conversion; sequential machines; subsequential finite state machine; Application software; Automata; Concurrent computing; Digital arithmetic; Propagation delay; Registers; Storage automation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic, 1997. Proceedings., 13th IEEE Symposium on
Conference_Location
Asilomar, CA
ISSN
1063-6889
Print_ISBN
0-8186-7846-1
Type
conf
DOI
10.1109/ARITH.1997.614903
Filename
614903
Link To Document