{"title":"Generation of rejection method bounds for spherically invariant random vectors","authors":"A. D. Keckler, D. Weiner","doi":"10.1109/NRC.2002.999690","DOIUrl":null,"url":null,"abstract":"Based upon the central limit theorem, random clutter returns are commonly modeled as Gaussian. Nevertheless, many situations arise in practice where the data are clearly non-Gaussian, as is seen with \"spiky\" radar clutter. Spherically invariant random vectors (SIRVs) are especially attractive for modeling correlated non-Gaussian clutter. This paper discusses the computer simulation of SIRVs for Monte Carlo purposes using the rejection method. A key requirement of the rejection method is the ability to find a tight bound of the probability density function, from which random samples can be readily generated. An automated technique for generating this bound for the SIRV probability density function is presented.","PeriodicalId":448055,"journal":{"name":"Proceedings of the 2002 IEEE Radar Conference (IEEE Cat. No.02CH37322)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 IEEE Radar Conference (IEEE Cat. No.02CH37322)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRC.2002.999690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Based upon the central limit theorem, random clutter returns are commonly modeled as Gaussian. Nevertheless, many situations arise in practice where the data are clearly non-Gaussian, as is seen with "spiky" radar clutter. Spherically invariant random vectors (SIRVs) are especially attractive for modeling correlated non-Gaussian clutter. This paper discusses the computer simulation of SIRVs for Monte Carlo purposes using the rejection method. A key requirement of the rejection method is the ability to find a tight bound of the probability density function, from which random samples can be readily generated. An automated technique for generating this bound for the SIRV probability density function is presented.