Performance of low-density parity-check (LDPC) coded OFDM systems

Hisashi Futaki, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Citations (Scopus)

Abstract

Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath environments. Many error-correcting codes have been applied to OFDM, convolutional codes, Reed-Solomon codes, Turbo codes, and so on. Recently, low-density parity-check (LDPC) codes have attracted much attention particularly in the field of coding theory. LDPC codes were proposed by Gallager in 1962 and the performance is very close to the Shannon limit with practical decoding complexity like Turbo codes. We proposed the LDPC coded OFDM (LDPC-COFDM) systems with BPSK and showed that the LDPC codes are effective to improve the bit error rate (BER) of OFDM in multipath environments [1]. LDPC codes can be decoded by using a probability propagation algorithm known as the sum-product algorithm or belief propagation. When the LDPC codes are used for the OFDM systems, the properties of the iterative decoding, such as the distribution of the number of iterations where the decoding algorithm stops, have not been clarified. In mobile communications, a high bandwidth efficiency is required, and thus the multilevel modulation is preferred. However, it has not been clarified how we can apply LDPC codes to the OFDM systems with multilevel modulation. In this paper, first we investigate the distribution of the number of iterations where the decoding algorithm stops in the LDPC-COFDM systems. Moreover, we propose the decoding algorithm for the LDPC-COFDM systems with M-PSK. From the simulation, we show that the LDPC-COFDM systems achieve good error rate performance with a small number of iterations on both an AWGN and a frequency-selective fading channels. We confirm that the algorithm for the LDPC-COFDM systems with M-PSK work correctly.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages1696-1700
Number of pages5
Volume3
Publication statusPublished - 2002
Externally publishedYes
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: 2002 Apr 282002 May 2

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period02/4/2802/5/2

Fingerprint

Orthogonal frequency division multiplexing
Decoding
Turbo codes
Phase shift keying
Modulation
Reed-Solomon codes
Iterative decoding
Frequency selective fading
Convolutional codes
Fading channels
Bit error rate
Data communication systems
Bandwidth
Communication

ASJC Scopus subject areas

  • Media Technology

Cite this

Futaki, H., & Ohtsuki, T. (2002). Performance of low-density parity-check (LDPC) coded OFDM systems. In IEEE International Conference on Communications (Vol. 3, pp. 1696-1700)

Performance of low-density parity-check (LDPC) coded OFDM systems. / Futaki, Hisashi; Ohtsuki, Tomoaki.

