World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

TERNARY RECURSIVE FAST TRANSFORMS

PROPERTIES, MUTUAL RELATIONS, AND CIRCUIT REALIZATION
    https://doi.org/10.1142/S0218126607003459Cited by:0 (Source: Crossref)

    This paper introduces two new classes of recursive fast transforms over GF (3). They are based on recursive equations using Kronecker products that allows to obtain simple corresponding fast transforms and regular butterfly diagrams. The computational costs to calculate both classes of new transforms and the experimental results comparing introduced transforms with ternary Reed–Muller transform are also presented.