盲反卷积中的等变自适应

S. Douglas
{"title":"盲反卷积中的等变自适应","authors":"S. Douglas","doi":"10.1109/ACSSC.2002.1197282","DOIUrl":null,"url":null,"abstract":"In blind source separation, equivariance has been shown to be a useful property for designing simple and efficient iterative algorithms for the task. In this paper, we explore iterative equivariant algorithms for block-based blind deconvolution, in which the deconvolved symbol sequence is found by successively filtering the estimated symbol sequence. A procedure based on maximum likelihood estimation of the source symbol sequence is given, and its performance is studied through simulations. In addition, we show that in the absence of truncation effects, the well-known Shalvi-Weinstein blind deconvolution algorithm is an iterative equivariant blind deconvolution procedure.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On equivariant adaptation in blind deconvolution\",\"authors\":\"S. Douglas\",\"doi\":\"10.1109/ACSSC.2002.1197282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In blind source separation, equivariance has been shown to be a useful property for designing simple and efficient iterative algorithms for the task. In this paper, we explore iterative equivariant algorithms for block-based blind deconvolution, in which the deconvolved symbol sequence is found by successively filtering the estimated symbol sequence. A procedure based on maximum likelihood estimation of the source symbol sequence is given, and its performance is studied through simulations. In addition, we show that in the absence of truncation effects, the well-known Shalvi-Weinstein blind deconvolution algorithm is an iterative equivariant blind deconvolution procedure.\",\"PeriodicalId\":284950,\"journal\":{\"name\":\"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2002.1197282\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2002.1197282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在盲源分离中,等方差已被证明是设计简单有效的迭代算法的有用性质。本文研究了基于块的盲反卷积迭代等变算法,该算法通过对估计的符号序列进行逐次滤波得到反卷积符号序列。给出了一种基于最大似然估计的源符号序列估计方法,并通过仿真研究了该方法的性能。此外,我们还证明了在没有截断效应的情况下,著名的Shalvi-Weinstein盲反卷积算法是一个迭代的等变盲反卷积过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On equivariant adaptation in blind deconvolution
In blind source separation, equivariance has been shown to be a useful property for designing simple and efficient iterative algorithms for the task. In this paper, we explore iterative equivariant algorithms for block-based blind deconvolution, in which the deconvolved symbol sequence is found by successively filtering the estimated symbol sequence. A procedure based on maximum likelihood estimation of the source symbol sequence is given, and its performance is studied through simulations. In addition, we show that in the absence of truncation effects, the well-known Shalvi-Weinstein blind deconvolution algorithm is an iterative equivariant blind deconvolution procedure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信