Cray Colloquium: Lessons learned from building three generations of massive MIMO systems

The computer science colloquium takes place on Mondays from 11:15 a.m. - 12:15 p.m.

This week's talk is a part of the Cray Distinguished Speaker Series. This series was established in 1981 by an endowment from Cray Research and brings distinguished visitors to the Department of Computer Science & Engineering every year.

This week's speaker is Lin Zhong from Yale University.


Computing is cheap and getting cheaper while spectrum is always scarce. Massive MIMO technology employs many antennas and massive computational power at the base station so that the latter can serve many users concurrently, reusing the same spectrum spatially. Despite its theoretical appeal, massive MIMO poses nontrivial scalability challenges to the design and implementation of both the base station and network systems. Over eight years ago, we reported the world's first massive MIMO base station prototype, Argos, which helped elevate massive MIMO to an important technology for 5G. Recently the third generation of Argos has been adopted as a key component of a national Platform for Advanced Wireless Research (PAWR). This talk shares our experience of building three generations of Argos and our ongoing effort toward commoditizing future telecom infrastructures.


Lin Zhong is Professor of Computer Science with Yale University. He received his B.S and M.S. from Tsinghua University and Ph.D. from Princeton University. From 2005 to 2019, he was with Rice University. At Yale, he leads the Efficient Computing Lab to make computing, communication, and interfacing more efficient and effective. He and his students received the best paper awards from ACM MobileHCI, IEEE PerCom, and ACM MobiSys (3), and ACM ASPLOS. He is a recipient of the NSF CAREER Award, the Duncan Award from Rice University, and the RockStar Award from ACM SIGMOBILE. He is a Fellow of IEEE. More information about his research can be found at

Start date
Monday, Nov. 23, 2020, 11:15 a.m.
End date
Monday, Nov. 23, 2020, 12:15 p.m.

Online - Zoom link