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

Aviv Rosenzweig

dblp:61/6051 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

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

Theory of computation · 2 · 2 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.

Theoretical computer science
2 papers
Information theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.122007
The Capacity of Gaussian Multi-User Channels With State and Feedback · IEEE Trans. Inf. Theory 2007
On channels with partial channel state information at the transmitter · IEEE Trans. Inf. Theory 2005
Information theory › network information theory
broadcast channel
0.112007
The Capacity of Gaussian Multi-User Channels With State and Feedback · IEEE Trans. Inf. Theory 2007
Information theory › network information theory
multiple-access channel
0.112007
The Capacity of Gaussian Multi-User Channels With State and Feedback · IEEE Trans. Inf. Theory 2007
Information theory › network information theory
multiuser channels
0.112007
The Capacity of Gaussian Multi-User Channels With State and Feedback · IEEE Trans. Inf. Theory 2007
Information theory › channel capacity
fading channel
0.112005
On channels with partial channel state information at the transmitter · IEEE Trans. Inf. Theory 2005
Information theory › channel capacity
state-dependent channel
0.112005
On channels with partial channel state information at the transmitter · IEEE Trans. Inf. Theory 2005
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.012005
On channels with partial channel state information at the transmitter · IEEE Trans. Inf. Theory 2005

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

scalar quantization · 0.1power allocation · 0.1random binning · 0.1feedback coding · 0.1rate-distortion bounds · 0.1rate-distortion bound · 0.1
YearPublicationVenuePosition
2007 The Capacity of Gaussian Multi-User Channels With State and Feedback
abstract
This correspondence considers communication over two Gaussian channels with additive state interference and noiseless output feedback-the multiple access channel (MAC) and the augmented broadcast channel (ABC) (a special class of the physically degraded broadcast channel). The state interference is assumed to be available noncausally at the transmitters. Deterministic coding schemes for these two channels were suggested by Ozarow when there is no state present. Recently, Merhav and Weissman derived an optimal feedback coding scheme for the single-user Gaussian channel with additive state interference. Combining ideas from these two schemes, we extend Ozarow's coding algorithms to the state-dependent case, showing that the capacity regions of the MAC and the ABC are not affected, even though not all parts of the system have knowledge of the state. The proposed schemes attain a better error performance and reduce the coding complexity with respect to the standard random binning coding technique.
Aviv Rosenzweig
IEEE Trans. Inf. Theory1
2005 On channels with partial channel state information at the transmitter
abstract
We consider an independent and identically distributed (i.i.d.) state-dependent channel with partial (rate-limited) channel state information (CSI) at the transmitter (CSIT) and full CSI at the receiver (CSIR). The CSIT comprises two parts, both subject to a rate constraint, and communicated over noiseless way-side channels. The first part is coded CSI, provided by a third party (a genie), and the second part is the output of a deterministic scalar quantizer of the state. A single-letter expression for the capacity of the channel is given. In case the CSIT comprises only the coded part, we show that the capacity previously suggested in the literature is too optimistic, and suggest a correction as part of our expression for the information capacity. For the general setting, an optimal coding scheme based upon multiplexing of several codebooks is presented. It is proved that the capacity of the channel is the same whether the quantizer's output is observed causally or noncausally by the encoder. In the rest of the correspondence, we focus on the special case where the system employs a stationary quantizer. Using a rate distortion approach we bound the alphabet's size of the auxiliary random variable (RV) of the information capacity. Next, we turn to the additive white Gaussian noise (AWGN) channel with fading, and show that the determination of the capacity region reduces to finding the optimal genie strategies and the optimal power allocation distribution along the product alphabet of the auxiliary RV and the quantizer's output alphabets. The suggested model can be applied, for example, to an orthogonal frequency-division multiplexing (OFDM) communication system. Here the fading across frequencies comprises the channel state sequence. Coded fading information is provided to the channel encoder via a way-side, rate-limited channel. In addition, since coding operation is expensive, a simpler scheme provides the channel encoder with quantized fading information, e.g., whether each coefficient is above/below a threshold.
Aviv Rosenzweig, Yossef Steinberg, Shlomo Shamai
IEEE Trans. Inf. Theory1