1. Signal Regeneration: Why Digital Wins Over Analog
One of the biggest advantages of digital signals over analog is regeneration. Let’s break this
down step by step:
How Signals Degrade During Transmission
When a signal (analog or digital) is transmitted through a medium (e.g., wired or wireless
channels), it suffers from:
1. Distortion – Transmission lines and circuits modify the signal due to imperfections in
their frequency response.
2. Noise & Interference – External sources (electrical noise, other signals,
environmental factors) add unwanted components.
For analog signals, distortion and noise accumulate over time, and once the signal is
altered, it cannot be restored perfectly. Any amplification will boost both the original signal
and the unwanted noise, making things worse.
How Digital Signals Overcome This
Digital signals exist in only two states (on/off or 1/0). A key technology called regenerative
repeaters allows digital signals to be restored to their original form before they degrade
beyond recognition.



A digital amplifier detects whether the signal is closer to a 1 or a 0 and reshapes the
pulse accordingly.
This prevents noise and distortion from accumulating, making long-distance
communication more reliable.
Unlike analog signals, digital pulses can be perfectly regenerated, making digital
transmission much more efficient.
2. Error Detection & Correction: High Fidelity in Digital
Systems
Digital systems can detect and correct errors in transmission, something analog systems
cannot do effectively.
How Error Detection Works


Digital communication uses error-checking codes (e.g., parity bits, checksums,
cyclic redundancy check (CRC), and Hamming codes) to detect and fix errors.
If errors are detected, they can either be corrected automatically or the data can be retransmitted.

This results in extremely low error rates and high signal fidelity.
Why Analog Signals Lack Error Correction



In an analog system, any noise or distortion becomes part of the signal
permanently.
There’s no way to distinguish what part of the signal is "original" and what part is
"noise."
This is why analog transmissions degrade over distance, while digital signals can be
regenerated flawlessly.
3. Multiplexing: Why TDM is Simpler Than FDM
Multiplexing allows multiple signals to share the same communication channel efficiently.
Frequency-Division Multiplexing (FDM) – Used in Analog Systems



In analog systems, different signals are assigned different frequency bands (e.g., radio
stations on FM frequencies 88 MHz to 108 MHz).
FDM requires complex filtering to ensure signals don’t overlap.
As more signals are added, bandwidth becomes a limiting factor.
Time-Division Multiplexing (TDM) – Used in Digital Systems



In TDM, different signals take turns using the channel in short time slots.
Since digital signals are just sequences of 1s and 0s, they can be easily divided into
time slots without interference.
TDM is more efficient and allows higher data transmission rates than FDM.
Because of this, modern digital systems prefer TDM over FDM, simplifying transmission
and increasing efficiency.
4. Security & Encryption: Protecting Digital
Communication
One of the biggest reasons for the widespread adoption of digital communication, especially
in military and commercial sectors, is security.
How Digital Systems Ensure Security
1. Encryption – Digital signals can be encrypted using algorithms like AES (Advanced
Encryption Standard) to prevent unauthorized access.
2. Authentication – Digital techniques can verify the sender and receiver's identities.
3. Interference Protection – Digital signals can be designed to withstand jamming
and hacking attempts, making them ideal for military use.
Why Analog Signals Are Less Secure


Analog signals can be intercepted easily with basic equipment (e.g., eavesdropping on
radio or telephone calls).
Encryption in analog is difficult and requires additional hardware, making it less
practical.
5. Synchronization Challenges in Digital Systems
One drawback of digital communication is the need for precise synchronization.
Why Synchronization is Crucial


Digital communication relies on accurate timing to correctly interpret 1s and 0s.
If the timing is slightly off, the receiver may misinterpret bits, leading to errors.
How Synchronization is Achieved


Digital systems use clocks and synchronization signals to align transmission and
reception.
Techniques like phase-locked loops (PLLs) help maintain synchronization.
Why Analog Synchronization is Easier


Analog signals flow continuously and do not require precise bit-level
synchronization.
However, this comes at the cost of higher noise susceptibility and distortion.
6. Nongraceful Degradation: A Digital Weakness
While digital communication has many advantages, it has one major drawback: sudden
failure at low signal-to-noise ratios (SNR).
How Digital Systems Fail Abruptly


