Locally computable coding for unary operations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationConcurrency
Subtitle of host publicationTheory, Language, and Architecture - UK/Japan Workshop, Proceedings
EditorsTakayasu Ito, Akinori Yonezawa
PublisherSpringer Verlag
Pages312-323
Number of pages12
ISBN (Print)9783540464525
DOIs
Publication statusPublished - Jan 1 1991
Externally publishedYes
EventUK/Japan Workshop on Concurrency Theory, 1989 - Oxford, United Kingdom
Duration: Sep 25 1989Sep 27 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume491 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherUK/Japan Workshop on Concurrency Theory, 1989
CountryUnited Kingdom
CityOxford
Period9/25/899/27/89

Fingerprint

Unary
State assignment
Redundancy
Coding
Parallel algorithms
Computability
Sequential machines
Sequential circuits
Digit
Finite automata
Parallel Algorithms
Local Algorithms
State Machine
Assignment Problem
Algebraic Structure
Finite Set
Assignment
Closed
Target

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuura, H. (1991). Locally computable coding for unary operations. In T. Ito, & A. Yonezawa (Eds.), Concurrency: Theory, Language, and Architecture - UK/Japan Workshop, Proceedings (pp. 312-323). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 491 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-53932-8_58

Locally computable coding for unary operations. / Yasuura, Hiroto.

Concurrency: Theory, Language, and Architecture - UK/Japan Workshop, Proceedings. ed. / Takayasu Ito; Akinori Yonezawa . Springer Verlag, 1991. p. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 491 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yasuura, H 1991, Locally computable coding for unary operations. in T Ito & A Yonezawa (eds), Concurrency: Theory, Language, and Architecture - UK/Japan Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 491 LNCS, Springer Verlag, pp. 312-323, UK/Japan Workshop on Concurrency Theory, 1989, Oxford, United Kingdom, 9/25/89. https://doi.org/10.1007/3-540-53932-8_58
Yasuura H. Locally computable coding for unary operations. In Ito T, Yonezawa A, editors, Concurrency: Theory, Language, and Architecture - UK/Japan Workshop, Proceedings. Springer Verlag. 1991. p. 312-323. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-53932-8_58
Yasuura, Hiroto. / Locally computable coding for unary operations. Concurrency: Theory, Language, and Architecture - UK/Japan Workshop, Proceedings. editor / Takayasu Ito ; Akinori Yonezawa . Springer Verlag, 1991. pp. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4bce2dd9a7fa4202bd7be699d6d3f308,
title = "Locally computable coding for unary operations",
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.",
author = "Hiroto Yasuura",
year = "1991",
month = "1",
day = "1",
doi = "10.1007/3-540-53932-8_58",
language = "English",
isbn = "9783540464525",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "312--323",
editor = "Takayasu Ito and {Yonezawa }, Akinori",
booktitle = "Concurrency",
address = "Germany",

}

TY - GEN

T1 - Locally computable coding for unary operations

AU - Yasuura, Hiroto

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85032878580&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032878580&partnerID=8YFLogxK

U2 - 10.1007/3-540-53932-8_58

DO - 10.1007/3-540-53932-8_58

M3 - Conference contribution

SN - 9783540464525

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 312

EP - 323

BT - Concurrency

A2 - Ito, Takayasu

A2 - Yonezawa , Akinori

PB - Springer Verlag

ER -