scientific article; zbMATH DE number 4056957

From MaRDI portal
Publication:3792205





[For the entire collection see Zbl 0635.00018.] In the process of specifying and modelling data structures for wide classes of real-time applications (signal-processing, pattern recognition, communications engineering) it has become a helpful tool to choose data structures as algebras which allow a group of automorphisms acting on the set of data. With this data algebras being suchwise enhanced many of the above mentioned applications find a natural description. In this lecture we show that this description can successfully be used for a unifying approach to fast algorithms for many applications e.g. by reproducing the known classes of fast Fourier transforms. The concept of the generalized Fourier transform can also be used in this context to generate such algorithms almost mechanically, as we will show in some examples.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792205)