正交频分复用
离散傅里叶变换(通用)
计算机科学
离散哈特利变换
算法
区块代码
频域
计算复杂性理论
理论计算机科学
分集方案
电子工程
分数阶傅立叶变换
傅里叶变换
数学
电信
解码方法
计算机视觉
工程类
频道(广播)
数学分析
傅里叶分析
作者
Xing Ouyang,Jiyu Jin,Guiyue Jin,Zhisen Wang
标识
DOI:10.1109/wcnc.2013.6554996
摘要
Discrete Hartley transform (DHT) based orthogonal frequency division multiplexing (OFDM) outperforms the OFDM based on discrete Fourier transform (DFT) for its intrinsic frequency diversity. However, the space-frequency block coding (SFBC) cannot be applied since the symbols in Hartley domain are coupled. In this paper, by using the properties of DHT and DFT, we propose a DHT based SFBC-OFDM system design with better performance than and similar complexity to the DFT counterpart. Moreover, a low complexity algorithm is derived based on the properties of DHT to get the time domain signals of the DHT based SFBC code words with about halved complexity. Finally, analysis and simulations are provided to validate its feasibility and ability to exploit both the frequency and spatial diversity, as a promising alternative to the DFT counterpart.
科研通智能强力驱动
Strongly Powered by AbleSci AI