Reliability-Based Information Set Decoding of Binary Linear Block Codes

Marc P. C. FOSSORIER; Shu LIN

Reliability-Based Information Set Decoding of Binary Linear Block Codes

Marc P. C. FOSSORIER, Shu LIN

Full Text Views

0

Cite this

Summary :

In this paper, soft decision decoding of linear block codes based on the reprocessing of several information sets is considered. These information sets are chosen according to the reliability measures of the received symbols and constructed from the most reliable information set, referred to as the most reliable basis. Each information set is then reprocessed by a multi-stage decoding algorithm until either the optimum error performance, or a desired level of error performance is achieved. General guidelines for the trade-offs between the number of information sets to be processed, the number of computations for reprocessing each information set, and the error performance to be achieved are provided. It is shown that with a proper selection of few information sets, low-complexity near-optimum soft decision decoding of relatively long block codes (64 N 128) can be achieved with significant reduction in computation complexity with respect to other known algorithms. This scheme, which generalizes the reprocessing of the most reliable basis with the ordered statistic algorithm proposed by Fossorier and Lin, is particularly efficient for codes with rate R 1/2.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2034-2042

Publication Date: 1999/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Marc P. C. FOSSORIER, Shu LIN, "Reliability-Based Information Set Decoding of Binary Linear Block Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E82-A, no. 10, pp. 2034-2042, October 1999, doi: .
Abstract: In this paper, soft decision decoding of linear block codes based on the reprocessing of several information sets is considered. These information sets are chosen according to the reliability measures of the received symbols and constructed from the most reliable information set, referred to as the most reliable basis. Each information set is then reprocessed by a multi-stage decoding algorithm until either the optimum error performance, or a desired level of error performance is achieved. General guidelines for the trade-offs between the number of information sets to be processed, the number of computations for reprocessing each information set, and the error performance to be achieved are provided. It is shown that with a proper selection of few information sets, low-complexity near-optimum soft decision decoding of relatively long block codes (64 N 128) can be achieved with significant reduction in computation complexity with respect to other known algorithms. This scheme, which generalizes the reprocessing of the most reliable basis with the ordered statistic algorithm proposed by Fossorier and Lin, is particularly efficient for codes with rate R 1/2.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2034/_p

Copy

@ARTICLE{e82-a_10_2034,
author={Marc P. C. FOSSORIER, Shu LIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reliability-Based Information Set Decoding of Binary Linear Block Codes},
year={1999},
volume={E82-A},
number={10},
pages={2034-2042},
abstract={In this paper, soft decision decoding of linear block codes based on the reprocessing of several information sets is considered. These information sets are chosen according to the reliability measures of the received symbols and constructed from the most reliable information set, referred to as the most reliable basis. Each information set is then reprocessed by a multi-stage decoding algorithm until either the optimum error performance, or a desired level of error performance is achieved. General guidelines for the trade-offs between the number of information sets to be processed, the number of computations for reprocessing each information set, and the error performance to be achieved are provided. It is shown that with a proper selection of few information sets, low-complexity near-optimum soft decision decoding of relatively long block codes (64 N 128) can be achieved with significant reduction in computation complexity with respect to other known algorithms. This scheme, which generalizes the reprocessing of the most reliable basis with the ordered statistic algorithm proposed by Fossorier and Lin, is particularly efficient for codes with rate R 1/2.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Reliability-Based Information Set Decoding of Binary Linear Block Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2034
EP - 2042
AU - Marc P. C. FOSSORIER
AU - Shu LIN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - In this paper, soft decision decoding of linear block codes based on the reprocessing of several information sets is considered. These information sets are chosen according to the reliability measures of the received symbols and constructed from the most reliable information set, referred to as the most reliable basis. Each information set is then reprocessed by a multi-stage decoding algorithm until either the optimum error performance, or a desired level of error performance is achieved. General guidelines for the trade-offs between the number of information sets to be processed, the number of computations for reprocessing each information set, and the error performance to be achieved are provided. It is shown that with a proper selection of few information sets, low-complexity near-optimum soft decision decoding of relatively long block codes (64 N 128) can be achieved with significant reduction in computation complexity with respect to other known algorithms. This scheme, which generalizes the reprocessing of the most reliable basis with the ordered statistic algorithm proposed by Fossorier and Lin, is particularly efficient for codes with rate R 1/2.
ER -