Asif Katz

dblp:284/0736 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-4241-8400ORCID · corroborated

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

Computer networks · 2 · 2 first-author · 2 since 2021

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 · 90% Coding theory · 10%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory › relay channel
compress-and-forward
1.422025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
The Filtered Gaussian Primitive Diamond Channel · IEEE Trans. Commun. 2022
Information theory › network information theory › relay channel
decode-and-forward
1.422025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
The Filtered Gaussian Primitive Diamond Channel · IEEE Trans. Commun. 2022
Information theory › network information theory › relay channel
diamond channel
1.422025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
The Filtered Gaussian Primitive Diamond Channel · IEEE Trans. Commun. 2022
Information theory › network information theory
relay channel
1.422025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
The Filtered Gaussian Primitive Diamond Channel · IEEE Trans. Commun. 2022
Information theory
time-sharing
1.422025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
The Filtered Gaussian Primitive Diamond Channel · IEEE Trans. Commun. 2022
Information theory › communication channels › channel models › noisy channel
dependent noise
0.912025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025
Coding theory › channel coding › channels with side information
dirty paper coding
0.912025
The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding · IEEE Trans. Commun. 2025

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

time-sharing · 1.4decode-and-forward · 1.4compress-and-forward · 1.4dirty paper coding · 0.9rate allocation · 0.6
YearPublicationVenuePosition
2025 The Gaussian Primitive Discrete Time and Filtered Diamond Channel: Correlated Noise and Dirty-Paper Coding
abstract
We investigate the primitive diamond relay channel model comprising Gaussian channels with identical frequency responses from the user to the relays and with lossless fronthaul links with a limited rate from the relays to the destination. The model is further extended by addressing correlated noise at the relays, which can be present in the uplink system, for example, due to interference or a jammer. We use the oblivious compress and forward (CF) scheme with distributed compression, and the decode and forward (DF) scheme. The CF system rate is calculated for the correlated noise case and a closed-form formula is derived. The effect of positive and negative correlation on the system rate is shown. It is proved that CF-DF time-sharing scheme is advantageous over a CF-DF superposition coding (SPC) scheme for the correlated noise case. We also analyze another scheme to combine CF and DF, which is based on dirty paper coding (DPC). This scheme’s analysis relies on the correlated noise CF results, providing another motivation for examining this case. It is proved that also in this setting, the CF-DF time-sharing scheme is advantageous over the CF-DF DPC scheme. The optimal time-sharing proportion between CF and DF, and each frequency’s power and rate allocations are determined for positive noise correlation.
Asif Katz, Michael Peleg, H. Vincent Poor, Shlomo Shamai
IEEE Trans. Commun.1
2022 The Filtered Gaussian Primitive Diamond Channel
abstract
We investigate a special case of diamond relay comprising Gaussian channels with an identical frequency response from the user to the relays, and with lossless fronthaul links with limited rate from the relays to the destination. We use the oblivious compress and forward (CF) scheme with with distributed compression, and a decode and forward (DF) scheme, where each relay decodes the whole message and sends half of the bits to the destination. It is proved that optimal CF-DF time-sharing scheme is advantageous over the CF-DF superposition scheme. We derive an achievable rate by using time-sharing between CF and DF. The optimal time-sharing proportion between CF and DF, and the power and rate allocations are different for each frequency and are fully determined.
Asif Katz, Michael Peleg, Shlomo Shamai
IEEE Trans. Commun.1