Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0802.3851

Joint Source Channel Coding with Side Information Using Hybrid Digital Analog Codes

Makesh Pravin Wilson·Krishna Narayanan·Giuseppe Caire
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information known only to the receiver. We introduce hybrid digital analog forms of the Costa and Wyner-Ziv coding schemes. Our schemes are based on random coding arguments and are different from the nested lattice schemes by Kochman and Zamir that use dithered quantization. We also discuss superimposed digital and analog schemes for the above problems which show that there are infinitely many schemes for achieving the optimal distortion for these problems. This provides an extension of the schemes by Bross et al to the interference/side information case. We then discuss applications of the hybrid digital analog schemes for transmitting under a channel signal-to-noise ratio mismatch and for broadcasting a Gaussian source with bandwidth compression.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Makesh Pravin Wilson, Krishna Narayanan, Giuseppe Caire. 2008-02-26. Joint Source Channel Coding with Side Information Using Hybrid Digital Analog Codes. https://arxiv.org/abs/0802.3851

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

KEEP EXPLORING

Related papers

arXiv2026

DRL-AdaPart: DRL-Driven Adaptive STAR-RIS Partitioning for Fair and Efficient Resource Utilization

Efficient resource utilization is proposed for simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) to ensure fair and high data rates. We optimize the number of STAR-RIS elements to be allocated to each user and maximize the sum of the user rates. To promote fairness, we introduce a soft fairness mechanism that guarantees a minimum STAR-RIS element allocation to every user. Subject to this requirement, the phase shifts of the STAR-RIS elements and the remaining element assignments are jointly optimized by harnessing an appropriately tailored deep reinforcement learning (DRL) algorithm. The proposed DRL method is also compared to Dinkelbach's algorithm and to a bespoke hybrid DRL approach. A deactivation incentive is incorporated into the DRL model for enhancing resource utilization by intelligently deactivating some of the STAR-RIS elements when not required. The proposed DRL method achieves fair and high data rates for both stationary and mobile users, while ensuring efficient resource utilization. Using the proposed DRL method, up to 34% and 23% of STAR-RIS elements can be deactivated in static and mobile scenarios, respectively, with negligible degradation in the average DL data rate.

cs.IT↗
arXiv2026

MAGRPO: Accelerated MARL Training for Fluid Antenna-Assisted Wireless Network Optimization

Fluid antenna systems (FASs) improve wireless links by repositioning antenna elements to exploit favorable spatial channel variations. Jointly optimizing fluid antenna (FA) positions, beamforming, and transmit power in a multi-cell network is challenging because the problem is non-convex and each base station has only local information during decentralized execution. However, the representative multi-agent reinforcement learning (MARL) algorithms, namely the on-policy multi-agent proximal policy optimization (MAPPO) and the off-policy multi-agent twin delayed deep deterministic policy gradient (MATD3), suffer from excessively long training times. To address this challenge, we formulate the problem as a decentralized partially observable Markov decision process (Dec-POMDP) and propose multi-agent group relative policy optimization (MAGRPO) under centralized training with decentralized execution. MAGRPO constructs relative advantages from groups of joint trajectories, thereby eliminating the centralized critic and generalized advantage estimation used by MAPPO; under parameter sharing, this critic-free design reduces the per-step computational complexity by approximately half. Simulations show that joint FA optimization provides several-fold sum-rate gains over fixed-position configurations. Across the evaluated antenna settings, MAGRPO achieves test sum rates higher than those of MATD3 and comparable to or slightly higher than those of MAPPO. Meanwhile, it reduces the training time by 20%-23% compared with MAPPO and by about 35% compared with MATD3.

cs.IT↗
arXiv2026

Exact exponents for smoothing the max-relative entropy and quantum information decoupling in von Neumann algebras

We establish the exact exponent for smoothing the max-relative entropy on arbitrary von Neumann algebras. The proof first develops the required large-deviation and smoothing estimates in the semifinite setting and then passes to general von Neumann algebras through Haagerup-Junge-Xu reduction. We next study catalytic quantum information decoupling when the reference system is described by an arbitrary von Neumann algebra. A key ingredient is an operator layer-cake formula valid on arbitrary von Neumann algebras. This formula leads to a convex-split estimate for normal states with a general von Neumann algebraic reference system. Combining this estimate with the smoothing exponent result, we obtain lower and upper bounds on the catalytic-decoupling reliability function. These bounds coincide below the corresponding critical rate, yielding the exact decoupling reliability function in that regime.

cs.IT↗