Related Experiment Video
Updated: May 31, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Random Frequency Division Multiplexing
Chanzi Liu1, Jianjian Wu1, Qingfeng Zhou1
1The School of Electric Engineering and Intelligentization, Dongguan University of Technology, Dongguan 523808, China.
Abstract:
In this paper, we propose a random frequency division multiplexing (RFDM) method for multicarrier modulation in mobile time-varying channels. Inspired by compressed sensing (CS) technology which use a sensing matrix (with far fewer rows than columns) to sample and compress the original sparse signal simultaneously, while there are many reconstruction algorithms that can recover the original high-dimensional signal from a small number of measurements at the receiver. The approach choose the classic sensing matrix of CS-Gaussian random matrix to compress the signal. However, the signal is not sparse which makes the reconstruction algorithms ineffective. We take full account of the great power of deep neural networks (DNN) to detect the signal as it is an underdetermined equation. The proposed RFDM establishes a novel signal modulation and detection method to target better transmission efficiency, and the simulation results show that the proposed method can achieve good BER, offering a new research paradigm to improve the spectrum efficiency of a multi-subcarrier, multi-antenna, multi-user system.
Related Concept Videos
Properties of Fourier Transform II
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
Voltage Dividers
Kirchhoff's voltage law implies that the sum of the voltages across the resistors in series equals the source voltage. This means that the...
Scaling
Upsampling
Properties of Fourier Transform I
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Fast Fourier Transform
The computational efficiency of the FFT becomes...

