Skip to main content

Raised Cosine Filter in MATLAB (with Simulator)


 

MATLAB Code

clc;
clear all; close all;
Data_sym = [0 1 1 0 1 0 0 1];
M = 4;
Phase = 0;
Sampling_rate = 48e3;
Data_Rate = 100;
Bandwidth = 400;
Upsampling_factor = Sampling_rate/Data_Rate;
Rolloff = 0.4;
Upsampled_Data = upsample(pskmod(Data_sym,M,Phase),Upsampling_factor);
Pulse_shape = firrcos(2*Upsampling_factor,Bandwidth/2,Rolloff,Sampling_rate,'rolloff','sqrt');

Output

What if we change the roll-off

roll-off = 0.01



roll-off = 0.99




What if we change the bandwidth

Bandwidth = 100 Hz

 
Bandwidth = 1000 Hz 
 


What if we change the sampling rate

 Sampling rate = 10 KHz


 Sampling rate = 100 KHz



Another MATLAB Code

% The code is developed by SalimWireless.Com
clc;
clear;
close all;

% Parameters
fs = 1000; % Sampling frequency in Hz
symbolRate = 100; % Symbol rate (baud)
span = 6; % Filter span in symbols
alpha = 0.25; % Roll-off factor for raised cosine filter


% Generate random data symbols
numSymbols = 100; % Number of symbols
data = randi([0 1], numSymbols, 1) * 2 - 1; % Generate random binary data (BPSK symbols: -1, 1)

% Upsample the data to match sampling rate
samplesPerSymbol = fs / symbolRate; % Samples per symbol based on fs and symbol rate
dataUpsampled = upsample(data, samplesPerSymbol);

% Create a raised cosine filter
rcFilter = rcosdesign(alpha, span, samplesPerSymbol, 'sqrt'); % Square root raised cosine filter

% Apply the filter to the upsampled data
txSignal = conv(dataUpsampled, rcFilter, 'same');

figure;
subplot(4,1,1)
stem(data);
title('Original Message signal');
grid on;

subplot(4,1,2)
plot(dataUpsampled);
title('Upsampled Message signal');
grid on;

subplot(4,1,3)
plot(rcFilter);
title('Raise Cosine Filter Coefficient');
grid on;

subplot(4,1,4)
plot(txSignal);
title('Transmitted Signal after Raised Cosine Filtering');
grid on;
 

Output

 

 
 
 
 

Copy the MATLAB Code above from here

 

 


Raised Cosine Filter Online Simulator

Random Bits
   ↓
BPSK Mapping (±1)
   ↓
Upsampling
   ↓
RRC (Root Raised Cosine) Filter Pulse Shaping



Simulation Note: The simulator generates random BPSK symbols, applies pulse shaping using a Root Raised Cosine (RRC) filter with roll-off factor β , adds AWGN noise, and detects symbols using a matched filter.
Lower β values use less bandwidth but pulses are narrower in time and more susceptible to inter-symbol interference (ISI). Higher β values spread the pulse in time but reduce ISI and require more bandwidth.

Raised Cosine Filter: Basics, Formula, etc.

In wireless communication, Raised Cosine Filters (RCF) are essential for pulse shaping. Their primary goal is to minimize Inter-Symbol Interference (ISI) by ensuring the transmitted waveform fits within a specific bandwidth while maintaining timing accuracy at the receiver.

Key Formula & Bandwidth Calculation

The bandwidth ($B$) of a raised cosine filter is determined by the symbol rate ($R_s$) and the roll-off factor ($\alpha$), which ranges from 0 to 1:

Bandwidth (B) = [Symbol Rate × (1 + α)] / 2

Example: For a symbol rate of 100 symbols/sec and a roll-off factor ($\alpha$) of 0.25:
B = [100 × (1 + 0.25)] / 2 = 62.5 Hz.
This slightly exceeds the theoretical Nyquist minimum (50 Hz) to allow for realistic filter implementation without ISI.

Applications in Modern Systems

  • Time-Bandwidth Product (TBP): RCFs help manage the trade-off between time localization and spectral efficiency. Higher $\alpha$ reduces ISI but increases the TBP.
  • OFDM Systems: Pulse shaping confines the spectral bandwidth of OFDM waveforms, reducing out-of-band emissions and adjacent channel interference.
  • Pulse Shaping: Essential for mapping digital bits to analog waveforms suitable for band-limited channels.

Read more

Further reading

 


Contact Us

Name

Email *

Message *

Popular Posts

Hybrid Beamforming | Page 1

Beamforming Techniques Hybrid Beamforming... Page 1 | Page 2 | Hybrid Beamforming: Hybrid beam formation was developed to address some of the limitations of digital pre-coding approaches. Every antenna element is connected to an RF chain in digital pre-coding (beam forming) method. We also know that each RF chain is in charge of providing a separate data stream between the transmitter and the receiver. We know that a larger number of independent data streams leads to higher data rates. It has a spatial multiplexing feature for MIMO. As a result, we may assume that switching from MIMO to massive MIMO will benefit us more in terms of spatial multiplexing in massive MIMO, where each antenna is coupled to a single RF chain. We'll proceed with a definition of hybrid beam forming. Overview of hybrid beam forming with example: Unlike digital beam forming, more than one antenna element is connected to a single RF chain in hybr...

MATLAB Code for 8-PSK, 16-PSK, ...

📘 Overview & Theory 🧮 MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK 🧮 Simulator for m-ary PSK 📚 Further Reading   MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK clc; clear all; close all; rng(10) M = 8; % M = 2, 4, 8, 16, 32, etc. N_Bits = 2520; Phase = 0; data_info_bit = randi([0,1],N_Bits,1); data_temp = bi2de(reshape(data_info_bit,N_Bits/log2(M),log2(M))); modData = pskmod(data_temp,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   for BPSK, Constellation Size, M = 2 for QPSK, M = 4 for 8-PSK, M = 8, and so on    Output Figure: 8-PSK Modulation Figure: 8-PSK Demodulation after adding AWGN Noise Using the above MATLAB code you'll able be to modulate and demodulate 2-PSK, 4-PSK, 8-PSK, 16-PSK, 32-PSK and so on.  16-PSK   Fig: 16-PSK In this above code ' M ' is the number of the conste...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 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 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Galois Fields: GF(2) and GF(2m) and Primitive Polynomial

Galois Fields: GF(2) and GF(2 m ) 1. What is a Galois Field (GF)? A Galois Field (GF) is a finite set of elements in which the four basic arithmetic operations—addition, subtraction, multiplication, and division (except by zero)— are all well defined and closed. GF(q) ⇒ a field with exactly q elements 2. The Simplest Field: GF(2) GF(2) is the smallest possible finite field and forms the foundation of all digital systems. GF(2) = {0, 1} Addition in GF(2) Addition is performed modulo 2 (XOR operation): + 0 1 0 0 1 1 1 0 Multiplication in GF(2) × 0 1 0 0 0 1 0 1 GF(2) is used in binary logic, XOR operations, and simple error-control codes. 3. Meaning of GF(2 m ) GF(2 m ) is a finite field containing exactly 2 m elements . Each element represents an m-bit symbol . Field Number of Elements GF(2) 2 GF(2²) 4 GF(2³) 8 GF(2⁸) 256 Important: GF(2 m ) is not integer arithmetic modulo 2 m . It is polynomial-based arithmetic. 4....

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...