Two classes of recursive fast transforms over GF(3): properties, relations and computational costs

This work introduces two new classes of recursive fast transforms over GF(3). They are based on recursive equations using Kronecker products what 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.