A heuristic search method with the reduced list of test error patterns for maximum likelihood decoding

Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.

    Original languageEnglish
    Pages (from-to)2721-2732
    Number of pages12
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE88-A
    Issue number10
    DOIs
    Publication statusPublished - 2005 Oct

    Fingerprint

    Heuristic Search
    Heuristic Method
    Search Methods
    Maximum likelihood
    Maximum Likelihood
    Decoding
    Space Complexity
    Heuristics
    Block Codes
    Block codes
    High Efficiency
    Simulation

    Keywords

    • Binary block codes
    • Heuristic search
    • Maximum likelihood decoding
    • Most reliable basis
    • Reliability

    ASJC Scopus subject areas

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

    Cite this

    @article{6c86294b1bc54b6c8c15f76f3334e72a,
    title = "A heuristic search method with the reduced list of test error patterns for maximum likelihood decoding",
    abstract = "The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.",
    keywords = "Binary block codes, Heuristic search, Maximum likelihood decoding, Most reliable basis, Reliability",
    author = "Hideki Yagi and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "2005",
    month = "10",
    doi = "10.1093/ietfec/e88-a.10.2721",
    language = "English",
    volume = "E88-A",
    pages = "2721--2732",
    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 - A heuristic search method with the reduced list of test error patterns for maximum likelihood decoding

    AU - Yagi, Hideki

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 2005/10

    Y1 - 2005/10

    N2 - The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.

    AB - The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version suggested by Valembois and Fossorier, we propose a new method for reducing the space complexity of the heuristic search methods for MLD including the well-known decoding algorithm of Han et al. If the heuristic function satisfies a certain condition, the proposed method guarantees to reduce the space complexity of both the Battail-Fang and Han et al. decoding algorithms. Simulation results show the high efficiency of the proposed method.

    KW - Binary block codes

    KW - Heuristic search

    KW - Maximum likelihood decoding

    KW - Most reliable basis

    KW - Reliability

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

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

    U2 - 10.1093/ietfec/e88-a.10.2721

    DO - 10.1093/ietfec/e88-a.10.2721

    M3 - Article

    AN - SCOPUS:27844590826

    VL - E88-A

    SP - 2721

    EP - 2732

    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 -