{"id":{"repo_id":"queens","oai_identifier":"oai:queensu.scholaris.ca:1974/13811"},"canonical_url":"https://search.dev.ndltd.org/etd/queens/oai:queensu.scholaris.ca:1974/13811","repository":{"repo_id":"queens","name":"Queens University","base_url":"https://qspace.library.queensu.ca/server/oai/request"},"display":{"title":"Optimal and Suboptimal Signal Detection-On the Relationship Between Estimation and Detection Theory","abstract":"In this thesis, we consider a general binary and M-ary hypothesis testing problems with unknown parameters. In a hypothesis testing problem, we assume that the probability density function (pdf) of observation is given while some unknown parameters exit in the structure of the pdf and the set of unknowns under each hypothesis is given. In the first part of this study, for a binary composite testing, we prove that the Minimum Variance and Unbiased Estimator of a Separating Function (SF) serves as the optimal decision statistic for the Uniformly Most Powerful (UMP) unbiased test. In many problems, the UMP test does not exist. For such cases, we introduce new suboptimal SF-Estimator Tests (SFETs) which are easy to derive for many problems. In the second part, we study the relationship between Constant False Alarm Rate (CFAR) and invariant tests. We generally show that for a family of distributions, the unknown parameters are eliminated from the distribution of the maximal invariant statistic under the Minimal Invariant Group (MIG) while the maximum information of the observed signal is preserved. We prove that any invariant test with respect to the MIG is CFAR. Then, we introduce the UMP-CFAR test as the optimal CFAR bound among all CFAR tests. In the third part, the asymptotical optimality of the CFAR tests is studied after reduction using MIG. We show that the CFAR tests obtained after MIG reduction using the Wald test is SFET and the Generalized Likelihood Ratio Test and the Rao test are asymptotically optimal. To find an improved test, we maximize the asymptotic probability of detection of the SFET using the Maximum Likelihood Estimation (MLE). We propose a systematic method allowing to derive the Asymptotically Optimal SFET. Finally, we extend the concept of SFET to the M-ary hypothesis testing. Defining M different SFs for an M-ary problem, we show that the optimal minimum error test is achieved using the MLE of SFs. Moreover, in the case that the optimal minimum error test does not exist, the error probability of the proposed SFET tends to zero when the number of independent observations tends to infinity.","abstract_html":"In this thesis, we consider a general binary and M-ary hypothesis testing problems with unknown parameters. In a hypothesis testing problem, we assume that the probability density function (pdf) of observation is given while some unknown parameters exit in the structure of the pdf and the set of unknowns under each hypothesis is given. In the first part of this study, for a binary composite testing, we prove that the Minimum Variance and Unbiased Estimator of a Separating Function (SF) serves as the optimal decision statistic for the Uniformly Most Powerful (UMP) unbiased test. In many problems, the UMP test does not exist. For such cases, we introduce new suboptimal SF-Estimator Tests (SFETs) which are easy to derive for many problems. In the second part, we study the relationship between Constant False Alarm Rate (CFAR) and invariant tests. We generally show that for a family of distributions, the unknown parameters are eliminated from the distribution of the maximal invariant statistic under the Minimal Invariant Group (MIG) while the maximum information of the observed signal is preserved. We prove that any invariant test with respect to the MIG is CFAR. Then, we introduce the UMP-CFAR test as the optimal CFAR bound among all CFAR tests. In the third part, the asymptotical optimality of the CFAR tests is studied after reduction using MIG. We show that the CFAR tests obtained after MIG reduction using the Wald test is SFET and the Generalized Likelihood Ratio Test and the Rao test are asymptotically optimal. To find an improved test, we maximize the asymptotic probability of detection of the SFET using the Maximum Likelihood Estimation (MLE). We propose a systematic method allowing to derive the Asymptotically Optimal SFET. Finally, we extend the concept of SFET to the M-ary hypothesis testing. Defining M different SFs for an M-ary problem, we show that the optimal minimum error test is achieved using the MLE of SFs. Moreover, in the case that the optimal minimum error test does not exist, the error probability of the proposed SFET tends to zero when the number of independent observations tends to infinity.","abstract_has_math":false,"creators":["Ghobadzadeh, Ali"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Gazor, Saeed"],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-10-27","date_published":"2015-10-27","updated_at":"2026-07-27T20:35:35Z","subjects":["Detection Theory","Invariant tests","CFAR","Estimation Theory"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1974/13811","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Gazor, Saeed"]},{"key":"dc:creator","label":"Author","values":["Ghobadzadeh, Ali"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-10-25 20:40:41.828"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-10-27T17:50:57Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-10-27T17:50:57Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-10-27"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Detection Theory","Invariant tests","CFAR","Estimation Theory"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1974/13811"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2015-10-25 20:40:41.828"]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we consider a general binary and M-ary hypothesis testing problems with unknown parameters. In a hypothesis testing problem, we assume that the probability density function (pdf) of observation is given while some unknown parameters exit in the structure of the pdf and the set of unknowns under each hypothesis is given. In the first part of this study, for a binary composite testing, we prove that the Minimum Variance and Unbiased Estimator of a Separating Function (SF) serves as the optimal decision statistic for the Uniformly Most Powerful (UMP) unbiased test. In many problems, the UMP test does not exist. For such cases, we introduce new suboptimal SF-Estimator Tests (SFETs) which are easy to derive for many problems. In the second part, we study the relationship between Constant False Alarm Rate (CFAR) and invariant tests. We generally show that for a family of distributions, the unknown parameters are eliminated from the distribution of the maximal invariant statistic under the Minimal Invariant Group (MIG) while the maximum information of the observed signal is preserved. We prove that any invariant test with respect to the MIG is CFAR. Then, we introduce the UMP-CFAR test as the optimal CFAR bound among all CFAR tests. In the third part, the asymptotical optimality of the CFAR tests is studied after reduction using MIG. We show that the CFAR tests obtained after MIG reduction using the Wald test is SFET and the Generalized Likelihood Ratio Test and the Rao test are asymptotically optimal. To find an improved test, we maximize the asymptotic probability of detection of the SFET using the Maximum Likelihood Estimation (MLE). We propose a systematic method allowing to derive the Asymptotically Optimal SFET. Finally, we extend the concept of SFET to the M-ary hypothesis testing. Defining M different SFs for an M-ary problem, we show that the optimal minimum error test is achieved using the MLE of SFs. Moreover, in the case that the optimal minimum error test does not exist, the error probability of the proposed SFET tends to zero when the number of independent observations tends to infinity."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["PhD"]},{"key":"dc:title","label":"Title","values":["Optimal and Suboptimal Signal Detection-On the Relationship Between Estimation and Detection Theory"]}]}],"canonical_facts":{"dc:contributor.department":["Electrical and Computer Engineering"],"dc:contributor.supervisor":["Gazor, Saeed"],"dc:creator":["Ghobadzadeh, Ali"],"dc:date":["2015-10-25 20:40:41.828"],"dc:date.accessioned":["2015-10-27T17:50:57Z"],"dc:date.available":["2015-10-27T17:50:57Z"],"dc:date.issued":["2015-10-27"],"dc:description":["Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2015-10-25 20:40:41.828"],"dc:description.abstract":["In this thesis, we consider a general binary and M-ary hypothesis testing problems with unknown parameters. In a hypothesis testing problem, we assume that the probability density function (pdf) of observation is given while some unknown parameters exit in the structure of the pdf and the set of unknowns under each hypothesis is given. In the first part of this study, for a binary composite testing, we prove that the Minimum Variance and Unbiased Estimator of a Separating Function (SF) serves as the optimal decision statistic for the Uniformly Most Powerful (UMP) unbiased test. In many problems, the UMP test does not exist. For such cases, we introduce new suboptimal SF-Estimator Tests (SFETs) which are easy to derive for many problems. In the second part, we study the relationship between Constant False Alarm Rate (CFAR) and invariant tests. We generally show that for a family of distributions, the unknown parameters are eliminated from the distribution of the maximal invariant statistic under the Minimal Invariant Group (MIG) while the maximum information of the observed signal is preserved. We prove that any invariant test with respect to the MIG is CFAR. Then, we introduce the UMP-CFAR test as the optimal CFAR bound among all CFAR tests. In the third part, the asymptotical optimality of the CFAR tests is studied after reduction using MIG. We show that the CFAR tests obtained after MIG reduction using the Wald test is SFET and the Generalized Likelihood Ratio Test and the Rao test are asymptotically optimal. To find an improved test, we maximize the asymptotic probability of detection of the SFET using the Maximum Likelihood Estimation (MLE). We propose a systematic method allowing to derive the Asymptotically Optimal SFET. Finally, we extend the concept of SFET to the M-ary hypothesis testing. Defining M different SFs for an M-ary problem, we show that the optimal minimum error test is achieved using the MLE of SFs. Moreover, in the case that the optimal minimum error test does not exist, the error probability of the proposed SFET tends to zero when the number of independent observations tends to infinity."],"dc:description.degree":["PhD"],"dc:identifier.uri":["http://hdl.handle.net/1974/13811"],"dc:language.iso":["eng"],"dc:subject":["Detection Theory","Invariant tests","CFAR","Estimation Theory"],"dc:title":["Optimal and Suboptimal Signal Detection-On the Relationship Between Estimation and Detection Theory"],"dc:type":["thesis"]},"updated_at":"2026-07-27T20:35:35Z"}