## 4/26/2009

## 3/31/2009

### Analogy matrix completion to MIMO channel recovery

As compresed sensing (CS) theory was developed by Candes and Tao, Donoho, sparse signal or approximate sparse signal recovery can be reconstruction exactly. On the heels of CS, a remarkable new field has very recently emerged. This field addresses a broad range of a data matrix from what appears to be incomplete, and perhaps even corrupted, information. This problem can be called as Matrix completion (MC).

In general, recovering a data matrix by a part of its entries is impossiable. However, if the unknown matrix is known to have llow rank or approximately low rank, then accurate recovery is possible. This recovery problem can be analogy to MIMO channel matrix modeling.

Channel estimation is a key problem in MIMO communication systems. In general, least square (LS) algorithm is a good candidata for channel estimation or modeling. However, this method will waste a lot of spectrum resource. If we employ the channel matrix completion, will improve greatly the spectrum resource. Recently, we will research this method on MIMO channel estiamtion. If you have some good suggestions about the MIMO channel matrix recovery, please do not hesitate to tell me. My email box is ：gui@uestc.edu.cn

Index:
matrix completion,
MIMO channel,
sparse channel

## 3/26/2009

### An Introduction to Compressed Sensing

Conventional signal sampling is that the sampling rate must be at least twice the maximum frequency presented in the signal. In the field of signal sampling or compressed, Shannon theorem plays an implicit role. However, the signal is uniformly sampled at or above the Nyquist rate. Thus, this sampling is not a effective approach. Fortunately, Candes and Tao, Donoho have introduced a new sampling theory: Compressed sensing, which was beyond Nyquist sampling theory. CS theory asserts that one can recover certain signals and images from far fewer samples or measurments than traditional methods use. To make this possible, CS relies on two priciples: signal sparsity and incoherence of measurment matrix.

On channel estimation problem, we can introduce CS theory. In general, there always exist a large delay spread and only has a few dominant taps in high data rate wireless communication. that is to say, this multipath channel has sparsity. In the process of channel estimation, training matrix can be designed Toeplitz structre which satisfies Restrict Isometry property (RIP).

On channel estimation problem, we can introduce CS theory. In general, there always exist a large delay spread and only has a few dominant taps in high data rate wireless communication. that is to say, this multipath channel has sparsity. In the process of channel estimation, training matrix can be designed Toeplitz structre which satisfies Restrict Isometry property (RIP).

## 3/25/2009

### How to exploit the channel prior information

Today, my supervisor dicussed with me about the channel estimation problem by exploiting channel prior information.

Accoding to our experiment of wireless communication, we find that channel nature property can be discribed as two part: the first part is overall zero taps and the second is dominant by a few nonzero taps. Thus, we can employ this information on channel estimation. If we search a proper length of overall zero, we will model channel impluse response properly. If you have some interest, we can discuss it in detail or refer to my paper: partial sparse channel estimation by expoiting prior information. My email is gui@uestc.edu.cn.

Accoding to our experiment of wireless communication, we find that channel nature property can be discribed as two part: the first part is overall zero taps and the second is dominant by a few nonzero taps. Thus, we can employ this information on channel estimation. If we search a proper length of overall zero, we will model channel impluse response properly. If you have some interest, we can discuss it in detail or refer to my paper: partial sparse channel estimation by expoiting prior information. My email is gui@uestc.edu.cn.

## 3/24/2009

### An promising theory: Matrix completion

Matrix completion, which was proposed by Candes and Tao, is a new matrix recovery technqiue which is come from compressed sensing (CS) theory. In general, Matrix reconstruction from few entries is impossiple. However, there exist recovery possiblity, if we know the Matrix has low-rank perpety. As Candes said, matrix completion will become a hot topic which can be employed many areas such as GPS and MIMO channel estimation.

MIMO channel estimation is a challenge task, especially in frequency-selective fading channel. Thus, MIMO channel estimation employ matrix completion which based on CS theory is a new idea. But, how we can do it? This is my research at present. If you have some suggestion about it, don't forget tell me. Waiting for your commances. Many thanks.

## 3/23/2009

### One of my reseach topics: MIMO Channel Estimation

The importance of wireless channel estimation and understanding channel knowledge for successful design of communication systems can never be overstated. In eariler of channel estimation, the wireless medium was viewed as an obstacle or challenge in designing reliable communication links. However, decades of research and subsequent insights have change this paradigm. Modern day communcation systems rather tend to exploit the channel knowledge for increasing system reliablity and thoughtput by employing techniques such as MIMO, which is the key for extending the limits of existing communication systems. Thus, MIMO channel estimation become a most important challenge because it must be to overcome the highly frequency selective of the fading channel.

Index:
fading channel,
frequecy selective,
MIMO channel

订阅：
博文 (Atom)

## Useful Links:

- Australasian digital Theses Program
- Communications and Signal Processing (CSP) research group at the University of Wisconsin - Madison
- Compressive Sensing Videos
- Cornell University's Library
- Dr. Deanna Needell (University of California, Davis)
- Dr. Jarvis D. Haupt (University of Wisconsin - Madison )
- Dr. Li_Compressed sensing
- Dr. Waheed U. Bajwa (University of Wisconsin-Madison)
- ETD collection (Digital library and archives)
- GIT Theses and dissertations
- Guan Gui (Sohu Chinese Blogger)
- MIT Theses and Dissertations
- Nuit Blanche Compressed Sensing
- OhioLINK Electronic Theses and Dissertations Center
- Prof. Akbar M. Sayeed （University of Wisconsin, Madison）
- Prof. Alexandre d'Aspremont (Princeton University)
- Prof. Anna C. Gilbert (University of Michigan)
- Prof. Arogyaswami Paulraj (Stanford University, MIMO wireless communication techniques)
- Prof. Bernard C. Levy (University of California, Davis)
- Prof. David Donoho (Stanford University)
- Prof. Emmanuel Candes (California Institute of Technology)
- Prof. Fumiyuki Adachi (Tohoku University)
- Prof. Joel A. Tropp (California Institute of Technology)
- Prof. Justin Romberg (GIT)
- Prof. Martin J. Wainwright (University of California at Berkeley )
- Prof. Milica Stojanovic (MIT)
- Prof. Phil Schniter (The Ohio State University)
- Prof. R. Tyrrell Rockafellar (University of Washington)
- Prof. Richard G. Baraniuk (Rice University )
- Prof. Robert Nowak (University of Wisconsin-Madison )
- Prof. Stephen P. Boyd (Stanford University)
- Prof. Terence Tao (Department of Mathematics, UCLA)
- Prof. Thomas Blumensath (University of Edinburgh)
- Prof. Yonina Eldar (Technion, Israel Institute of Technology)
- UC Berkeley's Webcasts
- UESTC (中国电子科技大学)
- UESTC, Department of Electrical Engineering
- Welcome to the TeX Users Group web site