The concept of Fourier-t transformation, FTT, emerged from my basic considerations on Fourier-transformation [68]. As opposed to FFT, the FTT can be readily made aurally adequate, i.e., with respect to the scaling of frequency and of analysis bandwidths. Because the time window used in FTT is asymmetrical, its BxT product is much smaller than that of FTT. Moreover, FTT can efficiently be computed by a recursive algorithm, such that a frequency function is obtained that is quasi-continuous both in frequency and time [69], [75], [104] p. 78-86.
Both in its original layout [68], [104], and in a modified version (Schlang & Mummert 1990a, Schlang 1989a) the FTT was employed in various types and applications of aurally adequate signal analysis (Baumann 1991b, 1991c, 1992a, 1994b, 1995a, Heinbach 1986a, 1987a, 1988a, Horn 1998a, Mummert 1990a, 1991a, 1998a, Rücker 1997a, 1998a, Valenzuela 1997a, 1998a, 1998b, Wartini et al. 1995a, 1995b, 1996a, Wartini & Rücker 1994a).