An improvement to GMD-like decoding algorithms

Hitoshi Tokushige, Yuansheng Tang, Takuya Kusaka, Tadao Kasami

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

Original languageEnglish
Pages (from-to)1963-1965
Number of pages3
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE83-A
Issue number10
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Decoding
Iteration
Block Codes
Block codes
Linear Codes
Increment
Optimality
Binary
Sufficient Conditions

Keywords

  • Binary block codes
  • Early termination conditions
  • Multiple GMD decoding
  • Soft-decision iterative decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

An improvement to GMD-like decoding algorithms. / Tokushige, Hitoshi; Tang, Yuansheng; Kusaka, Takuya; Kasami, Tadao.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E83-A, No. 10, 2000, p. 1963-1965.

Research output: Contribution to journalArticle

Tokushige, Hitoshi ; Tang, Yuansheng ; Kusaka, Takuya ; Kasami, Tadao. / An improvement to GMD-like decoding algorithms. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2000 ; Vol. E83-A, No. 10. pp. 1963-1965.
@article{b2db369f92094a649d240ab6606b43f5,
title = "An improvement to GMD-like decoding algorithms",
abstract = "For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.",
keywords = "Binary block codes, Early termination conditions, Multiple GMD decoding, Soft-decision iterative decoding",
author = "Hitoshi Tokushige and Yuansheng Tang and Takuya Kusaka and Tadao Kasami",
year = "2000",
language = "English",
volume = "E83-A",
pages = "1963--1965",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - An improvement to GMD-like decoding algorithms

AU - Tokushige, Hitoshi

AU - Tang, Yuansheng

AU - Kusaka, Takuya

AU - Kasami, Tadao

PY - 2000

Y1 - 2000

N2 - For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

AB - For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

KW - Binary block codes

KW - Early termination conditions

KW - Multiple GMD decoding

KW - Soft-decision iterative decoding

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

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

M3 - Article

VL - E83-A

SP - 1963

EP - 1965

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 10

ER -