{"title":"共阵域非整数线性天线阵列的在线DOA估计","authors":"Yitian Chen, H. Nosrati, E. Aboutanios","doi":"10.1109/mlsp52302.2021.9596114","DOIUrl":null,"url":null,"abstract":"We study low complexity direction of arrival (DOA) estimation in noninteger nonuniform antenna arrays with the same number as or more uncorrelated sources than sensors. We employ the maximum entropy (ME) method to solve the matrix completion problem that arises due to having an incomplete set of lags in the coarray. In order to decrease the computational complexity associated with the determinant maximization in the ME completion method, we present a projection-free online convex optimization (OCO) based on the conditional gradient method. We then frame the problem as a sequence of DOA estimation scenarios with varying directions in which a tight bound on total regret minimization is guaranteed by the employed unsupervised learning technique. We evaluate the performance using numerical examples and demonstrate that the proposed method decreases the root mean squared error (RMSE) as the iterations increase. Furthermore, our method approaches the RMSE of the offline method, exhibiting the same saturation behavior as the CRB.","PeriodicalId":156116,"journal":{"name":"2021 IEEE 31st International Workshop on Machine Learning for Signal Processing (MLSP)","volume":"51 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online DOA Estimation for Noninteger Linear Antenna Arrays in Coarray Domain\",\"authors\":\"Yitian Chen, H. Nosrati, E. Aboutanios\",\"doi\":\"10.1109/mlsp52302.2021.9596114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study low complexity direction of arrival (DOA) estimation in noninteger nonuniform antenna arrays with the same number as or more uncorrelated sources than sensors. We employ the maximum entropy (ME) method to solve the matrix completion problem that arises due to having an incomplete set of lags in the coarray. In order to decrease the computational complexity associated with the determinant maximization in the ME completion method, we present a projection-free online convex optimization (OCO) based on the conditional gradient method. We then frame the problem as a sequence of DOA estimation scenarios with varying directions in which a tight bound on total regret minimization is guaranteed by the employed unsupervised learning technique. We evaluate the performance using numerical examples and demonstrate that the proposed method decreases the root mean squared error (RMSE) as the iterations increase. Furthermore, our method approaches the RMSE of the offline method, exhibiting the same saturation behavior as the CRB.\",\"PeriodicalId\":156116,\"journal\":{\"name\":\"2021 IEEE 31st International Workshop on Machine Learning for Signal Processing (MLSP)\",\"volume\":\"51 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 31st International Workshop on Machine Learning for Signal Processing (MLSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/mlsp52302.2021.9596114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 31st International Workshop on Machine Learning for Signal Processing (MLSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/mlsp52302.2021.9596114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Online DOA Estimation for Noninteger Linear Antenna Arrays in Coarray Domain
We study low complexity direction of arrival (DOA) estimation in noninteger nonuniform antenna arrays with the same number as or more uncorrelated sources than sensors. We employ the maximum entropy (ME) method to solve the matrix completion problem that arises due to having an incomplete set of lags in the coarray. In order to decrease the computational complexity associated with the determinant maximization in the ME completion method, we present a projection-free online convex optimization (OCO) based on the conditional gradient method. We then frame the problem as a sequence of DOA estimation scenarios with varying directions in which a tight bound on total regret minimization is guaranteed by the employed unsupervised learning technique. We evaluate the performance using numerical examples and demonstrate that the proposed method decreases the root mean squared error (RMSE) as the iterations increase. Furthermore, our method approaches the RMSE of the offline method, exhibiting the same saturation behavior as the CRB.