DSP

Discrete Signals

Discrete Time Signals Standard Sequences LTI Systems Convolution Sum Difference Equations Correlation

Z-Transform

Z-Transform Definition Properties of ROC Inverse Z-Transform Transfer Function System Response

DFT & FFT

DTFT Overview DFT Basics Properties of DFT Circular vs Linear FFT Algorithms Computations in FFT Goertzel Algorithm

FIR Filters

Filter Types FIR Characteristics FIR Filter Design Window Functions Kaiser Window FIR Structures

IIR Filters

IIR Basics Impulse Invariance Bilinear Transform Butterworth Filters Chebyshev Filters IIR Structures

Multirate DSP

Decimation Interpolation Sampling Rate Conversion Polyphase Decomposition Filter Banks

Adaptive Filters

Adaptive Filter Basics LMS Algorithm RLS Algorithm Noise Cancellation Echo Cancellation Channel Equalization

DSP Applications

Speech Processing Basics Image Processing Basics Audio Compression Radar Signal Processing

Circular vs Linear

Using DFT for linear convolution.

Darshan N

Updated: 19 March 2026

9 min read

Circular vs Linear Quiz

Test your knowledge on this topic!

Question 1 of 3

Q1.To compute the linear convolution of two sequences of lengths L and M using circular convolution, what is the minimum required DFT length N?

DFT Basics

Discrete Fourier Transform definition, bins.

5 min read

DTFT Overview

Discrete Time Fourier Transform properties.

11 min read

Computations in FFT

Butterfly diagram, bit reversal.

10 min read

Goertzel Algorithm

Tone detection efficiency.

6 min read

LTI Systems

Linearity, Time-invariance, causality.

7 min read

Properties of DFT

FFT Algorithms

Contents