Skip to main content

MATLAB Code for OTFS (Orthogonal Time Frequency Space)


MATLAB Code for OTFS (Orthogonal Time Frequency Space)

%% Clear workspace
clc; clear; close all;
%% Step 1: OTFS Parameters
N_delay = 4; % Number of delay bins (rows)
N_doppler = 4; % Number of Doppler bins (columns)
N_sym = N_delay * N_doppler;
modOrder = 4; % QPSK
SNR_dB = 20; % Noise level
%% Step 2: Generate random data symbols
data = randi([0 modOrder-1], N_sym, 1);
txSymbols = pskmod(data, modOrder, pi/4);
disp('Transmitted Delay-Doppler symbols:');
disp(reshape(txSymbols, N_delay, N_doppler));
%% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT)
% ISFFT: Inverse Symplectic Finite Fourier Transform
% 1. Take IDFT along Doppler (columns)
% 2. Take DFT along Delay (rows)
ddSymbols = reshape(txSymbols, N_delay, N_doppler);
% Step 3a: IDFT along columns (Doppler)
tfGrid = ifft(ddSymbols, N_doppler, 2);
%IFFT (accross columns) along Doppler → spreads in time (Delay → Time)
%FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency)
% Step 3b: DFT along rows (Delay)
tfGrid = fft(tfGrid, N_delay, 1);
disp('Time-Frequency Grid (TF domain):');
disp(tfGrid);
%% Step 4: Serialize TF grid for transmission
txSerial = tfGrid(:); % Column-wise flatten
disp('Serial transmission stream:');
disp(txSerial);
%% Step 5: Channel Model
% Flat fading for simplicity
h = (randn(size(txSerial)) + 1j*randn(size(txSerial)))/sqrt(2);
rxSerial = txSerial .* h; % Apply channel
rxSerial = awgn(rxSerial, SNR_dB, 'measured'); % Add noise
%% Step 6: Reshape back into TF grid
rxTFGrid = reshape(rxSerial, N_delay, N_doppler);
hTFGrid = reshape(h, N_delay, N_doppler); % Channel coefficients per tile
%% Step 7: Equalization in TF domain
eqTFGrid = rxTFGrid ./ hTFGrid; % Simple one-tap per TF tile
%% Step 8: Map TF → Delay-Doppler (SFFT)
% SFFT: Symplectic Fourier Transform (inverse of ISFFT)
% 1. IDFT along Delay (rows)
% 2. DFT along Doppler (columns)
rxDD = ifft(eqTFGrid, N_delay, 1); % IDFT along rows
rxDD = fft(rxDD, N_doppler, 2); % DFT along columns
%% Step 9: Flatten and demap symbols
rxSymbols = rxDD(:);
rxData = pskdemod(rxSymbols, modOrder, pi/4);
%% Step 10: Display results
disp('Recovered Delay-Doppler symbols:');
disp(reshape(rxSymbols, N_delay, N_doppler));
numErrors = sum(data ~= rxData);
fprintf('Symbol errors: %d out of %d\n', numErrors, N_sym);
%% Optional: Plot constellations
figure;
subplot(1,2,1); plot(txSymbols,'o'); title('Transmitted Symbols'); grid on; axis equal;
subplot(1,2,2); plot(rxSymbols,'o'); title('Received Symbols'); grid on; axis equal;
web('https://www.salimwireless.com/search?q=otfs%20ofdm', '-browser');


Output

 Transmitted Delay-Doppler symbols:
  -0.7071 - 0.7071i  -0.7071 + 0.7071i  -0.7071 + 0.7071i  -0.7071 + 0.7071i
  -0.7071 + 0.7071i  -0.7071 - 0.7071i  -0.7071 - 0.7071i  -0.7071 - 0.7071i
  -0.7071 - 0.7071i   0.7071 + 0.7071i   0.7071 + 0.7071i  -0.7071 - 0.7071i
  -0.7071 - 0.7071i   0.7071 - 0.7071i  -0.7071 - 0.7071i   0.7071 + 0.7071i

Time-Frequency Grid (TF domain):
  -1.4142 - 0.3536i  -0.3536 + 0.0000i  -0.7071 - 0.3536i  -0.3536 - 0.7071i
  -0.7071 + 1.0607i   1.0607 - 0.0000i   0.7071 - 1.0607i   0.3536 + 0.0000i
   0.0000 + 1.0607i  -1.0607 - 0.7071i   0.7071 - 0.3536i   0.3536 - 1.4142i
  -0.7071 - 0.3536i   0.3536 - 0.7071i  -0.7071 + 0.3536i  -0.3536 + 0.7071i

