Fourier transform of a Fourier transform I generate a Gaussian noise and then I filter it with a passband FIR Kaiser window filter. When I perform the Fourier transform of the output of the filter and plot its magnitude spectrum, it is filtered in the correct frequency band. Now, I perform a second Fourier transform on the output of the first Fourier transform (I'm performing it on a complex vector this time and in the frequency domain), and when I plot the magnitude spectrum I see something very similar to the original filtered noise. I know this isn't time domain, I know this spectrum is not even because the input signal is complex. But as the time plot of the filtered noise and the absolute value plot of the Fourier transform (of the Fourier transform of the noise) are visually similar a doubt arised on me.


Why is the amplitude spectrum of the complex vector obtained after performing a Fourier tranform on the filtered noise once again occupying the whole vector (the whole frequency band) as if they were time samples spread in the time vector? 
Is the negative symbol in the inverse Fourier transform of the Fourier transform of the noise having no effect so that it is visually similar performing a Fourier transform of Fourier transform of noise and performing an inverse Fourier transform of Fourier transform of noise?


This doubt arised to me when I was trying to filter on a matched filter implemented in Matlab using IFFT(FFT(signal_1).*FFT(signal_1_inverted)) and I accidentally filtered the output of an already Fourier transformed signal and coudn't notice the difference (not on the output of the filter but on the output of the first FFT stage). And this leads me to another question. 


Suppose I would like to detect the likelihood of 2 signals by comparing their spectrums and I want to measure the likelihood by using a matched filter. Knowing that the convolution in time is the multiplication in frequency, is the convolution in frequency the multiplication in time and I get the same result if I use a matched filter (sort of convolution operation) on the spectrums than if I perform a sample by sample multiplication in time domain of the signals whose spectrums likelihood I want to determine?
Applying the discrete Fourier transform (DFT) twice to a time-domain signal, should produce the original time-domain signal in a circularly time-reversed, and linearly scaled (by N) form; as the inverse DFT is very similar to the forward DFT, except the sign of the complex exponential,a linear scale by 1/N.
The inverse DFT of $X[k]$ is:
$$ x[n] = \frac {1}{N} \sum_{k=0}^{N-1} {X[k]e^{j \frac{2\pi}{N} k n}}$$
By reverting the sign of the exponent $e^{j \frac{2\pi}{N} k n}$ into negative, by a change in the sign of the $n$ of $x[n]$ what you get is:
$$  N x[(-n)_N] = \sum_{k=0}^{N-1} {X[k]e^{-j \frac{2\pi}{N} k n}} $$
which is N times the circularly reversed (obtained via modulus operator denoted by $(.)_N$) version of the original signal $x[n]$, which is obtained by an apparently forward but effectively inverse DFT applied to $X[k]$ which is treated as a time-domain sequence, which is what you do at your second stage of applying forward FFT to $X[k]$ of $x[n]$.