IEEE International Conference on Communications. Vol. 3 2002. p. 1696-1700.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Futaki, H & Ohtsuki, T 2002, Performance of low-density parity-check (LDPC) coded OFDM systems. in IEEE International Conference on Communications. vol. 3, pp. 1696-1700, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 02/4/28.
Futaki H, Ohtsuki T. Performance of low-density parity-check (LDPC) coded OFDM systems. In IEEE International Conference on Communications. Vol. 3. 2002. p. 1696-1700
Futaki, Hisashi ; Ohtsuki, Tomoaki. / Performance of low-density parity-check (LDPC) coded OFDM systems. IEEE International Conference on Communications. Vol. 3 2002. pp. 1696-1700
@inproceedings{c6caa3c1640042d0ae8295a6e299c772,
title = "Performance of low-density parity-check (LDPC) coded OFDM systems",
abstract = "Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath environments. Many error-correcting codes have been applied to OFDM, convolutional codes, Reed-Solomon codes, Turbo codes, and so on. Recently, low-density parity-check (LDPC) codes have attracted much attention particularly in the field of coding theory. LDPC codes were proposed by Gallager in 1962 and the performance is very close to the Shannon limit with practical decoding complexity like Turbo codes. We proposed the LDPC coded OFDM (LDPC-COFDM) systems with BPSK and showed that the LDPC codes are effective to improve the bit error rate (BER) of OFDM in multipath environments [1]. LDPC codes can be decoded by using a probability propagation algorithm known as the sum-product algorithm or belief propagation. When the LDPC codes are used for the OFDM systems, the properties of the iterative decoding, such as the distribution of the number of iterations where the decoding algorithm stops, have not been clarified. In mobile communications, a high bandwidth efficiency is required, and thus the multilevel modulation is preferred. However, it has not been clarified how we can apply LDPC codes to the OFDM systems with multilevel modulation. In this paper, first we investigate the distribution of the number of iterations where the decoding algorithm stops in the LDPC-COFDM systems. Moreover, we propose the decoding algorithm for the LDPC-COFDM systems with M-PSK. From the simulation, we show that the LDPC-COFDM systems achieve good error rate performance with a small number of iterations on both an AWGN and a frequency-selective fading channels. We confirm that the algorithm for the LDPC-COFDM systems with M-PSK work correctly.",
author = "Hisashi Futaki and Tomoaki Ohtsuki",
year = "2002",
language = "English",
volume = "3",
pages = "1696--1700",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Performance of low-density parity-check (LDPC) coded OFDM systems

AU - Futaki, Hisashi

AU - Ohtsuki, Tomoaki

PY - 2002

Y1 - 2002

N2 - Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath environments. Many error-correcting codes have been applied to OFDM, convolutional codes, Reed-Solomon codes, Turbo codes, and so on. Recently, low-density parity-check (LDPC) codes have attracted much attention particularly in the field of coding theory. LDPC codes were proposed by Gallager in 1962 and the performance is very close to the Shannon limit with practical decoding complexity like Turbo codes. We proposed the LDPC coded OFDM (LDPC-COFDM) systems with BPSK and showed that the LDPC codes are effective to improve the bit error rate (BER) of OFDM in multipath environments [1]. LDPC codes can be decoded by using a probability propagation algorithm known as the sum-product algorithm or belief propagation. When the LDPC codes are used for the OFDM systems, the properties of the iterative decoding, such as the distribution of the number of iterations where the decoding algorithm stops, have not been clarified. In mobile communications, a high bandwidth efficiency is required, and thus the multilevel modulation is preferred. However, it has not been clarified how we can apply LDPC codes to the OFDM systems with multilevel modulation. In this paper, first we investigate the distribution of the number of iterations where the decoding algorithm stops in the LDPC-COFDM systems. Moreover, we propose the decoding algorithm for the LDPC-COFDM systems with M-PSK. From the simulation, we show that the LDPC-COFDM systems achieve good error rate performance with a small number of iterations on both an AWGN and a frequency-selective fading channels. We confirm that the algorithm for the LDPC-COFDM systems with M-PSK work correctly.

AB - Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath environments. Many error-correcting codes have been applied to OFDM, convolutional codes, Reed-Solomon codes, Turbo codes, and so on. Recently, low-density parity-check (LDPC) codes have attracted much attention particularly in the field of coding theory. LDPC codes were proposed by Gallager in 1962 and the performance is very close to the Shannon limit with practical decoding complexity like Turbo codes. We proposed the LDPC coded OFDM (LDPC-COFDM) systems with BPSK and showed that the LDPC codes are effective to improve the bit error rate (BER) of OFDM in multipath environments [1]. LDPC codes can be decoded by using a probability propagation algorithm known as the sum-product algorithm or belief propagation. When the LDPC codes are used for the OFDM systems, the properties of the iterative decoding, such as the distribution of the number of iterations where the decoding algorithm stops, have not been clarified. In mobile communications, a high bandwidth efficiency is required, and thus the multilevel modulation is preferred. However, it has not been clarified how we can apply LDPC codes to the OFDM systems with multilevel modulation. In this paper, first we investigate the distribution of the number of iterations where the decoding algorithm stops in the LDPC-COFDM systems. Moreover, we propose the decoding algorithm for the LDPC-COFDM systems with M-PSK. From the simulation, we show that the LDPC-COFDM systems achieve good error rate performance with a small number of iterations on both an AWGN and a frequency-selective fading channels. We confirm that the algorithm for the LDPC-COFDM systems with M-PSK work correctly.

UR - http://www.scopus.com/inward/record.url?scp=0036282026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036282026&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3

SP - 1696

EP - 1700

BT - IEEE International Conference on Communications

ER -