An efficient and simple algorithm for estimating the number of sources via ℓ0.55-norm

D. Guimarães, Giovanni Henrique Faria Floriano, Rausley Adriano Amaral de Souza
{"title":"An efficient and simple algorithm for estimating the number of sources via ℓ0.55-norm","authors":"D. Guimarães, Giovanni Henrique Faria Floriano, Rausley Adriano Amaral de Souza","doi":"10.1109/ITS.2014.6947967","DOIUrl":null,"url":null,"abstract":"Recently, it has been proposed an empirical method for estimating the number of sources of signals impinging on multiple sensors, named norm-based (NB) algorithm. The algorithm computes the Euclidian norm of vectors whose elements are the normalized and nonlinearly scaled eigenvalues of the received signal covariance matrix, and the corresponding normalized indexes. Such norms are then used to discriminate the largest eigenvalues from the remaining ones, thus allowing for the estimation of the number of sources. In this paper we propose an improved norm-based (iNB) algorithm which uses the ℓ0.55-norm as a means for classifying the eigenvalues. Differently from the NB, the iNB algorithm does not use the nonlinear scaling and does not need to set an additional empirical constant that is crucial to the proper operation of the NB algorithm. Comparisons are made with the estimators MDL (minimum description length) and AIC (Akaike information criterion), and with a recently-proposed estimator based on the random matrix theory (RMT). It is shown that the iNB algorithm can outperform one or more of these estimators in several situations, and that it always outperforms the NB algorithm.","PeriodicalId":359348,"journal":{"name":"2014 International Telecommunications Symposium (ITS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Telecommunications Symposium (ITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2014.6947967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recently, it has been proposed an empirical method for estimating the number of sources of signals impinging on multiple sensors, named norm-based (NB) algorithm. The algorithm computes the Euclidian norm of vectors whose elements are the normalized and nonlinearly scaled eigenvalues of the received signal covariance matrix, and the corresponding normalized indexes. Such norms are then used to discriminate the largest eigenvalues from the remaining ones, thus allowing for the estimation of the number of sources. In this paper we propose an improved norm-based (iNB) algorithm which uses the ℓ0.55-norm as a means for classifying the eigenvalues. Differently from the NB, the iNB algorithm does not use the nonlinear scaling and does not need to set an additional empirical constant that is crucial to the proper operation of the NB algorithm. Comparisons are made with the estimators MDL (minimum description length) and AIC (Akaike information criterion), and with a recently-proposed estimator based on the random matrix theory (RMT). It is shown that the iNB algorithm can outperform one or more of these estimators in several situations, and that it always outperforms the NB algorithm.
一种利用0.55范数估计信源数的简单有效算法
最近,人们提出了一种估计多个传感器上的信号源数量的经验方法,称为基于范数的(NB)算法。该算法计算以接收信号协方差矩阵的归一化特征值和非线性缩放特征值为元素的向量的欧几里得范数以及相应的归一化指标。然后使用这些规范来区分最大的特征值和其余的特征值,从而允许估计源的数量。在本文中,我们提出了一种改进的基于范数(iNB)的算法,该算法使用0.55范数作为特征值分类的手段。与NB不同的是,iNB算法不使用非线性缩放,也不需要设置对NB算法正常运行至关重要的额外经验常数。与最小描述长度估计器MDL和Akaike信息准则AIC以及最近提出的基于随机矩阵理论(RMT)的估计器进行了比较。结果表明,在几种情况下,iNB算法可以优于这些估计器中的一个或多个,并且它总是优于NB算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信