相关实验视频
Updated: May 31, 2025

06:42
Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
8.9K
随机频率划分多重复合
Chanzi Liu1, Jianjian Wu1, Qingfeng Zhou1
1The School of Electric Engineering and Intelligentization, Dongguan University of Technology, Dongguan 523808, China.
Entropy (Basel, Switzerland)
|January 24, 2025
概括
我们为移动频道引入了一种新的随机频率分割复杂化 (RFDM) 方法. 这种方法使用深度神经网络来提高复杂通信系统中的频谱效率.
科学领域:
- 电气工程 电气工程
- 信号处理 信号处理
- 无线通信无线通信
背景情况:
- 移动时变频道对传统的多载波调制提出了挑战.
- 压缩传感 (CS) 提供信号压缩,但需要稀疏的信号才能有效重建.
- 现有的CS重建算法对这些通道中的非散射信号无效.
研究的目的:
- 提出一种用于多载波调制的新型随机频率分割多重复合 (RFDM) 方法.
- 解决移动通道中非散射信号的CS重建的局限性.
- 提高多子载波,多天线,多用户系统的传输效率和频谱利用率.
主要方法:
- 使用高斯随机矩阵,灵感来自CS,用于信号压缩.
- 使用深度神经网络 (DNN) 在未确定系统中进行信号检测.
- 开发一种针对RFDM的新型调制和检测方案.
主要成果:
- 拟议的RFDM方法证明了有效的信号检测,尽管信号的非稀疏性质.
- 模拟结果显示了良好的比特错误率 (BER) 性能.
- 该方法为提高频谱效率提供了一个新的范式.
结论:
- 通过DNNs增强的新型RFDM方法,有效地应对移动时间变化的道中的挑战.
- 这种方法为改善复杂无线系统中的频谱效率提供了可行的解决方案.
- 它为先进的信号调制和检测技术开辟了新的研究途径.
相关概念视频
Properties of Fourier Transform II
165
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
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...
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...
165
Voltage Dividers
475
In electrical circuits, resistors can be connected in series, sequentially linked one after the other. In a series configuration, the same current flows through each resistor. Ohm's law is a fundamental principle to understand the behavior of resistors in series. It expresses the voltage across these resistors in terms of the current and resistance.
Kirchhoff's voltage law implies that the sum of the voltages across the resistors in series equals the source voltage. This means that the...
Kirchhoff's voltage law implies that the sum of the voltages across the resistors in series equals the source voltage. This means that the...
475
Scaling
228
In designing and analyzing filters, resonant circuits, or circuit analysis at large, working with standard element values like 1 ohm, 1 henry, or 1 farad can be convenient before scaling these values to more realistic figures. This approach is widely utilized by not employing realistic element values in numerous examples and problems; it simplifies mastering circuit analysis through convenient component values. The complexity of calculations is thereby reduced, with the understanding that...
228
Upsampling
200
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
200
Properties of Fourier Transform I
156
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
156
Fast Fourier Transform
261
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
261

