Distributed Joint Source-Channel Coding for Correlated Sources Using Non-systematic Repeat-Accumulate Based Codes
- 525 Downloads
In this paper, we propose a technique for coding the data from multiple correlated binary sources, with the aim of providing an alternative solution to the correlated source compression problem. Using non-systematic repeat-accumulate based codes, it is possible to achieve compression which is close to the Slepian–Wolf bound without relying on massive puncturing. With the technique proposed in this paper, instead of puncturing, compression is achieved by increasing check node degrees. Hence, the code rate can be more flexibly adjusted with the proposed technique in comparison with the puncturing-based schemes. Furthermore, the technique is applied to distributed joint source-channel coding (DJSCC). It is shown that in many cases tested, the proposed scheme can achieve mutual information very close to one with the lower signal-to-noise power ratio than turbo and low density generator matrix based DJSCC in additive white Gaussian noise channel. The convergence property of the system is also evaluated via the extrinsic information transfer analysis.
KeywordsConcatenated codes Cooperative coding Iterative decoding EXIT chart
This research was carried out in the framework of the project Distributed Decision Making for Future Wireless Communication Systems (DIDES) which is funded by Finnish Funding Agency for Technology and Innovation (TEKES). This work has been also in part supported by the Japanese government funding program, Grant-in-Aid for Scientific Research (B), No. 23360170. This work has been also supported by Academy of Finland, Riitta ja Jorma J. Takanen Foundation and Finnish Foundation for Technology Promotion.
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
- 2.Shannon, C. E. (1959). Coding theorems for a discrete source with a fidelity criterion. IRE national convention record (pp. 142–163).Google Scholar
- 5.Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error correcting coding and decoding: Turbo codes. Proceedings of IEEE international conference on communications, Geneva, Switzerland (Vol. 2, pp. 1064–1070).Google Scholar
- 8.Garcia-Frias, J., Zhong, W., & Zhao, Y. (2002). Iterative decoding schemes for source and joint source-channel coding of correlated sources. Proceedings of annual Asilomar conference on signals, systems and computers, Newark, DE, USA (pp. 250–256).Google Scholar
- 13.Rup, S., Dash, R., Ray, N. K., & Majhi, B. (2009). Recent advances in distributed video coding. Proceedings of IEEE international conference on computer science and information theory, Beijing, China (pp. 130–135).Google Scholar
- 15.Divsalar, D., Jin, H., & McEliece, R. J. (1998). Coding theorems for ‘turbo-like’ codes. Proceedings of 36th Allerton conference on communication, control and computing, Allerton, IL, USA (pp. 201–210).Google Scholar
- 16.Gallager R. (1963) Low-density parity-check codes. MIT Press, Cambridge, MAGoogle Scholar
- 17.Jin, H., & McEliece, R. J. (1999). RA codes achieve AWGN channel capacity. Applied algebra, algebraic algorithms and error-correcting codes, Pasadena, CA, USA. January 1, 1999 (Vol. 1719/1999, p. 729).Google Scholar
- 19.ten Brink, S. (2001). Code doping for triggering iterative decoding convergence. Proceedings of IEEE international symposium on information theory, Washington, D.C., USA.Google Scholar
- 22.Yano, T., & Matsumoto, T. (2009). Arithmetic extended-mapping for BICM-ID with repetition codes. Proceedings of ITG workshop smart antennas, Berlin, Germany (pp. 1–8).Google Scholar
- 23.Ashikhmin, A., Kramer, G., & ten Brink, S. (2002). Code rate and the area under extrinsic information transfer curves. Proceedings of IEEE international symposium on information theory, Lausanne, Switzerland (p. 115).Google Scholar
- 24.Peyton, Z., & Peebles, J. (2001). Probability, random variables, and random signal principles. 1221 Avenue of the Americas, New York, NY, 10020: Irwin/McGraw-Hill.Google Scholar
- 25.Brännström, F., Rasmussen, L. K., & Grant, A. J. (2005). Convergence analysis and optimal scheduling for multiple concatenated codes. IEEE Transactions on Information Theory, 51(9), 3354–3364. Proceedings of 2nd international conference on turbo codes, Brest, France (pp. 1–8).Google Scholar