Skip to main content

How to normalize a highly distorted signal


 

Signal normalization is a common practice in signal processing, especially after a signal has undergone filtering. For example, when using an FIR low-pass filter during the demodulation process of a modulated signal—such as AM or DSB-SC demodulation—you may observe that the first few samples of the demodulated signal exhibit significant transients due to the filtering effect. This occurs because the filter requires approximately N past input samples to produce a steady-state or valid output. To correct for amplitude attenuation, the filtered signal can be normalized to a standard range, such as -1 to 1

 

MATLAB Script

% Parameters for the sine wave
fs = 1000; % Sampling frequency
t = 0:1/fs:1; % Time vector
f = 15; % Frequency of the sine wave

% Example signal: Noisy sine wave
filtered_signal = 0.03*sin(2 * pi * f * t) + 0.05*sin(2 * pi * f * t);
% Step 2: Normalize the filterd signal to the range [-1, +1]
normalized_signal = (filtered_signal - min(filtered_signal)) / (max(filtered_signal) - min(filtered_signal));
normalized_signal = normalized_signal * 2 - 1; % Scale to [-1, +1]


% Original Signal
figure();
plot(t, filtered_signal, 'b', 'LineWidth', 1.5);
title('Filtered Signal');
xlabel('Time (s)');
ylabel('Amplitude');
ylim([-0.1 0.1]);
grid on;

% Normalized Signal
figure();
plot(t, normalized_signal, 'g', 'LineWidth', 1.5);
title('Normalized Signal [-1, +1]');
xlabel('Time (s)');
ylabel('Amplitude');
grid on;

Output








 

 

Copy the MATLAB Code from here 

 


 

Normalize a Highly distorted filtered signal

When normalizing a filtered signal, you may observe that the initial data points are often highly distorted, while the remainder of the signal appears stable. Therefore, it's recommended to discard the first N points (where N is the filter order) before performing normalization.

 

MATLAB script for normalizing a highly distorted filtered signal, where the first few samples are highly transient due to filtering effects

 
 % Parameters for the sine wave
fs = 1000; % Sampling frequency
t = 0:1/fs:1; % Time vector
t1 = N/fs:1/fs:1;
f = 15; % Frequency of the sine wave

% Example signal: Noisy sine wave
filtered_signal = 0.03*sin(2 * pi * f * t) + 0.05*sin(2 * pi * f * t);

N = 10; % N = Filter order
signal1 = filtered_signal(1:N) * 15;
signal2 = filtered_signal(N+1:end);

filtered_signal = [signal1 signal2];


% Normalize the filterd signal to the range [-1, +1] without discarding
% first N-points (N = order of filter)
normalized_signal = (filtered_signal - min(filtered_signal)) / (max(filtered_signal) ...
- min(filtered_signal));
normalized_signal = normalized_signal * 2 - 1; % Scale to [-1, +1]

% Normalize the filterd signal to the range [-1, +1]
normalized_signal1 = (filtered_signal(N+1:end) - min(filtered_signal(N+1:end))) / (max(filtered_signal(N+1:end)) ...
- min(filtered_signal(N+1:end)));
normalized_signal1 = normalized_signal1 * 2 - 1; % Scale to [-1, +1]


% Original Signal
figure();
plot(t, filtered_signal, 'b', 'LineWidth', 1.5);
title('Highly Distorted Filtered Signal');
xlabel('Time (s)');
ylabel('Amplitude');
ylim([-1 1]);
grid on;

% Normalized Signal
figure();
plot(t, normalized_signal, 'g', 'LineWidth', 1.5);
title('Normalized Signal [-1, +1] without discarding first N-points');
xlabel('Time (s)');
ylabel('Amplitude');
grid on;

% Normalized Signal
figure();
plot(t1, normalized_signal1, 'g', 'LineWidth', 1.5);
title('Normalized Signal [-1, +1]');
xlabel('Time (s)');
ylabel('Amplitude');
grid on;

Output 

 
















 Suppose we are using a filter of order N (e.g., 200), which uses N+1 taps (for FIR). The filter requires approximately N past input samples to produce a steady-state or valid output. Therefore, the first N or so samples are based on incomplete data, leading to startup transients. Discarding the first N samples is thus a conservative and practical way to avoid these artifacts.

Further Reading



Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2026 - Question Paper Download PDF June 202...

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

Coherent vs. Non-Coherent Demodulation

  For demodulation In general: 1. Synchronous (coherent) demodulation Receiver generates a local carrier/oscillator . It combines/multiplies the received signal with that carrier. Then a filter extracts the message. Received signal ↓ × Local oscillator ↓ Low-pass filter ↓ Message So yes, carrier multiplication is a common implementation of synchronous demodulation . 2. Asynchronous (non-coherent) demodulation Receiver doesn't need a phase-synchronized local carrier . It uses properties of the received signal itself to recover the information. For ASK , an envelope detector is the classic example: ASK signal ↓ Diode + RC ↓ Envelope ↓ Comparator ↓ Data Modulation Synchronous demodulation Non-coherent/asynchronous demodulation ASK/OOK Local carrier + multiplier Envelope detector AM Product detector Envelope detector FSK Coherent correlator/mixer Frequency discriminator, filters, etc. PSK Local synchronized carrier + multiplier Differential/n...

Alamouti Scheme for 2x2 MIMO in MATLAB

📘 Overview & Theory 🧮 MATLAB Code for Alamouti Scheme 🧮 MATLAB Code for BER vs. SNR for Alamouti Scheme 🧮 Alamouti Scheme Simulator 🧮 Alamouti Scheme Transmission Table 📚 Further Reading    Read about the Alamouti Scheme first MATLAB Code for Alamouti's Precoding Matrix for 2 X 2 MIMO % Clear any existing data and figures clc; clear; close all; % Define system parameters transmitAntennas = 2; % Number of antennas at the transmitter receiveAntennas = 2; % Number of antennas at the receiver symbolCount = 1000000; % Number of symbols to transmit SNR_dB = 15; % Signal-to-Noise Ratio in decibels % Generate random binary data for transmission rng(10); % Set seed for reproducibility transmitData = randi([0, 1], transmitAntennas, symbolCount); % Perform Binary Phase Shift Keying (BPSK) modulation modulatedSymbols = 1 - 2 * transmitData; % Define Alamouti's Precoding Matrix precodingMatrix = [1 1; -1i 1i]; % Encode and transmit dat...

Online Simulator for ASK, FSK, and PSK Signal Generation

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 Demodulation More Topics 1. ASK (Ampli...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...