Papers
Topics
Authors
Recent
2000 character limit reached

Deep Joint Source-Channel Coding Over Cooperative Relay Networks

Published 12 Nov 2022 in cs.IT, eess.SP, and math.IT | (2211.06705v2)

Abstract: This paper presents a novel deep joint source-channel coding (DeepJSCC) scheme for image transmission over a half-duplex cooperative relay channel. Specifically, we apply DeepJSCC to two basic modes of cooperative communications, namely amplify-and-forward (AF) and decode-and-forward (DF). In DeepJSCC-AF, the relay simply amplifies and forwards its received signal. In DeepJSCC-DF, on the other hand, the relay first reconstructs the transmitted image and then re-encodes it before forwarding. Considering the excessive computation overhead of DeepJSCC-DF for recovering the image at the relay, we propose an alternative scheme, called DeepJSCC-PF, in which the relay processes and forwards its received signal without necessarily recovering the image. Simulation results show that the proposed DeepJSCC-AF, DF, and PF schemes are superior to the digital baselines with BPG compression with polar codes and provides a graceful performance degradation with deteriorating channel quality. Further investigation shows that the PSNR gain of DeepJSCC-DF/PF over DeepJSCC-AF improves as the channel condition between the source and relay improves. Moreover, DeepJSCC-PF scheme achieves a similar performance to DeepJSCC-DF with lower computational complexity.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (17)
  1. A. Host-Madsen and J. Zhang, “Capacity bounds and power allocation for wireless relay channels,” IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 2020–2040, 2005.
  2. “Cooperative strategies and capacity theorems for relay networks,” IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3037–3063, 2005.
  3. “Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel,” IEEE Trans. Signal Process., vol. 57, no. 11, pp. 4467–4481, 2009.
  4. I. E. Aguerri and D. Gündüz, “Capacity of a class of state-dependent orthogonal relay channels,” IEEE Trans. on Info. Theory, vol. 62, no. 3, pp. 1280–1295, 2016.
  5. Y.-H. Kim, “Capacity of a class of deterministic relay channels,” IEEE Trans. on Info. Theory, vol. 54, no. 3, pp. 1328–1329, 2008.
  6. “Reliable joint source-channel cooperative transmission over relay networks,” IEEE Trans. on Info. Theory, vol. 59, no. 4, pp. 2442–2458, 2013.
  7. “Cooperative source and channel coding for wireless multimedia communications,” IEEE Journal of Selected Topics in Signal Processing, pp. 295–307, 2007.
  8. “Deep learning based near-orthogonal superposition code for short message transmission,” in ICC 2022.
  9. “Learning to detect,” IEEE Transactions on Signal Processing, vol. 67, no. 10, pp. 2554–2564, 2019.
  10. “Deep joint source-channel coding for wireless image transmission,” IEEE Transactions on Cognitive Communications and Networking, 2019.
  11. “Deep learning for joint source-channel coding of text,” in ICASSP. IEEE, 2018, pp. 2326–2330.
  12. “Wireless deep video semantic transmission,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 1, pp. 214–229, 2023.
  13. “Wireless point cloud transmission,” arXiv preprint arXiv:2306.08730, 2023.
  14. “OFDM-guided deep joint source channel coding for wireless multipath fading channels,” IEEE Trans. Cogn. Commun. Netw., vol. 8, no. 2, pp. 584–599, 2022.
  15. “Space-time design for deep joint source channel coding of images over MIMO channels,” in SPAWC, 2023.
  16. “Semantic communication on multi-hop concatenated relay networks,” in 2023 IEEE/CIC International Conference on Communications in China (ICCC), 2023, pp. 1–6.
  17. “Wireless image transmission using deep source channel coding with attention modules,” IEEE Transactions on Circuits and Systems for Video Technology, 2021.
Citations (13)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.