Digital systems rely on threshold detection (deciding if a signal is a 1 or 0).
If noise levels become too high, the signal becomes unreadable and fails suddenly.
How Analog Systems Degrade Gradually

Analog signals don’t have a strict threshold for interpretation.

As noise increases, the signal quality decreases gradually, rather than failing all at
once.
Despite this, digital systems often compensate for this issue by using error correction and
higher transmission power.
7. Practical Applications: Why Digital Communication is
Dominant
Digital communication is now used in almost every industry because of its advantages.
Telecommunications (Mobile Phones & Internet)


Mobile networks (4G, 5G) use digital transmission to provide high-speed data and
clear voice communication.
The internet relies on packet-switching (TCP/IP), which is only possible in digital
systems.
Broadcasting (TV & Radio)


Digital TV and radio (DVB, DAB) offer better quality and higher efficiency than
analog.
Digital signals take up less bandwidth and can be compressed to transmit more
information.
Military & Aerospace


Secure communication using encrypted digital signals prevents interception and
jamming.
Digital radar and GPS systems offer more precise tracking and navigation.
Computers & Networking


The entire internet and modern computing rely on digital communication.
Data transmission between devices (USB, Wi-Fi, Ethernet) is purely digital.
Final Thoughts: Why Digital Wins
While analog communication has some advantages (easier synchronization, gradual
degradation), digital communication far outweighs it in terms of reliability, security,
efficiency, and quality.
That’s why almost all modern communication systems—military and commercial—have
"gone digital."
Would you like more details on any specific area? 😊
Summary
The provided text delves into the details of digital communication, highlighting its advantages
over analog systems. Key areas of discussion include the regeneration of signals, error detection
and correction, multiplexing methods, security and encryption measures, and synchronization
challenges. Each section elucidates why digital communication has become the preferred
standard in various sectors, particularly emphasizing its reliability, efficiency, and security
features.
Highlights





Signal Regeneration: Digital signals can be regenerated perfectly, overcoming the degradation
issues faced by analog signals.
Error Detection & Correction: Digital communication effectively utilizes error-checking methods
to maintain high fidelity.
Multiplexing: Time-Division Multiplexing (TDM) is preferred for its simplicity and higher data
rates compared to Frequency-Division Multiplexing (FDM).
Security & Encryption: Digital systems are inherently more secure due to encryption and other
protective measures.
Synchronization: Precise timing is essential in digital communications to avoid misinterpretation
of signals, although it presents challenges.
Key Insights
Digital communication distinguishes itself through its ability to regenerate signals, utilize error
detection and correction techniques, multiplex efficiently, ensure security, and complicate
synchronization. These insights reinforce the notion that digital systems are better tailored for
modern communication demands.
Outline
1. Signal Regeneration: Why Digital Wins Over Analog
Digital signals exhibit a formidable strength in regeneration. As signals travel through various
mediums, they experience degradation due to factors such as distortion and noise. Analog
signals, particularly, accumulate these distortions and cannot be restored accurately.
Regenerative repeaters in digital communication play a crucial role by reshaping and restoring
these signals back to their original forms before degradation occurs. By working in binary states
(1s and 0s), digital amplifiers can effectively remove noise, showcasing the reliability and
efficiency of digital communication, especially over long distances.
2. Error Detection & Correction: High Fidelity in Digital Systems
One of the significant advantages of digital systems is their ability to detect and correct
transmission errors. Digital communication employs various error-checking codes such as parity
bits, checksums, and cyclic redundancy checks (CRC) to identify inaccuracies. Once detected,
errors can either be corrected in real-time or result in retransmission requests. This capability
ensures minimal error rates and preserves signal integrity, a stark contrast to analog systems
where any noise becomes part of the signal itself, leading to irreversible degradation.
3. Multiplexing: Why TDM is Simpler Than FDM
Multiplexing techniques allow multiple signals to efficiently use the same communication channel.
In analog systems, Frequency-Division Multiplexing (FDM) assigns different frequency bands to
various signals, necessitating complex filtering to prevent overlap, which often leads to
bandwidth limitations. Conversely, Time-Division Multiplexing (TDM)—predominantly in digital
systems—allocates short time slots for different signals, enabling ease of division without
interference. This method supports higher data transmission rates and simplifies overall
operation, making TDM the preferred choice in contemporary digital communications.
4. Security & Encryption: Protecting Digital Communication
The security aspect of digital communication significantly contributes to its preference in sectors
demanding confidentiality, such as military and commercial industries. Digital systems leverage
encryption methods like the Advanced Encryption Standard (AES) to secure data against
unauthorized access. Furthermore, these systems can authenticate sender and receiver
identities, bolstering communication integrity. In comparison, analog signals are more susceptible
to interception and lack robust encryption methods, rendering them less secure for sensitive
communications.
5. Synchronization Challenges in Digital Systems
Despite its advantages, digital communication faces challenges concerning synchronization.
Accurate timing is essential to accurately interpret the binary signals. Any misalignment can lead
to errors in how bits are read. To achieve synchronization, digital systems utilize clocks and
synchronization signals, which ensure that the transmission and reception of signals are aligned.
While synchronization enhances reliability, it also introduces complexity in managing accurate
timing.
Core Concepts





