An Evaluation Method of the Block Error Probability by Using a Low-Weight Sub-Trellis Diagram
スポンサーリンク
概要
- 論文の詳細を見る
This paper is concerned with the evaluation of the block error probability of maximum likelihood decoding (MLD) for a block code or a block modulation code over an AWGN channel. It is infeasible to evaluate the block error probability of MLD for a long block code with a large minimum distance by simulation. In this paper, a new evaluation method of the block error probability of MLD by an analytical method combined with simulation with a low-weight sub-trellis diagram is proposed. We show that this proposed method gives a tighter upper bound on the block error probability then the conventional one, and can be applicable to a relatively long block code with a large minimum distance for which conventional simulation is infeasible.
- 社団法人電子情報通信学会の論文
- 1997-11-25
著者
-
KOUMOTO Takuya
Graduate School of Information Science, Nara Institute of Science and Technology
-
TAKATA Toyoo
Graduate School of Info. Science, Nara Institute of Science and Technology
-
Kasami Tadao
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Koumoto Takuya
Okayama University
-
Takata T
Faculty Of Software And Information Science Iwate Prefectural University
-
Tomita Kenichi
The Department Of Information Processing And Management Shiga University
-
Koumoto T
Hiroshima City Univ. Hiroshima Jpn
関連論文
- 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)
- 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)
- 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
- Average Complexity Evaluation of an MLD Algorithm Using the Trellis Structure for a Linear Block Code
- 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
- Syntactic Unification Problems under Constrained Substitutions
- A Polynomial Time Learning Algorithm for Recognizable Series
- 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 of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes(Coding Theory)
- 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)
- RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar