Tag: Discrete Fourier Transform (DFT)

Magnitude and phase of the DFT of a rectangular signal for L = 7, N= 16 and starting sample shifted by one
DSP

DFT Examples

For understanding what follows, we need to refer to the Discrete Fourier Transform (DFT) and the effect of time shift in frequency domain first. Here, we discuss a few examples of DFTs of some basic signals that will help not only understand the Fourier transform but will also be useful in comprehending concepts discussed further. A Rectangular Signal A rectangular sequence, both in time and frequency domains, is by far the most important signal encountered in digital signal processing. One of the reasons is that any signal with a finite duration, say $T$ seconds, in time domain (that all practical

Continue reading
A signal broken down into scaled and shifted impulses
DSP

Convolution

Understanding convolution is the biggest test DSP learners face. After knowing about what a system is, its types and its impulse response, one wonders if there is any method through which an output signal of a system can be determined for a given input signal. Convolution is the answer to that question, provided that the system is linear and time-invariant (LTI). We start with real signals and LTI systems with real impulse responses. The case of complex signals and systems will be discussed later. Convolution of Real Signals Assume that we have an arbitrary signal $s[n]$. Then, $s[n]$ can be

Continue reading
A prism decomposes the white light into 7 colours
DSP

The Discrete Fourier Transform (DFT)

Learned in some other articles on this website, the following three important concepts take us to the core of the Discrete Fourier Transform (DFT) idea. Regardless of the signal shape, most signals of practical interest can be considered as a sum of complex sinusoids oscillating at different frequencies. A set of $N$ orthogonal complex sinusoids can be constructed within a span of $N$ time domain samples. Each `tick’ or bin on the discrete frequency axis denotes the discrete frequency $k/N$ of such a complex sinusoid. To understand how a set of sinusoids with $N$ discrete frequencies can sum up to

Continue reading
DSP

Correlation

Correlation is a foundation over which the whole structure of digital communications is built. In fact, correlation is the heart of a digital communication system, not only for data detection but for parameter estimation of various kinds as well. Throughout, we will find recurring reminders of this fact. As a start, consider from the article on Discrete Fourier Transform that each DFT output $S[k]$ is just a sum of term-by-term products between an input signal and a cosine/sine wave, which is actually a computation of correlation. Later, we will learn that to detect the transmitted bits at the receiver, correlation

Continue reading
A linear system with scaled input and output
DSP

Linear Systems

In wireless communications and other applications of digital signal processing, we often want to modify a generated or acquired signal. A device or algorithm that performs some prescribed operations on an input signal to generate an output signal is called a system. Amplifiers in communication receivers and filters in image processing applications are some systems that we interact with in daily lives. Our main focus in these articles will be on a particular class of systems which are linear and time-invariant. A linear system implies that if two inputs are scaled and summed together to form a new input, the

Continue reading