Title :
On the Computational Complexity of MSE-OFDM System using Pseudo Random Cyclic Prefix
Author :
Wang, Xianbin ; Wu, Yiyan ; Gagnon, Gilles ; Chouinard, Jean-Yves ; Tian, Bin ; Yi, Kechu
Author_Institution :
Commun. Res. Centre, Ottawa
Abstract :
A new multicarrier system, termed multi-symbol encapsulated orthogonal frequency division multiplexing (MSE-OFDM), was proposed earlier, in which one cyclic prefix (CP) is used for multiple OFDM symbols. The motivation of this proposal is to address the disadvantages of OFDM system, i.e., the high peak to average power ratio and sensitivity to carrier frequency offset at the same time. Although more robust performance and higher bandwidth efficiency are achieved, the implementation of the MSE-OFDM receiver is substantially more complicated than OFDM. In this paper, we propose a new cyclic prefix using pseudo random sequence for MSE-OFDM. With the new introduced cyclic prefix, the inter-symbol interference (ISI) within one MSE-OFDM frame can be easily canceled in time domain. It is shown that the implementation complexity of the MSE-OFDM receiver with the new cyclic prefix is comparable to the traditional OFDM. The performance of the proposed technique is also analyzed and verified through numerical simulations.
Keywords :
OFDM modulation; computational complexity; intersymbol interference; random sequences; MSE-OFDM system; computational complexity; intersymbol interference; multisymbol encapsulated orthogonal frequency division multiplexing; pseudo random cyclic prefix; pseudo random sequence; Bandwidth; Computational complexity; Interference cancellation; Intersymbol interference; OFDM; Peak to average power ratio; Performance analysis; Proposals; Random sequences; Robustness;
Conference_Titel :
Information Theory, 2007. CWIT '07. 10th Canadian Workshop on
Conference_Location :
Edmonton, AB
Print_ISBN :
1-4244-0769-9
Electronic_ISBN :
1-4244-0769-9
DOI :
10.1109/CWIT.2007.375693