Regeneration of Signals: Digital signals can be restored to their initial condition, preventing the
degradation issues faced by analog signals.
Error Detection and Correction: Robust systems maintain signal fidelity through various errorchecking mechanisms.
Efficient Multiplexing: Time-Division Multiplexing enhances data transmission rates and
operational simplicity.
Enhanced Security Measures: Digital communication benefits from advanced security features,
making it suitable for sensitive applications.
Synchronization: Precise timing is necessary for optimal functioning in digital communications,
but managing this synchronization can be complex.
Keywords
Digital communication, signal regeneration, error detection, multiplexing, time-division
multiplexing, frequency-division multiplexing, encryption, security, synchronization, analog
signals, signal fidelity.
Here are the notes in the same language style as your lecture:
Notes: Introduction to Filters



A filter passes the desired frequency components whereas it attenuates the
undesired frequency components.
In the signals and systems perspective, any LTI system is a filter, and any
convolution operation is a filtering operation.
An LTI system is characterized by its impulse response (H), and if we have an input
XX, the output YY is given as:
Y=X∗HY = X * H

Filter designing is basically modeling this impulse response H.
Need for Filters – Example: Voice Recorder


A mic captures our voice, but the recorded signal contains extra frequency
components (noise).
This additional component is not easily visualized in the time domain, so we take
the frequency domain representation (Fourier Transform).

The Fourier transform of the recorded signal shows extra frequency components
that were not present in the original voice signal.
Filtering Process





The goal is to pass the desired frequency range and attenuate the unwanted
components.
If we define a frequency range [−Fc,Fc][-F_c, F_c] that we need to pass and
eliminate everything outside, we can get back a clean signal.
This can be achieved by designing a system that passes all frequency components
inside the required range and attenuates the rest.
Multiplying the Fourier transform of the recorded signal with the filter removes the
unwanted components.
Taking the inverse Fourier transform of this gives the filtered voice signal.
Poles and Zeros in Filtering




Zeros are responsible for attenuating the frequencies at the locations where they are
placed.
Poles are responsible for passing (boosting) the frequencies where they are placed.
To design a filter:
o Place poles in the frequency range that we need to pass.
o Place zeros in the frequency range that we need to attenuate.
But manually placing poles and zeros for all frequency components is not practical.
Need for a Systematic Procedure for Filter Design


Instead of manually placing poles and zeros, we need a proper systematic procedure
for designing filters.
This systematic filter designing process will be covered in the upcoming lectures.
Summary




A filter is used to pass desired frequencies and attenuate undesired frequencies.
Example of voice recording system shows the need for filtering to remove extra
frequency components.
Zeros help in attenuating, while poles help in passing frequencies.
Manually placing poles and zeros is difficult, so a proper filter design method is
required, which will be studied in the next lectures.
This keeps the same flow and explanation style as your original lecture. Let me know if you
need any changes! 😊
Here are your lecture notes in the same language style:
Lecture Notes: Designing an Ideal Low-Pass Discrete-Time Filter
Recap of Previous Lecture



