Autocorrelation-based quickest change detection

dc.contributor.authorAfser, Huseyin
dc.contributor.authorYabaci, Seyhun Barbaros
dc.date.accessioned2025-01-06T17:30:12Z
dc.date.available2025-01-06T17:30:12Z
dc.date.issued2020
dc.description.abstractWe 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.
dc.identifier.doi10.1109/LCOMM.2020.3016652
dc.identifier.endpage2916
dc.identifier.issn1089-7798
dc.identifier.issue12
dc.identifier.scopus2-s2.0-85097802250
dc.identifier.scopusqualityQ1
dc.identifier.startpage2913
dc.identifier.urihttps://doi.org/10.1109/LCOMM.2020.3016652
dc.identifier.urihttps://hdl.handle.net/20.500.14669/1517
dc.identifier.volume24
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartofIEEE Communications Letters
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_20241211
dc.subjectautocorrelation detection
dc.subjectcumulative sum algorithm
dc.subjectenergy detection
dc.subjectQuickest detection
dc.titleAutocorrelation-based quickest change detection
dc.typeArticle

Dosyalar