Home > Research > Publications & Outputs > Fast Chase algorithm with an application in tur...
View graph of relations

Fast Chase algorithm with an application in turbo decoding.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Fast Chase algorithm with an application in turbo decoding. / Hirst, Simon A.; Honary, Bahram; Markarian, Garik.
In: IEEE Transactions on Communications, Vol. 49, No. 10, 01.10.2001, p. 1693-1699.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Hirst, SA, Honary, B & Markarian, G 2001, 'Fast Chase algorithm with an application in turbo decoding.', IEEE Transactions on Communications, vol. 49, no. 10, pp. 1693-1699. https://doi.org/10.1109/26.957387

APA

Vancouver

Hirst SA, Honary B, Markarian G. Fast Chase algorithm with an application in turbo decoding. IEEE Transactions on Communications. 2001 Oct 1;49(10):1693-1699. doi: 10.1109/26.957387

Author

Hirst, Simon A. ; Honary, Bahram ; Markarian, Garik. / Fast Chase algorithm with an application in turbo decoding. In: IEEE Transactions on Communications. 2001 ; Vol. 49, No. 10. pp. 1693-1699.

Bibtex

@article{24cc0b3c174e44b6956ab5d25f9f8178,
title = "Fast Chase algorithm with an application in turbo decoding.",
abstract = "Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (RSC)-based turbo systems. Rather than employ trellis-based decoders, an algebraic decoder may be repeatedly employed in a low-complexity, soft-input/soft-output errors-and-erasures decoder such as the Chase algorithm. Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced without degrading performance. The result is a highly efficient fast Chase implementation. The algorithm presented here is principally applicable to single error-correcting codes although consideration is also given to the more general case. The new decoder's value in practical turbo schemes is demonstrated via application to decoding of the (64,57,4) extended Hamming TPC",
keywords = "DCS-publications-id, art-222, DCS-publications-credits, coding-fa, DCS-publications-personnel-id, 27, 1, 141",
author = "Hirst, {Simon A.} and Bahram Honary and Garik Markarian",
note = "This paper describes a modified fast Chase decoding algorithm for product codes. This algorithm allows fast decoding of turbo codes, resulting in a larger number of iterations without additional delay. These results were implemented by Advanced Hardware Architectures Inc in the AHA4850 turbo product decoder chip. RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering",
year = "2001",
month = oct,
day = "1",
doi = "10.1109/26.957387",
language = "English",
volume = "49",
pages = "1693--1699",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

RIS

TY - JOUR

T1 - Fast Chase algorithm with an application in turbo decoding.

AU - Hirst, Simon A.

AU - Honary, Bahram

AU - Markarian, Garik

N1 - This paper describes a modified fast Chase decoding algorithm for product codes. This algorithm allows fast decoding of turbo codes, resulting in a larger number of iterations without additional delay. These results were implemented by Advanced Hardware Architectures Inc in the AHA4850 turbo product decoder chip. RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering

PY - 2001/10/1

Y1 - 2001/10/1

N2 - Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (RSC)-based turbo systems. Rather than employ trellis-based decoders, an algebraic decoder may be repeatedly employed in a low-complexity, soft-input/soft-output errors-and-erasures decoder such as the Chase algorithm. Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced without degrading performance. The result is a highly efficient fast Chase implementation. The algorithm presented here is principally applicable to single error-correcting codes although consideration is also given to the more general case. The new decoder's value in practical turbo schemes is demonstrated via application to decoding of the (64,57,4) extended Hamming TPC

AB - Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (RSC)-based turbo systems. Rather than employ trellis-based decoders, an algebraic decoder may be repeatedly employed in a low-complexity, soft-input/soft-output errors-and-erasures decoder such as the Chase algorithm. Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced without degrading performance. The result is a highly efficient fast Chase implementation. The algorithm presented here is principally applicable to single error-correcting codes although consideration is also given to the more general case. The new decoder's value in practical turbo schemes is demonstrated via application to decoding of the (64,57,4) extended Hamming TPC

KW - DCS-publications-id

KW - art-222

KW - DCS-publications-credits

KW - coding-fa

KW - DCS-publications-personnel-id

KW - 27

KW - 1

KW - 141

U2 - 10.1109/26.957387

DO - 10.1109/26.957387

M3 - Journal article

VL - 49

SP - 1693

EP - 1699

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 10

ER -