Experiment No. A: Software Should Be Installed On PC. Theory
Experiment No. A: Software Should Be Installed On PC. Theory
THEORY -:
BASICS OF MATLAB
MATLAB is a language of technical computing. The MATLAB development environment is a set of tools
to help user use MATLAB functions and files. Many of these tools are graphical user interface.
To start MATLAB on Microsoft Windows platform, double-click MATLAB shortcut icon on your windows
desktop.
• Type quit at command window prompt. DESKTOP TOOLS Desktop is thought of as your instrument
panel for MATLAB. When you start MATLAB, desktop appears containing tools (GUI) for managing files,
variables and applications associated with MATLAB.
MATLAB Desktop -:
• Launch Pad- Run tools and access documentation for all of your MathWorks Products
• Current Directory Browser- View MATLAB files and related files and perform file operations such as
open, and find content.
• Help Browser- View and search documentation for the full family of MATLAB products.
• Array Editor- View array contents in a table format and edit values
The command window is the main way you communicate with MATLAB. It appears in the desktop when
you first start MATLAB. Use command window to run MATLAB functions and MATLAB operations.
MATLAB WORKSPACE
The MATLAB workspace consists of the set of variables built up during a MATLAB session and stored in
memory. You add variables to the workspace by using functions, running M-files and loading saved
workspaces.
FILE OPERATIONS:
MATLAB file operations use the current directory as a reference point. Any file you want to run must either
be in the current directory or on the search path. The key tools for performing file operations are
MATLAB provides many ways to load data from disk files or the clipboard into the workspace, a process
called Importing data, and to save workspace variables to a disk file, a process called exporting data. You
can import/export both text data and binary data. The easiest way to import the data is to use MATLAB
Import Wizard.
Demonstrations:
MATLAB provides very powerful Demonstrations for almost everything in the software. To start demo you
have to use demo command. It’s syntax is:
('matlab'|'toolbox'|'simulink'|'blockset'|'stateflow'),
You have to select the topic whose demo is required from the left panel and click Run.
Some commonly used basic MATLAB commands are: To learn more about each command type help in the
command window.
THEORY - The Discrete Fourier Transform (DFT) is a mathematical technique used in signal
processing and mathematics to analyse and manipulate signals and data in the frequency
domain. It is the discrete counterpart of the continuous Fourier Transform and is widely
used in various fields, including image processing, audio analysis, and communications.
The DFT takes a discrete sequence of numbers (often representing a signal sampled at
discrete points in time) and transforms it into another sequence of complex numbers,
representing the signal's frequency components. The formula for the DFT of a sequence
x[n] of N samples is given by:
N−1
X[k] = ∑n=0 x[n]⋅e−j(2π/N)kn , k=0,1,2,…,N−1
In this formula:
• X[k] represents the kth frequency component (complex number) of the signal.
• x[n] is the input sequence.
• N is the total number of samples in the sequence.
• j represents the imaginary unit.
• The sum is taken over all values of n from 0 to N−1.
In the context of the Discrete Fourier Transform (DFT), a "twiddle factor" refers to the
complex exponential term that is used to weight the input data or output coefficients when
performing the DFT or its inverse, the Inverse Discrete Fourier Transform (IDFT). The
twiddle factor is used to rotate and scale the values in the DFT computation.
OUTPUT - :
OUTPUT PLOT -:
RESULT – Discrete Fourier Transform of a sequence has been studied and implemented
successfully.
EXPERIMENT NO. 8
AIM- To study and implement the Inverse Discrete Fourier Transform of a Sequence.
THEORY - The Discrete Fourier Transform (DFT) is a mathematical technique used in signal
processing and mathematics to analyse and manipulate signals and data in the frequency
domain. It is the discrete counterpart of the continuous Fourier Transform and is widely
used in various fields, including image processing, audio analysis, and communications.
The IDFT takes this frequency-domain representation and converts it back into the time-
domain signal. Mathematically, the IDFT can be represented as follows:
N−1
X[n] = 1/N ∑n=0 x[k]⋅ej(2π/N)kn
In this formula:
• X[k] represents the kth frequency component (complex number) of the signal.
• x[n] is the input sequence.
• N is the total number of samples in the sequence.
• j represents the imaginary unit.
• The sum is taken over all values of n from 0 to N−1.
In the context of the Discrete Fourier Transform (DFT), a "twiddle factor" refers to the
complex exponential term that is used to weight the input data or output coefficients when
performing the DFT or its inverse, the Inverse Discrete Fourier Transform (IDFT). The
twiddle factor is used to rotate and scale the values in the DFT computation.
N−1
IDFT -> X[n]=1/N ∑n=0 x[k].W N-kn
CODE -:
OUTPUT -:
OUTPUT PLOT-:
RESULT – Discrete Fourier Transform of a sequence has been studied and implemented
successfully.
EXPERIMENT NO. 9
THEORY - The Fast Fourier Transform (FFT) is an efficient algorithm for computing the
Discrete Fourier Transform (DFT) and its inverse, the Inverse Discrete Fourier Transform
(IDFT). The FFT is widely used in various applications, including signal processing, data
analysis, image processing, and more, due to its significant speed improvements over the
straightforward DFT calculation, especially for large data sets.
• Speed: The primary advantage of the FFT is its computational efficiency. It reduces
the number of arithmetic operations required to compute the DFT from O(N^2) (for
the straightforward DFT) to O(N log N) operations, where N is the number of data
points. This substantial reduction in computation time is especially crucial for real-
time and high-performance applications.
• Divide-and-Conquer Approach: The FFT algorithm employs a divide-and-conquer
strategy to split the DFT into smaller DFTs, allowing for recursive calculation and a
reduction in the number of operations.
CODE -:
CODE continued –:
OUTPUT-:
OUTPUT PLOT-:
RESULT – Fast Fourier Transform of a sequence has been studied and implemented
successfully.
EXPERIMENT NO. 10
AIM- To study target detection using radar via correlation
THEORY - Radar target detection via correlation involves analysing received radar signals to
identify the presence of targets. In MATLAB, this is achieved by generating a radar
waveform, simulating target echoes, adding noise and clutter, and applying matched
filtering (correlation) to enhance target signals.
Here's a general overview of how target detection using radar via correlation works:
1. Signal Transmission:
• Radar systems transmit radio frequency (RF) signals towards a specific area.
2. Signal Reflection:
• When the RF signals encounter objects in their path, they reflect back to the radar
receiver.
• The radar receiver processes the received signals, which may contain information
about the distance, speed, and direction of potential targets.
4. Correlation Processing:
• Correlation measures the similarity between the received signal and the reference
signal.
5. Thresholding:
• A threshold is set to determine whether the correlation result indicates the presence
of a target.
• If the correlation result surpasses the threshold, it suggests the presence of a target.
6. Target Identification:
OUTPUT -: