A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
スポンサーリンク
概要
- 論文の詳細を見る
In an iterative decoding algorithm, such as Chase Type-II decoding algorithm and its improvements, candidate codewords for a received vector are generated for test based on a bounded-distance decoder and a set of test error patterns. It is desirable to remove useless test error patterns in these decoding algorithms. This paper presents a sufficient condition for ruling out some useless test error patterns. If this condition holds for a test error patterns e, then e can not produce a candidate codeword with a correlation metric larger than those of the candidate codewords generated already and hence e is useless. This significantly reduces the decoding operations in Chase type-II decoding algorithm or decoding iterations in its improvements.
- 社団法人電子情報通信学会の論文
- 1998-02-25
著者
-
Lin Shu
California Univ. Ca Usa
-
Lin Shu
The Author Is With The Department Of Electrical And Computer Engineering University Of California
-
Lin Shu
Department Of Electrical Engineering University Of Hawaii At Manoa
-
Shu Lin
University Of Hawaii At Manoa Dept.electrical Engineering Usa.
-
KOUMOTO Takuya
the Graduate School of Information Science, Nara Institute of Science and Technology
-
KASAMI Tadao
the Graduate School of Information Science, Nara Institute of Science and Technology
-
LIN Shu
the Department of Electrical Engineering, University of Hawaii
-
KOUMOTO Takuya
Graduate School of Information Science, Nara Institute of Science and Technology
-
Koumoto Takuya
Okayama University
-
Lin Shu
University Of Hawaii At Manoa Dept. Electrical Engineering
-
Koumoto T
Hiroshima City Univ. Hiroshima Jpn
関連論文
- Practical Multilevel Coding and Multistage Decoding for Satellite Broadcasting
- Practical Multilevel Coding and Multistage Decoding for Satellite Broadcasting
- MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure(Special Section on Information Theory and Its Applications)
- A Recursive Maximum Likelihood Decoding Algorithm for Some Transitive Invariant Binary Block Codes
- A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
- Low Weight Subtrellises for Binary Linear Block Codes and Their Applications
- Error Performance of Multilevel Block Coded 8-PSK Modulations Using Unequal Error Protection Codes for the Rayleigh Fading Channel
- An Improved Union Bound on Block Error Probability for Closest Coset Decoding
- On Branch Labels of Parallel Components of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes
- On Structural Complexity of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes (Special Section on Information Theory and Its Applications)
- Tradeoffs between Error Performance and Decoding Complexity in Multilevel 8-PSK Codes with UEP Capabilities and Multistage Decoding
- Coded Modulation for Satellite Broadcasting Based on Unconventional Partitionings (Special Section on Information Theory and Its Applications)
- 非対称変調に基づく不均一誤り訂正符号化変調方式の誤り率特性
- 不均一誤り訂正のための3レベルBCH符号化8-PSK変調について
- セクショントレリスダイアグラムの詳細構造を用いた線形符号の再帰的最ゆう復号アルゴリズムについての平均計算複雑度の評価
- 逐次復号法の繰り返し回数を減少させるための条件
- 新しい逐次軟判定復号法
- セクショントレリスダイアグラムを用いた線形符号の最尤復号の複雑度について
- 線形ブロック符号のLセクション最簡トレリスダイアグラムの並列成分におけるラベル系列につ いて
- イ-サネットで用いられる短縮巡回ハミング符号の誤り検出能力
- ある2重符号化方式の誤り見逃し確率と再送確率の計算法
- Structural Analysis of Minimum Weight Codewords of the Extended (32, 21, 6) and (64, 45, 8) BCH Codes Using Invariance Property(HISC2006)
- The structure of the set of minimum weight codewords of the extended (32,21,6) and (64,45,8) BCH codes
- Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms (Special Section on Information Theory and Its Applications)
- The Weight Distributions of Cosets of the Second-Order Reed-Muller Code of Length 128 in the Third-Order Reed-Muller Code of Length 128
- A Method for Computing the Weight Distribution of a Block Code by Using Its Trellis Diagram (Special Section on Information Theory and Its Applications)
- An Improved Method for Formal Security Verification of Cryptographic Protocols
- A System for Deciding the Security of Cryptographic Protocols (Special Section on Cryptography and Information Security)
- Multilevel Coded 16-QAM Modulation with Multistage Decoding and Unequal Error Protection
- Performance Analysis for Binary Image of Linear Block Codes over an Extended Field of GF(2)
- Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
- Soft-Input Soft-Output Decoding Algorithm Based on Iterative Minimum Distance Search for Reed-Muller Codes
- Selecting the Search Centers of h-Chase Decoding Algorithms by Simulation
- The Optimal Sectionalized Trellises for the Generalized Version of Viterbi Algorithm of Linear Block Codes and Its Application to Reed-Muller Codes
- 多値符号化における線形ブロック符号の順序統計量に基づく軟判定復号特性
- Assignment of Data Types to Words in a Natural Language Specification
- Implementation of Natural Language Specifications of Communication Protocols by Executable Specifications
- A Translation Method from Natural Language Specifications of Communication Protocols into Algebraic Specifications Using Contextual Dependencies
- RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
- On the Generative Power of Grammars for RNA Secondary Structure(Foundations of Computer Science)
- A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search(Special Section on Information Theory and Its Applications)
- An Evaluation Method of the Block Error Probability by Using a Low-Weight Sub-Trellis Diagram
- A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars
- A Note on Inadequacy of the Model for Learning from Queries
- Finite State Translation Systems and Parallel Multiple Context-Free Grammars
- The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems
- Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms(Coding Theory)(Information Theory and Its Applications)
- Selection of Search Centers in Iterative Soft-Decision Decoding Algorithms(Special Section on Information Theory and Its Applications)
- An Improvement to GMD-Like Decoding Algorithms(Special Section on Information Theory and Its Applications)
- Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search(Cording Theory)(Information Theory and Its Applications)