An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines

Yasunori NAGATA; Masao MUKAIDONO; Chushin AFUSO

An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines

Yasunori NAGATA, Masao MUKAIDONO, Chushin AFUSO

Full Text Views

0

Cite this

Summary :

In this paper, a new optimum input encoding algorithm with m-out-of-2m code which is called Half-Hot Code is presented. By applying Half-Hot Code to the input encoding in PLA-based digital system, the logic functions of the system turn out to be unate functions, thus, the number of bit-lines of PLA may be reduced. The proposed method further reduces the number of product-lines of PLA optimally. In this code assignment procedure, computed Boolean subspaces satisfying suggeset two conditions are assigned to each partitioned subset of digital input variables which are obtained by disjoint minimization or other techniques. As an experiment to evaluate the method, the state assignment for finite state machines of two-lavel implementation is considered. Specifically, the proposed Half-Hot Code assignment is compared with arbitrary Half-Hot Code assignment. The results show that the optimum encoding is superior to an arbitrary assignment up to about 24% in the number of product-lines of PLA.

Publication: IEICE TRANSACTIONS on Information Vol.E78-D No.10 pp.1231-1238

Publication Date: 1995/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Automata, Languages and Theory of Computing

Cite this

Copy

Yasunori NAGATA, Masao MUKAIDONO, Chushin AFUSO, "An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines" in IEICE TRANSACTIONS on Information, vol. E78-D, no. 10, pp. 1231-1238, October 1995, doi: .
Abstract: In this paper, a new optimum input encoding algorithm with m-out-of-2m code which is called Half-Hot Code is presented. By applying Half-Hot Code to the input encoding in PLA-based digital system, the logic functions of the system turn out to be unate functions, thus, the number of bit-lines of PLA may be reduced. The proposed method further reduces the number of product-lines of PLA optimally. In this code assignment procedure, computed Boolean subspaces satisfying suggeset two conditions are assigned to each partitioned subset of digital input variables which are obtained by disjoint minimization or other techniques. As an experiment to evaluate the method, the state assignment for finite state machines of two-lavel implementation is considered. Specifically, the proposed Half-Hot Code assignment is compared with arbitrary Half-Hot Code assignment. The results show that the optimum encoding is superior to an arbitrary assignment up to about 24% in the number of product-lines of PLA.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_10_1231/_p

Copy

@ARTICLE{e78-d_10_1231,
author={Yasunori NAGATA, Masao MUKAIDONO, Chushin AFUSO, },
journal={IEICE TRANSACTIONS on Information},
title={An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines},
year={1995},
volume={E78-D},
number={10},
pages={1231-1238},
abstract={In this paper, a new optimum input encoding algorithm with m-out-of-2m code which is called Half-Hot Code is presented. By applying Half-Hot Code to the input encoding in PLA-based digital system, the logic functions of the system turn out to be unate functions, thus, the number of bit-lines of PLA may be reduced. The proposed method further reduces the number of product-lines of PLA optimally. In this code assignment procedure, computed Boolean subspaces satisfying suggeset two conditions are assigned to each partitioned subset of digital input variables which are obtained by disjoint minimization or other techniques. As an experiment to evaluate the method, the state assignment for finite state machines of two-lavel implementation is considered. Specifically, the proposed Half-Hot Code assignment is compared with arbitrary Half-Hot Code assignment. The results show that the optimum encoding is superior to an arbitrary assignment up to about 24% in the number of product-lines of PLA.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines
T2 - IEICE TRANSACTIONS on Information
SP - 1231
EP - 1238
AU - Yasunori NAGATA
AU - Masao MUKAIDONO
AU - Chushin AFUSO
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 1995
AB - In this paper, a new optimum input encoding algorithm with m-out-of-2m code which is called Half-Hot Code is presented. By applying Half-Hot Code to the input encoding in PLA-based digital system, the logic functions of the system turn out to be unate functions, thus, the number of bit-lines of PLA may be reduced. The proposed method further reduces the number of product-lines of PLA optimally. In this code assignment procedure, computed Boolean subspaces satisfying suggeset two conditions are assigned to each partitioned subset of digital input variables which are obtained by disjoint minimization or other techniques. As an experiment to evaluate the method, the state assignment for finite state machines of two-lavel implementation is considered. Specifically, the proposed Half-Hot Code assignment is compared with arbitrary Half-Hot Code assignment. The results show that the optimum encoding is superior to an arbitrary assignment up to about 24% in the number of product-lines of PLA.
ER -