By Topic

Construction algebraic geometric LDPC codes on frequency-selective fading channels

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

3 Author(s)
Jie Shen ; Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China ; Deshan Miao ; Daoben Li

Many papers have shown that low density parity-check (LDPC) codes exhibit excellent performance in the additive white noise (AWGN) channel and flat fading channels, but their performance on frequency-selective fading channels slightly degrades. In this paper, we present the construction of a new algebraic geometric LDPC code and its decoding algorithm, evaluate the performance of AG density parity-check codes in frequency-selective fading channels based on the Overlapped code division multiple access (OVCDMA) system. Simulation results show that AG-LDPC codes outperform turbo codes at high signal-to-noise ratio (SNR) over a wild range of mobile speeds. Furthermore we simply analyze the reasons on their differences on performance, indicating that the distance spectrum plays a very important role to the performance of codes.

Published in:

Global Mobile Congress 2009

Date of Conference:

12-14 Oct. 2009