Полные и укороченные помехоустойчивые низкоплотностные коды на основе конечных геометрий и алгоритмы их итеративного приема

Abstract

The theme of this paper is investigation of the characteristics of error-correcting low-density parity-check codes (LDPC) which enable communication at relatively low received signal/noise and provide very high power efficiency. Specific feature of investigated codes is construction of these by means of full LDPC code word and information volume shortening. According to this the broad class of LDPC codes is constructed with variety of code-rates and information volumes. The full (original) LDPC codes are based on the finite geometries (finite Eucledean and projective geometries). The decoding algorithms for that are symbol-by-symbol decoding developed for common class LDPC codes, namely, BP (belief propagation) and BP modification (mBP) decoding algorithms. The BP and mBP decoding algorithms are iterative and for implementation the signal/noise is not required. The resulted characteristics of full and shortened low-density parity-check codes (namely, duration of code words, information volume, code rate, error performances) are presented. The original LDPC codes are cyclic and have encoding and decoding algorithms with low complexity implementation. The computer simulations for encoding and iterative decoding algorithms for the number of turbo-codes with different code rate and information volumes are performed. The results of computer simulations have shown that mBP decoding algorithm is more effective than BP decoding algorithm (difference between signal/noise is more 0.2 dB). The results of encoding and decoding algorithm realization using FPGA VIRTEX-5SX are presented, in particularly, the information rate 200 Mb/s is achieved for generator clock 180 MHz and for 10 iterations.

• помехоустойчивые коды
• конечные геометрии
• алгоритмы приема
• плис
• низкоплотностные коды
• noise-immunity
• low-density parity-check codes
• iterative decoding

For citation

References

1. Питерсон У., Уэлдон Э. Коды, исправляющие ошибки. Перев. с англ. М.: Мир. 1976. 594 c.
2. Johnson S.J. Iterative Error Correction: Turbo, Low-density Parity-Check and Repeat-Accumulate Codes. Cambrige University Press. 2010. 356 p.
3. Gallager R.G. Low-density parity-check codes. // IRE Transactions Information Theory. 1968. V.8. P.21-28.
4. MacKay D.J.C., Neal R.M. Near Shannon limit performance of low density parity check codes. // Electronics Letters. 1997. V. 33. P.457-458.
5. Richardson T.J., Shokrollahi M.A., Urbanke R.L. Design of capacity-approaching irregular low-density parity-check codes. // IEEE Transactions on Information Theory. 2001. V. 47. N2. P.619-637.
6. Назаров Л.Е., Головкин И.В. Итеративный посимвольный прием ансамблей сигналов на основе низкоплотностных кодов. // Известия Вузов. Электроника. 2007. №3. Стр.43-49.
7. Блейхут Теория и практика кодов, контролирующих ошибки. Перевод с англ. М.: Мир. 1986. 576 с.
8. Kou Y., Lin S., Fossorier M. Low-density parity-check codes based on finite geometries: a rediscovery and new results. // IEEE Transactions on Information Theory. 2001. V.IT-47. №11. P.2711-2736.
9. Liu Z., Pados D.A. A Decoding Algorithm for Finite-Geometry LDPC Codes. // IEEE Transactions on Communications. 2005. V.53. N3. P.415-421.
10. Назаров Л.Е., Щеглов М.А. Вероятностные характеристики итеративного приема дискретных сигналов на основе помехоустойчивых блоковых низкоплотностных кодов. // Журнал радиоэлектроники. URL:http://jre.cplire.ru/jre/apr15/5/text.pdf. 2015. №4.
11. Назаров Л.Е., Щеглов М.А. Характеристики полных и укороченных помехоустойчивых низкоплотностных кодов на основе конечных геометрий. // Успехи современной радиоэлектроники. 2017. №6. Стр. 23-30.
12. Li Z., Chen L., Lin S., Fong W.H. Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes. // IEEE Transactions on Communications. 2006. V.54. N1. P.71-81.
13. Назаров Л.Е., Шишкин П.В. Характеристики помехоустойчивых блоковых турбо-кодов на основе низкоплотностных кодов. // Информационные технологии. 2018. Т. 24. №6. Стр. 427-431.
14. Research and Development for Space Data System Standards. Low density parity check codes for use in near-earth and deep space applications. 2007. Experimental specification CCSDS 131.1-O-2. 44 p.