Search arXivSearch

arXiv · 2608.05184

Media Meets Communication in 6G: Fundamentals, Key Technologies, and Applications

Abstract

The rapid advancement of sixth-generation (6G) networks is accelerating the convergence of media intelligence and communication intelligence, driving media communication beyond conventional bit-level delivery toward intelligent, semantic-aware, and generative paradigms. Emerging media services require not only high data rates and low latency, but also semantic awareness, perceptual quality assurance, adaptive resource orchestration, trustworthy content processing, and personalized media generation. Meanwhile, media technologies are evolving from handcrafted signal processing and conventional coding toward artificial intelligence (AI)-driven representation learning, content understanding, and generative reconstruction. Motivated by these trends, this paper presents a systematic survey of media communication technologies for 6G vision communication by revisiting the evolution of communication and media technologies and clarifying the intrinsic relationship between media content processing and wireless transmission. We introduce a unified framework consisting of four key dimensions: AI-driven media technologies, media-aware wireless transmission, large model-enabled media communication, and intelligent network infrastructures. Specifically, AI-driven media technologies encompass media coding, content understanding, quality assessment, security and compliance detection, and AIGC-enabled media generation, while media-aware wireless transmission is examined from three complementary perspectives: semantic joint source-channel optimization, which jointly encodes task-relevant semantic information; source-aware transmission optimization, which leverages media characteristics for channel adaptation, prediction, and compensation; and channel-aware source optimization, which adapts media coding and reconstruction based on real-time channel conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bingyan Xie, Longyu Zhou, Zihan Chen, Shunpu Tang, Mingyang Shi, Yu Tian, Guo Lu, Yongpeng Wu, Tianhao Liang, Tony Q. S. Quek, Guangtao Zhai, Wenjun Zhang. 2026-07-25. Media Meets Communication in 6G: Fundamentals, Key Technologies, and Applications. https://arxiv.org/abs/2608.05184

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT