For the decimation-in-frequency Fast Fourier Transform (FFT) algorithm using fixed point arithmetic, it is shown that there are position-dependent bounds on the error amplitude in the Fourier coefficients. This means that the error statistics are position dependent and the earlier results on finite arithmetic effects in FFT calculation are inaccurate to that extent. These results lead to worst-case deterministic design of a FFT processor.