FFT is one of sevel methods to compute discrete Fourier transform
Example with input signal of 256 length:
y = fft(x)
x: 256 values sampled at fs Hz
y: 256 values where y[i] is value at frequency i * fs / 256
Power Spectral Density (V^2/Hz) where x (V) and fs (Hz)
d = psd(y)
d[0] = 0
d[1 to 127] = abs(y[i])^2 / (fs * 128)
d[128] = abs(y[i])^2 / (fs * 256)