Research indexJournal article
Sparse channel estimation with regularization method using convolution inequality for entropy
Han, Kim, Prı́ncipe
Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.5 Jan 2006
NobleIDark:/48914/w1/20260524/1A5BB8DFDOI10.1109/ijcnn.2005.1556270
Sparse channel estimation with regularization method using convolution inequality for entropy
Han, Kim, Prı́ncipe · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · 2006 · Subscription
NobleIDark:/48914/w1/20260524/1A5BB8DFDOI10.1109/ijcnn.2005.1556270
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
In this paper, we show that the sparse channel estimation problem can be formulated as a regularization problem between mean squared error (MSE) and the L/sub 1/-norm constraint of the channel impulse response. A simple adaptive method to solve regularization problem using the convolution inequality for entropy is proposed. Performance of this proposed regularization method is compared to the Wiener filter, the matching pursuit (IMP) algorithm and the information criterion based method. The results show that the estimate of the sparse channel using the MSE criterion with the L/sub 1/-norm constraint outperforms the Wiener filter and the conventional sparse solution methods in terms of MSE of the estimates and the generalization performance.