Signal Processing Stack Exchange is a question and answer site for practitioners of the art and science of signal, image and video processing. It only takes a minute to sign up.
Sign up to join this community
Fourier transform has different types like continuous Fourier transform (CFT), Discrete time Fourier transform (DTFT) and Discrete Fourier transform ( DFT).
CFT can be used in case of continuous aperiodic signals while DFT for discrete aperiodic signals .
On the other hand, Laplace transform can be used in case of continuous signals and Z transform for discrete signals.
So I want to ask that can use of Fourier transform be minimized completely with the help of Laplace and Z transform?
The answer to your last question is definitely 'no'. The point hotpaw2 makes in his answer is very relevant: the FFT is an efficient implementation of the DFT, and there are no equivalently efficient implementations for the numerical computation of the $\mathcal{Z}$-transform or the Laplace transform.
But that's not the only reason. There are important functions (or sequences) for which the Laplace transform or the $\mathcal{Z}$-transform don't even exist, whereas the Fourier transform does. E.g., take a sinusoid or a complex exponential extending from $-\infty$ to $\infty$. These functions (or sequences) don't have a Laplace transform or a $\mathcal{Z}$-transform. Other important examples are impulse responses of ideal frequency selective filters such as low pass or high pass. They can be represented in terms of the sinc function, which can only be transformed using the Fourier transform, but not using the (bilateral) Laplace transform or - in discrete time - the (bilateral) $\mathcal{Z}$-transform.
So even if formally it looks like the Fourier transform is a special case of the Laplace transform or the $\mathcal{Z}$-transform, that's generally not case. One reason for that is the incorporation of the theory of distributions in the theory of the Fourier transform (i.e., the use the Dirac delta impulse), which makes it possible to compute the transform of functions like $\sin(\omega_0t)$ or $e^{j\omega t}$. The latter is not possible using the (bilateral) Laplace transform (or, in discrete time, the bilateral $\mathcal{Z}$-transform).
When people see the definitions of the (bilateral) Laplace transform and of the Fourier transform
$$X_L(s)=\int_{-\infty}^{\infty}x(t)e^{-st}dt\\ X_F(j\omega)=\int_{-\infty}^{\infty}x(t)e^{-j\omega t}dt\tag{1}$$
it may seem obvious to them that both transforms become identical by substituting $s=j\omega$. This, however, is generally not true. The pitfall here is the fact that the substitution does not take into account the convergence of the improper integrals. Depending on $x(t)$, the Laplace integral might not converge for $s=j\omega$, so $X_F(j\omega)$ might not even exist. The substitution is only valid if the region of convergence (ROC) of the Laplace integral includes the $j\omega$-axis. A completely analogous argument is true for the $\mathcal{Z}$-transform and the DTFT. In that case the substitution $z=e^{j\omega}$ is only valid if the ROC includes the unit circle.
The last paragraph may seem to imply that the Laplace transform and the $\mathcal{Z}$-transform are simply more general than the respective versions of the Fourier transform. However, this is also not true, as already mentioned above, because there are functions (sequences) that can only be treated by the Fourier transform, but not by the Laplace transform ($\mathcal{Z}$-transform).
Also take a look at the following answers to related questions: answer 1, answer 2, answer 3.
The short answer is yes, if you have the Laplace or Z-transform of a function you do not need the Fourier transform.
This is because the CFT is a special case of the Laplace transform and the DTFT is a special case of the Z transform. The Fourier transform is used to find the complex sinusoids that compose a function, whereas the Laplace transform finds all complex exponentials that compose a function.
Knowing this, it is simple to derive the Fourier transform from the Laplace transform. The Laplace transform is defined as:
$$ \int_{-\infty}^{\infty}e^{-s}f(t)\,dt\\ s = \alpha+j\omega $$
To find the Fourier transform from the Laplace transform, all you must do is assert $\alpha = 0$ for all $\omega$ and $t$. This evaluates the Laplace transform along the imaginary axis only, as any component lying directly on the imaginary axis is a complex sinusoid. This leaves us with: $$ \int_{-\infty}^{\infty}e^{-j\omega}f(t)\,dt\\ $$
Which is in fact the Fourier transform.
A similar relationship applies between the DTFT and the Z-transform. The Z-transform is defined as:
$$ \sum_{n=-\infty}^\infty x[n]Z^{-n} $$ Where $Z$ is a complex variable. To find all complex sinusoids in the discrete world we must constrain $Z$ to fall on the unit circle: $$ Z = e^{j\omega} $$
Which leaves us with
$$ \sum_{n=-\infty}^\infty x[n]e^{-j\omega n} $$ Or the discrete time Fourier transform.
The reason the Fourier transform exists is because there are a lot of applications that only need the real frequencies of a function. If only the real frequencies are needed there is no point calculating the rest of the Laplace domain. Why do more work than necessary?
For more information check out the Wikipedia articles https://en.wikipedia.org/wiki/Discrete-time_Fourier_transform#Relationship_to_the_Z-transform and https://en.wikipedia.org/wiki/Laplace_transform#Fourier_transform And I would also strongly recommend the text book Linear Systems and Signals by B.P. Lathi for a much more indepth discussion on Laplace, Z, and Fourier transforms.
The DFT and IDFT have a computationally efficient implementation in the form of the FFT. This efficiency can not be replaced or minimized by the LT or ZT in the general case.
