论文信息 - Sign Haar Transform

Sign Haar Transform

A non-linear transform, called "Sign Haar Transform" has been introduced. The transform is unique and converts binary/ternary vectors into ternary spectral domain. Recursive definitions and Fast Transforms for the calculation of Sign Haar Transform have been developed. The new transform is extremely computationally effective both in terms of memory requirements and processing time.<<ETX>>

Susanto Rahardja | Bogdan J. Falkowski | S. Rahardja | B. Falkowski

[1] Leonid P. Yaroslavsky,et al. Digital Picture Processing , 1985 .

[2] Abraham Bookstein,et al. Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .

[3] K. R. Rao,et al. Orthogonal Transforms for Digital Signal Processing , 1979, IEEE Transactions on Systems, Man and Cybernetics.

[4] J. Shore. On the Application of Haar Functions , 1973, IEEE Trans. Commun..

[5] E. A. Trachtenberg,et al. Binary input/ternary output switching circuits designed via the sign transformation , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[6] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .

[7] P. S. Moharir,et al. Pattern-recognition transforms , 1992 .