The present paper describes an efficient heuristic approach to state encoding of sequential circuits so that the total usage of silicon area of PLA-based two-level implementation for combinational circuits can be minimized. Apart from those conventional methods in which state encoding is determined one after another in a predetermined order of states, this approachi is distinctive in that top priority is given to how to seek cubes which constitute a cover to be allocated to each group of states (where a group of states denotes a set of states which have the same next state and the same output for an input) on the basis of a magnitude estimation of cubes so that the total number of cubes to be used can be minimized. Implementation results are also shown to reveal how this approach is of practical use.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kenji MINATO, Hiromu ARIYOSHI, Isao SHIRAKAWA, "An Efficient Heuristic Approach to State Encoding for PLA-Based Sequential Circuits" in IEICE TRANSACTIONS on Fundamentals,
vol. E74-A, no. 1, pp. 14-21, January 1991, doi: .
Abstract: The present paper describes an efficient heuristic approach to state encoding of sequential circuits so that the total usage of silicon area of PLA-based two-level implementation for combinational circuits can be minimized. Apart from those conventional methods in which state encoding is determined one after another in a predetermined order of states, this approachi is distinctive in that top priority is given to how to seek cubes which constitute a cover to be allocated to each group of states (where a group of states denotes a set of states which have the same next state and the same output for an input) on the basis of a magnitude estimation of cubes so that the total number of cubes to be used can be minimized. Implementation results are also shown to reveal how this approach is of practical use.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_1_14/_p
Copy
@ARTICLE{e74-a_1_14,
author={Kenji MINATO, Hiromu ARIYOSHI, Isao SHIRAKAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Heuristic Approach to State Encoding for PLA-Based Sequential Circuits},
year={1991},
volume={E74-A},
number={1},
pages={14-21},
abstract={The present paper describes an efficient heuristic approach to state encoding of sequential circuits so that the total usage of silicon area of PLA-based two-level implementation for combinational circuits can be minimized. Apart from those conventional methods in which state encoding is determined one after another in a predetermined order of states, this approachi is distinctive in that top priority is given to how to seek cubes which constitute a cover to be allocated to each group of states (where a group of states denotes a set of states which have the same next state and the same output for an input) on the basis of a magnitude estimation of cubes so that the total number of cubes to be used can be minimized. Implementation results are also shown to reveal how this approach is of practical use.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - An Efficient Heuristic Approach to State Encoding for PLA-Based Sequential Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 14
EP - 21
AU - Kenji MINATO
AU - Hiromu ARIYOSHI
AU - Isao SHIRAKAWA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1991
AB - The present paper describes an efficient heuristic approach to state encoding of sequential circuits so that the total usage of silicon area of PLA-based two-level implementation for combinational circuits can be minimized. Apart from those conventional methods in which state encoding is determined one after another in a predetermined order of states, this approachi is distinctive in that top priority is given to how to seek cubes which constitute a cover to be allocated to each group of states (where a group of states denotes a set of states which have the same next state and the same output for an input) on the basis of a magnitude estimation of cubes so that the total number of cubes to be used can be minimized. Implementation results are also shown to reveal how this approach is of practical use.
ER -