350 rub
Journal Radioengineering №7 for 2014 г.
Article in number:
Simulation algorithms coprocessing polar codes in a product code
Authors:
A.A. Gladkih - Ph.D. (Eng.), associate professor, professor, Dept. of Telecommunications, Ulyanovsk State Technical University. E-mail: a_gladkih@mail.ru, a.gladkih@ulstu.ru
N.Yu. Chilikhin - Post-graduate student, Dept. of Telecommunications, Ulyanovsk State Technical University. E-mail: n.chilikhin@gmail.com
Abstract:
One of the new proposals in this area are polar codes (PC), which can in channels with Gaussian noise to achieve bandwidth binary symmetric channel (BSC) with no memory. This puts the theory and practice of error-correcting coding series of new problems related to the joint use of PC based on the known schemes of building codec solution which allows you to get additional energy gain in the communication system. Technology of PC based on the total exclusion from the analysis of the received sequence of the channels in which the transmission bit is not reliable enough. Capacity of such channels is considered to be zero (channel is considered «frozen»), and data recovery is performed by data obtained from reliable channels. Thus in the transmitted sequence of symbols, the cross-links are created, allowing to recover the sequence is not on algebraic relationships, as is customary in theory error-correcting coding and for cumulative conditional probabilities defined structure PC. By sharing your PC error-correcting coding schemes and achieved energy efficiency of the communication system. It has been shown that the structure of the PC is not without major drawback of the algorithm: the result of each step of decoding is completely dependent on the reliability of estimates of the information bits from the previous steps. Positive role in overcoming this dependence play soft processing techniques.
Pages: 111-115
References

  1. Arikan E. Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels // IEEE Transactions on Information Theory. 2009. № 7(55). P. 3051-3073.
  2. Semenov P.K. Dekodirovanie obobshhenny'x kaskadny'x kodov s vnutrennimi polyarny'mi kodami // Informaczionno-upravlyayushhie sistemy'. 2012. Vy'p. № 5. S. 44-50.
  3. Gladkix A.A. Osnovy' teorii myagkogo dekodirovaniya izby'tochny'x kodov v stirayushhem kanale svyazi. Ul'yanovsk: UlGTU. 2010.
  4. Verner M. Osnovy' kodirovaniya. Texnosfera. 2004.
  5. Arıkan E. and Telatar E. On the rate of channel polarization // in Proc. IEEE Int-l Symp. Inform. Theory (ISIT-2009). Seoul, South Korea. 2009. P. 1493-1495.
  6. Gladkix A.A., Klimov R.V. Chislennoe modelirovanie obobshhennoj proczedury' formirovaniya indeksov myagkix reshenij // IKT. 2013. T. 12. № 2. S. 22-28.
  7. Gladkix A.A., Chilixin N.Ju. Formirovanie myagkix reshenij v sisteme shirokopolosnogo kanala svyazi s QPSK-QAM // Avtomatizacziya proczessov upravleniya. 2013. № 3 (33).
  8. Eslami A., Pishro-Nik. A practical approach to polar codes // IEEE International Symposium on Information Theory Proceedings. 2011.
  9. Korada S. Polar Codes for Channel and Source Coding. PhD thesis, Ecole Polytechnique Fdrale de Lausanne (EPFL). 2009.
  10. Morelos-Saragosa R. Iskusstvo pomexoustojchivogo kodirovaniya. Metody', algoritmy', primenenie. M.: Texnosfera. 2005.