Maximum-Distance Linear Codes

Described here is a linear code that has a maximum distance between codewords of k for a code of order 2k. Since the minimum-maximum distance is k for a code of order 2k, a class of minimum-maximum distance codes results. For an (n,k) linear code, k ≤ n ≤ k + k∣2 for k even and k ≤ n ≤ k + (k - 1)/2 for k odd. Maximum-distance codes are found useful in encoding the states of sequential circuits. © 1971, IEEE. All rights reserved

A State Assignment Procedure For Asynchronous Sequential Circuits

This paper presents a new procedure for constructing nonuniversal shared-row internal state assignments for asynchronous sequential circuits. The method consists basically of establishing an initial code with the minimum number of variables required to dis. © 1971, IEEE. All rights reserved

A method for generating UTS assignments with an iterative state transition algorithm

There is a lack of systematic procedures that can be used to find uni-code totally sequential (UTS) assignments from a flow table description of an asynchronous sequential circuit. Presented here is an iterative internal state assignment method. This method consists of three algorithms. The first generates a minimum variable initial assignment from a flow table description. The second tests the validity of this assignment by constructing minimum length transition paths without crossover and the third augments this assignment by adding an internal state variable in the event that all transition paths cannot be constructed without crossover. The second and the third algorithms are used iteratively until a valid non-universal UTS assignment is produced. The iterative state assignment method is systematic in all its phases. Every phase of the method includes more than one algorithm to perform the same function. The algorithm producing minimum length transition paths is very powerful in that it can also be used in conjunction with other state assignment methods producing either universal or non-universal UTS assignments. After one obtains a valid UTS assignment an algorithm is provided to replace some or all of the totally sequential transitions with mixed mode transitions. This reduces the number of subtransitions in a given transition path and therefore speeds up the transition time considerably --Abstract, page ii