The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1968 vol.17)
pp: 649-655
ABSTRACT
This paper analyzes invertible length-preserving convolutional transformations of binary sequences, when the perfect inverse feedback transducer is replaced by a finite feedforward (i. e., convolutional) transducer which represents an approximation of the former. This replacement eliminates the error propagation effect, but the finiteness of the "inverse" transducer (decoder) results in a restriction on the input sequences, for which exact replication is achieved in the two-way transduction (transformation and recovery). The entity of the input restriction can be taken as a measure of performance for sets of transformations, and can be described in terms of the upper bound of the entropies of the binary sources which are "matched" to the system (direct and inverse transducers). This bound is clearly the capacity of the system viewed as a noiseless channel. It is shown that, if r is the number of decoder stages, the channel capacity has an asymptotic expression C?1-Ab<sup>r</sup>, where the parameters b < 1 and A depend solely upon the structure of the set of resynchronizing states (RS cluster) possessed by the given set of transformations.
INDEX TERMS
Index terms?Binary sequences, convolutional transformations, entropy, feedforward transducers, sources.
CITATION
F.P. Preparata, "Convolutional Transformation and Recovery of Binary Sequences", IEEE Transactions on Computers, vol.17, no. 7, pp. 649-655, July 1968, doi:10.1109/TC.1968.227441
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool