1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2022
Smaller Low-Depth Circuits for Kronecker Powers
Josh Alman, Yunfeng Guan, Ashwin Padaki
We give new, smaller constructions of constant-depth linear circuits for computing any matrix which is the Kronecker power of a fixed matrix. A standard argument (e.g., the mixed p…
eess.SP2022
Double-Sided Information Aided Temporal-Correlated Massive Access
Weifeng Zhu, Meixia Tao, Yunfeng Guan
This letter considers temporal-correlated massive access, where each device, once activated, is likely to transmit continuously over several consecutive frames. Motivated by that t…
cs.IT2021★ 1 cited
Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity
Weifeng Zhu, Meixia Tao, Xiaojun Yuan +1
This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base statio…