Optimum State Assignment for the D Flip-Flop

Authors:
P. S. Noe;V. T. Rhyne
Affiliations:
Department of Electrical Engineering, Texas A & M University, College Station, TX 77843.;Department of Electrical Engineering, Texas A & M University, College Station, TX 77843.
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 3
Cited 1

A Modification to the SHR-Optimal State Assignment Procedure

IEEE Transactions on Computers
Optimum State Assignment for Synchronous Sequential Circuits

IEEE Transactions on Computers
Remarks on the SHR-Optimal State Assignment Procedure

IEEE Transactions on Computers

Evaluation of Marton's inner bound for the general broadcast channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4

Quantified Score

Hi-index	14.98

Visualization

Abstract

This correspondence is a modification of the basic SHR-optimal1 state assignment procedure for the D flip-flop. Under the minimum sum-of-products (MSOP) constraint, a sequential machine with n D flip-flops has 2n times as many distinct state assignments and twice as many distinct state assignment columns as the other flip-flop types. This correspondence shows that even though the D flip-flop machine has 2nN total distinct state assignments, the costs of these assignments can be uniquely determined by examination of only N of these assignments. Integration of this concept into the basic SHR-optimal algorithm produces a computational saving on the order of 2n-1 times.