学术报告(1)
题目：On the achievable sum rate of MIMO channels with ZF Receivers
报告人：钟财军博士后 (Queen’s University Belfast)
时间：4月1日9:00
地点：信电楼215学术厅
Abstract: Multiple-input multiple-output (MIMO) antenna systems have received enormous attention due to their ability to provide linear capacity growth without extra power and bandwidth. With optimum non-linear receivers, the capacity of MIMO channels under a wide range of propagation scenarios has been extensively investigated and has now been well-understood. However, the prohibitive complexity associated with such optimum receivers poses significant implementation challenges for practical systems. In contract, low complexity receivers, such as linear zero forcing (ZF) receivers, are more appealing for many applications.
In this talk, we examine the achievable sum rate of MIMO channels with linear ZF receivers. Specifically, we propose several generic upper and lower bounds for the achievable sum rate, which are then particularized to various Rayleigh and Rician fading channel scenarios. Based on the new analytical results, we gain valuable insights into the impact of various model parameters, such as the number of antennas, spatial correlation and Rician K factor, on the achievable sum rate of MIMO channels with linear ZF receivers.
Biography: Caijun Zhong received the B.S. degree in Information Engineering from the Xi'an Jiaotong University, Xi'an, China, in 2004, and the M.S. degree in Information Security in 2006, Ph.D. degree in Telecommunications in 2010, both from University College London, London, United Kingdom. He is currently a research fellow at the Institute for Electronics, Communications and Information Technologies (ECIT), Queen's University Belfast, Belfast, Northern Ireland. His research interests include multivariate statistical theory, MIMO communications systems, cooperative communications, and cognitive radio.
学术 报 告(2)
Title: Cyclic and Quasi-Cyclic LDPC Codes: New Developments
Time： 2011年4月1日上午10:30
Venue：信电大楼-215学术厅
Abstract: This talk is concerned with construction of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of two parts. The first part shows that a cyclic code given by a parity-check matrix in circulant form can be decomposed into descendant cyclic and quasi-cyclic codes of various lengths and rates. Some fundamental structural properties of these descendant codes are developed, including the characterizations of the roots of the generator polynomial of a cyclic descendant code. The second part of the paper shows that cyclic and quasi-cyclic descendant LDPC codes can be derived from cyclic finite geometry LDPC codes using the results developed in the first part of the paper. This enlarges the repertoire of cyclic LDPC codes.
Biography：Qin Huang started college at 15 years old as a gifted young. He received the B.S. and M.S. degrees from Southeast University, Nanjing, China, in 2005 and 2007, respectively, both in Electronic Engineering (EE). He has finished his Ph.D. degree in EE under the guidance of Dr. Shu Lin, IEEE, life fellow, at the University of California, Davis. He has published 6 papers on Trans. Commun. and submitted 3 papers to Trans. Inform. Theory. He has been a reviwer of IEEE Trans. Commun., Trans. CSI, Trans. Commun. Letter, and Trans. KIIS. His research interests include classical and modern coding theory, signal processing, and their applications on communication systems and storage systems.