Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding

Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa

研究成果: Article査読

4 被引用数 (Scopus)

抄録

We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.

本文言語English
ページ(範囲)2676-2683
ページ数8
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E89-A
10
DOI
出版ステータスPublished - 2006 10

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル