Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0703035

On the Distortion SNR Exponent of Some Layered Transmission Schemes

Kapil Bhattad·Krishna R. Narayanan·Giuseppe Caire
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the problem of joint source-channel coding for transmitting K samples of a complex Gaussian source over T = bK uses of a block-fading multiple input multiple output (MIMO) channel with M transmit and N receive antennas. We consider the case when we are allowed to code over L blocks. The channel gain is assumed to be constant over a block and channel gains for different blocks are assumed to be independent. The performance measure of interest is the rate of decay of the expected mean squared error with the signal-to-noise ratio (SNR), called the distortion SNR exponent. We first show that using a broadcast strategy of Gunduz and Erkip, but with a different power and rate allocation policy, the optimal distortion SNR exponent can be achieved for bandwidth efficiencies 0 < b < (|N-M|+1)/min(M,N). This is the first time the optimal exponent is characterized for 1/min(M,N) < b < (|N-M |+ 1)/ min(M, N). Also, for b > MNL^2, we show that the broadcast scheme achieves the optimal exponent of MNL. Special cases of this result have been derived for the L=1 case and for M=N=1 by Gunduz and Erkip. We then propose a digital layered transmission scheme that uses both time layering and superposition. This includes many previously known schemes as special cases. The proposed scheme is at least as good as the currently best known schemes for the entire range of bandwidth efficiencies, whereas at least for some M, N, and b, it is strictly better than the currently best known schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kapil Bhattad, Krishna R. Narayanan, Giuseppe Caire. 2007-04-20. On the Distortion SNR Exponent of Some Layered Transmission Schemes. https://doi.org/10.1109/tit.2008.924703

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

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