Preview

Proceedings of the Southwest State University

Advanced search

INCREASE IN EFFICIENCY OF DECODING OF CODES OF READ-SOLOMON ON THE GENERALIZED MINIMUM DISTANCE

https://doi.org/10.21869/2223-1560-2018-22-3-51-58

Abstract

In the modern systems of transfer and storage of information for correction of the arising mistakes noiseproof codes of Read-Solomon widely are used. With use of soft decisions apply decoding of these codes on the generalized minimum distance which advantage is simplicity of realization to correction of mistakes. In work the algorithm of decoding of codes of Read-Solomon on the generalized minimum distance which feature is use of the algebraic decoder correcting errors abroad a half of the minimum code distance with use of soft decisions is offered. The algebraic decoder realizes syndromic decoding and is based on application of analytical continuation of an algorithm of Berlekempa-Messi for 2τ iterations (τ-number of in addition corrected wrong symbols). He provides search of positions of tC+τ of wrong symbols in a code word (tC - number of the wrong symbols which are guaranteed corrected by a code) which locators would be the return to roots of a possible polynom of locators of errors of degree tC + τ. Search of positions of mistakes is carried out in ascending order of nadezhnost of symbols of the accepted code word. The efficiency of correction of mistakes was investigated by the offered algorithm in the channel with additive white Gaussian noise by imitating modeling on the COMPUTER. Researches were conducted for Read-Solomon's codes defined over the field of GF(28). The additional code prize provided with an algorithm at correction on iteration of three additional mistakes in relation to Read-Solomon (255,239,17) code reaches 0,26 dB. The additional code prize for Read-Solomon (255,127,129) code at correction on iteration of two additional mistakes has made about 0,1 dB. The additional code prize for Read-Solomon (255,41,215) code at correction on iteration of three additional mistakes has made about 0,17 dB.

About the Authors

S. I. Yegorov
Southwest State University
Russian Federation


D. B. Borzov
Southwest State University
Russian Federation


S. V. Degtyarev
Southwest State University
Russian Federation


V. A. Dreizin
Southwest State University
Russian Federation


I. B. Mikhailov
Southwest State University
Russian Federation


References

1. Кларк Д., Кейн Д. Кодирование с исправлением ошибок в системах цифровой связи: [пер. с англ.]. М.: Радио и связь, 1987. 392 с.

2. Guruswami V., Sudan M. Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes // IEEE Trans. Inform. Theory, Nov. 1999, vol. 45, no. 6, pp. 1757-1767.

3. Koetter R., Vardy A. Algebraic soft-decision decoding of Reed-Solomon codes // IEEE Trans. Inform. Theory, Nov. 2003, vol. 49, no. 6, pp. 2809-2825.

4. Forney G. J. Generalized minimum distance decoding // IEEE Trans. Inform. Theory, Feb. 1966, vol. 12, no. 2, pp. 125-131.

5. Графов О.Б., Егоров С.И. Мягкое декодирование популярных кодов Рида-Соломона // Труды РНТОРЭС им. А.С.Попова. Серия: Цифровая обработка сигналов и ее применение. Вып. XIV. М., 2012. С. 46-49.

6. Графов О.Б., Егоров С.И., Титов В.С. Мягкое декодирование кодов Рида-Соломона // Известия Юго-Западного государственного университета. Серия: Управление, вычислительная техника, информатика. Медицинское приборостроение. 2012. №2, ч.1. С.17-23.

7. Построение алгоритмов мягкого декодирования кодов Рида-Соломона на основе алгоритма списочного декодирования / С.И. Егоров, О.Б. Графов, Ж.Т. Жусубалиев, Э.И. Ватутин // Известия Юго-Западного государственного университета. Серия: Управление, вычислительная техника, информатика. Медицинское приборостроение. 2012. №2, ч. 2. С. 28-33.

8. Egorov S., Markarian G.: An Algorithm for t+1 Error Correction in Reed-Solomon Codes. In Proc. ICC’04: 2004 IEEE International Conference on Communications, Paris, France, vol.2, pp. 651-655.

9. Егоров С.И. Алгоритм декодирования кодов Рида-Соломона, исправляющий вплоть до n-k ошибок в кодовом слове // Труды РНТОРЭС им. А.С. Попова. Серия: Цифровая обработка сигналов и ее применение. Вып. XI-1. М., 2009. С. 27-30.

10. Егоров С.И. Алгоритм декодирования кодов Рида-Соломона, исправляющий дополнительные ошибки за пределами половины минимального кодового расстояния // Методы и алгоритмы прикладной математики в технике, медицине и экономике: матер. 9-ой Междунар. науч.-практ. конф. Новочеркасск: ЮРГТУ, 2009. С. 16-19.


Review

For citations:


Yegorov S.I., Borzov D.B., Degtyarev S.V., Dreizin V.A., Mikhailov I.B. INCREASE IN EFFICIENCY OF DECODING OF CODES OF READ-SOLOMON ON THE GENERALIZED MINIMUM DISTANCE. Proceedings of the Southwest State University. 2018;22(3):51-58. (In Russ.) https://doi.org/10.21869/2223-1560-2018-22-3-51-58

Views: 607


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2223-1560 (Print)
ISSN 2686-6757 (Online)