Abstract | ||
---|---|---|
We propose a new technique for adaptive identification of sparse systems based on the compressed sensing (CS) theory. We manipulate the transmitted pilot (input signal) and the received signal such that the weights of adaptive filter approach the compressed version of the sparse system instead of the original system. To this end, we use random filter structure at the transmitter to form the measurement matrix according to the CS framework. The original sparse system can be reconstructed by the conventional recovery algorithms. As a result, the denoising property of CS can be deployed in the proposed method at the recovery stage. The experiments indicate significant performance improvement of proposed method compared to the conventional LMS method which directly identifies the sparse system. Furthermore, at low levels of sparsity, our method outperforms a specialized identification algorithm that promotes sparsity. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/IranianCEE.2012.6292545 | international conference on e-business and e-government |
Keywords | Field | DocType |
compressed sensing,adaptive filters,least mean square,least squares approximation,transmitter | Least mean squares filter,Noise reduction,Pattern recognition,Computer science,Sparse approximation,Reconstruction algorithm,Artificial intelligence,Adaptive filter,Kernel adaptive filter,Recursive least squares filter,Compressed sensing | Journal |
Volume | Citations | PageRank |
abs/1204.0803 | 0 | 0.34 |
References | Authors | |
0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Seyed Hossein Hosseini | 1 | 65 | 18.55 |
Mahrokh G. Shayesteh | 2 | 103 | 17.17 |