Skip to main content

Applications of a Raise Cosine Filter

 

For a typical wireless communication system, we use modulation schemes and filters before transmitting the signal. The main purpose of using it is to transmit a proper waveform so that we can recover the signal at the receiving end more accurately. 

If the roll-off factor is Î±, then 

Bandwidth (B) = (1 + α) / (2 * T)

where T is the time interval. The filter response is zero outside that.

The roll-off factor is a parameter used to shape the spectrum of a digital signal in communication systems, and it is not just the product of time and bandwidth. It affects both the time and frequency domain characteristics of the signal.


Example

According to the Nyquist criterion, the sampling frequency of a signal must be at least twice the highest frequency present in the message signal. Conversely, during signal transmission, the bandwidth of the transmitted signal must be at least half the symbol rate to ensure inter-symbol interference (ISI)-free transmission. A raised cosine filter facilitates this requirement.

For example, if the symbol rate is 100 symbols per second, the minimum bandwidth required for ISI-free transmission is: 100 / 2 = 50 Hz

In simple terms, the symbol rate indicates that symbols are changing 100 times per second. To recover the transmitted signal at the receiver end without ISI, the minimum transmission bandwidth required is 50 Hz.

The bandwidth of a raised cosine filter is given by the formula:

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

where α is the roll-off factor of the filter. If the roll-off factor α is 0.25, the bandwidth is calculated as:

Bandwidth = (100 × (1 + 0.25)) / 2 = 62.5 Hz

This bandwidth (62.5 Hz) exceeds the minimum requirement of 50 Hz for transmitting a signal at a symbol rate of 100 symbols per second. 

 

 MATLAB Code for the example above

% 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 

 




 
 


 


MATLAB code for raise-cosine filter


 

Result


Figure: Raise-Cosine Filter

There are 961 samples in the x-axis of the above image, as the upsampling factor is 480 here and filter span is 2.


Application

A raised cosine filter is used for pulse shaping. You might have noticed in most of the diagrams of 'communication systems.' It is common to use this type of filter after the modulation module.

Further Reading

Time Bandwidth Product (TBP)

The Time-Bandwidth Product (TBP) is a fundamental parameter in signal processing and digital communications that quantifies the relationship between a signal's temporal duration and its occupied bandwidth. It is mathematically expressed as TBP = Δt × Î”f, where Δt represents the effective signal duration and Δf denotes its frequency bandwidth. The TBP illustrates the inherent trade-off between time localization and frequency localization, as described by Heisenberg's uncertainty principle. A signal cannot be made arbitrarily short in time while simultaneously occupying an extremely narrow bandwidth.

This study examines the Time-Bandwidth Product using two commonly employed pulse-shaping techniques: the raised cosine filter and the Gaussian pulse. For a raised cosine filter, the bandwidth depends on the symbol rate and roll-off factor, while the signal duration is determined by the filter span. Increasing either the roll-off factor or the filter span improves pulse shaping and reduces intersymbol interference (ISI); however, it also increases the TBP, thereby lowering spectral efficiency. Conversely, smaller TBP values indicate more efficient utilization of the available spectrum but require more precise system design.

Gaussian pulses represent the theoretical optimum because they achieve the minimum achievable time-bandwidth product permitted by the uncertainty principle. Their energy is optimally concentrated in both the time and frequency domains, making them valuable in applications such as optical communications, radar, and ultra-wideband systems. MATLAB simulations are employed to compute bandwidth, signal duration, and TBP, while interactive visualizations demonstrate how variations in filter parameters influence signal characteristics. Overall, the analysis highlights the importance of the Time-Bandwidth Product in balancing bandwidth efficiency, pulse duration, interference suppression, and overall communication system performance.

Read More: about Time Bandwidth Product (TBP) 


Pulse Shaping for OFDM using Raised Cosine Filter

The Root Raised Cosine (RRC) pulse shaping further confines the spectral bandwidth of the OFDM waveform. By limiting the occupied bandwidth, the transmitted signal can propagate more efficiently through bandwidth-constrained communication channels. To minimize frequency-selective fading and signal distortion, the signal bandwidth should remain within the coherence bandwidth of the channel. Furthermore, RRC pulse shaping suppresses out-of-band emissions and reduces spectral leakage, thereby preserving the essential frequency components of the transmitted signal and improving spectral efficiency while limiting interference with adjacent channels.


