The linear complexity LS(G) of a finite Group G is the minimal number of additions, subtractions and multiplications needed to evaluate a suitable Fourier transform of CG. Combining and modifying several classical FFT-algorithms, we show that LS ≤ 8|G| log2|G| for any finite abelian group G.