Abstract
Coding plays an important role in the design of parallel algorithms. When each digit of a result of a desired operation depends only on a part of digits of operands under a coding scheme, we say the operation is locally computable under the coding scheme. There is a closed relation between local computability and redundancy of codes. Several excellent algorithms utilizing local computability by redundant coding schemes are developed and used practically. The problem to examine the relation among coding schemes, local computability and algebraic structures of target operations is a basic problem on the design of parallel algorithms. In this paper, we discuss a relation between redundancy of coding schemes and local computability of unary operations defined on finite sets. We show that it is generally impossible to realize local computability by nonredundant coding schemes. If we introduce redundancy into coding, we can construct a coding under which every digit of a result depends only on 2 digits of an operand for any unary operations. These results are closely related with a state assignment problem of finite state machines. The above 2-locally computable coding derives a state assignment of a pipelined sequential circuit for an arbitrary sequential machine.
Preview
Unable to display preview. Download preview PDF.
References
Avizienis, A: Signed-Digit Number Representation for Fast Parallel Arithmetic, IRE Trans. Elec. Comput. vol.EC-10, no.3, pp.389–400, Sept. 1961.
Ladner, R.E. and Fischer, M.J.: Parallel Prefix Computation, J. of ACM, vol.27, no.4, pp.831–838, Oct.1980.
Spaniol, O.: Computer Arithmetic, John Wiley Sons, p.194 1981.
Takagi, N., Yasuura, H. and Yajima, S.: High-speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree, IEEE Trans. on Comput. vol.C-34, no.9, pp.789–796, Sept. 1985.
Unger S.H.: Tree Realization of Iterative Circuits, IEEE Trans. on Comput. vol.C-26, no.4, pp.365–383, April 1977.
Yasuura H., Takagi N. and Yajima, S.: Redundant Coding for Local Computation, in Discrete Algorithms and Complexity, Proceedings of the Japan-U.S. Joint Seminar, Academic Press, pp.145–159, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yasuura, H. (1991). Locally computable coding for unary operations. In: Yonezawa, A., Ito, T. (eds) Concurrency: Theory, Language, and Architecture. CONCURRENCY 1989. Lecture Notes in Computer Science, vol 491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53932-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-53932-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53932-2
Online ISBN: 978-3-540-46452-5
eBook Packages: Springer Book Archive