Links

Tools

Export citation

Search in Google Scholar

A method for reducing space complexity of reliability-based heuristic search maximum likelihood decoding algorithms

Journal article published in 1 by Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa
This paper was not found in any repository; the policy of its publisher is unknown or unclear.
This paper was not found in any repository; the policy of its publisher is unknown or unclear.

Full text: Unavailable

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

In this paper, reliability-based heuristic search methods for maximum likelihood decoding of block codes are considered. Based on the decoding algorithm by Battail and Fang (and its improved technique by Valembois and Fossorier), we deduce a method of reducing the space com-plexity of the heuristic search maximum likelihood decod-ing algorithm. The proposed method is applicable to the heuristic search method with a certain class of evaluation functions. Simulation results show the efficiency of the de-coding algorithm adopting the proposed method.