Performance Analysis of OFDM System through Pseudo-Pilot and Greedy Algorithms
Rosy Dhiman1, Akshay Rana2, Mamta Arora3
1Rosy Dhiman, Department of Electronics and Communication Engineering, Chandigarh University, Mohali, India.
2Akshay Rana, Department of Electronics and Communication Engineering, Chandigarh University, Mohali, India.
3Mamta Arora, Department of Electronics and Communication Engineering, Chandigarh University, Mohali, India.
Manuscript received on April 01, 2017. | Revised Version Manuscript Received on April 16, 2017. | Manuscript published on April 20, 2017. | PP: 39-42 | Volume-4 Issue-5, March 2017. | Retrieval Number: E0740034517/2017©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, to investigate a pilot problem for Greedy algorithms using channel estimation in OFDM system. The Greedy algorithm is used for channel estimation in OFDM system over AWGN fading channel. Thus, Greedy algorithm is used for the optimization process. The OFDM is providing a high speed data rate and low complexity because it reduces the intersymbol interference for transmission over frequency selective channel. Hence, Greedy algorithms use a pilot to create overhead problem, this problem solve with pseudo-pilot. On the basis of BER (bit error rate) performance of OFDM is evaluate. In Simulation results show, BER vs SNR compared the performance of pilot aided and pseudo-pilot using Greedy algorithms.
Keywords: Greedy Algorithms, Channel Estimation, OFDM System, Sparse Channel.