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 Feb

Keywords

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'An efficient heuristic search method for maximum likelihood decoding of linear block codes using dual codes'. Together they form a unique fingerprint.

  • Cite this