I dont like the Fourier Transform. It is infinite which makes it coarse and rough and it it gets everywhere.

ted_dunning a day ago | parent | next [-]

Anybody who does anything in the real world with Fourier transforms uses the fast Fourier transform operating on windowed data. This eliminates all of that infinite support and infinite resolution of frequencies.

	▲	RossBencina a day ago \| parent \| next [-]
		To be more precise, when working with sampled data with uniform sample rate you use the Discrete Time Fourier Transform (DTFT), not the Fourier Transform!. None the less, you still end up with an approximate spectrum which is the signal spectrum convolved with the window function's spectrum. In my view the Fourier Transform is still useful in the real world. For example you can use it to analytically derive the spectrum of a given window. But I think the parent is hinting at wavelet basis.
	▲	petermcneeley a day ago \| parent \| prev [-]
		Yes but they commonly dont end up as FT/FFT. For example wavelets and DCT.

▲

monuszero a day ago | parent | prev | next [-]

Not sure if an oblaque tomb raider reference or math metaphor.

	▲	andrewflnr a day ago \| parent [-]
		It's both a math metaphor and a Star Wars prequel reference.

▲

globalnode a day ago | parent | prev [-]

not like here.