Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qiuyu Cheng

dblp:380/5885 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0004-9430-2305ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › equalization
MIMO equalization
0.912025
Low-Complexity Inverse Matrix Mini-Batch Gradient Descent for MIMO Equalization and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO
MIMO precoding
0.912025
Low-Complexity Inverse Matrix Mini-Batch Gradient Descent for MIMO Equalization and Precoding · IEEE Trans. Commun. 2025
Mathematical optimization
gradient descent
0.312025
Low-Complexity Inverse Matrix Mini-Batch Gradient Descent for MIMO Equalization and Precoding · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

mini-batch gradient descent · 1.7finite-alphabet neighborhood search · 1.7
YearPublicationVenuePosition
2025 Low-Complexity Inverse Matrix Mini-Batch Gradient Descent for MIMO Equalization and Precoding
abstract
As the size of base station antenna arrays continues to grow, even with linear processing algorithms, the computational complexity and power consumption required for massive MIMO equalization or precoding (EoP) matrix computation increase exponentially. This paper proposes an inverse matrix minibatch gradient descent (IM-MBGD) method for MIMO EoP. The proposed method leverages minibatch gradient descent to compute the pseudo-inverse of the Gram matrix instead of directly calculating the EoP matrix. Since the pseudo-inverse matrix has significantly lower dimensions compared to the EoP matrix, this approach effectively reduces computational complexity and accelerates convergence. Based on our convergence analysis, to further minimize the iteration time and improve the accuracy of the EoP matrix, we optimize the IM-MBGD method using a finite-alphabet neighborhood search. The finite-alphabet search performs neighborhood optimization to achieve the optimal solution. Compared to state-of-the-art alphabet-based equalizers, our proposed method achieves a 14-fold reduction in computational complexity for EoP matrix calculation. Furthermore, in terms of storage and the overall equalization process, our method reduces overhead by 80% compared to linear equalizers.
Shihan Wang 0008, Jienan Chen, Qiuyu Cheng, Chentao Liang, Peizhi Lei
IEEE Trans. Commun.3
2024 A Hardware Efficient Matrix Multiplications Scheme with Dynamic Precisions and Dimensions for Massive MIMO Systems
abstract
Matrix multiplication serves as the primary operation in massive multiple-input multiple-output (MIMO). However, with the continuous advancement of MIMO technology, the escalating computational complexity and the necessity for adaptable matrix multiplication in MIMO communication pose a formidable challenge. In this paper, we propose the Joint Serial-Parallel Dataflow (JSPD) mapping method for dynamic precision matrix multiplication, which relies on the utilization of Spatio-Temporal Transforms (STT) and Principal-Auxiliary Matrices (PAM). The data is initially processed serially and is mapped onto Processing Element (PE) arrays through STT transforms. Subsequently, both high-precision and low-precision components of the data are computed selectively in parallel, employing a combination of principal and auxiliary matrices. The matrix multiplication process is mapped onto the PE arrays, incorporating output-stationary and output-flow modes. Compared with the traditional fixed structure PE arrays, the JSPD mapping method improves the computational flexibility while increasing the PE cell work share ratio by 7.57% ∼ 21.86%. Meanwhile, JSPD reduces the hardware overhead by a maximum of 68% and improves hardware efficiency by 35.77%.
Qiuyu Cheng, Yakun Zhou, Chentao Liang, Zuofeng Zhang, Jienan Chen
ISCAS1