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

IEICE Technical Report; IEICE Tech. Rep.

Selection Method of Search Centers in Iterative Soft-decision Decoding Algorithms for Non Binary Codes (情報通信基礎サブソサイエティ合同研究会)

仁 得重, I. Hisadomi, 忠雄 嵩

Published Mar 19, 2002• 0 citations
OpenAlex

Related papers

Optimality and Ruling-Out Conditions and Their Evaluation Methods for Soft-Decision Iterative Decoding Algorithms for Binary Linear Block Codes

元生 唐

•Mar 24, 2000•0 citations

A Soft-input and output Iterative Decoding Algorithm using an Algebraic Decoding for Non-binary Codes

Hitoshi Tokushige

International Symposium on Information Theory and its Applications•Jan 1, 2002•1 citation

A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search

Jun Asatani, Ken‐ichi Tomita, Takuya Koumoto +2 more

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 12, 2002•2 citations

On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes

Hitoshi Tokushige, I. Hisadomi, Tadao Kasami

We consider an iterative decoding algorithm by using algebraic decoding for non-binary codes. In the decoding algorithm, algebraic decoding are carried out with respect to successively chosen input words, called the search centers. We present a new method for selecting sequences of search centers of algebraic decoding. Over the AWGN channel using BPSK signaling, we show simulation results on the error performances of the iterative decoding algorithms whose search centers are given by the proposed method, abbreviated IAD, for Reed-Solomon codes. From the simulation results, IAD provides considerably better error performance than GMD and CGA decoding with the same number of iterations.

Globecom•Mar 22, 2004•3 citations

Soft-Decision Decoding Algorithms for Binary Linear Block Codes

Hitoshi Tokushige

•Dec 19, 2000•0 citations

A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

Takuya Koumoto, T. Takata, Tadao Kasami +1 more

This paper presents a new low-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.

IEEE Transactions on Information Theory•Mar 1, 1999•13 citations
We consider an iterative decoding algorithm by using algebraic decoding for non-binary codes. In the decoding algorithm, algebraic decoding are carried out with respect to successively chosen input words, called the search centers. We present a new method for selecting sequences of search centers of algebraic decoding. Over the AWGN channel using BPSK signaling, we show simulation results on the error performances of the iterative decoding algorithms whose search centers are given by the proposed method, abbreviated IAD, for Reed-Solomon codes. From the simulation results, IAD provides considerably better error performance than GMD and CGA decoding with the same number of iterations.
This paper presents a new low-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. The algorithm is devised based on a set of optimality conditions and the generation of a sequence of candidate codewords for an optimality test. The initial candidate codeword is generated by a simple decoding method. The subsequent candidate codewords, if needed, are generated by a chain of low-weight trellis searches, one at a time. Each search is conducted through a low-weight trellis diagram centered around the latest candidate codeword and results in an improvement over the previous candidate codewords that have been already tested. This improvement is then used as the next candidate codeword for a test of optimality. The decoding iteration stops whenever a candidate codeword is found to satisfy a sufficient condition on optimality or the latest low-weight trellis search results in a repetition of a previously generated candidate codeword. A divide-and-conquer technique is also presented for codes that are not spanned by their minimum-weight codewords. The proposed decoding algorithm has been applied to some well-known codes of lengths 48, 64, and 128. Simulation results show that the proposed algorithm achieves either practically optimal error performance for the example codes of length 48 and 64 or near optimal error performance for the (128, 29, 32) RM code with a significant reduction in computational decoding complexity.