Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Victor M. Elizondo

dblp:127/0995 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 88% Wireless networking · 12%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › channel state information
channel state information feedback
0.212013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013
Physical-layer communications › channel state information
quantized feedback
0.212013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013
Information theory
channel capacity
0.212013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013
Information theory › channel capacity
fading channel
0.212013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013
Physical-layer communications › modulation
adaptive modulation and coding
0.012013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013
Wireless networking › link adaptation
rate adaptation
0.012013
Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback · IEEE Trans. Commun. 2013

Methods — techniques the papers use, named apart from their topics

scalar root-finding · 0.3entropy-constrained quantization · 0.3
YearPublicationVenuePosition
2013 Maximum Expected Rates of Block-Fading Channels with Entropy-Constrained Channel State Feedback
abstract
We obtain the maximum average data rates achievable over block-fading channels when the receiver has perfect channel state information (CSI), and only an entropy-constrained quantized approximation of this CSI is available at the transmitter. We assume channel gains in consecutive blocks are independent and identically distributed and consider a short term power constraint. Our analysis is valid for a wide variety of channel fading statistics, including Rician and Nakagami-m fading. For this situation, the problem translates into designing an optimal entropy-constrained quantizer to convey approximated CSI to the transmitter and to define a rate-adaptation policy for the latter so as to maximize average downlink data rate. A numerical procedure is presented which yields the thresholds and reconstruction points of the optimal quantizer, together with the associated maximum average downlink rates, by finding the roots of a small set of scalar functions of two scalar arguments. Utilizing this procedure, it is found that achieving the maximum downlink average capacity C requires, in some cases, time sharing between two regimes. In addition, it is found that, for an uplink entropy constraint H̅2(L), a quantizer with more than L cells provides only a small capacity increase, especially at high SNRs.
Victor M. Elizondo, Milan S. Derpich
IEEE Trans. Commun.1