Generating Discrete Fourier Transform of Abel Groups
Liye Shi · Journal of Kashgar Teachers College · 2009
Let G be a finite group of order n.The group algebra G is isomorphic to matrix algebra i.e CG≌hk=1Cdk×dk.Every such isomorphism is called a DFT of G.It consist of pairwise ineqivalent irreducible representation Dk.It's difficult to compute the ordinary irreducible representation of a given finite group.In 1994 Baum and Clausen gave the algorithm for supersolvable Groups DFT.Its complexity is O(|G|log|G|).In 2003 Clausen and Muller gave an algorithm about solvable groups.In this paper we thought about Abel groups.