Self-clocking of binary information involves a coding constraint whereby the maximum length of zero strings is limited to a predetermined number. For reasons of operational stability it is desirable to keep this numbe...
详细信息
Self-clocking of binary information involves a coding constraint whereby the maximum length of zero strings is limited to a predetermined number. For reasons of operational stability it is desirable to keep this number low. The price of such constraint is a degradation in code density. The class of serial recording which includes the well-known frequency modulation and phase encoding represents one extreme where every other symbol is mandatory, making the code density one bit for every two symbols. This paper describes a coding method which improves code efficiency while maintaining the constraint on the length of zero strings. It will be shown that adaptive coding, which is an extension of the block code concept known from information theory, offers a significant improvement. The concept is illustrated by describing a practical application in which the code density is improved from two symbols per bit to three symbols per bit pair, while keeping the maximum length of zero strings to one. It is shown that while this technique represents an improvement by one third over phase encoding, it approaches the theoretical limit for this class of codes to within 4 percent.
In this note the successive-higher-ordering method for testing and realization of threshold functions is applied to the realization of a threshold function F, such that it will contain a given function F 1 , which may...
详细信息
In this note the successive-higher-ordering method for testing and realization of threshold functions is applied to the realization of a threshold function F, such that it will contain a given function F 1 , which may or may not be a threshold function, and such that it will be contained in F 1 +F ø , where F ø is the function representing the don't care vertices. Before the application of the successive-higher-ordering method, the given functions F 1 and F 0 = (F 1 +F ø ) are first changed into unate functions by the successive positivizing of the functions with respect to the variables, one at a time. Some theorems relating to this formation of unate functions are presented. A systematic procedure for testing and realization is developed. An example is given for illustration.
暂无评论