Contact Us

Name

Email *

Message *

Popular Posts

CMOS Logic Gates: Inverter, NAND, and NOR

CMOS Logic Gates: Inverter, NAND, and NOR Complementary metal–oxide–semiconductor (CMOS) technology forms the backbone of modern digital IC design. Patented by Frank Wanlass in 1963 ( US patent 3,356,858 ), CMOS enables low-power, high-speed, and noise-immune logic circuits. CMOS gates, including inverters, NAND, and NOR, are widely used in both large-scale and small-scale integrated circuits due to their efficiency and versatility. CMOS Inverter A CMOS inverter consists of a complementary pair of PMOS and NMOS transistors. The PMOS transistor connects to the supply voltage V DD , while the NMOS connects to ground. The input voltage V IN controls both gates, and the output voltage V OUT is taken from the connected drains. CMOS inverters are highly energy-efficient and produce minimal heat due to their comple...

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...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

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 Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Linear vs Circular Convolution

Linear vs Circular Convolution Linear convolution vs circular convolution Linear convolution (what nature does) If: x[n] = transmitted signal h[n] = channel impulse response (multipath) Then the received signal is: y[n] = x[n] * h[n] This means: Past symbols spill into future symbols Causes inter-symbol interference (ISI) DFT of y[n] is not a simple product Circular convolution (what DFT assumes) The DFT assumes periodic signals : y[n] = x[n] ⊛ h[n], where indices wrap around modulo N Only under circular convolution does the DFT satisfy: Y[k] = X[k] · H[k] This is what enables one-tap frequency-domain equalization . What happens in the real channel (linear convolution) The channel performs linear convolution: y[n] = Σ l=0 Lh−1 h[l] x[n-l] But because: CP absorbs the “spillover” Receiver discards CP before DFT The useful part of the received symbol becomes: y[n] = Σ l=0 Lh−1 h[l] x[(n-l) mod N] Modulo inde...

MUSIC Algorithm Explained (with MATLAB + Simulator)

Practical Implementation of the MUSIC Algorithm The focus is on how the algorithm works computationally , not just theory, and it explains the denominator (a H E n E n H a) mathematically and intuitively. 1. Introduction The MUSIC (Multiple Signal Classification) algorithm is a high-resolution method used in signal processing and array processing to estimate the Direction of Arrival (DOA) of signals received by a sensor array. Unlike classical beamforming methods, MUSIC uses eigenvector decomposition of the covariance matrix to separate the signal subspace and noise subspace , allowing it to achieve much higher angular resolution. In practical implementations, MUSIC works by: Simulating or collecting array signals Computing the covariance matrix Performing eigenvalue decomposition Separating signal and noise subspaces Scanning possible angles using a steering vector Constructing a pseudo-spectrum where peaks indicate signal directions 2. Signal Mo...

Decision Feedback Equalizer (DFE) in MATLAB

  MATLAB Code M = 4; % QPSK numSymbols = 10000; numTrainingSymbols = 5000; chtaps = [1 0.5*exp(1i*pi/6) 0.1*exp(-1i*pi/8)]; % Generate QPSK symbols data = randi([0 M-1], numSymbols, 1); tx = pskmod(data, M, pi/4); % DFE setup eq = comm.DecisionFeedbackEqualizer; eq.ReferenceTap = 1; eq.NumForwardTaps = 5; eq.NumFeedbackTaps = 3; % SNR sweep snrVec = 0:5:25; % 0,5,10,...25 dB berBefore = zeros(size(snrVec)); berAfter = zeros(size(snrVec)); for k = 1:length(snrVec) % Apply channel and AWGN rx = awgn(filter(chtaps,1,tx), snrVec(k), 'measured' ); % BER before equalization rxDataNoEq = pskdemod(rx, M, pi/4); [~, berBefore(k)] = biterr(data, rxDataNoEq); % Equalize [y,~,~] = eq(rx, tx(1:numTrainingSymbols)); % Phase correction phaseOffset = angle(mean(conj(tx(1:numTrainingSymbols)) .* y(1:numTrainingSymbols))); yCorrected = y * exp(-1i*phaseOffset); % BER after equalization rxDataEq = pskdemod(yCorrected, M, pi/4); [...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📈 Q-function 📚 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...