http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Steffen Barembruch (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
The Expectation and Sparse Maximization Algorithm
Barembruch, Steffen,Scaglione, Anna,Moulines, Eric The Korea Institute of Information and Commucation 2010 Journal of communications and networks Vol.12 No.4
In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method-the expectation-sparse-maximization (ESpaM) algorithm-for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.
-
The Expectation and Sparse Maximization Algorithm
Steffen Barembruch,Anna Scaglione,Eric Moulines 한국통신학회 2010 Journal of communications and networks Vol.12 No.4
In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However,most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method—the expectation-sparse-maximization (ESpaM)algorithm—for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
