Rateless Joint Source-Channel Coding, and a Blueprint for 6G Semantic Communications System Design

• URL: http://arxiv.org/abs/2502.06095v1
• Date: Mon, 10 Feb 2025 01:49:16 GMT
• Title: Rateless Joint Source-Channel Coding, and a Blueprint for 6G Semantic Communications System Design
• Authors: Saeed R. Khosravirad,
• Abstract summary: This paper introduces rateless joint source-channel coding (rateless J SCC) We also introduce rate-adaptive and stable communication link operation to accommodate rateless J SCCs. In the second part of the paper, we dive into the practical concerns around semantic communication and provide a blueprint for semantic networking system design.
• Score: 4.2240468630800985
• License:
• Abstract: This paper introduces rateless joint source-channel coding (rateless JSCC). The code is rateless in that it is designed and optimized for a continuum of coding rates such that it achieves a desired distortion for any rate in that continuum. We further introduce rate-adaptive and stable communication link operation to accommodate rateless JSCCs. The link operation resembles a ``bit pipe'' that is identified by its rate in bits per frame, and, by the rate of bits that are flipped in each frame. Thus, the link operation is rate-adaptive such that it punctures the rateless JSCC codeword to adapt its length (and coding rate) to the underlying channel capacity, and is stable in maintaining the bit flipping ratio across time frames. Next, a new family of autoencoder rateless JSCC codes are introduced. The code family is dubbed RLACS code (read as relax code, standing for ratelss and lossy autoencoder channel and source code). The code is tested for reconstruction loss of image signals and demonstrates powerful performance that is resilient to variation of channel quality. RLACS code is readily applicable to the case of semantic distortion suited to variety of semantic and effectiveness communications use cases. In the second part of the paper, we dive into the practical concerns around semantic communication and provide a blueprint for semantic networking system design relying on updating the existing network systems with some essential modifications. We further outline a comprehensive list of open research problems and development challenges towards a practical 6G communications system design that enables semantic networking.

Related papers

• Joint Source-Channel Coding: Fundamentals and Recent Progress in Practical Designs [6.059175509501795]
  Joint source-channel coding (JSCC) offers an alternative end-to-end approach by optimizing compression and channel coding together. This article provides an overview of the information theoretic foundations of J SCC, surveys practical J SCC designs over the decades, and discusses the reasons for their limited adoption in practical systems.
  arXiv  Detail & Related papers  (2024-09-26T06:10:29Z)
• Multi-level Reliability Interface for Semantic Communications over Wireless Networks [5.9056146376982]
  Joint source-channel coding (JSCC) maps source messages directly into channel input symbols. We propose designing the source and channel mappings separately and sequentially via a novel multi-level reliability interface. This work represents an important step towards realizing semantic communications in wireless networks.
  arXiv  Detail & Related papers  (2024-07-07T20:15:10Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• Deep Joint Source-Channel Coding for Efficient and Reliable Cross-Technology Communication [7.133814048121873]
  Cross-technology communication (CTC) is a promising technique that enables direct communications among incompatible wireless technologies. This paper proposes a deep joint source-channel coding scheme to enable efficient and reliable CTC.
  arXiv  Detail & Related papers  (2024-01-26T04:55:37Z)
• Friendly Attacks to Improve Channel Coding Reliability [0.33993877661368754]
  "Friendly attack" aims at enhancing the performance of error correction channel codes. Inspired by the concept of adversarial attacks, our method leverages the idea of introducing slight perturbations to the neural network input. We demonstrate that the proposed friendly attack method can improve the reliability across different channels, modulations, codes, and decoders.
  arXiv  Detail & Related papers  (2024-01-25T13:46:21Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Joint Source-Channel Coding with Iterative Source Error Correction [11.41076729592696]
  We propose an iterative source error correction (ISEC) decoding scheme for deep-learning-based joint source-channel code (Deep J SCC) Given a noisyword received through the channel, we use a Deep J SCC encoder and decoder pair to update the code iteratively. The proposed scheme produces more reliable source reconstruction results compared to the baseline when the channel noise characteristics do not match the ones used during training.
  arXiv  Detail & Related papers  (2023-02-17T22:50:58Z)
• Is Semantic Communications Secure? A Tale of Multi-Domain Adversarial Attacks [70.51799606279883]
  We introduce test-time adversarial attacks on deep neural networks (DNNs) for semantic communications. We show that it is possible to change the semantics of the transferred information even when the reconstruction loss remains low.
  arXiv  Detail & Related papers  (2022-12-20T17:13:22Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Adversarial Neural Networks for Error Correcting Codes [76.70040964453638]
  We introduce a general framework to boost the performance and applicability of machine learning (ML) models. We propose to combine ML decoders with a competing discriminator network that tries to distinguish between codewords and noisy words. Our framework is game-theoretic, motivated by generative adversarial networks (GANs)
  arXiv  Detail & Related papers  (2021-12-21T19:14:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.