Low-complexity finite precision decoders for low-density parity-check codes

Shiva Kumar Planjery; Bane Vasic; David Declercq; Michael W. Marcellin

Low-complexity finite precision decoders for low-density parity-check codes

Shiva Kumar Planjery
, Bane Vasic
, David Declercq
, Michael W. Marcellin

Research output: Contribution to journal › Conference article › peer-review

Abstract

We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.

Original language	English (US)
Journal	Proceedings of the International Telemetering Conference
Volume	46
State	Published - 2010
Event	46th Annual International Telemetering Conference and Technical Exhibition - Overcoming Telemetry Obstacles with Technology, ITC/USA 2010 - San Diego, CA, United States Duration: Oct 25 2010 → Oct 28 2010

ASJC Scopus subject areas

Signal Processing
Instrumentation
Computer Networks and Communications
Electrical and Electronic Engineering

Cite this

@article{c970df80b2fa4fefb9b7ce9a21488dfe,

title = "Low-complexity finite precision decoders for low-density parity-check codes",

abstract = "We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.",

author = "Planjery, \{Shiva Kumar\} and Bane Vasic and David Declercq and Marcellin, \{Michael W.\}",

year = "2010",

language = "English (US)",

volume = "46",

journal = "Proceedings of the International Telemetering Conference",

issn = "0884-5123",

publisher = "International Foundation for Telemetering",

note = "46th Annual International Telemetering Conference and Technical Exhibition - Overcoming Telemetry Obstacles with Technology, ITC/USA 2010 ; Conference date: 25-10-2010 Through 28-10-2010",

}

TY - JOUR

T1 - Low-complexity finite precision decoders for low-density parity-check codes

AU - Planjery, Shiva Kumar

AU - Vasic, Bane

AU - Declercq, David

AU - Marcellin, Michael W.

PY - 2010

Y1 - 2010

N2 - We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.

AB - We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.

UR - https://www.scopus.com/pages/publications/84877964441

UR - https://www.scopus.com/pages/publications/84877964441#tab=citedBy

M3 - Conference article

AN - SCOPUS:84877964441

SN - 0884-5123

VL - 46

JO - Proceedings of the International Telemetering Conference

JF - Proceedings of the International Telemetering Conference

T2 - 46th Annual International Telemetering Conference and Technical Exhibition - Overcoming Telemetry Obstacles with Technology, ITC/USA 2010

Y2 - 25 October 2010 through 28 October 2010

ER -

Low-complexity finite precision decoders for low-density parity-check codes

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this