Decoding algorithms for low-density parity-check codes with multilevel modulations

Hisashi Futaki, Tomoaki Ohtsuki

Research output: Contribution to journalArticle

Abstract

Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) BP- and normalized BP-based algorithms were proposed for BPSK on an additive white Gaussian noise (AWGN) channel. The conventional BP and BP-based algorithms can be applied to BPSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the BP algorithm for multilevel modulations is proposed in [1]. In this paper, we propose the BP algorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed BP algorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm [1] on AWGN and flat Rayleigh fading channels. We also propose the UMP BP- and normalized BP-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed BP algorithm is almost identical to that of the algorithm in [1], where the decoding complexity of the proposed BP algorithm is less than that of the algorithm in [1]. We also show that the proposed BP-based algorithms can achieve the good trade-off between the complexity and the error rate performance.

Original languageEnglish
Pages (from-to)1282-1289
Number of pages8
JournalIEICE Transactions on Communications
VolumeE87-B
Issue number5
Publication statusPublished - 2004 May
Externally publishedYes

Fingerprint

Decoding
Modulation
Rayleigh fading
Fading channels
Turbo codes

Keywords

  • Belief propagation (BP) algorithm
  • Low-density parity-check (LDPC) code
  • Multilevel modulation
  • Normalized BP-based algorithm
  • Uniformly most powerful (UMP) BP-based algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Decoding algorithms for low-density parity-check codes with multilevel modulations. / Futaki, Hisashi; Ohtsuki, Tomoaki.

In: IEICE Transactions on Communications, Vol. E87-B, No. 5, 05.2004, p. 1282-1289.

Research output: Contribution to journalArticle

@article{3991700c2f194a359bb687b49475fae8,
title = "Decoding algorithms for low-density parity-check codes with multilevel modulations",
abstract = "Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) BP- and normalized BP-based algorithms were proposed for BPSK on an additive white Gaussian noise (AWGN) channel. The conventional BP and BP-based algorithms can be applied to BPSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the BP algorithm for multilevel modulations is proposed in [1]. In this paper, we propose the BP algorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed BP algorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm [1] on AWGN and flat Rayleigh fading channels. We also propose the UMP BP- and normalized BP-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed BP algorithm is almost identical to that of the algorithm in [1], where the decoding complexity of the proposed BP algorithm is less than that of the algorithm in [1]. We also show that the proposed BP-based algorithms can achieve the good trade-off between the complexity and the error rate performance.",
keywords = "Belief propagation (BP) algorithm, Low-density parity-check (LDPC) code, Multilevel modulation, Normalized BP-based algorithm, Uniformly most powerful (UMP) BP-based algorithm",
author = "Hisashi Futaki and Tomoaki Ohtsuki",
year = "2004",
month = "5",
language = "English",
volume = "E87-B",
pages = "1282--1289",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - Decoding algorithms for low-density parity-check codes with multilevel modulations

AU - Futaki, Hisashi

AU - Ohtsuki, Tomoaki

PY - 2004/5

Y1 - 2004/5

N2 - Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) BP- and normalized BP-based algorithms were proposed for BPSK on an additive white Gaussian noise (AWGN) channel. The conventional BP and BP-based algorithms can be applied to BPSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the BP algorithm for multilevel modulations is proposed in [1]. In this paper, we propose the BP algorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed BP algorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm [1] on AWGN and flat Rayleigh fading channels. We also propose the UMP BP- and normalized BP-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed BP algorithm is almost identical to that of the algorithm in [1], where the decoding complexity of the proposed BP algorithm is less than that of the algorithm in [1]. We also show that the proposed BP-based algorithms can achieve the good trade-off between the complexity and the error rate performance.

AB - Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) BP- and normalized BP-based algorithms were proposed for BPSK on an additive white Gaussian noise (AWGN) channel. The conventional BP and BP-based algorithms can be applied to BPSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the BP algorithm for multilevel modulations is proposed in [1]. In this paper, we propose the BP algorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed BP algorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm [1] on AWGN and flat Rayleigh fading channels. We also propose the UMP BP- and normalized BP-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed BP algorithm is almost identical to that of the algorithm in [1], where the decoding complexity of the proposed BP algorithm is less than that of the algorithm in [1]. We also show that the proposed BP-based algorithms can achieve the good trade-off between the complexity and the error rate performance.

KW - Belief propagation (BP) algorithm

KW - Low-density parity-check (LDPC) code

KW - Multilevel modulation

KW - Normalized BP-based algorithm

KW - Uniformly most powerful (UMP) BP-based algorithm

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

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

M3 - Article

AN - SCOPUS:2642555497

VL - E87-B

SP - 1282

EP - 1289

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 5

ER -