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

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

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 The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...

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

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

Channel Impulse Response (CIR) (with MATLAB + Simulator)

📘 Overview & Theory 📘 How CIR Affects the Signal 🧮 Online Channel Impulse Response Simulator 🧮 MATLAB Codes 📚 Further Reading What is the Channel Impulse Response (CIR)? The Channel Impulse Response (CIR) is a concept primarily used in the field of telecommunications and signal processing. It provides information about how a communication channel responds to an impulse signal. It describes the behavior of a communication channel in response to an impulse signal. In signal processing, an impulse signal has zero amplitude at all other times and amplitude ∞ at time 0 for the signal. Using a Dirac Delta function, we can approximate this. Fig: Dirac Delta Function The result of this calculation is that all frequencies are responded to equally by δ(t) . This is crucial since we never know which frequenci...

FFT Butterfly Method Explained (with Simulations)

4-Point FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {x[0], x[2]} = {0, 2} Odd indices: x o = {x[1], x[3]} = {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 4 k O[k] X[k + 2] = E[k] - W 4 k O[k] Twiddle Factors (N=4): W 4 0 = 1, W 4 1 = -j Final Calculations: X[0] = E[0] + W 4 0 O[0] = 2 + (1)(4) = 6 X[2] = E[0] - W 4 0 O[0] = 2 - (1)(4) = -2 X[1] = E[1] + W 4 1 O[1] = -2 + (-j)(-2) = -2 + 2j X[3] = E[1] - W 4 1 O[1] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} 8-Point FFT Using Butterfly Method Given: x[n] = {0,1,2,3,4,5,6,7} Step 1: Split into Bit-Reversed Order To perform DIT-FFT, split the 8 points into pairs of two: Group A: {x[0], x[4]} = {0, 4}...

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):

Frequency Bands : EHF, SHF, UHF, VHF, HF, MF, LF, VLF and Their Uses

Frequency Bands >> EHF, SHF, UHF, VHF, HF, MF, LF... Frequency Bands and Their Uses 1. Extremely High Frequency (EHF) 30 - 300 GHz Uses 5G Networks 5G millimeter wave band 6G and beyond (Experimental) RADAR 2. Super High Frequency (SHF) 3 - 30 GHz Uses Ultra-wideband (UWB) Airborne RADAR Satellite Communication Microwave Link Communication or SATCOM 3. Ultra High Frequency (UHF) 300 - 3000 MHz Uses Satellite Communication Television Surveillance Navigation aids Also, read important wireless communication terms 4....