Family of fast transforms over GF(3) logic

Abstract

New classes of recursive transforms over GF(3) have been introduced here. They are based on simple recursive equations what allows to obtain corresponding fast forward and inverse transforms and very regular butterfly diagrams. The classification is further extended into various transforms with horizontal and vertical permutations. The relations between various classes of introduced ternary transforms are also discussed.