Serial transmission stream:
  -1.4142 - 0.3536i
  -0.7071 + 1.0607i
   0.0000 + 1.0607i
  -0.7071 - 0.3536i
  -0.3536 + 0.0000i
   1.0607 - 0.0000i
  -1.0607 - 0.7071i
   0.3536 - 0.7071i
  -0.7071 - 0.3536i
   0.7071 - 1.0607i
   0.7071 - 0.3536i
  -0.7071 + 0.3536i
  -0.3536 - 0.7071i
   0.3536 + 0.0000i
   0.3536 - 1.4142i
  -0.3536 + 0.7071i

Recovered Delay-Doppler symbols:
  -0.6366 - 0.6820i  -0.7347 + 0.6199i  -0.7577 + 0.7180i  -0.5586 + 0.8659i
  -0.6824 + 0.8404i  -0.6304 - 0.9573i  -0.5014 - 0.4702i  -0.8630 - 0.8956i
  -0.7453 - 1.0323i   0.6771 + 1.0969i   0.6840 + 0.4994i  -0.5991 - 0.5179i
  -0.8816 - 0.4403i   0.7372 - 0.7281i  -0.7871 - 0.7687i   0.5789 + 0.7468i

Symbol errors: 0 out of 16

 

Plot BER vs SNR for OTFS using MATLAB

%% Clear workspace
clc; clear; close all;
%% Step 1: OTFS Parameters
N_delay = 4;
N_doppler = 4;
N_sym = N_delay * N_doppler;
modOrder = 4;
M_bits = log2(modOrder);
% --- NEW: SNR Range and Storage ---
SNR_vec = 0:2:16; % Range of SNR values to test
numFrames = 100; % Number of iterations per SNR for smooth curve
BER = zeros(size(SNR_vec));
%% --- NEW: SNR Loop ---
for i = 1:length(SNR_vec)
SNR_dB = SNR_vec(i);
totalBitErrors = 0;
for f = 1:numFrames
%% Step 2: Generate random data bits (Changed to bits for BER)
txBits = randi([0 1], N_sym * M_bits, 1);
txSymbols = pskmod(txBits, modOrder, pi/4, 'InputType', 'bit');
%% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT)
ddSymbols = reshape(txSymbols, N_delay, N_doppler);
tfGrid = ifft(ddSymbols, N_doppler, 2);
tfGrid = fft(tfGrid, N_delay, 1);
%% Step 4: Serialize TF grid
txSerial = tfGrid(:);
%% Step 5: Channel Model
h = ones(size(txSerial)); %(randn(size(txSerial)) + 1j*randn(size(txSerial)))/sqrt(2);
rxSerial = txSerial .* h;
rxSerial = awgn(rxSerial, SNR_dB, 'measured');
%% Step 6: Reshape back into TF grid
rxTFGrid = reshape(rxSerial, N_delay, N_doppler);
hTFGrid = reshape(h, N_delay, N_doppler);
%% Step 7: Equalization in TF domain
eqTFGrid = rxTFGrid ./ hTFGrid;
%% Step 8: Map TF → Delay-Doppler (SFFT)
rxDD = ifft(eqTFGrid, N_delay, 1);
rxDD = fft(rxDD, N_doppler, 2);
%% Step 9: Flatten and demap symbols to bits
rxSymbols = rxDD(:);
rxBits = pskdemod(rxSymbols, modOrder, pi/4, 'OutputType', 'bit');
%% Step 10: Count Errors
totalBitErrors = totalBitErrors + sum(txBits ~= rxBits);
end
% Calculate average BER for this SNR
BER(i) = totalBitErrors / (N_sym * M_bits * numFrames);
fprintf('SNR: %d dB | BER: %e\n', SNR_dB, BER(i));
end
%% --- NEW: Plot Results ---
figure;
semilogy(SNR_vec, BER, 'b-o', 'LineWidth', 2);
grid on;
xlabel('SNR (dB)');
ylabel('Bit Error Rate (BER)');
title('OTFS BER vs SNR');

 Output

 



Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

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

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

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} \] ...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):