Skip to main content

Fourier Transform of some common analog signals


  • Fourier Transform of a delta function

If x(t) = \( \delta(t) \), then Fourier transform,

X(\( \omega \)) = \( \int_{-\infty}^{\infty} \delta(t)e^{-j\omega t} dt \)

= \( \int_{-\epsilon}^{\epsilon} \delta(t)e^{-j\omega t} dt \)

= \( \int_{-\epsilon}^{\epsilon} \delta(t)e^{-j\omega 0} dt \)

= 1

Thus, the Fourier transform of a delta/impulse is a constant equal to 1, independent of frequency. Remember that derivation used the shifting property of the impulse to eliminate the integral.

 

 

 

  • Fourier transform of a unit step function

 

\( \gamma(t) \) = 0 for t < 0

                                                            = 1 for t \( \ge \) 1

We know that a unit-step function is an integration of a delta function. So for a unit step function,

\( \gamma(t) \) = \( \int \delta(t) dt \)

So, X(\( \omega \)) = \( \frac{1}{j\omega} F(\delta(t)) + \pi F(\delta(t))\delta(\omega) \)

[See the property of integration above]

           = \( \frac{1}{j\omega} + \pi\delta(\omega) \)       [as F(\( \delta(t) \)) = 1]

When a function (i.e., x(t)) is not an energy function and hence the Fourier transform of [\( \int x(t) dt \)] includes an impulse function.

 

 

 

  • Fourier Transform of a rectangular / unit pulse function

A pulse function can be represented as,

x(t)=Π(t) = \( \gamma(t + \frac{1}{2}) - \gamma(t - \frac{1}{2}) \)

For a function rect(t) = Π(t) = 1 for |t| \( \le \frac{1}{2} \)

                                             = 0 otherwise

Given that

x(t) = Π(t)

Hence from the definition of the Fourier transform we have

F (Π(t)) = X(\( \omega \)) = \( \int_{-\infty}^{\infty} \Pi(t)e^{-j\omega t} dt \)

                           = \( \int_{-1/2}^{1/2} e^{-j\omega t} dt \)      [as Π(t) = 1 for |t| \( \le \frac{1}{2} \)]

                            = [(e –jωt)/-jω]-1/21/2

                                           = [e –jω/2 - e jω/2] / -jω

                            = [e jω/2 - e -jω/2] / jω

                            = 2/ω . {[e jω/2 - e -jω/2] / 2j}

                            = 2/ω . sin(ω/2)

                            = {sin(ω/2) / (ω/2)}

                           = {sin(\( \pi \)(ω/2\( \pi \))) / (\( \pi \)(ω/2\( \pi \)))}

                            = sinc(ω/2\( \pi \))

 

For the above case, the rectangular function has a pulse width value of 1 over the interval of [-½, ½]; 0 otherwise.

Now we’ll discuss a rectangular pulse that has a width of T

Then,    rect(t/T) = Π(t/T) = 1 for |t| \( \le \) T/2

                                             = 0 otherwise

Given that

x(t/T) = Π(t/T)

Hence from the definition of the Fourier transform we have

F (Π(t/T)) = \( \int_{-\infty}^{\infty} \Pi(t/T)e^{-j\omega t} dt \)

                           = \( \int_{-T/2}^{T/2} e^{-j\omega t} dt \)      [as Π(t/T) = 1 for |t| \( \le \) T/2]

                            = [(e –jωt)/-jω]-T/2T/2

                                           = [e –jωT/2 - e jωT/2] / -jω

                            = [e jωT/2 - e -jωT/2] / jω

                            = 2/ω . {[e jωT/2 - e -jωT/2] / 2j}

                            = 2/ω . sin(ω(T/2))

                            = {sin(ω(T/2)) / (ω/2)}

                            = {sin(\( \pi \)ωT/2\( \pi \))) / (\( \pi \)ω/2\( \pi \))}

                            = {sin(\( \pi \)ωT/2\( \pi \))) / (\( \pi \)ωT/2\( \pi \))}.T

                            = T. sinc(ωT/2\( \pi \))

 

 

 

 

  • Fourier Transform of a unit triangle pulse

A unit triangle pulse is simply the convolution of a unit pulse function with itself.

Here, Λ(t) = Π(t) * Π(t)               

[Π(t) is a unit pulse function & ‘*’ denotes convolution]

So, Λ(\( \omega \)) = sinc(ω/2\( \pi \)) . sinc(ω/2\( \pi \)) = sinc2(ω/2\( \pi \))

 

 

 

  • Fourier Transform of a Sawtooth function

1738659393_fourier-transform-40.png

s(t) = 0, for t < 0 and t > 1

                                                  = t, for 0 \( \le \) t \( \le \) 1

We can represent sawtooth as the integral of shifted unit pulse function (to give the ramp) and a negative impulse (delayed by one second) to give the discontinuity at the end of the ramp

1738659393_fourier-transform-41.png

 

s(t) = \( \int_{-\infty}^{t} \Pi(\tau)d\tau - \int_{-\infty}^{t} \delta(\tau-1)d\tau = \int_{-\infty}^{t} y(\tau)d\tau \)

y(t) = \( \Pi(t) - \delta(t-1) \)

Now, we’ve to find the Fourier transform of y(t),

Y(\( \omega \)) = sinc(ω/2\( \pi \))e-jω/2 - e-jω

We can now apply integral property with Y(0) = 0, to find S(\( \omega \))

S(\( \omega \)) = F(\( \int_{-\infty}^{t} y(\tau)d\tau \)) = Y(\( \omega \))/jω - \( \pi \)Y(0)\( \delta \)(0) = Y(\( \omega \))/jω

= {(sinc(ω/2\( \pi \))e-jω/2 - e-jω) / jω}

= {((sin(π . ω/2\( \pi \)) / (π . ω/2\( \pi \)))e-jω/2 - e-jω) / jω}

=  (((sin(Ï€ . ω/2\( \pi \)) / (Ï€ . ω/2\( \pi \)))e-jω/2) / jω) – (e-jω / jω)

= (2(sin(ω/2)e-jω/2) / jω2) – (je-jω / j2ω)

= (2((ejω/2 - e-jω/2) / 2j)e-jω/2) / jω2) + (je-jω / ω)     [as j2 = -1]

= (((ejω/2 - e-jω/2)e-jω/2) / j2ω2) + (je-jω / ω)

= (((e-jω/2 - ejω/2)e-jω/2) / ω2) + (je-jω / ω)

= (((e-jω/2 - ejω/2)e-jω/2) / ω2) + (je-jω / ω)

= ((((e-jω/2 - ejω/2)e-jω/2) + jωe-jω) / ω2)

= ((e-jω - 1 + jωe-jω) / ω2)

= ((e-jω(1+jω) - 1) / ω2


Further Reading

  1.  


Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):

Online Simulator for ASK, FSK, and PSK

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...