350 rub
Journal Electromagnetic Waves and Electronic Systems №3 for 2023 г.
Article in number:
Procedure for generating and decoding codewords of a joint low-density source and channel code
Type of article: scientific article
DOI: https://doi.org/10.18127/j5604128-202303-04
UDC: 621.391.037.3
Authors:

E.I. Balunin1, A.P. Ratushin2, D.S. Khrapkov3, M.V. Vlasov4

1–4 Military University of Radio Electronics (Cherepovets, Russia)

Abstract:

Shannon’s theorems state that source coding and channel coding can be optimized separately, while maintaining the optimality of the entire system as the length of the codeword tends to infinity. However, for finite length codes, the redundancy left by the source code can be used by the channel decoder to correct errors introduced by the communication channel. In order to efficiently use the channel bandwidth and achieve high corrective capacity, modern communication systems are optimized through the use of distributed code structures (DCS).

Distributed code structures of digital signals in the article are understood as schemes that implement joint source and channel coding. The study of the holistic mutual arrangement of code symbols of heterogeneous codes and the presence of stable relationships between them makes DCS a promising direction for further development and implementation in modern communication systems.

The article presents an analytical model of the code word of a joint low-density source and channel code (D-LDPC), which makes it possible to further describe the procedures for forming the structure of the DCS based on protographs and to study these schemes. The conducted studies have shown that the source message can be reconstructed at the receiver by a joint maximum likelihood decoder, where the source decoder and the channel decoder work in parallel and exchange information. In order to achieve high information transfer rates for sources with high entropy, it is possible to compensate for the redundancy introduced by the channel encoder by the result of compression. It has been established that it is possible to compress and protect the original sequence from interference in one step using the combined D-LDPC matrix. It is noted that in D-LDPC the initial information sequence is not transmitted over the communication channel, but only check blocks are transmitted, due to which an increase in the throughput of the communication channel is achieved.

A graphical model of a joint decoder is presented in the form of a double bipartite Tanner graph. The correction capability of the scheme with a joint decoder and the scheme with separate channel and source decoding is compared. The resulting difference in performance of the circuits is explained by the cooperative operation of the D-LDPC decoders, where the redundancy of the source encoder gives additional information to the channel encoder to evaluate the correct source sequence.

The effectiveness of the described scheme makes DCS a promising direction for further development and implementation in modern communication systems, for example, in fifth generation mobile networks (5G). But all these developments are conceptually based on the D-LDPC system.

Pages: 28-37
For citation

Balunin E.I., Ratushin A.P., Khrapkov D.S., Vlasov M.V. Procedure for generating and decoding codewords of a joint low-density source and channel code. Electromagnetic waves and electronic systems. 2023. V. 28. № 3. P. 28−37. DOI: https://doi.org/10.18127/ j15604128-202303-04 (in Russian)

References
  1. Shannon C.E. A Mathematical Theory of Communication. Bell System Technical Journal. 1948. V. 27. № 3. P. 379–423.
  2. Ratushin A.P. A model of the distributed component code structure of digital signals of satellite communication systems, taking into account the patterns of multi-stage unification of heterogeneous code transformations. Science Intensive Technologies. 2023. V. 24. № 1. P. 31–47. DOI 10.18127/j19998465-202301-04. (in Russian)
  3. Zhulev A.E., Ratushin A.P., Dianov S.V. Combinatorial detection and identification of a continuous low-density correcting code taking into account the structural patterns of the encoded sequence. Achievements of modern radioelectronics. 2017. № 9. P. 14–19. (in Russian)
  4. Pu L., Wu Z., Bilgin A., Marcellin M.W., Vasic B. LDPC-based iterative joint source-channel decoding for JPEG2000. IEEE Transactions on Image Processing. 2007. V. 16. № 2. P. 577–581. DOI 10.1109/TIP.2006.888329.
  5. Zribi A., Pyndiah R., Zaibi S., Guilloud F., Bouallegue A. Low-Complexity Soft Decoding of Huffman Codes and Iterative Joint Source Channel Decoding. IEEE Transactions on Communications. 2012. V. 60. № 6. P. 1669–1679.
  6. Fresia M., Perez-Cruz F., Poor H.V. Optimized concatenated LDPC codes for joint source-channel coding. IEEE International Symposium on Information Theory. Korea (South). 2009. P. 2131–2135. DOI 10.1109/ISIT.2009.5205766.
  7. Fresia M., Peréz-Cruz F., Poor H.V., Verdú S. Joint Source and Channel Coding. IEEE Signal Processing Magazine. 2010. V. 27. № 6.
    P. 104–113. DOI 10.1109/MSP.2010.938080.
  8. Caire G., Shamai S., Verdu S. Almost-noiseless joint source-channel coding-decoding of sources with memory. ITG-Fachbericht. 2004. № 181. P. 295–303.
  9. Garcia-Frias J., Villasenor J.D. Combining hidden Markov source models and parallel concatenated codes. IEEE Communications Letters. 1997. V. 1. № 4. Р. 111–113. DOI 10.1109/4234.602600.
  10. Garcia-Frias J., Zhong W. LDPC codes for compression of multi-terminal sources with hidden Markov correlation. IEEE Communications Letters. 2003. V. 7. № 3. Р. 115–117. DOI 10.1109/LCOMM.2003.810001.
  11. Gallagher R. Information theory and reliable communication. Ed. by M.S. Pinsker and B.S. Tsybakov. M.: Sov. radio. 1974. 568 p. (in Russian)
  12. Caire G., Shamai S., Verdu S. Universal data compression with LDPC codes. Proc. 3rd Int. Symp. Turbo Codes and Related Topics. Brest. France. 2003. P. 55–58.
  13. Thorpe J. Low-density parity-check (LDPC) codes constructed from protographs. The Interplanetary Network Progress Report. 2003.
    V. 42–154. P. 1–7.
  14. He J., Wang L., Chen P. A joint source and channel coding scheme base on simple protograph structured codes. International Symposium on Communications and Information Technologies. 2012. Р. 65–69. DOI 10.1109/ISCIT.2012.6380983.
  15. Wang L., Wu H., Hong S. The sensitivity of joint source-channel coding based on double protograph LDPC codes to source statistics. 9th International Symposium on Medical Information and Communication Technology. Kamakura. Japan. 2015. Р. 213–217.
  16. Chen C., Wang L., Liu S. The Design of Protograph LDPC Codes as Source Codes in a JSCC System. IEEE Communications Letters. 2018. V. 22. № 4. P. 672–675. DOI 10.1109/LCOMM.2018.2804382.
Date of receipt: 11.04.2023
Approved after review: 05.05.2023
Accepted for publication: 26.05.2023