An efficient heuristic search method for maximum likelihood decoding of linear block codes using dual codes

Tomotsugu Okada, Manabu Kobayashi, Shigeichi Hirasawa

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Y.S. Han et al. have proposed an efficient maximum likelihood decoding (MLD) algorithm using A* algorithm which is the graph search method. In this paper, we propose a new MLD algorithm for linear block codes. The MLD algorithm proposed in this paper improves that given by Han et al. utilizing codewords of dual codes. This scheme reduces the number of generated codewords in the MLD algorithm. We show that the complexity of the proposed decoding algorithm is reduced compared to that given by Han et al. without increasing the probability of decoding error.

Original languageEnglish
Pages (from-to)485-489
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE85-A
Issue number2
Publication statusPublished - 2002 Jan 1

Fingerprint

Dual Codes
Block Codes
Block codes
Heuristic Search
Linear Codes
Heuristic Method
Search Methods
Maximum likelihood
Maximum Likelihood
Decoding
Graph Search
A* Algorithm

Keywords

  • A* algorithm
  • Block codes
  • Dual codes
  • Maximum likelihood decoding
  • Soft decision

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{81517ac3313246058c0de03b3f0945e2,
title = "An efficient heuristic search method for maximum likelihood decoding of linear block codes using dual codes",
abstract = "Y.S. Han et al. have proposed an efficient maximum likelihood decoding (MLD) algorithm using A* algorithm which is the graph search method. In this paper, we propose a new MLD algorithm for linear block codes. The MLD algorithm proposed in this paper improves that given by Han et al. utilizing codewords of dual codes. This scheme reduces the number of generated codewords in the MLD algorithm. We show that the complexity of the proposed decoding algorithm is reduced compared to that given by Han et al. without increasing the probability of decoding error.",
keywords = "A* algorithm, Block codes, Dual codes, Maximum likelihood decoding, Soft decision",
author = "Tomotsugu Okada and Manabu Kobayashi and Shigeichi Hirasawa",
year = "2002",
month = "1",
day = "1",
language = "English",
volume = "E85-A",
pages = "485--489",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

TY - JOUR

T1 - An efficient heuristic search method for maximum likelihood decoding of linear block codes using dual codes

AU - Okada, Tomotsugu

AU - Kobayashi, Manabu

AU - Hirasawa, Shigeichi

PY - 2002/1/1

Y1 - 2002/1/1

N2 - Y.S. Han et al. have proposed an efficient maximum likelihood decoding (MLD) algorithm using A* algorithm which is the graph search method. In this paper, we propose a new MLD algorithm for linear block codes. The MLD algorithm proposed in this paper improves that given by Han et al. utilizing codewords of dual codes. This scheme reduces the number of generated codewords in the MLD algorithm. We show that the complexity of the proposed decoding algorithm is reduced compared to that given by Han et al. without increasing the probability of decoding error.

AB - Y.S. Han et al. have proposed an efficient maximum likelihood decoding (MLD) algorithm using A* algorithm which is the graph search method. In this paper, we propose a new MLD algorithm for linear block codes. The MLD algorithm proposed in this paper improves that given by Han et al. utilizing codewords of dual codes. This scheme reduces the number of generated codewords in the MLD algorithm. We show that the complexity of the proposed decoding algorithm is reduced compared to that given by Han et al. without increasing the probability of decoding error.

KW - A algorithm

KW - Block codes

KW - Dual codes

KW - Maximum likelihood decoding

KW - Soft decision

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

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

M3 - Article

AN - SCOPUS:0036475848

VL - E85-A

SP - 485

EP - 489

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 - 2

ER -