{"title":"解耦根music算法的多维谐波检索","authors":"R. Boyer","doi":"10.1109/SPAWC.2008.4641561","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a decoupled root-MUSIC algorithm adapted to the multidimensional harmonic model, which is widely used in MIMO channel sounding. The optimization criterion of the proposed algorithm is based on multidimensional orthogonal condition testings between a tensor steering manifold parameterized by the parameters of interest and a set of orthogonal projectors associated with each dimension. This criterion can be viewed as a set of decoupled estimation subproblems and allows the use of fast polynomial rooting techniques. In consequence, the proposed algorithm is highly scalable, parallelizable and avoids costly enumerative-based search. However, decoupling property implies to correctly pair the estimated model parameters. So, we propose a fast automatic pairing procedure based on the exploitation of the Vandermonde-structure preserving property of the alternating least squares candecomp/parafac (ALS-CP) algorithm. In addition, we study in a first time the case of a single snapshot and we generalize our algorithm to the multiple snapshots scenario. Finally, by means of numerical simulations, we show that the proposed scheme is efficient for one order of magnitude less complex than other standard algorithms.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Decoupled root-MUSIC algorithm for Multidimensional Harmonic retrieval\",\"authors\":\"R. Boyer\",\"doi\":\"10.1109/SPAWC.2008.4641561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a decoupled root-MUSIC algorithm adapted to the multidimensional harmonic model, which is widely used in MIMO channel sounding. The optimization criterion of the proposed algorithm is based on multidimensional orthogonal condition testings between a tensor steering manifold parameterized by the parameters of interest and a set of orthogonal projectors associated with each dimension. This criterion can be viewed as a set of decoupled estimation subproblems and allows the use of fast polynomial rooting techniques. In consequence, the proposed algorithm is highly scalable, parallelizable and avoids costly enumerative-based search. However, decoupling property implies to correctly pair the estimated model parameters. So, we propose a fast automatic pairing procedure based on the exploitation of the Vandermonde-structure preserving property of the alternating least squares candecomp/parafac (ALS-CP) algorithm. In addition, we study in a first time the case of a single snapshot and we generalize our algorithm to the multiple snapshots scenario. Finally, by means of numerical simulations, we show that the proposed scheme is efficient for one order of magnitude less complex than other standard algorithms.\",\"PeriodicalId\":197154,\"journal\":{\"name\":\"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2008.4641561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decoupled root-MUSIC algorithm for Multidimensional Harmonic retrieval
In this paper, we propose a decoupled root-MUSIC algorithm adapted to the multidimensional harmonic model, which is widely used in MIMO channel sounding. The optimization criterion of the proposed algorithm is based on multidimensional orthogonal condition testings between a tensor steering manifold parameterized by the parameters of interest and a set of orthogonal projectors associated with each dimension. This criterion can be viewed as a set of decoupled estimation subproblems and allows the use of fast polynomial rooting techniques. In consequence, the proposed algorithm is highly scalable, parallelizable and avoids costly enumerative-based search. However, decoupling property implies to correctly pair the estimated model parameters. So, we propose a fast automatic pairing procedure based on the exploitation of the Vandermonde-structure preserving property of the alternating least squares candecomp/parafac (ALS-CP) algorithm. In addition, we study in a first time the case of a single snapshot and we generalize our algorithm to the multiple snapshots scenario. Finally, by means of numerical simulations, we show that the proposed scheme is efficient for one order of magnitude less complex than other standard algorithms.