FFTGUI Demonstration of Finite Fourier Transform.
FFTGUI(y) plots real(y), imag(y), real(fft(y)) and imag(fft(y)).
FFTGUI, without any arguments, uses y = zeros(1,32).
When any point is moved with the mouse, the other plots respond.
Inspired by Java applet by Dave Hale, Stanford Exploration Project,
http://sepwww.stanford.edu/oldsep/hale/FftLab.html
The Hilbert Transform is an important component in communication systems, e.g. for single sideband modulation/demodulation, amplitude and phase detection, etc. It can be formulated as filtering operation which makes it possible to approximate the Hilbert Transform with a digital filter. Due to the non-causal and infinite impulse response of that filter, it is not that easy to get a good approximation with low hardware resource usage. Therefore, different filters with different complexities have been implemented.
The detailed discussion can be found in "Digital Hilbert Transformers or FPGA-based Phase-Locked Loops" (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4629940).
The design is fully pipelined for maximum throughput.
