NDLI: Universal Multicode STT State Assignments for Asynchronous Sequential Machines

Content Provider	IEEE Xplore Digital Library
Author	Nanya, T. Tohma, Y.
Copyright Year	1968
Abstract	A universal single transition time (STT) state assignment is a way to give a valid STT state assignment in which all state variables that must change in a given transition are allowed to change simultaneously without critical races for any asynchronous sequential machine regardless of the configuration of its flow table. This paper presents a new systematic procedure for constructing universal STT state assignments and shows that the procedure can give better upper bounds on the number of state variables required for realizing asynchronous normal flow tables than any known universal STT state assignments, although there is some difference in standpoint between earlier works and the present one. It is further shown that the procedure can also be applied to improve the best known bounds for (2, 1) separating systems which are known to be less restricted universal assignments. The feature of the procedure lies in the idea that two binary code vectors are assigned to each internal state. In the resulting universal STT assignments, the number of state variables required is given by 2 · m1.59 where m = [log2 n], n being the number of states and [X] being the least integer ≥ X. Furthermore, the resulting (2, 1) separating systems require 2 ·m state variables.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	811
Ending Page	818
Page Count	8
File Size	2429155
File Format	PDF
ISSN	00189340
Volume Number	C-28
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1979-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	universal state assignments Asynchronous sequential machines multicode state assignments single transition time state assignments (2, 2) and (2, 1) separating systems
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On Universal Single Transition Time Asynchronous State Assignments

A Multicode Single Transition-Time State Assignment for Asynchronous Sequential Machines

Universal Single Transition Time Asynchronous State Assignments

Optimization of Asynchronous Sequential Circuit Realizations

A Universal STT State Assignment Method for Pulse Input Asynchronous Sequential Circuits

State Assignments for Asynchronous Sequential Machines

Techniques to Construct

Comments on Next-State Equations of Asynchronous Sequential Machines

Generation of Internal State Assignments for Large Asynchronous Sequential Machines

Universal Multicode STT State Assignments for Asynchronous Sequential Machines

Similar Documents

On Universal Single Transition Time Asynchronous State Assignments

A Multicode Single Transition-Time State Assignment for Asynchronous Sequential Machines

Universal Single Transition Time Asynchronous State Assignments

Optimization of Asynchronous Sequential Circuit Realizations

A Universal STT State Assignment Method for Pulse Input Asynchronous Sequential Circuits

State Assignments for Asynchronous Sequential Machines

Techniques to Construct

Comments on Next-State Equations of Asynchronous Sequential Machines

Generation of Internal State Assignments for Large Asynchronous Sequential Machines

Universal Multicode STT State Assignments for Asynchronous Sequential Machines