TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES

Sik-Sang Yau, GF DEPALMA GF

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

Problem of realizing sequential machines with a structure in which the memory elements are connected in the form consisting of a minimum number of shift-registers is studied. The shift- registers in these realizations are in general two-way, that is, the content can be shifted to right as well as left. An efficient state assignment method for such realizations is presented.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
Pages722-731
Number of pages10
StatePublished - 1968
Externally publishedYes
EventAllerton Conference on Circuit & Systems Theory, 6th-Proc -
Duration: Oct 2 1968Oct 4 1968

Other

OtherAllerton Conference on Circuit & Systems Theory, 6th-Proc
Period10/2/6810/4/68

Fingerprint

Sequential machines
Shift registers
State assignment
Data storage equipment

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yau, S-S., & DEPALMA GF, GF. (1968). TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES. In Unknown Host Publication Title (pp. 722-731)

TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES. / Yau, Sik-Sang; DEPALMA GF, GF.

Unknown Host Publication Title. 1968. p. 722-731.

Research output: Chapter in Book/Report/Conference proceedingChapter

Yau, S-S & DEPALMA GF, GF 1968, TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES. in Unknown Host Publication Title. pp. 722-731, Allerton Conference on Circuit & Systems Theory, 6th-Proc, 10/2/68.
Yau S-S, DEPALMA GF GF. TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES. In Unknown Host Publication Title. 1968. p. 722-731
Yau, Sik-Sang ; DEPALMA GF, GF. / TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES. Unknown Host Publication Title. 1968. pp. 722-731
@inbook{14cede530e8e4c479b45b5100c4ea981,
title = "TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES",
abstract = "Problem of realizing sequential machines with a structure in which the memory elements are connected in the form consisting of a minimum number of shift-registers is studied. The shift- registers in these realizations are in general two-way, that is, the content can be shifted to right as well as left. An efficient state assignment method for such realizations is presented.",
author = "Sik-Sang Yau and {DEPALMA GF}, GF",
year = "1968",
language = "English (US)",
pages = "722--731",
booktitle = "Unknown Host Publication Title",

}

TY - CHAP

T1 - TWO-WAY SHIFT- REGISTER REALIZATIONS OF SEQUENTIAL MACHINES

AU - Yau, Sik-Sang

AU - DEPALMA GF, GF

PY - 1968

Y1 - 1968

N2 - Problem of realizing sequential machines with a structure in which the memory elements are connected in the form consisting of a minimum number of shift-registers is studied. The shift- registers in these realizations are in general two-way, that is, the content can be shifted to right as well as left. An efficient state assignment method for such realizations is presented.

AB - Problem of realizing sequential machines with a structure in which the memory elements are connected in the form consisting of a minimum number of shift-registers is studied. The shift- registers in these realizations are in general two-way, that is, the content can be shifted to right as well as left. An efficient state assignment method for such realizations is presented.

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

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

M3 - Chapter

AN - SCOPUS:0014380288

SP - 722

EP - 731

BT - Unknown Host Publication Title

ER -