Filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) is considered as a powerful supplementary waveform for future wireless communications. However, FBMC systems have the same high peak-to-average power ratio (PAPR) problem as other multi-carrier systems, and the PAPR reduction methods designed for orthogonal frequency division multiplexing (OFDM) systems cannot be directly applied to FBMC systems due to the unique overlapping structure of FBMC signals. Therefore, some PAPR suppression schemes tailored to FBMC systems have been proposed, but their computational complexity is prohibitively high for some practical applications. In this paper, we propose a conversion vector-based low-complexity dispersive selection mapping (DSLM) scheme, called the C-DSLM scheme, to reduce the PAPR of FBMC signals. In the C-DSLM scheme, a series of conversion vectors is first carefully designed for FBMC signals with overlapping structures, and then candidate signals are generated by multiplying the original signal by the cyclic shift of the conversion vectors with only a few nonzero elements. The complexity evaluation and simulation results show that the C-DSLM scheme’s PAPR suppression performance is similar to that of the DSLM scheme with computational complexity is only approximately 10% of that of the DSLM scheme. Our proposed C-DSLM scheme is highly efficient and strongly applicable.

中文翻译：

---

一种新的基于转换矢量的低复杂度 SLM 方案，用于降低 FBMC/OQAM 系统中的 PAPR

具有偏移正交幅度调制 (FBMC/OQAM) 的滤波器组多载波被认为是未来无线通信的强大补充波形。然而，FBMC 系统与其他多载波系统具有相同的高峰均功率比 (PAPR) 问题，并且由于正交频分复用 (OFDM) 系统而设计的 PAPR 降低方法不能直接应用于 FBMC 系统FBMC 信号独特的重叠结构。因此，已经提出了一些为 FBMC 系统量身定制的 PAPR 抑制方案，但它们的计算复杂度对于某些实际应用来说非常高。在本文中，我们提出了一种基于转换矢量的低复杂度色散选择映射 (DSLM) 方案，称为 C-DSLM 方案，以降低 FBMC 信号的 PAPR。在 C-DSLM 方案中，首先针对具有重叠结构的FBMC信号精心设计一系列转换向量，然后通过将原始信号乘以只有少数非零元素的转换向量的循环移位来生成候选信号。复杂度评估和仿真结果表明，C-DSLM方案的PAPR抑制性能与DSLM方案相似，计算复杂度仅为DSLM方案的10%左右。我们提出的 C-DSLM 方案高效且适用性强。复杂度评估和仿真结果表明，C-DSLM方案的PAPR抑制性能与DSLM方案相似，计算复杂度仅为DSLM方案的10%左右。我们提出的 C-DSLM 方案高效且适用性强。复杂度评估和仿真结果表明，C-DSLM方案的PAPR抑制性能与DSLM方案相似，计算复杂度仅为DSLM方案的10%左右。我们提出的 C-DSLM 方案高效且适用性强。