Skip to main content

AI-RAN, RIS, ISAC and Spectrum Coexistence


AI-RAN, RIS, ISAC and Spectrum Coexistence

AI-RAN, RIS, ISAC, and Spectrum Coexistence are major technologies being developed for advanced 5G and future 6G networks. These technologies aim to improve spectrum efficiency, signal quality, and wireless communication performance.

1. AI-RAN (Artificial Intelligence Radio Access Network)

Concept

AI-RAN integrates artificial intelligence directly into the Radio Access Network (RAN) to optimize wireless communication in real time.

The RAN includes:

  • Base stations
  • Antennas
  • Beamforming systems
  • User scheduling
  • Power control

Instead of fixed algorithms, AI dynamically learns optimal decisions.

Optimization Model

The network tries to maximize system performance:

$$ \max_{\mathbf{x}} R(\mathbf{x}) $$

Where:

  • \(R\) = network throughput
  • \(\mathbf{x}\) = control parameters

Example control variables:

$$ \mathbf{x} = \{P, W, f, B\} $$
  • \(P\) = transmit power
  • \(W\) = beamforming weights
  • \(f\) = frequency allocation
  • \(B\) = bandwidth

AI learns the mapping:

$$ (H, I, S) \rightarrow (P, W, f) $$
  • \(H\) = channel information
  • \(I\) = interference
  • \(S\) = spectrum state

2. RIS (Reconfigurable Intelligent Surface)

Concept

Reconfigurable Intelligent Surface (RIS) is a programmable reflecting surface that can control how radio waves propagate.

Instead of signals reflecting randomly off buildings or obstacles, RIS elements control the phase of reflected signals to improve communication.

A RIS surface may contain hundreds or thousands of passive reflecting elements.

Signal Model

Without RIS:

$$ y = hx + n $$

With RIS:

$$ y = (h_d + h_r \Phi g)x + n $$

Where:

  • \(h_d\) = direct channel
  • \(h_r\) = RIS → receiver channel
  • \(g\) = transmitter → RIS channel
  • \(\Phi\) = RIS phase control matrix

RIS phase matrix:

$$ \Phi = \text{diag}(e^{j\theta_1}, e^{j\theta_2}, ..., e^{j\theta_N}) $$

Each RIS element adjusts the phase \(\theta_i\).

Optimization objective:

$$ \max_{\Phi} |h_d + h_r \Phi g|^2 $$

3. ISAC (Integrated Sensing and Communication)

Concept

ISAC integrates radar sensing and wireless communication into a single system.

Example:

  • A base station communicates with users
  • The same signal is used to detect objects like radar

This improves spectrum efficiency.

Signal Model

Communication signal:

$$ y_c = hx + n $$

Radar echo:

$$ y_r = \alpha x(t-\tau) + n $$

Where:

  • \(\alpha\) = reflection coefficient
  • \(\tau\) = time delay

Distance estimation:

$$ d = \frac{c\tau}{2} $$

Where \(c\) is the speed of light.

Joint optimization objective:

$$ \max_x R(x) + \lambda S(x) $$
  • \(R(x)\) = communication rate
  • \(S(x)\) = sensing accuracy

4. Spectrum Coexistence

Concept

Spectrum coexistence allows multiple wireless systems to share the same spectrum without harmful interference.

Examples include:

  • WiFi
  • 5G networks
  • Radar systems
  • Satellite communication

Signal Model

$$ y(t) = \sum_{k=1}^{K} h_k s_k(t) + n(t) $$

Where:

  • \(s_k(t)\) = signal from system \(k\)

Interference power:

$$ I_m = \sum_{k \ne m} |h_{mk}|^2 P_k $$

Constraint:

$$ I_m \le I_{th} $$

Techniques used include:

  • Beamforming
  • Dynamic spectrum access
  • Cognitive radio
  • AI-driven spectrum sharing

5. Combined System for Future 6G

Future wireless systems combine multiple technologies:

  • RIS controls signal propagation
  • AI-RAN optimizes beamforming and resource allocation
  • ISAC enables radar and communication simultaneously
  • Spectrum coexistence allows multiple systems to share frequencies

Example combined signal model:

$$ y = (H_d + H_r \Phi G)Ws + n $$

Where:

  • \(W\) = beamforming matrix
  • \(\Phi\) = RIS control matrix
  • \(s\) = transmitted signals

Optimization objective:

$$ \max_{W,\Phi,P} R - \lambda I $$

6. Industry Applications

These technologies are actively researched for future communication systems such as:

  • 6G wireless networks
  • Smart cities
  • Autonomous vehicles
  • Satellite-terrestrial communication
  • Radar-communication coexistence systems

Companies working on these technologies include:

  • Ericsson
  • Nokia
  • Samsung
  • Huawei
  • Qualcomm
  • NVIDIA

Summary

Technology Purpose
AI-RAN AI optimizes wireless network operation
RIS Programmable surfaces control radio wave propagation
ISAC Combines radar sensing and wireless communication
Spectrum Coexistence Allows multiple systems to share spectrum efficiently


Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

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

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 Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

Coherent vs. Non-Coherent Demodulation

  For demodulation In general: 1. Synchronous (coherent) demodulation Receiver generates a local carrier/oscillator . It combines/multiplies the received signal with that carrier. Then a filter extracts the message. Received signal ↓ × Local oscillator ↓ Low-pass filter ↓ Message So yes, carrier multiplication is a common implementation of synchronous demodulation . 2. Asynchronous (non-coherent) demodulation Receiver doesn't need a phase-synchronized local carrier . It uses properties of the received signal itself to recover the information. For ASK , an envelope detector is the classic example: ASK signal ↓ Diode + RC ↓ Envelope ↓ Comparator ↓ Data Modulation Synchronous demodulation Non-coherent/asynchronous demodulation ASK/OOK Local carrier + multiplier Envelope detector AM Product detector Envelope detector FSK Coherent correlator/mixer Frequency discriminator, filters, etc. PSK Local synchronized carrier + multiplier Differential/n...

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

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

Random Variable vs. Random Process: Definitions, Examples, and Key Differences

Random Variable vs. Random Process: Definitions, Examples, and Key Differences Random Variable and Random Process In the fields of probability theory and statistics, understanding the distinction between a Random Variable and a Random Process (Stochastic Process) is fundamental. This guide breaks down these concepts with mathematical precision and practical examples. 1. Random Variable (RV) Definition: A Random Variable is a deterministic function that maps each possible outcome of a random experiment to a unique real number. Mathematical Representation A random variable X is defined as a mapping from the sample space S to the set of real numbers ℝ : X : S → ℝ S (Sample Space): The set of all possible outcomes of an experiment. s ∈ S: A specific outcome. X(s): The numerical value asso...