This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matrix Transformations for N-Tuple Analysis of Binary Patterns
May 1976 (vol. 25 no. 5)
pp. 542-546
H.C. Ratz, Department of Electrical Engineering, University of Waterloo
The frequency of occurrence of logic functions of binary N-tuples can be observed from sequences of binary patterns. The logic functions considered here are AND, NOR, NAND, OR, and an odd-even parity check; and the frequency parameters are expressed as real matrix transformations on the probabilities of the patterns. Some properties, inverses, and interrelationships among the parameter sets are given, along with fast algorithms to facilitate computational processes. The results permit the outputs of convenient hardware logic operations to be converted into other parameters for smoothing, detection, or inference purposes, or to estimate the pattern probabilities by inversion. A measure of association among binary patterns is given as one characteristic feature which can be derived from the observed parameters.
Citation:
H.C. Ratz, "Matrix Transformations for N-Tuple Analysis of Binary Patterns," IEEE Transactions on Computers, vol. 25, no. 5, pp. 542-546, May 1976, doi:10.1109/TC.1976.1674645
Usage of this product signifies your acceptance of the Terms of Use.