Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Efficient MAP Decoding Algorithms for Linear Block Codes

Ryujiro Shibuya

Published Mar 23, 2001• 0 citations
Publisher

Abstract

線形ﾌﾞﾛﾂｸ符号に対する効率的なMAP復号ｱﾙｺﾞﾘｽﾞﾑ) 氏名渋谷竜二郎 ﾀ-ﾎﾞ符号に代表されるように,比較的単純な符号を繰り返し行うことによって誤り訂正 を行うﾀｲﾌﾟの符号が,その復号性能の高さから注目を浴び,盛んに研究されている

DOI
10.11501/3185421

Related papers

MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure

Yuichi Kaji

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 2000•7 citations

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; The Map and Related Decoding Algirithms

Shu Wen Lin, M.P.C. Fossorier

•Apr 20, 1998•0 citations

Soft decision MAP decoding of binary linear block codes via global optimization

Stefan Schäffler, Joachim Hagenauer

This paper presents a stochastic method for soft decision decoding of binary linear block codes. An efficient algorithm is developed and investigated based on a special nonlinear regression model. Numerical results using BCH codes and turbo codes with code dimension up to 191 are considered.

IEEE International Symposium on Information Theory (ISIT)•Nov 22, 2002•3 citations

A decoding algorithm for linear codes

Martin Bossert, F. Hergert

Lecture notes in computer science•Jan 1, 1986•2 citations

A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code

Toshiyuki Ishida, Yuichi Kaji

A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 1, 2003•0 citations

On decoding algorithms for binary linear block codes

Bruce L. Montgomery

This dissertation investigates the complexity of minimum-distance decoding (MDD) algorithms for general binary linear block codes, and also investigates the use of such codes in constructing error correcting/detecting codes that are effective against both random and unidirectional errors. A new MDD algorithm is proposed, and its complexity is analyzed and compared to that of other such algorithms. The question of whether all good codes satisfy certain properties required for efficient implementation of the algorithm is also considered. The performance of decoding algorithms, with the information bit error rate as the criterion instead of the block error rate, is also studied. New decoding rules which can yield lower information bit error rates than the MDD rule are proposed and evaluated. A new class of binary codes is developed which corrects random errors and detects all unidirectional errors. These codes are obtained by appending a suffix to each codeword of a linear block code. To evaluate the efficiency of the new codes, a thorough comparison with the best previously obtained codes is made.

•Jan 1, 1987•0 citations
線形ﾌﾞﾛﾂｸ符号に対する効率的なMAP復号ｱﾙｺﾞﾘｽﾞﾑ) 氏名渋谷竜二郎 ﾀ-ﾎﾞ符号に代表されるように,比較的単純な符号を繰り返し行うことによって誤り訂正 を行うﾀｲﾌﾟの符号が,その復号性能の高さから注目を浴び,盛んに研究されている
A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.
This dissertation investigates the complexity of minimum-distance decoding (MDD) algorithms for general binary linear block codes, and also investigates the use of such codes in constructing error correcting/detecting codes that are effective against both random and unidirectional errors. A new MDD algorithm is proposed, and its complexity is analyzed and compared to that of other such algorithms. The question of whether all good codes satisfy certain properties required for efficient implementation of the algorithm is also considered. The performance of decoding algorithms, with the information bit error rate as the criterion instead of the block error rate, is also studied. New decoding rules which can yield lower information bit error rates than the MDD rule are proposed and evaluated. A new class of binary codes is developed which corrects random errors and detects all unidirectional errors. These codes are obtained by appending a suffix to each codeword of a linear block code. To evaluate the efficiency of the new codes, a thorough comparison with the best previously obtained codes is made.