Channel Detection in Coded Communication

作     者：Weinberger, Nir Merhav, Neri 

作者机构：Technion Israel Inst Technol IL-32000 Haifa Israel Tel Aviv Univ IL-69978 Tel Aviv Israel 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE信息论汇刊)

年 卷 期：2017年第63卷第10期

页      面：6364-6392页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Israel Science Foundation [412/12] Jacobs scholarship 

主　　题：Detection complexity error exponents expurgated bounds false alarm joint detection/decoding misdetection mismatch detection random coding universal detection 

摘      要：The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The simplified case where each of the sets is a singleton is studied first. The decoding error, false alarm, and misdetection probabilities of a given code are defined, and the optimum detection/decoding rule in a generalized Neyman-Pearson sense is derived. Sub-optimal detection/decoding rules are also introduced which are simpler to implement. Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder. The random coding analysis is then extended to general sets of channels, and an asymptotically optimal detector/decoder under a worst case formulation of the error probabilities is derived, as well as its random coding exponents. The case of a pair of binary symmetric channels is discussed in detail.