【24h】

A novel complexity PAPR reduction scheme for MIMO-OFDM systems

机译:一种用于MIMO-OFDM系统的新型复杂度PAPR降低方案

获取原文

摘要

The future generation (4G) Wireless Networks aim at offering very high data rates and high spectral efficiency in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems, A number of peak-to-average power ratio (PAPR) reduction techniques have been proposed for (MIMO-OFDM) systems; however, most of them involve very high computational complexity and are not applicable to MIMO-OFDM systems with space frequency block coding (SFBC). A novel complexity PAPR reduction scheme for SFBC MIMO-OFDM systems is proposed. The input sequence is multiplied by a set of phase rotation vectors respectively and then each resulting sequence is decomposed into several sub-sequences based on the linear property of SFBC. After computing the inverse fast Fourier transform (IFFT) to convert each frequency-domain sub-sequence into a time-domain signal, the equivalent SFBC encoding operations in the time domain for generating candidate signal sets is performed, where one with the lowest maximum PAPR is selected for transmission. With the proposed scheme, a large number of candidate signal sets by computing only a few IFFTs can be generated. As compared to previous related schemes, the proposed one achieves similar PAPR reduction performance with much lower computational complexity.
机译:下一代(4G)无线网络旨在在多输入多输出(MIMO)正交频分复用(OFDM)系统中提供非常高的数据速率和高频谱效率,许多峰均功率比(PAPR) )已经提出了针对(MIMO-OFDM)系统的缩减技术;然而,它们中的大多数涉及非常高的计算复杂性,并且不适用于具有空频块编码(SFBC)的MIMO-OFDM系统。提出了一种新的SFBC MIMO-OFDM系统复杂度PAPR降低方案。将输入序列分别乘以一组相位旋转矢量,然后根据SFBC的线性特性,将每个结果序列分解为几个子序列。在计算了快速傅里叶逆变换(IFFT)以将每个频域子序列转换为时域信号后,执行时域中的等效SFBC编码操作以生成候选信号集,其中最大PAPR最低的一组选择进行传输。利用所提出的方案,可以通过仅计算几个IFFT来生成大量候选信号集。与先前的相关方案相比,所提出的方案以较低的计算复杂度实现了类似的PAPR降低性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号