𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Soft-decision decoding of Reed–Solomon codes

✍ Scribed by Hideaki Nara; Hatsukazu Tanaka

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
202 KB
Volume
83
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

✦ Synopsis

This paper proposes a new soft-decision decoding procedure for the ReedSolomon code. As the first step, the reliability function for the decoded estimation symbol is defined. To determine the estimated symbol and the reliability efficiently, an open trellis diagram is proposed from which the candidates for the estimated symbol, as well as the respective likelihoods, can be determined. Then, a new decoding procedure is proposed, by which the decoding error rate can be reduced by effectively utilizing the reliability. Lastly, the performance of the defined reliability function is evaluated by a computer simulation, and the effectiveness of the reliability function is verified. The proposed decoding method and the traditional decoding methods are compared, and the effectiveness of the proposed decoding method is verified.

📜 SIMILAR VOLUMES

Soft decision decoding using the hierarc
Soft decision decoding using the hierarchy of linear block codes
✍ Tadahiro Sato; Hatsukazu Tanaka 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 2 views

Soft decision decoding is a decoding method which can cut the decoding error probability as compared with hard decision decoding by utilizing the channel measurement information effectively. In this paper, a new soft decision decoding method by which decoding operations can be efficiently carried ou

On Multisequence Shift Register Synthesi
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes
✍ N. Kamiya 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

In this paper. it is shown that the problem of generalized-minimum-distance (GMD) decoding of Reed-Solomon (RS) codes can be reduced to the problem of multisequence shift register synthesis, and a simple algorithm is presented that yields a solution for this problem by finding, for \(k=1,2, \ldots\)