Functions occurring in reality often have special properties, for example, that they appear as overlays of certain fundamental oscillations. The discrete Fourier transformation provides a representation of discrete signals as a combination of sine oscillations, which in many cases leads to significant data compression. A suitable use of trigonometric identities allows the construction of a fast numerical method for calculating the representation.