一个基于FPGA的节能实时IMDD OFDM-PON,由一个高效的FFT实现
Zhe Zheng1, Tianyang Chen2, Yuanzhe Qu2
1Beijing Smartchip Microelectronics Technology Company Limited, Beijing 100192, China.
Sensors (Basel, Switzerland)
|December 11, 2025
概括
一个新的节能快速里叶变换 (FFT) 方案用于强度调制直接检测光学正对角频率分割复合被动光学网络 (IMDD OFDM-PON) 显著降低了功耗. 这种优化的 FFT 设计在 IMDD OFDM-PON 系统中可降低接收器功率高达 43%.
科学领域:
- 光学通信是指光学通信.
- 数字信号处理 数字信号处理
- 集成电路设计 集成电路设计
背景情况:
- 被动光学网络 (PON) 对于宽带接入至关重要.
- 强度调制直接检测 (IMDD) 是一种成本效益高的PON调制技术.
- 直角频率分割复杂化 (OFDM) 提高了光学系统的光谱效率.
研究的目的:
- 为IMDD OFDM-PON提出并实施一个高能效的32平行64点FFT方案.
- 建立FFT功耗和FPGA逻辑资源利用之间的关系.
- 为了优化FFT比特分辨率,在不同接收光学功率水平下最小的功耗.
主要方法:
- 在Xilinx ML605 FPGA平台上实现一个32平行64点的FFT.
- 对FPT计算的FPGA逻辑资源功耗模型的实验验证.
- 为FFT比特分辨率优化推导资源选择原则.
主要成果:
- 建立了FFT功耗和FPGA逻辑资源使用之间的明确关系.
- 与传统的螺旋FFT相比,FFT的功耗降低了76.1%,收到的光功率为-21dBm.
- 在实时IMDD OFDM-PON接收器中,使用拟议的FT方案,证明了高达43%的节能.
结论:
- 拟议的节能FFT方案大大降低了IMDD OFDM-PON系统的电力消耗.
- 衍生资源选择原理通过FFT位分辨率调整实现功率优化.
- 这项工作为降低下一代光学接入网络的运营成本提供了实际解决方案.
相关概念视频
Fast Fourier Transform
851
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...
851
Properties of Fourier Transform I
575
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...
575
Discrete-time Fourier transform
992
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
992
Discrete-Time Fourier Series
632
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
632
Frequency-Domain Interpretation of PD Control
330
Proportional-Derivative (PD) controllers are widely used in fan control systems to improve stability and performance. A fan control system can be effectively represented using a Bode plot to illustrate the impact of a PD controller through its transfer function. The Bode plot visually conveys how PD control modifies the fan's response across various frequencies, providing a frequency domain interpretation of the controller's behavior.
The proportional control gain, combined with the...
The proportional control gain, combined with the...
330
Discrete Fourier Transform
825
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
825


