A Method for the Generation and Processing of Dyadic Indexed Data
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (5) , 487-494
- https://doi.org/10.1109/tc.1983.1676260
Abstract
The elements of an array of 2n data are indexed so that adjacent elements have Hamming distance 1. Based on this indexing a class of invertible fast in-place transformations is developed. The transform coefficients depend on the Hamming distance between the indexes of input data. A class of similar transformations exists in the Walsh-Hadamard domain. Three transform operations are discussed in detail: dyadic shift transform, a subsuming and averaging transformation and a weighting operation. Applications of the method are in the processing of Boolean and fuzzy switching functions, image analysis, etc.Keywords
This publication has 8 references indexed in Scilit:
- Kronecker products and shuffle algebraIEEE Transactions on Computers, 1981
- Fast transform procedure for the generation of near-minimal covers of Boolean functionsIEE Proceedings E Computers and Digital Techniques, 1981
- On the Walsh-Hadamard Transform and Prime Implicant ExtractionIEEE Transactions on Electromagnetic Compatibility, 1978
- A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic ArraysIEEE Transactions on Computers, 1978
- Determination of the irredundant forms of a Boolean function using Walsh-Hadamard analysis and dyadic groupsIEE Journal on Computers and Digital Techniques, 1978
- Orthogonal Transforms for Digital Signal ProcessingPublished by Springer Nature ,1975
- An Algorithm for the Automatic Approximate Minimization of Boolean FunctionsIEEE Transactions on Computers, 1968
- The problem of simplifying logical expressionsThe Journal of Symbolic Logic, 1959