A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search(Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we present a new soft-decision iterative decoding algorithm using an efficient minimum distance search (MDS) algorithm. The proposed MDS algorithm is a top-down and recursive MDS algorithm, which finds a most likely codeword among the codewords at the minimum distance of the code from a given codeword. A search is made in each divided section by a "call by need" from the upper section. As a consequence, the search space and computational complexity are reduced significantly. The simulation results show that the proposed decoding algorithm achieves near error performance to the maximum likelihood decoding for any RM code of length 128 and suboptimal for the (256, 37), (256, 93) and (256, 163) RM codes.
- 社団法人電子情報通信学会の論文
- 2002-10-01
著者
-
KOUMOTO Takuya
Graduate School of Information Science, Nara Institute of Science and Technology
-
Asatani Jun
Okayama University or Science
-
Koumoto Takuya
Okayama University
-
ASATANI Jun
Department of Information & Computer Engineering, Faculty of Engineering, Okayama University of Scie
-
KASAMI Tadao
Department of Computer Science, Faculty of Information Science, Hiroshima City University
-
Takata T
Faculty Of Software And Information Science Iwate Prefectural University
-
Takata Toyoo
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
-
TOMITA Kenichi
Department of Information Processing and Management, Shiga University
-
KOUMOTO Takuya
Department of Computer Science, Graduate School of Information Science, Hiroshima City University
関連論文
- 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
- 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
- On the Number of Minimum Weight Codewords of Subcodes of Reed-Muller Codes (Special Section on Information Theory and Its Applications)
- 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)
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining
- Mining Sequential Patterns More Efficiently by Reducing the Cost of Scanning Sequence Databases(Data Mining)
- Mining Frequent Patterns Securely in Distributed System(Data Mining)
- Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search(Cording Theory)(Information Theory and Its Applications)
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining