Generic architectures for uniformly reweighted APP decoders

Velimir Ilic, Elsa Dupraz, Bane V Vasic

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

Abstract

We propose generic architectures for memory-efficient Uniformly reweighted a posteriori probability (URAPP) Decoders of Low Density Parity Check (LDPC) codes, with the bit error rate close to Belief propagation decoding. The architectures enables a trade off between the throughput, computational and hardware resources. As a special case, we derive previously proposed flooding schedule URAPP decoder and propose new type of the URAPP decoder which uses shuffled scheduling. We conduct a rigorous complexity analysis and provide new formulas for the URAPP decoder throughput in terms of hardware resources and memory requirements. The analysis confirms that the shuffled decoder represents an optimal solution if the hardware resources are limited, which makes it attractive in practical applications. The results are verified by simulations for the case of finite geometry LDPC codes.

Original languageEnglish (US)
Title of host publication2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages308-316
Number of pages9
Volume2018-January
ISBN (Electronic)9781538618004
DOIs
StatePublished - Jan 3 2018
Event13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Nis, Serbia
Duration: Oct 18 2017Oct 20 2017

Other

Other13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017
CountrySerbia
CityNis
Period10/18/1710/20/17

Fingerprint

Throughput
Hardware
Data storage equipment
Bit error rate
Computer hardware
Decoding
Scheduling
Geometry

Keywords

  • APP decoding
  • architecture
  • complexity
  • LDPC
  • memory
  • throughput

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Signal Processing
  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Cite this

Ilic, V., Dupraz, E., & Vasic, B. V. (2018). Generic architectures for uniformly reweighted APP decoders. In 2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding (Vol. 2018-January, pp. 308-316). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/TELSKS.2017.8246286

Generic architectures for uniformly reweighted APP decoders. / Ilic, Velimir; Dupraz, Elsa; Vasic, Bane V.

2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. p. 308-316.

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

Ilic, V, Dupraz, E & Vasic, BV 2018, Generic architectures for uniformly reweighted APP decoders. in 2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding. vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 308-316, 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017, Nis, Serbia, 10/18/17. https://doi.org/10.1109/TELSKS.2017.8246286
Ilic V, Dupraz E, Vasic BV. Generic architectures for uniformly reweighted APP decoders. In 2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding. Vol. 2018-January. Institute of Electrical and Electronics Engineers Inc. 2018. p. 308-316 https://doi.org/10.1109/TELSKS.2017.8246286
Ilic, Velimir ; Dupraz, Elsa ; Vasic, Bane V. / Generic architectures for uniformly reweighted APP decoders. 2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. pp. 308-316
@inproceedings{cb7aefef308a47a18127896b35b4611b,
title = "Generic architectures for uniformly reweighted APP decoders",
abstract = "We propose generic architectures for memory-efficient Uniformly reweighted a posteriori probability (URAPP) Decoders of Low Density Parity Check (LDPC) codes, with the bit error rate close to Belief propagation decoding. The architectures enables a trade off between the throughput, computational and hardware resources. As a special case, we derive previously proposed flooding schedule URAPP decoder and propose new type of the URAPP decoder which uses shuffled scheduling. We conduct a rigorous complexity analysis and provide new formulas for the URAPP decoder throughput in terms of hardware resources and memory requirements. The analysis confirms that the shuffled decoder represents an optimal solution if the hardware resources are limited, which makes it attractive in practical applications. The results are verified by simulations for the case of finite geometry LDPC codes.",
keywords = "APP decoding, architecture, complexity, LDPC, memory, throughput",
author = "Velimir Ilic and Elsa Dupraz and Vasic, {Bane V}",
year = "2018",
month = "1",
day = "3",
doi = "10.1109/TELSKS.2017.8246286",
language = "English (US)",
volume = "2018-January",
pages = "308--316",
booktitle = "2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Generic architectures for uniformly reweighted APP decoders

AU - Ilic, Velimir

AU - Dupraz, Elsa

AU - Vasic, Bane V

PY - 2018/1/3

Y1 - 2018/1/3

N2 - We propose generic architectures for memory-efficient Uniformly reweighted a posteriori probability (URAPP) Decoders of Low Density Parity Check (LDPC) codes, with the bit error rate close to Belief propagation decoding. The architectures enables a trade off between the throughput, computational and hardware resources. As a special case, we derive previously proposed flooding schedule URAPP decoder and propose new type of the URAPP decoder which uses shuffled scheduling. We conduct a rigorous complexity analysis and provide new formulas for the URAPP decoder throughput in terms of hardware resources and memory requirements. The analysis confirms that the shuffled decoder represents an optimal solution if the hardware resources are limited, which makes it attractive in practical applications. The results are verified by simulations for the case of finite geometry LDPC codes.

AB - We propose generic architectures for memory-efficient Uniformly reweighted a posteriori probability (URAPP) Decoders of Low Density Parity Check (LDPC) codes, with the bit error rate close to Belief propagation decoding. The architectures enables a trade off between the throughput, computational and hardware resources. As a special case, we derive previously proposed flooding schedule URAPP decoder and propose new type of the URAPP decoder which uses shuffled scheduling. We conduct a rigorous complexity analysis and provide new formulas for the URAPP decoder throughput in terms of hardware resources and memory requirements. The analysis confirms that the shuffled decoder represents an optimal solution if the hardware resources are limited, which makes it attractive in practical applications. The results are verified by simulations for the case of finite geometry LDPC codes.

KW - APP decoding

KW - architecture

KW - complexity

KW - LDPC

KW - memory

KW - throughput

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

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

U2 - 10.1109/TELSKS.2017.8246286

DO - 10.1109/TELSKS.2017.8246286

M3 - Conference contribution

VL - 2018-January

SP - 308

EP - 316

BT - 2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications, TELSIKS 2017 - Proceeding

PB - Institute of Electrical and Electronics Engineers Inc.

ER -