Paper Info
Title
Discrete Hartley transform based SFBC-OFDM transceiver design with low complexity.
Abstract
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. © 2013 IEEE.
Year
DOI
Venue
2013
10.1109/WCNC.2013.6554996
WCNC
Keywords
Field
DocType
computational complexity,block codes,ofdm modulation
Time domain,Diversity scheme,Antenna diversity,Computer science,Algorithm,Real-time computing,Theoretical computer science,Fast Fourier transform,Discrete Hartley transform,Discrete Fourier transform,Orthogonal frequency-division multiplexing,Computational complexity theory
Conference
Volume
Issue
ISSN
null
null
null
ISBN
Citations 
PageRank 
978-1-4673-5937-5
0
0.34
References 
Authors
8
4
Name
Order
Citations
PageRank
Xing Ouyang1203.56
Jiyu Jin255.58
Guiyue Jin374.47
ZhiSen Wang432.09