Anlan Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anlan Yu has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Arnab Bhadury
YouTube, Vancouver, Canada
1 shared publication - Changping Meng
Google, Mountain View, CA, USA
1 shared publication - Chuan He
Google, Mountain View, CA, USA
1 shared publication - Chuan Zhang
LEADS, the National Mobile Communications Research Laboratory, and the Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
1 shared publication - Dapeng Hong
Google, Mountain View, CA, USA
1 shared publication - Jiawei Li
Google, Mountain View, CA, USA
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1500-1505
Soft Curriculum Learning for Optimizing Fresh and Generalized Recommendations
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1500-1505
Open AccessSoft Curriculum Learning for Optimizing Fresh and Generalized Recommendations
- 29 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 67 (6) , 2128-2139
Efficient Successive Over Relaxation Detectors for Massive MIMO
Massive multiple-input and multiple-output (MIMO) is considered as an advanced technique in wireless communication due to its high spectral efficiency, data rates, and transmission reliability. However, the large number of antennas makes it challenging to design efficient detectors since computational complexity is much higher. Thus, conventional linear methods like minimum mean square error (MMSE) detection suffer from prohibitive complexity. To balance complexity and performance, a class of iterative linear methods are considered to approach MMSE performance with O(NT2) complexity, where NT is the number of transmit antennas. Among them, successive over relaxation (SOR) detector is promising since it achieves near MMSE performance with affordable complexity and fast convergence. However, error performance of previously proposed SOR detectors is sensitive to a relaxation factor ω, especially when the channel varies. To address this issue, two detectors are proposed in this paper: non-adaptive SOR (NA-SOR) detector (with fixed ω) and adaptive SOR (A-SOR) detector (with iteratively changed ω). Compared to prior SOR detectors, the performance of the NA-SOR detector is more robust to ω, and the A-SOR detector achieves better performance, especially in highly correlated channels. An efficient pipelined hardware architecture of the A-SOR detector is proposed. Implementation results show advantages when compared to the state-of-the-art (SOA).
- 29 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 67 (6) , 2128-2139
Efficient Successive Over Relaxation Detectors for Massive MIMO
Massive multiple-input and multiple-output (MIMO) is considered as an advanced technique in wireless communication due to its high spectral efficiency, data rates, and transmission reliability. However, the large number of antennas makes it challenging to design efficient detectors since computational complexity is much higher. Thus, conventional linear methods like minimum mean square error (MMSE) detection suffer from prohibitive complexity. To balance complexity and performance, a class of iterative linear methods are considered to approach MMSE performance with O(NT2) complexity, where NT is the number of transmit antennas. Among them, successive over relaxation (SOR) detector is promising since it achieves near MMSE performance with affordable complexity and fast convergence. However, error performance of previously proposed SOR detectors is sensitive to a relaxation factor ω, especially when the channel varies. To address this issue, two detectors are proposed in this paper: non-adaptive SOR (NA-SOR) detector (with fixed ω) and adaptive SOR (A-SOR) detector (with iteratively changed ω). Compared to prior SOR detectors, the performance of the NA-SOR detector is more robust to ω, and the A-SOR detector achieves better performance, especially in highly correlated channels. An efficient pipelined hardware architecture of the A-SOR detector is proposed. Implementation results show advantages when compared to the state-of-the-art (SOA).