Home > Research > Publications & Outputs > Decoding of generalised low-density parity-chec...

Research

Associated organisational unit

Links

Text available via DOI:

View graph of relations

Decoding of generalised low-density parity-check codes using weighted bit-flip voting

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

Published

Standard

Decoding of generalised low-density parity-check codes using weighted bit-flip voting. / Hirst, Simon A.; Honary, Bahram.
In: IEE Proceedings - Communications, Vol. 149, No. 1, 02.2002, p. 1-5.

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

Harvard

Hirst, SA & Honary, B 2002, 'Decoding of generalised low-density parity-check codes using weighted bit-flip voting', IEE Proceedings - Communications, vol. 149, no. 1, pp. 1-5. https://doi.org/10.1049/ip-com:20020307

APA

Hirst, S. A., & Honary, B. (2002). Decoding of generalised low-density parity-check codes using weighted bit-flip voting. IEE Proceedings - Communications, 149(1), 1-5. https://doi.org/10.1049/ip-com:20020307

Vancouver

Hirst SA, Honary B. Decoding of generalised low-density parity-check codes using weighted bit-flip voting. IEE Proceedings - Communications. 2002 Feb;149(1):1-5. doi: 10.1049/ip-com:20020307

Author

Hirst, Simon A. ; Honary, Bahram. / Decoding of generalised low-density parity-check codes using weighted bit-flip voting. In: IEE Proceedings - Communications. 2002 ; Vol. 149, No. 1. pp. 1-5.

Bibtex

@article{cb07391ec64e423797ca385b2facf263,
title = "Decoding of generalised low-density parity-check codes using weighted bit-flip voting",
abstract = "A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's (1963) bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. The performance is found to compete well with other more conventional hard decision decoding schemes",
author = "Hirst, {Simon A.} and Bahram Honary",
year = "2002",
month = feb,
doi = "10.1049/ip-com:20020307",
language = "English",
volume = "149",
pages = "1--5",
journal = "IEE Proceedings - Communications",
issn = "1350-2425",
publisher = "Institute of Electrical Engineers",
number = "1",

}

RIS

TY - JOUR

T1 - Decoding of generalised low-density parity-check codes using weighted bit-flip voting

AU - Hirst, Simon A.

AU - Honary, Bahram

PY - 2002/2

Y1 - 2002/2

N2 - A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's (1963) bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. The performance is found to compete well with other more conventional hard decision decoding schemes

AB - A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's (1963) bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. The performance is found to compete well with other more conventional hard decision decoding schemes

U2 - 10.1049/ip-com:20020307

DO - 10.1049/ip-com:20020307

M3 - Journal article

VL - 149

SP - 1

EP - 5

JO - IEE Proceedings - Communications

JF - IEE Proceedings - Communications

SN - 1350-2425

IS - 1

ER -