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

Tomotsugu Okada, Manabu Kobayashi, Shigeichi Hirasawa

研究成果: Article査読

5 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)485-489
ページ数5
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E85-A
2
出版ステータスPublished - 2002 2

ASJC Scopus subject areas

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

フィンガープリント 「An efficient heuristic search method for maximum likelihood decoding of linear block codes using dual codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル