Home > Research > Publications & Outputs > Low-complexity decoding of LDPC codes

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

Low-complexity decoding of LDPC codes

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Low-complexity decoding of LDPC codes. / Pandya, Nishit; Honary, Bahram.
In: Electronics Letters, Vol. 43, No. 18, 08.2007, p. 990-991.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Pandya, N & Honary, B 2007, 'Low-complexity decoding of LDPC codes', Electronics Letters, vol. 43, no. 18, pp. 990-991. https://doi.org/10.1049/el:20071653

APA

Pandya, N., & Honary, B. (2007). Low-complexity decoding of LDPC codes. Electronics Letters, 43(18), 990-991. https://doi.org/10.1049/el:20071653

Vancouver

Pandya N, Honary B. Low-complexity decoding of LDPC codes. Electronics Letters. 2007 Aug;43(18):990-991. doi: 10.1049/el:20071653

Author

Pandya, Nishit ; Honary, Bahram. / Low-complexity decoding of LDPC codes. In: Electronics Letters. 2007 ; Vol. 43, No. 18. pp. 990-991.

Bibtex

@article{baa5eb947d154d2c9319030a8dbe9150,
title = "Low-complexity decoding of LDPC codes",
abstract = "The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity- check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.",
author = "Nishit Pandya and Bahram Honary",
year = "2007",
month = aug,
doi = "10.1049/el:20071653",
language = "English",
volume = "43",
pages = "990--991",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "18",

}

RIS

TY - JOUR

T1 - Low-complexity decoding of LDPC codes

AU - Pandya, Nishit

AU - Honary, Bahram

PY - 2007/8

Y1 - 2007/8

N2 - The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity- check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

AB - The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity- check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

U2 - 10.1049/el:20071653

DO - 10.1049/el:20071653

M3 - Journal article

VL - 43

SP - 990

EP - 991

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 18

ER -