Afser, HuseyinYabaci, Seyhun Barbaros2025-01-062025-01-0620201089-779810.1109/LCOMM.2020.30166522-s2.0-85097802250https://doi.org/10.1109/LCOMM.2020.3016652https://hdl.handle.net/20.500.14669/1517We consider the utilization of the autocorrelation information for aiding the quickest detection problem. Specifically, we investigate the problem of quickly detecting a Gaussian source with autocorrelation such that some of its symbols are repeated as cyclic prefixes. Based on the cumulative sum algorithm, we propose a method which takes advantage of this autocorrelation in order to provide performance improvement compared to the classical energy based detection of the uncorrelated source. © 1997-2012 IEEE.eninfo:eu-repo/semantics/closedAccessautocorrelation detectioncumulative sum algorithmenergy detectionQuickest detectionArticle291612Q1291324