Quan Liu

Work place: School of Information Engineering, Wuhan University of Technology, Wuhan, China

E-mail: quanliu@whut.edu.cn


Research Interests: Database Management System, Analysis of Algorithms


Quan Liu was born in Wuhan in 1963. She got her BS degree in Huazhong University of technology in 1985. After years of study, she got MS degree and Ph.D. degree in Wuhan University of technology. Now she is the professor and dean in the school of information engineering in that school. With several years’ research of computer network communication and signal processing, she has published more than 90 related dissertations. Her research interests include nonlinear system analysis and signal processing, etc.

Author Articles
Improved FCLSD algorithm based on LTE/LTE-A system

By Kewen Liu Quan Liu He Ting

DOI: https://doi.org/10.5815/ijcnis.2011.05.03, Pub. Date: 8 Aug. 2011

In order to meet the high data rate, large capacity and low latency in LTE, advanced MIMO technology has been introduced in LTE system, which becomes one of the core technologies in physical layer. In a variety of MIMO detection algorithms, the ZF and MMSE linear detection algorithms are the most simple, but the performance is poor. MLD algorithm can achieve optimal detection performance, but it’s too complexity to be applied in practice. CLSD algorithm has similar detection performance and lower complexity with the MLD algorithm, but the uncertainty of complexity will bring hardware difficulties. FCLSD algorithm can maximize the advantages of CLSD algorithm and solve difficult problems in practice. Based on advanced FCLSD algorithm and combined with LTE / LTE-A practical system applications, this article designed two improved algorithms. The two improved algorithms can be flexibly and adaptively used in various antenna configurations and modulation scene in LTE / LTE-A spatial multiplexing MIMO system. The Simulation results show that the improved algorithm can achieve an approximate performance to the original FCLSD algorithm; in addition, it has a fixed complexity and could be carried out by parallel processing.

[...] Read more.
Research on Fine-grained Job scheduling in Grid Computing

By Yeqing Liao Quan Liu

DOI: https://doi.org/10.5815/ijieeb.2009.01.02, Pub. Date: 8 Oct. 2009

Grid computing is the technology used in building Internet-wide computing environment and integrating distributed and heterogeneous resources. However, in Grid environment, job scheduling is confronted with a great challenge. This paper focuses on lightweight jobs scheduling in Grid Computing. An Adaptive Fine-grained Job Scheduling (AFJS) algorithm is proposed. Compared with other fine-grained job scheduling algorithms based on grouping, AFJS can outperform them according to the experimental results. And some other related problems are also illustrated.

[...] Read more.
Other Articles