Ryan Song

Ryan Song

Auto-generated profile, based on publicly available information

Ryan Song

Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
24 April 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RSRyan Song
Ryan Song
KAKareem M. Attiah
Kareem M. Attiah
WYWei Yu
Wei Yu
This paper considers a massive connectivity setting in which a base-station (BS) aims to communicate sources $(X_{1},\cdots ,X_{k})$ to a randomly activated subset of k users, among a large pool of n users, via a common message in the downlink. Although the identities of the k active users are assumed to be known at the BS, each active user only knows whether itself is active and does not know the identities of the other active users. A naive coding strategy is to transmit the sources alongside the identities of the users for which the source information is intended. This requires $H(X_{1},\cdots ,X_{k}) + k\log (n)$ bits, because the cost of specifying the identity of one out of n users is $\log (n)$ bits. For large n, this overhead can be significant. This paper shows that it is possible to develop coding techniques that eliminate the dependency of the overhead on n, if the source distribution follows certain symmetry. Specifically, if the source distribution is independently and identically distributed (i.i.d.) then the overhead can be reduced to at most $O(\log (k))$ bits, and in case of uniform i.i.d. sources, the overhead can be further reduced to $O(1)$ bits. For sources that follow a more general exchangeable distribution, the overhead is at most $O(k)$ bits, and in case of finite-alphabet exchangeable sources, the overhead can be further reduced to $O(\log (k))$ bits. The downlink massive random access problem is closely connected to the study of finite exchangeable sequences. The proposed coding strategy allows bounds on the Kullback-Leibler (KL) divergence between finite exchangeable distributions and i.i.d. mixture distributions to be developed and gives a new KL divergence version of the finite de Finetti theorem, which is scaling optimal.

31 October 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
ZZZihan Zhao
Zihan Zhao
SBSidi Mohamed Beillahi
Sidi Mohamed Beillahi
RSRyan Song
Ryan Song
YCYuxi Cai
Yuxi Cai
AVAndreas Veneris
Andreas Veneris
FLFan Long
Fan Long
This paper presents SigVM, the first blockchain virtual machine that extends EVM to support an event-driven execution model, enabling developers to build truly decentralized smart contracts. Contracts in SigVM can emit signal events, on which other contracts can listen. Once an event is triggered, corresponding handler functions are automatically executed as signal transactions. We build an end-to-end blockchain platform SigChain and a contract language compiler SigSolid to realize the potential of SigVM. Experimental results show that our benchmark applications can be reimplemented with SigVM in a truly decentralized way, eliminating the dependency on centralized and unreliable mechanisms like off-chain relay servers. The development effort of reimplementing these contracts with SigVM is small, i.e., we modified on average 3.17% of the contract code. The runtime and the gas overhead of SigVM on these contracts is negligible.