On the Nonasymptotic Bounds of Joint Source-Channel Coding with Hierarchical Sources
Shuo Shao, Chao Qi, and Jincheng Dai

TL;DR
This paper investigates the finite blocklength performance limits of joint source-channel coding systems with hierarchical sources, focusing on bounds for excess distortion probability in a complex reconstruction scenario.
Contribution
It provides new nonasymptotic bounds for hierarchical source coding in joint source-channel systems, addressing both achievable and converse limits.
Findings
Derived nonasymptotic bounds for excess distortion probability
Analyzed the impact of hierarchical source structure on coding performance
Established bounds applicable to finite blocklength regimes
Abstract
In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on the achievable and converse bounds of the excess distortion probability in the finite blocklength regime. The main challenge arises from the hierarchical source structure, which requires simultaneous reconstruction of both sources. This setup demands a coding scheme which satisfy the demand of encoding both source for the achievability bound, and a method to characterize the joint excess-distortion probability of two correlated events for the converse bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Advanced Data Compression Techniques
