By Topic

Analysis of the performance improvement of fountain codes over puncturing schemes for OFDM system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deepak, P.M. ; Dept. of Electron. & Commun., Coll. of Eng., Thiruvananthapuram, India ; Manuel, E.M.

The orthogonal frequency division multiplexing (OFDM) has become the most popular technique for wireless communication nowadays because of its high spectral efficiency and robustness against frequency selective fading. The rateless codes can provide better performance when the channel characteristics are time varying in nature. Fountain codes are class of rateless codes with forward error correction capability for erasure channels. It is widely used to compensate for high delay of retransmission protocol, high BER and high erasure probability. The channel associated with the space communication and internet produces erasure in addition to noise on the signal. In this paper novel crosscoding scheme of convolutional encoding and fountain coding is proposed for OFDM to improve the performance of fountain coded OFDM system in AWGN channel and to extent the system performance to a channel having both erasure and noise. The performance of the system is compared with punctured OFDM system. The simulation results show that the performance of the proposed system is superior to existing punctured OFDM system.

Published in:

Signal Processing, Communication, Computing and Networking Technologies (ICSCCN), 2011 International Conference on

Date of Conference:

21-22 July 2011