You are in:Home/Publications/LOS and NLOS Performance of OFDM with PCC of ICI

Dr. Khaled talat ibrahim harb :: Publications:

Title:
LOS and NLOS Performance of OFDM with PCC of ICI
Authors: Sherif Mamdouh Ziada; Abdel Aziz M El-Bassiouni; Ghada Mohamed Amer; Khalid Talaat Harb
Year: 2013
Keywords: Orthogonal Frequency Division Multiplexing; Polynomial Cancellation Coding; Inter-carrier Interference; Interference Suppression, Rician Distribution K Factor
Journal: The Online Journal on Electronics and Electrical Engineering (OJEEE)
Volume: 5
Issue: 2
Pages: 539-543
Publisher: Not Available
Local/International: International
Paper Link: Not Available
Full paper Khaled talat ibrahim harb_10.1.1.677.2427.pdf
Supplementary materials Not Available
Abstract:

Orthogonal frequency division multiplexing (OFDM) based wireless systems are spectrally efficient but they are vulnerable to Inter carrier interference (ICI). The rapid variation of the channel can induce ICI. ICI will significantly increase the difficulty of OFDM channel estimation. Polynomial Cancellation Coding (PCC) is a self-cancellation scheme proposed by Y. Zhao and SG Haggman [5]. PCC has CIR improvement of more than 15 dB compared to conventional OFDM [6]. It is shown that performance is improved as compared to conventional OFDM by about 4 dB in the QPSK modulation at an error rate of 10-2 over fading channels with a normalized carrier frequency offset of 0.1. Exact BER calculation of BPSK Polynomial Cancellation Coding (PCC) of OFDM in multipath propagation of LOS and NLOS environment is evaluated for different normalized Carrier frequency Offset (CFO) values. In this treatment, the Rician K factor is used as a scale of the propagation environment ranging from perfect LOS no fading to Non LOS condition. In this paper shows that PCC-OFDM has 3 dB Eb/N0 performance improvement over conventional OFDM in CFO= 0.1 and BER of 10-3. In addition, since no channel equalization is needed for reducing ICI, the proposed scheme is therefore beneficial in implementation issue without increasing system complexity.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus