deposit_your_work

LDPC Code Design for OFDM Channel: Graph Connectivity and Information Bits Positioning

Files in this item

Files Size Format View
deB2005Jul5LDPCCodeDe.PDF 123.1Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: LDPC Code Design for OFDM Channel: Graph Connectivity and Information Bits Positioning
Author: de Baynast, Alexandre; Sabharwal, Ashutosh; Aazhang, Behnaam
Type: Conference Paper
Keywords: LDPC codes; OFDM system; Factor Graph; Density Evolution Algorithm
Citation: A. de Baynast, A. Sabharwal and B. Aazhang,"LDPC Code Design for OFDM Channel: Graph Connectivity and Information Bits Positioning," in IEEE International Symposium on Signals, Circuits and Systems,, pp. 649-652.
Abstract: We present an optimized channel coding scheme for OFDM transmission. In the future wireless standards such IEEE 802.11n, frame error rates (FER) as low as 0.0001 are targeting. Irregular LDPC codes have excellent performance at moderate computational complexity: they are strong candidates for channel coding in such systems. In the context of an OFDM transmission, the authors in [Mannoni, 2002] proposed to optimize the graph connectivity of the irregular LDPC code accordingly to the channel spectrum. However, their codes did not have good performance for a FER range of 0.001 - 0.0001. In this paper, we propose to optimize the LDPC code in two steps: first, we optimize the graph connectivity in order to get a minimum operational average SNR and therefore excellent FER; then we optimize the information bits placement accordingly to the channel. By simulation, we show that our approach provides substantial performance gain in term of FER over the existing methods (1 dB or more for FER equal to 10e-4.
Date Published: 2005-07-01

This item appears in the following Collection(s)

  • ECE Publications [1034 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students