نتایج جستجو برای: water filling algorithm
تعداد نتایج: 1323590 فیلتر نتایج به سال:
In this letter, we analyze power and rate adaptation in a point-to-point link with Rayleigh fading and impulsive interference. We model the impulsive interference as a BernoulliGaussian random process. Adaptation is used to maximize the average spectral efficiency by changing power and rate of the transmission subject to an average power and instantaneous probability of error constraints. Witho...
The interaction of two transmit-receive pairs coexisting in the same area and communicating using the same portion of the spectrum is analyzed from a game theoretic perspective. Each pair utilizes a decentralized iterative water-filling scheme to greedily maximize the individual rate. We study the dynamics of such a game and find properties of the resulting Nash equilibria. The region of achiev...
The Gaussian vector multiple access channel with a sum-power constraint across all users, rather than the usual individual power constraint on each user, has recently been shown to be the dual of a Gaussian vector broadcast channel [1] [2]. Further, a numerical algorithm for the sum capacity under the sum power constraint has been proposed in [3]. This paper proposes a different algorithm for t...
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parallel zero-mean additive white Gaussian channels subject to a signal energy constraint. In this work, we take an information theoretic approach to analyze the watermark communication problem in the presence of perceptual co...
This paper first identifies a flaw in the proof of the convergence theorem of Algorithm 2 of the paper by Jindal et al. [“Sum power iterative water-filling for multi-antenna Gaussian broadcast channels,” IEEE Trans. Inf. Theory, vol. 54, no. 4, pp. 1570–1580, Apr. 2005] and then presents a corrected convergence proof for that algorithm.
We revisit the sequential rate-distortion (SRD) trade-off problem for vector-valued Gauss-Markov sources with mean-squared error distortion constraints. We show via a counterexample that the dynamic reverse water-filling algorithm suggested by [1, eq. (15)] is not applicable to this problem, and consequently the closed form expression of the asymptotic SRD function derived in [1, eq. (17)] is n...
In this paper, we develop a new distributed adaptive power control framework for multi-cell OFDM systems based on the game theory. A specific utility function is defined considering the users’ achieved average utility per power, i.e., power unit based utility. We solve the subcarrier allocation issue naturally as well as the power control. Each user tries to maximize its utility by adjusting th...
This paper studies cooperative spectrum sensing in cognitive radio networks where secondary users collect local energy statistics and report their findings to a secondary base station, i.e., a fusion center. First, the average error probability is quantitively analyzed to capture the dynamic nature of both observation and fusion channels, assuming fixed amplifier gains for relaying local statis...
We analyze the ergodic capacity and channel outage probability for a composite MIMO channel model, which includes both fast fading and shadowing effects. The ergodic capacity and exact channel outage probability with space-time water-filling can be evaluated through numerical integrations, which can be further simplified by using approximated empirical eigenvalue and maximal eigenvalue distribu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید