Siyao Zhou

Siyao Zhou

Auto-generated profile, based on publicly available information

Siyao Zhou


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 February 2019 in Entropy
Verified
Journal Article
Open access
PDF file
YWYizhong Wang
Yizhong Wang
LXLi Xie
Li Xie
SZSiyao Zhou
Siyao Zhou
MWMengzhen Wang
Mengzhen Wang
Jun ChenJun Chen
Jun Chen
Consider a symmetric multivariate Gaussian source with ℓ components, which are corrupted by independent and identically distributed Gaussian noises; these noisy components are compressed at a certain rate, and the compressed version is leveraged to reconstruct the source subject to a mean squared error distortion constraint. The rate-distortion analysis is performed for two scenarios: centralized encoding (where the noisy source components are jointly compressed) and distributed encoding (where the noisy source components are separately compressed). It is shown, among other things, that the gap between the rate-distortion functions associated with these two scenarios admits a simple characterization in the large ℓ limit.

28 February 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
LXLi Xie
Li Xie
XTXiaolan Tu
Xiaolan Tu
SZSiyao Zhou
Siyao Zhou
Jun ChenJun Chen
Jun Chen
A conjectural expression of the asymptotic gap between the rate-distortion function of an arbitrary generalized Gaussian multiterminal source coding system and that of its centralized counterpart in the high-resolution regime is proposed. The validity of this expression is verified when the number of sources is no more than 3.

1 November 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SZSiyao Zhou
Siyao Zhou
SSSadaf Salehkalaibar
Sadaf Salehkalaibar
JQJingjing Qian
Jingjing Qian
Jun ChenJun Chen
Jun Chen
WSWuxian Shi
Wuxian Shi
WTWen Tong
Wen Tong
A distributed lossy compression network with L encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. The minimum compression rate of this network versus the distortion threshold is referred to as the rate-distortion function, for which an explicit lower bound is established by solving a minimization problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic gap between the upper and lower bounds is characterized in the large L limit.