880 research outputs found
Performance of DF Incremental Relaying with Energy Harvesting Relays in Underlay CRNs
In this paper, we analyze the throughput performance of incremental relaying
using energy harvesting (EH) decode-and-forward (DF) relays in underlay
cognitive radio networks (CRNs). The destination combines the direct and
relayed signals when the direct link is in outage. From the derived closed-form
expressions, we present an expression for the power-splitting parameter of the
EH relay that optimizes the throughput performance. We demonstrate that
relaying using EH DF relays results in better performance than direct
signalling without a relay only when the destination combines the direct signal
from the source with the relayed signal. Computer simulations demonstrate
accuracy of the derived expressions
Derandomizing Isolation in Space-Bounded Settings
We study the possibility of deterministic and randomness-efficient isolation in space-bounded models of computation: Can one efficiently reduce instances of computational problems to equivalent instances that have at most one solution? We present results for the NL-complete problem of reachability on digraphs, and for the LogCFL-complete problem of certifying acceptance on shallow semi-unbounded circuits.
A common approach employs small weight assignments that make the solution of minimum weight unique. The Isolation Lemma and other known procedures use Omega(n) random bits to generate weights of individual bitlength O(log(n)). We develop a derandomized version for both settings that uses O(log(n)^{3/2}) random bits and produces weights of bitlength O(log(n)^{3/2}) in logarithmic space. The construction allows us to show that every language in NL can be accepted by a nondeterministic machine that runs in polynomial time and O(log(n)^{3/2}) space, and has at most one accepting computation path on every input. Similarly, every language in LogCFL can be accepted by a nondeterministic machine equipped with a stack that does not count towards the space bound, that runs in polynomial time and O(log(n)^{3/2}) space, and has at most one accepting computation path on every input.
We also show that the existence of somewhat more restricted isolations for reachability on digraphs implies that NL can be decided in logspace with polynomial advice. A similar result holds for certifying acceptance on shallow semi-unbounded circuits and LogCFL
Iterative receiver based on SAGE algorithm for crosstalk cancellation in upstream vectored VDSL
We propose the use of an iterative receiver based on the Space Alternating Generalized Expectation maximization (SAGE) algorithm for crosstalk cancellation in upstream vectored VDSL. In the absence of alien crosstalk, we show that when initialized with the frequency-domain equalizer (FEQ) output, the far-end crosstalk (FEXT) can be cancelled with no more real-time complexity than the existing linear receivers. In addition, the suggested approach does not require offline computation of the channel inverse and thus reduces the receiver complexity. In the presence of alien crosstalk, there is a significant gap between the rate performance of the linear receivers as compared with the single-user bound (SUB). The proposed receiver is shown to successfully bridge this gap while requiring only a little extracomplexity. Computer simulations are presented to validate the analysis and confirm the performance of the proposed receiver
- …