activity
20072016
most citedConvergence Analysis and Assurance for Gaussian Message Passing Iterative Detector in Massive MU-MIMO Systems

100 citations · 267 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IT2016★ 100 cited

Convergence Analysis and Assurance for Gaussian Message Passing Iterative Detector in Massive MU-MIMO Systems

Lei Liu, Chau Yuen, Yong Liang Guan +2

This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for massive Multiuser Multiple-Input Multiple-Output (MU-MIMO) system, in which…

cs.IT2015★ 15 cited

A Low-Complexity Gaussian Message Passing Iterative Detector for Massive MU-MIMO Systems

Lei Liu, Chau Yuen, Yong Liang Guan +2

This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) method over a pairwise graph for a massive Multiuser Multiple-Input Multiple-Output (MU-M…

cs.IT2014★ 51 cited

Sequence Design for Cognitive CDMA Communications under Arbitrary Spectrum Hole Constraint

Su Hu, Zilong Liu, Yong Liang Guan +3

To support interference-free quasi-synchronous code-division multiple-access (QS-CDMA) communication with low spectral density profile in a cognitive radio (CR) network, it is desi…

cs.IT2013★ 2 cited

TDCS-based Cognitive Radio Networks with Multiuser Interference Avoidance

Su H, Guoan Bi, Yong Liang Guan +1

For overlay cognitive radio networks (CRNs), transform domain communication system (TDCS) has been proposed to support multiuser communications through spectrum bin nulling and fre…

cs.IT2012★ 2 cited

Reduced Functional Dependence Graph and Its Applications

Xiaoli Xu, Satyajit Thakor, Yong Liang Guan

Functional dependence graph (FDG) is an important class of directed graph that captures the dominance relationship among a set of variables. FDG is frequently used in calculating n…

cs.IT2007★ 97 cited

Four-Group Decodable Space-Time Block Codes

Dung Ngoc Dao, Chau Yuen, Chintha Tellambura +2

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising d…