Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding

Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Several reliability based code search algorithms for maximum likelihood decoding have been proposed. These algorithms search the most likely codeword, using the most reliable information set where the leftmost k (the dimension of code) columns of generator matrix are the most reliable and linearly independent. Especially, D. Gazelle and J. Snyders have proposed an efficient decoding algorithm and this algorithm requires small number of candidate codewords to find out the most likely codeword. In this paper, we propose new efficient methods for both generating candidate codewords and computing metrics of candidate codewords to obtain the most likely codeword at the decoder. The candidate codewords constructed by the proposed method are identical those in the decoding algorithm of Gazelle et al. Consequently, the proposed decoding algorithm reduces the time complexity in total, compared to the decoding algorithm of Gazelle et al. without the degradation in error performance.

Original languageEnglish
Pages (from-to)2461-2472
Number of pages12
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE86-A
Issue number10
Publication statusPublished - 2003 Jan 1
Externally publishedYes

Fingerprint

Maximum likelihood
Maximum Likelihood
Decoding
Likely
Search Algorithm
Time Complexity
Degradation
Linearly
Generator
Metric
Computing

Keywords

  • Information set decoding
  • Linear block codes
  • Maximum likelihood decoding
  • Most reliable basis
  • Reliability measure

ASJC Scopus subject areas

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

Cite this

Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding. / Yagi, Hideki; Kobayashi, Manabu; Hirasawa, Shigeichi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E86-A, No. 10, 01.01.2003, p. 2461-2472.

Research output: Contribution to journalArticle

@article{56bbab120ad6454198db68c9cd9391d7,
title = "Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding",
abstract = "Several reliability based code search algorithms for maximum likelihood decoding have been proposed. These algorithms search the most likely codeword, using the most reliable information set where the leftmost k (the dimension of code) columns of generator matrix are the most reliable and linearly independent. Especially, D. Gazelle and J. Snyders have proposed an efficient decoding algorithm and this algorithm requires small number of candidate codewords to find out the most likely codeword. In this paper, we propose new efficient methods for both generating candidate codewords and computing metrics of candidate codewords to obtain the most likely codeword at the decoder. The candidate codewords constructed by the proposed method are identical those in the decoding algorithm of Gazelle et al. Consequently, the proposed decoding algorithm reduces the time complexity in total, compared to the decoding algorithm of Gazelle et al. without the degradation in error performance.",
keywords = "Information set decoding, Linear block codes, Maximum likelihood decoding, Most reliable basis, Reliability measure",
author = "Hideki Yagi and Manabu Kobayashi and Shigeichi Hirasawa",
year = "2003",
month = "1",
day = "1",
language = "English",
volume = "E86-A",
pages = "2461--2472",
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 - Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding

AU - Yagi, Hideki

AU - Kobayashi, Manabu

AU - Hirasawa, Shigeichi

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Several reliability based code search algorithms for maximum likelihood decoding have been proposed. These algorithms search the most likely codeword, using the most reliable information set where the leftmost k (the dimension of code) columns of generator matrix are the most reliable and linearly independent. Especially, D. Gazelle and J. Snyders have proposed an efficient decoding algorithm and this algorithm requires small number of candidate codewords to find out the most likely codeword. In this paper, we propose new efficient methods for both generating candidate codewords and computing metrics of candidate codewords to obtain the most likely codeword at the decoder. The candidate codewords constructed by the proposed method are identical those in the decoding algorithm of Gazelle et al. Consequently, the proposed decoding algorithm reduces the time complexity in total, compared to the decoding algorithm of Gazelle et al. without the degradation in error performance.

AB - Several reliability based code search algorithms for maximum likelihood decoding have been proposed. These algorithms search the most likely codeword, using the most reliable information set where the leftmost k (the dimension of code) columns of generator matrix are the most reliable and linearly independent. Especially, D. Gazelle and J. Snyders have proposed an efficient decoding algorithm and this algorithm requires small number of candidate codewords to find out the most likely codeword. In this paper, we propose new efficient methods for both generating candidate codewords and computing metrics of candidate codewords to obtain the most likely codeword at the decoder. The candidate codewords constructed by the proposed method are identical those in the decoding algorithm of Gazelle et al. Consequently, the proposed decoding algorithm reduces the time complexity in total, compared to the decoding algorithm of Gazelle et al. without the degradation in error performance.

KW - Information set decoding

KW - Linear block codes

KW - Maximum likelihood decoding

KW - Most reliable basis

KW - Reliability measure

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

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

M3 - Article

VL - E86-A

SP - 2461

EP - 2472

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 -