Coherent sampling
Fast Fourier Transform (FFT) is a common tool to investigate performance of data converters and other sampled systems. Coherent sampling refers to a certain relationship between input frequency, [math]\displaystyle{ f_{in} }[/math], sampling frequency, [math]\displaystyle{ f_s }[/math], number of cycles in the sampled set, [math]\displaystyle{ M_{cycles} }[/math], and number of samples, [math]\displaystyle{ N_{samples} }[/math]. With coherent sampling one is assured that the signal power in an FFT is contained within one FFT bin, assuming single input frequency. The condition for coherent sampling is given by
- [math]\displaystyle{ \frac{f_{in}}{f_{s}} = \frac{M_{cycles}}{N_{samples}}. }[/math]
Where [math]\displaystyle{ N_{samples} }[/math] value must be a power of 2 and [math]\displaystyle{ M_{cycles} }[/math] value must be an odd or prime number.
If we have [math]\displaystyle{ N_{samples} = 2^{11} = 2048 }[/math] and [math]\displaystyle{ f_s = 100e6 }[/math] and we want an input frequency close to [math]\displaystyle{ f_s/2 }[/math], let's say [math]\displaystyle{ f_{in} = 44MHz }[/math], then [math]\displaystyle{ M_{cycles} = 901.12 }[/math] which is close to an integer, so we could round it down to [math]\displaystyle{ M_{cycles} = 901 }[/math] and we would get [math]\displaystyle{ f_{in} = 43994140.625Hz }[/math]. This is an input frequency that satisfies coherent sampling and makes sure that we get an integer number of cycles.
This integer number [math]\displaystyle{ M }[/math] can be chosen to be a Prime number (except for 2). This ensures that the same FFT samples will not be repeated across any input signal cycles of the sampled signal[1]. For example, if N=32 and M=6 (non-prime) then there will be N/M=5.33 samples per cycle of the input frequency, so three cycles of the input will take exactly 16 samples, and so the first 16 samples will be identical to the second 16 samples. Usually, no additional information is gained by repeating with the same sampling points and so generally a non-prime M should not be used.
See also
External links
 |
