اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the capacity of the dither-quantized Gaussian channel
145
0
0.0
(
0
)
تأليف
Tobias Koch
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper studies the capacity of the peak-and-average-power-limited Gaussian channel when its output is quantized using a dithered, infinite-level, uniform quantizer of step size $Delta$. It is shown that the capacity of this channel tends to that of the unquantized Gaussian channel when $Delta$ tends to zero, and it tends to zero when $Delta$ tends to infinity. In the low signal-to-noise ratio (SNR) regime, it is shown that, when the peak-power constraint is absent, the low-SNR asymptotic capacity is equal to that of the unquantized channel irrespective of $Delta$. Furthermore, an expression for the low-SNR asymptotic capacity for finite peak-to-average-power ratios is given and evaluated in the low- and high-resolution limit. It is demonstrated that, in this case, the low-SNR asymptotic capacity converges to that of the unquantized channel when $Delta$ tends to zero, and it tends to zero when $Delta$ tends to infinity. Comparing these results with achievability results for (undithered) 1-bit quantization, it is observed that the dither reduces capacity in the low-precision limit, and it reduces the low-SNR asymptotic capacity unless the peak-to-average-power ratio is unbounded.
قيم البحث
اقرأ أيضاً
We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy capacity in this
scenario generally requires solving a nonconvex secrecy rate maximization (SRM) problem. To deal with this issue, we first reformulate the original SRM problem into a sequence of convex subproblems. For the special case of single-antenna legitimate receiver, we obtain the secrecy capacity via a combination of convex optimization and one-dimensional search, while for the general case of multi-antenna legitimate receiver, we propose an iterative solution. To gain more insight into how the secrecy capacity of a helper-assisted Gaussian wiretap channel behaves, we examine the achievable secure degrees of freedom (s.d.o.f.) and obtain the maximal achievable s.d.o.f. in closed-form. We also derive a closed-form solution to the original SRM problem which achieves the maximal s.d.o.f.. Numerical results are presented to illustrate the efficacy of the proposed schemes.
Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of interferen
ce-limited multi-user channels, for example, the Gaussian interfering multiple access channel (G-IMAC). Networks with interference usually require the use of interference alignment (IA) as a technique to achieve the upper bounds of a network. A promising approach in view of constant-gap capacity results is a special form of IA called signal-scale alignment, which works for time-invariant, frequency-flat, single-antenna networks. However, until now, results were limited to the many-to-one interference channel and the Gaussian X-channel. To make progress on this front, we investigate signal-scale IA schemes for the G-IMAC and aim to show a constant-gap capacity result for the G-IMAC. We derive a constant-gap sum capacity approximation for the lower triangular deterministic (LTD)-IMAC and see that the LTD model can overcome difficulties of the linear deterministic model. We show that the schemes can be translated to the Gaussian IMAC and that they achieve capacity within a constant gap. We show that multi-user gain is possible in the whole regime and provide a new look at cellular interference channels.
This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify th
e corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have a symmetric antipodal input distribution for all values of noise variance. Next, we analytically derive and characterize an achievable rate region for the capacity in cases with small peak power constraints, which coincides with the capacity in a certain scenario. The capacity per unit cost is of interest in low power regimes and is a target performance measure in energy efficient communications. In this work, we derive the capacity per unit cost of additive white Gaussian channel and GMAC with peak power constraints. The results in case of GMAC demonstrate that the capacity per unit cost is obtained using antipodal signaling for both users and is independent of users rate ratio. We characterize the optimized transmission strategies obtained for capacity and capacity per unit cost with peak-power constraint in detail and specifically in contrast to the settings with average-power constraints.
We propose a new coding scheme using only one lattice that achieves the $frac{1}{2}log(1+SNR)$ capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, when the signal-to-noise ratio $SNR>e-1$. The scheme applies a discrete
Gaussian distribution over an AWGN-good lattice, but otherwise does not require a shaping lattice or dither. Thus, it significantly simplifies the default lattice coding scheme of Erez and Zamir which involves a quantization-good lattice as well as an AWGN-good lattice. Using the flatness factor, we show that the error probability of the proposed scheme under minimum mean-square error (MMSE) lattice decoding is almost the same as that of Erez and Zamir, for any rate up to the AWGN channel capacity. We introduce the notion of good constellations, which carry almost the same mutual information as that of continuous Gaussian inputs. We also address the implementation of Gaussian shaping for the proposed lattice Gaussian coding scheme.
The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers outputs, three types of physically degrade
d RBCs (PDRBCs) are introduced. Inner bounds and outer bounds are derived on the capacity region of the presented three types. The bounds are tight for two types of PDRBCs: 1) one receivers output is a degraded form of the other receivers output, and the relays output is a degraded form of the weaker receivers output; 2) one receivers output is a degraded form of the relays output, and the other receivers output is a degraded form of the relays output. For the Gaussian PDRBC, the bounds match, i.e., establish its capacity region.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
