{"title":"宽带认知无线电低复杂度序列非参数信号分类","authors":"Mario Bkassiny, S. Jayaweera","doi":"10.1109/TSSA.2014.7065908","DOIUrl":null,"url":null,"abstract":"This paper addresses the computational complexity of the Dirichlet process mixture model (DPMM)-based Bayesian non-parametric classifier in cognitive radios (CR's). The DPMM is an ideal signal classification tool for wideband CR's (W-CR's) due to its non-parametric structure. However, it can incur a high computational complexity since it usually requires a large number of Gibbs sampling iterations. To address this issue, we first propose a parameter selection policy that efficiently selects the cluster parameters at each Gibbs sampling iteration, leading to a faster convergence to the stationary distribution of the underlying Markov Chain Monte Carlo (MCMC). Next, we propose a sequential DPMM classifier based on a recursive formulation that allows real-time classification of newly detected signals. The proposed algorithms are shown to significantly reduce the computational burden of the DPMM-based classifier, making it suitable for both large-scale and real-time CR applications.","PeriodicalId":169550,"journal":{"name":"2014 8th International Conference on Telecommunication Systems Services and Applications (TSSA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low-complexity sequential non-parametric signal classification for wideband cognitive radios\",\"authors\":\"Mario Bkassiny, S. Jayaweera\",\"doi\":\"10.1109/TSSA.2014.7065908\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the computational complexity of the Dirichlet process mixture model (DPMM)-based Bayesian non-parametric classifier in cognitive radios (CR's). The DPMM is an ideal signal classification tool for wideband CR's (W-CR's) due to its non-parametric structure. However, it can incur a high computational complexity since it usually requires a large number of Gibbs sampling iterations. To address this issue, we first propose a parameter selection policy that efficiently selects the cluster parameters at each Gibbs sampling iteration, leading to a faster convergence to the stationary distribution of the underlying Markov Chain Monte Carlo (MCMC). Next, we propose a sequential DPMM classifier based on a recursive formulation that allows real-time classification of newly detected signals. The proposed algorithms are shown to significantly reduce the computational burden of the DPMM-based classifier, making it suitable for both large-scale and real-time CR applications.\",\"PeriodicalId\":169550,\"journal\":{\"name\":\"2014 8th International Conference on Telecommunication Systems Services and Applications (TSSA)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 8th International Conference on Telecommunication Systems Services and Applications (TSSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSSA.2014.7065908\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 8th International Conference on Telecommunication Systems Services and Applications (TSSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSSA.2014.7065908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low-complexity sequential non-parametric signal classification for wideband cognitive radios
This paper addresses the computational complexity of the Dirichlet process mixture model (DPMM)-based Bayesian non-parametric classifier in cognitive radios (CR's). The DPMM is an ideal signal classification tool for wideband CR's (W-CR's) due to its non-parametric structure. However, it can incur a high computational complexity since it usually requires a large number of Gibbs sampling iterations. To address this issue, we first propose a parameter selection policy that efficiently selects the cluster parameters at each Gibbs sampling iteration, leading to a faster convergence to the stationary distribution of the underlying Markov Chain Monte Carlo (MCMC). Next, we propose a sequential DPMM classifier based on a recursive formulation that allows real-time classification of newly detected signals. The proposed algorithms are shown to significantly reduce the computational burden of the DPMM-based classifier, making it suitable for both large-scale and real-time CR applications.