Introduced the concept of a filter and why it is needed.
Discussed the necessity of a proper procedure for designing a filter.
In this lecture, we will go through that procedure and design an ideal low-pass
discrete-time filter.
Step 1: Understanding the Problem Statement



Consider a signal whose Fourier transform (magnitude response) is given in a plot.
The signal has significant frequency components from -1 kHz to 1 kHz, and the
components outside this range are not significant.
The goal is to design a filter that passes all frequencies from -1 kHz to 1 kHz and
removes the rest.
Step 2: Defining the Ideal Low-Pass Filter in the Frequency Domain


We consider a system whose Fourier transform (H) has:
o Magnitude = 1 for frequencies between -1 kHz to 1 kHz.
o Magnitude = 0 outside this range.
The multiplication of the Fourier transform of the signal (X) and the filter (H) results
in a filtered signal containing only the required frequency components.
Definition of the Ideal Low-Pass Filter
H(F)={1,−1 kHz≤F≤1 kHz0,otherwiseH(F) = \begin{cases} 1, & -1 \text{ kHz} \leq F \leq 1 \text{ kHz} \\
0, & \text{otherwise} \end{cases}

The frequency 1 kHz till which the components are passed is called the cutoff
frequency (F_c).
Step 3: Mapping Continuous-Time Parameters to Discrete-Time Parameters



The given Fourier transform and cutoff frequency are for continuous-time signals.
We need to convert them into discrete-time equivalents.
If the continuous-time signal x(t)x(t) is sampled with a frequency FsF_s, the
discrete-time angular frequency ω\omega is given by:
ω=2πFFs\omega = \frac{2\pi F}{F_s}
where:
o
o

FF = frequency in Hz
FsF_s = sampling frequency in Hz
Given:
o
o

Sampling frequency, Fs=4F_s = 4 kHz
Cutoff frequency, Fc=1F_c = 1 kHz
The discrete-time cutoff frequency ωc\omega_c is found as:
ωc=2πFcFs=2π(1×103)4×103=π2\omega_c = \frac{2\pi F_c}{F_s} = \frac{2\pi (1 \times
10^3)}{4 \times 10^3} = \frac{\pi}{2}

The ideal low-pass filter in discrete time is defined as:
H(ω)={1,−π2≤ω≤π20,otherwiseH(\omega) = \begin{cases} 1, & -\frac{\pi}{2} \leq \omega
\leq \frac{\pi}{2} \\ 0, & \text{otherwise} \end{cases}
Step 4: Converting H(ω) to h(n) using Inverse DTFT


To design a discrete-time filter, we need the impulse response h(n)h(n) of the
system.
The Inverse Discrete-Time Fourier Transform (IDTFT) is given by:
h(n)=12π∫−ππH(ω)ejωndωh(n) = \frac{1}{2\pi} \int_{-\pi}^{\pi} H(\omega) e^{j\omega n}
d\omega

Since H(ω)=1H(\omega) = 1 for −π/2≤ω≤π/2-\pi/2 \leq \omega \leq \pi/2, we modify
the limits:
h(n)=12π∫−π/2π/2ejωndωh(n) = \frac{1}{2\pi} \int_{-\pi/2}^{\pi/2} e^{j\omega n} d\omega

Solving the integral:
h(n)=1πn(sin⁡(π2n))h(n) = \frac{1}{\pi n} \left( \sin\left(\frac{\pi}{2} n\right) \right)
which simplifies to:
h(n)=sin⁡(ωcn)πn,for n≠0h(n) = \frac{\sin(\omega_c n)}{\pi n}, \quad \text{for } n \neq 0
Handling the Special Case n=0n = 0


When n=0n = 0, the expression becomes 0/0, which is undefined.
We evaluate it separately using the original integral:
h(0)=ωcπh(0) = \frac{\omega_c}{\pi}
Substituting ωc=π/2\omega_c = \pi/2:
h(0)=12h(0) = \frac{1}{2}
Step 5: Final Filter Equation
The impulse response of the ideal low-pass discrete-time filter is:
h(n)={sin⁡(ωcn)πn,n≠0ωcπ,n=0h(n) = \begin{cases} \frac{\sin(\omega_c n)}{\pi n}, & n \neq 0 \\
\frac{\omega_c}{\pi}, & n = 0 \end{cases}

Since ωc=π/2\omega_c = \pi/2 in this case:
h(n)={sin⁡(πn/2)πn,n≠00.5,n=0h(n) = \begin{cases} \frac{\sin(\pi n / 2)}{\pi n}, & n \neq 0 \\
0.5, & n = 0 \end{cases}

This function is known as the sinc function, which has a central peak and oscillates.
Step 6: Practical Considerations




h(n)h(n) extends from n=−∞n = -\infty to n=+∞n = +\infty, which is ideal but not
practical.
In reality, we must truncate this impulse response to a finite number of samples.
This truncation introduces side effects in the frequency domain (like ripples).
These effects will be discussed in the next lecture.
Summary of Steps for Designing an Ideal Low-Pass Filter
1. Define the problem – Identify the desired passband and cutoff frequency.
2. Map continuous-time parameters to discrete-time using:
ωc=2πFcFs\omega_c = \frac{2\pi F_c}{F_s}
3. Define the ideal filter in the frequency domain:
H(ω)={1,−ωc≤ω≤ωc0,otherwiseH(\omega) = \begin{cases} 1, & -\omega_c \leq \omega \leq
\omega_c \\ 0, & \text{otherwise} \end{cases}
4. Use Inverse DTFT to find the impulse response h(n)h(n).
5. Handle the special case n=0n = 0 separately.
6. Recognize that the impulse response is infinite, and practical filters require
truncation (to be discussed next).
Next Steps



Truncating the impulse response and its effects on the frequency domain.
Understanding the trade-offs in practical filter design.
Windowing techniques to reduce side effects.
This version keeps the same detailed style as your lecture while ensuring clarity. Let me
know if you need any adjustments! 😊
Here’s a summary of the lecture in the original language:
Lecture on Digital Signal Processing:
1. Ideal Low-Pass Filter:


The ideal low-pass filter has a frequency response with a magnitude of 1 for
frequencies between −ΩC-\Omega_C and ΩC\Omega_C, where ΩC\Omega_C is the
cutoff frequency. For other frequencies, the magnitude is 0.
The time-domain equivalent of the filter is the sinc function, represented as:
H(n)=sin⁡(ΩCn)πn,for n≠0,and H(0)=ΩCπH(n) = \frac{\sin(\Omega_C n)}{\pi n},
\quad \text{for} \, n \neq 0, \quad \text{and} \, H(0) = \frac{\Omega_C}{\pi}
2. Problems with the Ideal Filter:


The ideal filter has an infinite duration because it spans from −∞-\infty to +∞+\infty.
Hence, it cannot be implemented practically.
It is also non-causal, meaning the filter’s response extends into the negative time
domain (n<0n < 0).
3. Making a Non-Causal Filter Causal:


A delay can make a non-causal system causal. By introducing a delay (shifting the
filter by a certain number of units), a non-causal system can be transformed into a
causal one.
However, for the ideal low-pass filter, to make it causal, you would require an infinite
delay, which is impractical.
4. Truncating the Ideal Filter:


The ideal filter can be truncated to a finite length. For example, you might only
consider the values of the filter at n=−1,0,1n = -1, 0, 1. This results in a finite impulse
response (FIR) filter.
Truncating the ideal filter introduces ripples in the frequency domain, a
phenomenon known as the Gibbs phenomenon.
5. Gibbs Phenomenon:

The Gibbs phenomenon refers to the ripples or overshoot that appear in the
frequency response when an ideal filter is truncated. Even when you increase the
length of the filter (from 3 to 51 or 101 points), the ripples persist, though their
magnitude diminishes.
6. Causal FIR Filters:


After truncating, you can shift the impulse response to make the system causal. This
involves delaying the impulse response by an amount L−1L - 1, where LL is the filter
length.
This shifting effectively makes the system causal, and this system is referred to as a
causal FIR filter.
7. Z-Transform of FIR Filters:

The Z-transform of a causal FIR filter is given by:
H(Z)=∑k=0L−1BkZ−kH(Z) = \sum_{k=0}^{L-1} B_k Z^{-k}
where BkB_k represents the filter coefficients, and LL is the filter length.
8. Key Points Covered in the Lecture:



Causality: A system is causal if its output depends only on current and past inputs
(not future inputs).
FIR Filters: Finite Impulse Response filters, which can be made causal by shifting
the impulse response.
Gibbs Phenomenon: Truncating the ideal filter introduces ripples in the frequency
response, an inherent issue in approximating ideal filters.
9. Next Lecture:

In the next lecture, techniques to reduce the ripples (Gibbs phenomenon) in the
frequency domain will be discussed.
This summary maintains the language and style of the original content, including key
concepts and technical terms. If you need more details on a specific topic, feel free to ask!
Here is a summary of the lecture in its original language, highlighting the key points:
Lecture on FIR Filter Design and Window Functions
1. Recap of Previous Lecture:

In the previous lecture, we designed an FIR filter using the ideal low-pass filter by
truncating its infinite duration to a finite range. The range of nn was limited to
[−m/2,m/2][-m/2, m/2], where mm is the order of the filter.
2. Example:


Consider m=20m = 20. The range of nn will be from −10-10 to 1010, and the
truncated filter H(n)H(n) is plotted as a blue curve. This truncated filter is compared
with the ideal filter, shown by the yellow plot.
The truncation operation leads to ripples in the frequency domain, which appear at
the points of discontinuity due to the sudden truncation.
3. Mathematical Representation of Truncation:



The ideal filter Hideal(n)H_{\text{ideal}}(n) is truncated by multiplying it with a
window function W(n)W(n), which is 1 for nn between −10-10 and 1010 and 0
otherwise.
This function W(n)W(n) is known as the rectangular window.
The truncated filter H(n)H(n) is obtained as:
H(n)=Hideal(n)×W(n)H(n) = H_{\text{ideal}}(n) \times W(n)
4. Problems with Rectangular Window:


Truncating with a rectangular window leads to ripples in the frequency domain.
These ripples are due to the sudden transition from 1 to 0 at the boundaries of the
window.
5. Smoother Window:



To reduce the ripples, a smoother window is introduced instead of the rectangular
window.
The smoother window leads to a gradual transition from 1 to 0, which significantly
reduces the ripples in the frequency domain.
The frequency response of the smoother window is shown in the red plot, and it has
fewer ripples compared to the rectangular window (blue plot).
6. Example of Smoother Window:

One example of a smoother window is the Hanning window, given by the equation:
W(n)=0.5+0.5cos⁡(2πnm)W(n) = 0.5 + 0.5 \cos\left(\frac{2\pi n}{m}\right)

This window significantly reduces the ripples in the frequency domain.
7. Trade-off:

While smoother windows reduce ripples, they also increase the transition width (the
width over which the filter transitions from passband to stopband).

The reduction in ripples comes at the cost of an increased transition width.
8. Types of Windows:

Several types of windows are used in FIR filter design:
o Rectangular Window: W(n)=1W(n) = 1
o Hanning Window: W(n)=0.5+0.5cos⁡(2πnm)W(n) = 0.5 + 0.5
\cos\left(\frac{2\pi n}{m}\right)
o Hamming Window: W(n)=0.5+0.46cos⁡(2πnm)W(n) = 0.5 + 0.46
\cos\left(\frac{2\pi n}{m}\right)
o Bartlett Window (Triangular Window): W(n)=1−2∣nm∣W(n) = 1 2\left|\frac{n}{m}\right|
o Blackman Window: W(n)=0.42+0.5cos⁡(2πnm)+0.08cos⁡(4πnm)W(n) =
0.42 + 0.5 \cos\left(\frac{2\pi n}{m}\right) + 0.08 \cos\left(\frac{4\pi
n}{m}\right)
9. Conclusion:



The lecture focused on how truncating the ideal filter with a rectangular window
leads to ripples in the frequency domain, and how using a smoother window can
reduce these ripples.
Smoother windows reduce ripples at the cost of increasing the transition width.
In the next lecture, we will explore the properties of these different windows in more
detail.
This summary captures the main concepts and methods discussed in the lecture. If you need
further clarification on any point, feel free to ask!
Here is a summary of the lecture in its original language, focusing on the key concepts
discussed:
Lecture on FIR Filter Design and Window Specifications
1. Recap of Previous Lecture:


In the previous lecture, we designed an FIR filter using the windowing technique.
The main issue with the rectangular window (sudden truncation) is that it introduces
ripples in the frequency domain.
By using a smoother window (such as the Hanning window), we observed a
reduction in these ripples in the frequency domain.
2. Window Functions:

We reviewed various window functions:
o Rectangular Window: W(n)=1W(n) = 1 for n∈[−m/2,m/2]n \in [-m/2, m/2]
o
o
o
o
Hanning Window: W(n)=0.5+0.5cos⁡(2πnm)W(n) = 0.5 + 0.5
\cos\left(\frac{2\pi n}{m}\right)
Hamming Window: W(n)=0.54+0.46cos⁡(2πnm)W(n) = 0.54 + 0.46
\cos\left(\frac{2\pi n}{m}\right)
Bartlett Window: W(n)=1−2∣nm∣W(n) = 1 - 2 \left|\frac{n}{m}\right|
Blackman Window: W(n)=0.42+0.5cos⁡(2πnm)+0.08cos⁡(4πnm)W(n) =
0.42 + 0.5 \cos\left(\frac{2\pi n}{m}\right) + 0.08 \cos\left(\frac{4\pi
n}{m}\right)
3. Filter Specifications:


When designing a filter, the choice of window depends on the filter specifications:
o Pass Band: The frequency range that should pass through the filter with a
certain gain.
o Stop Band: The frequency range that should be attenuated.
o Pass Band Edge (ωp\omega_p): The frequency up to which signals should
pass.
o Stop Band Edge (ωs\omega_s): The frequency beyond which signals should
be stopped.
o Transition Width (Δω\Delta \omega): The frequency range between the pass
band and stop band where the transition occurs, calculated as ωs−ωp\omega_s
- \omega_p.
o Pass Band Ripple (Δ1\Delta_1): The allowable ripple in the pass band.
o Stop Band Ripple (Δ2\Delta_2): The allowable ripple in the stop band,
ideally this should be 0.
o Peak Side Lobe: The height of the first side lobe in the frequency domain.
Stop Band Ripple (Δ2\Delta_2) should be as small as possible, ideally approaching
0, and is measured in decibels (20log⁡(Δ2)20 \log(\Delta_2)).
4. Main Lobe and Side Lobes:

The main lobe is the region containing the pass band and transition width, while the
side lobes correspond to the ripples or lobes in the stop band.
5. Designing Filters:

To design a filter with specific specifications, you need values such as:
o Pass band edge (ωp\omega_p)
o Stop band edge (ωs\omega_s)
o Transition width
o Stop band attenuation (Δ2\Delta_2) in dB
o Peak side lobe
o Filter order (mm)
o Cutoff frequency (ωc\omega_c)
6. Window Specifications Comparison:

We compared the specifications of different windows:
o Rectangular Window:



o
o
o
o
Peak Side Lobe: -13 dB
Transition Width: 4πm+1\frac{4\pi}{m+1}
Stop Band Attenuation: -21 dB
Bartlett Window:
 Peak Side Lobe: -25 dB
 Transition Width: 8πm\frac{8\pi}{m}
 Stop Band Attenuation: -25 dB
Hanning Window:
 Peak Side Lobe: -31 dB
 Transition Width: 8πm\frac{8\pi}{m}
 Stop Band Attenuation: -44 dB
Hamming Window:
 Peak Side Lobe: -41 dB
 Transition Width: 8πm\frac{8\pi}{m}
 Stop Band Attenuation: -53 dB
Blackman Window:
 Peak Side Lobe: -57 dB
 Transition Width: 12πm\frac{12\pi}{m}
 Stop Band Attenuation: -74 dB
7. Trade-offs:



The Blackman window provides the best peak side lobe (-57 dB) and stop band
attenuation (-74 dB), but it also has the largest transition width.
The Rectangular window has the smallest transition width, but its peak side lobe
and stop band attenuation are not as good as the Blackman window.
There is a trade-off between achieving better side lobes and stop band attenuation
and larger transition width.
8. Conclusion:


When designing a filter, you must balance the trade-offs between transition width,
side lobe levels, and stop band attenuation to meet the filter specifications.
The window function you choose depends on these specifications, and understanding
their properties will help in selecting the most suitable one for the given design.
This concludes the main concepts covered in the lecture. Let me know if you need more
details or further clarification!
Here’s a summary of the key concepts from the lecture:
Lecture on Designing Causal FIR Filters:
1. Recap of Previous Lecture:


In earlier lectures, we learned how to design a low-pass FIR filter using the
windowing technique.
The process involved multiplying the ideal low-pass filter
Hideal(n)H_{\text{ideal}}(n) by a window function W(n)W(n). This resulted in the
desired non-causal FIR filter.
2. Making the Filter Causal:


The non-causal FIR filter has a range of nn from −M/2-M/2 to M/2M/2, meaning the
filter is not causal.
To make the filter causal, we need to shift the filter to have a range of nn from 0 to
MM. This is achieved by introducing a delay of M/2M/2 units. The delayed filter is
then represented as H(n)=Hideal(n−M/2)H(n) = H_{\text{ideal}}(n - M/2).
3. Delayed Ideal Filter:

The ideal low-pass filter Hideal(n)H_{\text{ideal}}(n) is given by:
Hideal(n)=sin⁡(ΩCn)πnforn≠0H_{\text{ideal}}(n) = \frac{\sin(\Omega_C n)}{\pi
n} \quad \text{for} \quad n \neq 0
and at n=0n = 0, the value is ΩC/π\Omega_C / \pi, where ΩC\Omega_C is the cutoff
frequency.

After introducing the delay, the equation becomes:
Hideal(n−M/2)=sin⁡(ΩC(n−M/2))π(n−M/2)H_{\text{ideal}}(n - M/2) =
\frac{\sin(\Omega_C (n - M/2))}{\pi (n - M/2)}
This is the delayed version of the ideal low-pass filter.
4. Delayed Window Function:

The window function W(n)W(n) also needs to be delayed by M/2M/2. For the
Hanning window, the equation is:
W(n)=0.5+0.5cos⁡(2πnM)W(n) = 0.5 + 0.5 \cos\left( \frac{2\pi n}{M} \right)
After shifting by M/2M/2, we get:
W(n−M/2)=0.5−0.5cos⁡(2πnM−π)W(n - M/2) = 0.5 - 0.5 \cos\left( \frac{2\pi n}{M}
- \pi \right)
Simplifying this using the trigonometric identity cos⁡(θ−π)=−cos⁡(θ)\cos(\theta \pi) = -\cos(\theta), we obtain:
W(n−M/2)=0.5−0.5cos⁡(2πnM)W(n - M/2) = 0.5 - 0.5 \cos\left( \frac{2\pi n}{M}
\right)
5. Other Window Functions for Causal Filter:





Rectangular Window: No change needed.
Hanning Window: W(n)=0.5−0.5cos⁡(2πnM)W(n) = 0.5 - 0.5 \cos\left( \frac{2\pi
n}{M} \right)
Hamming Window: W(n)=0.54−0.46cos⁡(2πnM)W(n) = 0.54 - 0.46 \cos\left(
\frac{2\pi n}{M} \right)
Bartlett Window: W(n)=1−2∣n−M/2M∣W(n) = 1 - 2 \left| \frac{n - M/2}{M} \right|
Blackman Window: W(n)=0.42−0.5cos⁡(2πnM)+0.08cos⁡(4πnM)W(n) = 0.42 0.5 \cos\left( \frac{2\pi n}{M} \right) + 0.08 \cos\left( \frac{4\pi n}{M} \right)
6. Conclusion:

To design a causal FIR filter, we introduce a delay of M/2M/2 units in both the ideal
filter and the window function. The causal filter is represented by:
H(n)=Hideal(n−M/2)⋅W(n−M/2)H(n) = H_{\text{ideal}}(n - M/2) \cdot W(n - M/2)

We also reviewed the delayed versions of common window functions like
rectangular, Hanning, Hamming, Bartlett, and Blackman windows, each adjusted
to suit the causal filter design.
This concludes the discussion on designing causal FIR filters by delaying the ideal filter and
window function. Let me know if you need more details!