Prototyping noise immune codes in communication systems with channels code division


DOI: 10.34759/trd-2021-119-11

Аuthors

Volkov A. S.1*, Solodkov A. V.1**, Suslova K. O.2***, Strelnikov A. P.2****

1. National Research University of Electronic Technology, Bld. 1, Shokin Square, Zelenograd, Moscow, Russia, 124498
2. National Research University of Electronic Technology "MIET", 1, Shokin Square, Zelenograd, Moscow, 124498, Russia

*e-mail: leshvol@mail.ru
**e-mail: solodkov_aw@mail.ru
***e-mail: ksenija.suslova@yandex.ru
****e-mail: antonstrela@mail.ru

Abstract

The article discusses a modified RS-code. The purpose of the work consists in developing a prototype of a shortened noise-immune RS-code using NI USRP-2974 for a CDMA-type system. The CDMA system is intended for information transmission in the air from a base station to a mobile one and vice versa. The subscribers operation in this system proceeds in the common frequency band and on one carrier while separation takes place by various code sequences application, which are being assigned individually for each channel. A shortened modified RS-code was selected for this partition.

The article presents both coding and decoding procedures of the modified shortened RS-code with both errors and erasure correction for the CDMA-type systems. The Euclidean algorithm was being employed for cutting computing time of the key equation. This algorithm automatically obtains a polynomial of error locators in parallel with the key equation solving. This algorithm was being executed with the predetermined initial conditions, and operational procedure was being changed depending on characteristic features of each iteration. The errors position search was performed by the Chen procedure, and their value by the Forney’s algorithm.

The article demonstrated that the shortened modified RS-code corrected errors and erasures being the part of signal-code structures in the communication systems with code division multiplexing under development. The codes are of maximal possible minimal distance for linear codes with similar length of both input and output blocks. The may be employed as well for the concatenated code creation with greater minimal distance. Prototyping of the shortened modified RS-code was performed using the NI USRP-2974 high performance stand-alone device with software defined radio communication (SDR) USRP for system design and deployment of next generation wireless radio communication systems. The discrepancy range of the bit error occurrence probability was found applying the RS-code. Graphs proving effectiveness of the error correcting method of the truncated RS-code by employing the binary channel with erasures were obtained

.

Keywords:

noise immunity, shortened code, noise-immunity code decoding, Euclid's algorithm, Chen's algorithm, error and erasure correction, block code, Reed-Solomon code prototyping

References

  1. Piterson U., Ueldon E. Kody, ispravlyayushchie oshibki (Error-correcting codes), Moscow, Mir, 1976, 596 p.

  2. Mak-Vil’yams F. Dzh., Sloen N. Dzh. A. Teoriya kodov, ispravlyayushchikh oshibki (Theory of error-correcting codes), Moscow, Svyaz’, 1979, 744 p.
  3. Lidl R., Niderraiter G. Konechnye polya (Finite fields), Moscow, Mir, 1988, 430 p.
  4. Kuznetsov V.S., Volkov A.S., Solodkov A.V., Soroka V.G. Trudy MAI, 2020, no. 111. URL: http://trudymai.ru/eng/published.php?ID=115131. DOI: 10.34759/trd-2020-111-9
  5. Kuznetsov V.S., Misyuto M.V., Volkov A.S., Chigrinets V.A., Vinogradov K.E., Solodkov A.V. Modelirovanie i prototipirovanie sistem svyazi s shumopodobnymi signalami (Modeling and prototyping of communication systems with noise-like signals: Textbook), Moscow, MIET, 2020, 204 p.
  6. Mak-Vil’yams F. Dzh, Sloen N. Dzh. A. Trudy Instituta inzhenerov po elekrotekhnike i radioelektronike, 1976, vol. 64, no. 12, pp. 80 — 95.
  7. Sagalovich Yu.L. Vvedenie v algebraicheskie kody (Introduction to algebraic codes), Moscow, MFTI, 2007, 280 p.
  8. Verner M. Osnovy kodirovaniya (Fundamentals of coding), Moscow, Tekhnosfera, 2004, 288 p.
  9. Khasse G. Lektsii po teorii chisel (Lectures on theory of numbers), Moscow, Izd-vo inostrannoi literatury, 1953, 527 p.
  10. Bleikhut R. Teoriya i praktika kodov, kontroliruyushchikh oshibki (Theory and practice of error controlling codes), Moscow, Mir, 1986, 576 p.
  11. Borodin V.V., Petrakov A.M., Shevtsov V.A. Elektrosvyaz’, 2016, no. 11, pp. 41 — 45.
  12. Egorov S.I. Korrektsiya oshibok v informatsionnykh kanalakh periferiinykh ustroistv EVM (Correction of errors in information channels of computer peripheral devices), Kursk, Kurskii gosudarstvennyi tekhnicheskii universitet, 2008, 252 p.
  13. Klark Dzh., Kein Dzh. Kodirovanie s ispravleniem oshibok v sistemakh tsifrovoi svyazi (Coding with error correction in digital communication systems), Moscow, Radio i svyaz’, 1987, 392 p.
  14. Abramov S.A. Kvant, 1985, no. 11, pp. 44 — 46.
  15. Borodin V.V., Petrakov A.M., Shevtsov V.A. Trudy MAI, 2015, no. 81. URL: http://trudymai.ru/eng/published.php?ID=57894
  16. Zolotarev V.V. Kody i kodirovanie (Codes and coding), Moscow, Znanie, 1990, 64 p.
  17. Morelos-Saragosa R. Iskusstvo pomekhoustoichivogo kodirovaniya. Metody, algoritmy, primenenie (The art of noise—immune coding. Methods, algorithms, application), Moscow, Tekhnosfera, 2006, 320 p.
  18. Shevtsov V.A., Borodin V.V., Krylov M.A. Trudy MAI, 2016, no. 85. URL: http://trudymai.ru/eng/published.php?ID=66417
  19. Tsymbal V.P. Zadachnik po teorii informatsii i kodirovaniyu (Problem book on information theory and coding), Moscow, Gostekhizdat, 2014, 751 p.
  20. Romashchenko A.E. Zametki po teorii kodirovaniya (Notes on coding theory), Moscow, MTsNMO, 2017, 281 p.
  21. Blokh E.L., Zyablov V.V. Obobshchennye kaskadnye kody (Generalized concatenated codes), Moscow, Svyaz’, 1976, 237 p.
  22. Serdyukov P.N., Dronov A.E., Kryukov D.A. Kodirovanie i dekodirovanie kodov Rida—Solomona (Encoding and decoding of Reed—Solomon codes), Moscow, GU NPO «Spetsial’naya tekhnika i svyaz» MVD Rossii, 2001, pp. 27 — 30.

  23. Download

mai.ru — informational site MAI

Copyright © 2000-2024 by MAI

Вход