{"title":"脉冲位置调制的组合优化——基于压缩感知和模数转换器的超宽带信号检测","authors":"Weidong Wang, Shafei Wang, Jun-an Yang, Hui Liu","doi":"10.1049/iet-spr.2015.0261","DOIUrl":null,"url":null,"abstract":"Pulse position modulation-ultra wideband (PPM–UWB) communication signal is hard to detect and sample directly, owing to its ultra-low power spectral density and wide bandwidth. There are already some researches on using analogue-to-information converter (AIC) technology and compressed sensing (CS) theory to under-sample and detect PPM-UWB communication signal, utilising its sparseness in time domain. However, greedy algorithm lacks of restriction on sparseness of reconstructed vector, while common restrictions on sparseness (e.g. convex optimisation) has high computational complexity. To solve these problems, a combinatorial optimisation method is proposed in this study to detect PPM–UWB communication signal based on CS and AIC. Reconstruction error and sparseness of reconstructed vector are restricted by l 2- and l p-norms, respectively. l p-norm (0 < p < 1), which is a non-convex function, has stricter restriction on sparseness than l 1-norm. Meanwhile, the steepest descent method is adopted for l p-norm optimisation, which can rapidly converge to objective values. Proposed method has more comprehensive restriction than greedy algorithm and convex optimisation, while maintain low complexity in computation as greedy algorithm. Numerical experiments demonstrate the validity of proposed method.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Combinatorial optimisation for pulse position modulation-ultra wideband signal detection based on compressed sensing and analogue-to-information converter\",\"authors\":\"Weidong Wang, Shafei Wang, Jun-an Yang, Hui Liu\",\"doi\":\"10.1049/iet-spr.2015.0261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pulse position modulation-ultra wideband (PPM–UWB) communication signal is hard to detect and sample directly, owing to its ultra-low power spectral density and wide bandwidth. There are already some researches on using analogue-to-information converter (AIC) technology and compressed sensing (CS) theory to under-sample and detect PPM-UWB communication signal, utilising its sparseness in time domain. However, greedy algorithm lacks of restriction on sparseness of reconstructed vector, while common restrictions on sparseness (e.g. convex optimisation) has high computational complexity. To solve these problems, a combinatorial optimisation method is proposed in this study to detect PPM–UWB communication signal based on CS and AIC. Reconstruction error and sparseness of reconstructed vector are restricted by l 2- and l p-norms, respectively. l p-norm (0 < p < 1), which is a non-convex function, has stricter restriction on sparseness than l 1-norm. Meanwhile, the steepest descent method is adopted for l p-norm optimisation, which can rapidly converge to objective values. Proposed method has more comprehensive restriction than greedy algorithm and convex optimisation, while maintain low complexity in computation as greedy algorithm. Numerical experiments demonstrate the validity of proposed method.\",\"PeriodicalId\":272888,\"journal\":{\"name\":\"IET Signal Process.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Signal Process.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/iet-spr.2015.0261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Signal Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/iet-spr.2015.0261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
脉冲位置调制-超宽带(PPM-UWB)通信信号由于其超低的功率谱密度和较宽的带宽,给直接检测和采样带来困难。利用模信转换器(AIC)技术和压缩感知(CS)理论,利用PPM-UWB通信信号在时域的稀疏性,对其进行欠采样和检测已经有了一些研究。然而,贪婪算法缺乏对重构向量稀疏性的限制,而常见的稀疏性限制(如凸优化)具有较高的计算复杂度。针对这些问题,本文提出了一种基于CS和AIC的PPM-UWB通信信号检测组合优化方法。重构向量的重构误差和稀疏度分别受1个2范数和1个p范数的限制。L p-范数(0 < p < 1)是非凸函数,它比L -范数对稀疏性有更严格的限制。同时,采用最陡下降法进行l -范数优化,可以快速收敛到目标值。该方法具有比贪心算法和凸优化更全面的约束,同时保持了贪心算法较低的计算复杂度。数值实验验证了该方法的有效性。
Combinatorial optimisation for pulse position modulation-ultra wideband signal detection based on compressed sensing and analogue-to-information converter
Pulse position modulation-ultra wideband (PPM–UWB) communication signal is hard to detect and sample directly, owing to its ultra-low power spectral density and wide bandwidth. There are already some researches on using analogue-to-information converter (AIC) technology and compressed sensing (CS) theory to under-sample and detect PPM-UWB communication signal, utilising its sparseness in time domain. However, greedy algorithm lacks of restriction on sparseness of reconstructed vector, while common restrictions on sparseness (e.g. convex optimisation) has high computational complexity. To solve these problems, a combinatorial optimisation method is proposed in this study to detect PPM–UWB communication signal based on CS and AIC. Reconstruction error and sparseness of reconstructed vector are restricted by l 2- and l p-norms, respectively. l p-norm (0 < p < 1), which is a non-convex function, has stricter restriction on sparseness than l 1-norm. Meanwhile, the steepest descent method is adopted for l p-norm optimisation, which can rapidly converge to objective values. Proposed method has more comprehensive restriction than greedy algorithm and convex optimisation, while maintain low complexity in computation as greedy algorithm. Numerical experiments demonstrate the validity of proposed method.