Skip to main content

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 — it converts the received signal from the time-frequency domain back to the delay-Doppler domain.

\[ x[k, l] = \frac{1}{\sqrt{NM}} \sum_{n=0}^{N-1} \sum_{m=0}^{M-1} X[n, m] \, e^{-j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \]


3. Summary Table

Transform From → To Mathematical Type Purpose
ISFFT Delay-Doppler → Time-Frequency Inverse Transform Used at transmitter to map data symbols
SFFT Time-Frequency → Delay-Doppler Forward Transform Used at receiver to recover data symbols


4. Intuitive View

  • Delay-Doppler domain: Represents the signal in terms of physical channel parameters (delays and Doppler shifts). Sparse and stable.
  • Time-Frequency domain: Represents how the signal occupies time and frequency. Suitable for modulation schemes like OFDM.

Comparison: OTFS vs. OFDM

Feature OFDM (5G) OTFS (Potential 6G)
Modulation Domain Time-Frequency Delay-Doppler
Mobility Support Limited (Sensitive to Doppler) High (Robust up to 500+ km/h)
Channel Estimation Complex (Time-varying) Simple (Sparse & Static)
Mathematical Core FFT / IFFT SFFT / ISFFT + OFDM Core

The Problem: Why move from OFDM to OTFS?

Standard OFDM (Orthogonal Frequency Division Multiplexing), used in 4G and 5G, performs poorly in high-mobility scenarios such as high-speed trains or V2X communications. This is due to Doppler Spread, which destroys the orthogonality of subcarriers.

The Solution: OTFS solves this by placing information symbols in the Delay-Doppler domain rather than the Time-Frequency domain. The ISFFT and SFFT act as the bridge between these two worlds.

Practical Applications of OTFS Technology

  • 6G Satellite Networks: Managing extreme Doppler shifts in LEO (Low Earth Orbit) satellites.
  • V2X (Vehicle-to-Everything): Ensuring stable data links for autonomous vehicles at highway speeds.
  • High-Speed Rail: Providing 5G/6G connectivity for passengers on Maglev or Bullet trains.
  • Military Communications: High-reliability links in combat environments with high mobility.

How the Transformation Works

  1. Mapping: Data symbols $x[k, l]$ are mapped onto the Delay-Doppler grid.
  2. ISFFT: The 2D Inverse Symplectic Finite Fourier Transform converts the grid to the Time-Frequency domain $X[n, m]$.
  3. Heisenberg Transform: This converts the Time-Frequency signal into a continuous time-domain waveform for transmission.
  4. Channel Interaction: The signal travels through a channel with specific delays ($\tau$) and Doppler shifts ($\nu$).
  5. SFFT: At the receiver, the process is reversed to recover the original symbols.

Computational Complexity

The complexity of the ISFFT/SFFT is primarily driven by the 2D FFT operations. For a grid of size $N \times M$, the complexity is roughly $O(NM \log(NM))$. This makes it slightly more computationally demanding than standard OFDM but manageable for modern 6G chipsets.

In summary, OTFS uses ISFFT before modulation and SFFT after demodulation to exploit both delay and Doppler diversity efficiently.


5. Similarity with the OFDM Process

In OFDM (Orthogonal Frequency Division Multiplexing), the main goal is to transmit orthogonal subcarriers to mitigate intersymbol interference (ISI). One effective way to achieve this is by transmitting orthogonal signals in the frequency domain.

However, instead of directly generating those frequency-domain signals, we apply an Inverse Fast Fourier Transform (IFFT) to the modulated symbols at the transmitter. This operation automatically ensures orthogonality among subcarriers in the frequency domain, while producing a time-domain signal suitable for transmission.

At the receiver side, we perform the Fast Fourier Transform (FFT) to convert the received time-domain signal back to the frequency domain, where the transmitted data symbols can be recovered.


Further Reading

  1. MATLAB Code for OFTS
  2. OFDM (Theory)

Frequently Asked Questions (FAQ)

What is the main advantage of ISFFT in OTFS?

ISFFT allows the transmitter to spread each data symbol across the entire Time-Frequency grid, ensuring that every symbol benefits from full diversity gain, unlike OFDM where a deep fade can destroy specific subcarriers.

Is OTFS a replacement for OFDM?

Not necessarily. OTFS is often implemented as a pre-processing and post-processing layer that sits on top of an existing OFDM multicarrier modulation system.



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

How Windowing Affects Your Periodogram

The windowed periodogram is a widely used technique for estimating the Power Spectral Density (PSD) of a signal. It enhances the classical periodogram by mitigating spectral leakage through the application of a windowing function. This technique is essential in signal processing for accurate frequency-domain analysis.   Power Spectral Density (PSD) The PSD characterizes how the power of a signal is distributed across different frequency components. For a discrete-time signal, the PSD is defined as the Fourier Transform of the signal’s autocorrelation function: S x (f) = FT{R x (Ï„)} Here, R x (Ï„)}is the autocorrelation function. FT : Fourier Transform   Classical Periodogram The periodogram is a non-parametric PSD estimation method based on the Discrete Fourier Transform (DFT): P x (f) = \(\frac{1}{N}\) X(f) 2 Here: X(f): DFT of the signal x(n) N: Signal length However, the classical periodogram suffers from spectral leakage due to abrupt truncation of the ...

Advanced M-ary Modulation Simulator: Constellation, min dist, Efficiency, SER, EVM (RMS)

Advanced M-ary Communication Lab Analytical & Statistical Performance of Digital Modulation Theoretical Probability of Error (\(P_s\)) \[ P_s = Q\left(\sqrt{\frac{2 E_b}{N_0}}\right) \] Modulation (M-ary) BPSK (M=2) QPSK (M=4) 8-PSK (M=8) 16-QAM (M=16) 64-QAM (M=64) 256-QAM (M=256) SNR (\(E_b/N_0\)): 12 dB Efficiency 2 bps/Hz Min Dist (\(d_{min}\)) 1.41 Symbol Error 1.2e-5 EVM (RMS) 0.0% Constellation Diagram Noise PDF & Decision Tail 1. Geometric Mapping ...

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

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