اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSource-Channel Coding under Energy, Delay and Buffer Constraints
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Source-channel coding for an energy limited wireless sensor node is investigated. The sensor node observes independent Gaussian source samples with variances changing over time slots and transmits to a destination over a flat fading channel. The fading is constant during each time slot. The compressed samples are stored in a finite size data buffer and need to be delivered in at most $d$ time slots. The objective is to design optimal transmission policies, namely, optimal power and distortion allocation, over the time slots such that the average distortion at destination is minimized. In particular, optimal transmission policies with various energy constraints are studied. First, a battery operated system in which sensor node has a finite amount of energy at the beginning of transmission is investigated. Then, the impact of energy harvesting, energy cost of processing and sampling are considered. For each energy constraint, a convex optimization problem is formulated, and the properties of optimal transmission policies are identified. For the strict delay case, $d=1$, $2D$ waterfilling interpretation is provided. Numerical results are presented to illustrate the structure of the optimal transmission policy, to analyze the effect of delay constraints, data buffer size, energy harvesting, processing and sampling costs.
قيم البحث
اقرأ أيضاً
This paper simplifies an existing coding scheme for the two-receiver discrete memoryless broadcast channel with complementary receiver side information where there is a passive eavesdropper and individual secrecy is required. The existing coding sche
me is simplified in two steps by replacing Wyner secrecy coding with Carleial-Hellman secrecy coding. The resulting simplified scheme is free from redundant message splits and random components. Not least, the simplified scheme retains the existing achievable individual secrecy rate region. Finally, its construction simplicity helps us gain additional insight on the integration of secrecy techniques into error-correcting coding schemes.
The distributed remote source coding (so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower bound for
the sum-rate-distortion function under arbitrary distortion measures. When specialized to the case of mean-squared error, it is shown that the bound exactly mirrors a corresponding upper bound, except that the upper bound has the source power (variance) whereas the lower bound has the source entropy power. Bounds exhibiting this pleasing duality of power and entropy power have been well known for direct and centralized source coding since Shannons work. While the bounds hold generally, their value is most pronounced when interpreted as a function of the number of agents in the CEO problem.
We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest attainable expec
ted distortion to its asymptotic value, as a function of blocklength $n$. Our main result is that in general the convergence rate is not faster than $n^{-1/2}$. In particular, we show that for the problem of transmitting i.i.d uniform bits over a binary symmetric channels with Hamming distortion, the smallest attainable distortion (bit error rate) is at least $Omega(n^{-1/2})$ above the asymptotic value, if the ``bandwidth expansion ratio is above $1$.
In this paper, we design a dimming compatible visible light communication (VLC) system in a standard office room according to illumination standards under channel constraints. We use overlapping pulse position modulation (OPPM) to support dimming con
trol by changing the code weights. The system parameters such as a valid interval for dimming together with an upper bound for bit rate according to the channel delay spread are investigated. Moreover, considering the dispersive VLC channel and using Monte Carlo (MC) simulations, a method is proposed to determine the minimum code length in different dimming levels in order to achieve a valid bit error rate (BER). Finally, trellis coded modulation (TCM) is suggested to be applied to OPPM in order to take advantage of consequent coding gain which could be up to $3$ dB.
Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-co
mplexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources under a minimum mean squared error distortion measure. All encoders use the same nested lattice codebook. Each encoder quantizes its observation using the fine lattice as a quantizer and reduces the result modulo the coarse lattice, which plays the role of binning. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer linear combinations of the quantized signals, and then inverts it. In general, the linear combinations have smaller average powers than the original signals. This allows to increase the density of the coarse lattice, which in turn translates to smaller compression rates. We also propose and analyze a one-shot version of IF source coding, that is simple enough to potentially lead to a new design principle for analog-to-digital converters that can exploit spatial correlations between the sampled signals.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
