1) In addition to negative frequencies, which is the minimum frequency provided by the FFT function? Is it zero?
fft(y) returns the vector from the 0th to the (N-1) -th DFT y , where y (t) should be considered as defined on 0 ... N-1 (hence the "periodic repetition" of y (t) can be considered as a periodic signal defined over Z).
The first sample fft(y) corresponds to frequency 0. The Fourier transform of real discrete-time periodic signals also has a discrete region, and it is periodic and Hermitian (see below). Therefore, the conversion for negative frequencies is conjugate to the corresponding patterns for positive frequencies.
For example, if you interpret (periodic repetition) y as a periodic real signal defined over Z (sampling period == 1), then the region fft(y) should be interpreted as N equidistant points 0, 2 Ο / N ... 2 ? pi (N-1) / N. Conversion samples at negative frequencies -? Pi ... -? Pi / N are conjugates of samples at frequencies pi ... ... pi / N, and are equal to samples at frequencies pi ... 2 pi (N-1) / N.
2) If it is equal to zero, how do we construct zero on a logarithmic scale?
If you want to make some kind of Bode plot , you can build the transformation only for positive frequencies, ignoring the patterns corresponding to the lowest frequencies (in particular, 0).
3) Is the result always symmetrical? Or does it just seem symmetrical?
It has Hermitian symmetry if y real: its real part is symmetric, its imaginary part is antisymmetric. In other words, its amplitude is symmetric and phase antisymmetry.
4) If I use abs (fft (y)) to compare two signals, can I lose some accuracy?
If you mean abs(fft(x - y)) , this is normal, and you can use it to get an idea of ββthe frequency distribution of the difference (or error if x is the estimate of y). If you mean abs(fft(x)) - abs(fft(y)) (???), you lose at least phase information.