Distributed hypothesis testing with variable-length coding

被引:1
作者
Salehkalaibar S. [1 ]
Wigger M. [2 ]
机构
[1] Department of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran
[2] Ltci, Telecom Paris, Paris
来源
IEEE Journal on Selected Areas in Information Theory | 2020年 / 1卷 / 03期
关键词
Discrete memoryless channels; Distributed hypothesis testing; Strong converse; Variable-length coding;
D O I
10.1109/JSAIT.2020.3039839
中图分类号
学科分类号
摘要
The problem of distributed testing against independence with variable-length coding is considered when the average and not the maximum communication load is constrained as in previous works. The paper characterizes the optimum type-II error exponent of a single-sensor single-decision center system given a maximum type-I error probability when communication is either over a noise-free rate-R link or over a noisy discrete memoryless channel (DMC) with stop-feedback. Specifically, let ∈ denote the maximum allowed type-I error probability. Then the optimum exponent of the system with a rate-R link under a constraint on the average communication load coincides with the optimum exponent of such a system with a rate R/(1 -∈) link under a maximum communication load constraint. A strong converse thus does not hold under an average communication load constraint. A similar observation also holds for testing against independence over DMCs. With variable-length coding and stopfeedback and under an average communication load constraint, the optimum type-II error exponent over a DMC of capacity C equals the optimum exponent under fixed-length coding and a maximum communication load constraint when communication is over a DMC of capacity C/(1 -∈). © 2020 IEEE Journal on Selected Areas in Information Theory.All right reserved.
引用
收藏
页码:681 / 694
页数:13
相关论文
共 33 条
[1]  
Ahlswede R., Csiszar I., Hypothesis testing with communication constraints, Ieee Trans. Inf. Theory, IT-32, 4, pp. 533-542, (1986)
[2]  
Han T.S., Hypothesis testing with multiterminal data compression, Ieee Trans. Inf. Theory, IT-33, 6, pp. 759-772, (1987)
[3]  
Shimokawa H., Han T., Amari S.I., Error bound for hypothesis testing with data compression, Proc. Ieee Int. Symp. Inf. Theory, (1994)
[4]  
Rahman M.S., Wagner A.B., On the optimality of binning for distributed hypothesis testing, Ieee Trans. Inf. Theory, 58, 10, pp. 6282-6303, (2012)
[5]  
Tian C., Chen J., Successive refinement for hypothesis testing and lossless one-helper problem, Ieee Trans. Inf. Theory, 54, 10, pp. 4666-4681, (2008)
[6]  
Weinberger N., Kochman Y., On the reliability function of distributed hypothesis testing under optimal detection, Ieee Trans. Inf. Theory, 65, 8, pp. 4940-4965, (2019)
[7]  
Zhao W., Lai L., Distributed testing against independence with multiple terminals, Proc. 52nd Allerton Conf. Commun Comput, pp. 1246-1251, (2014)
[8]  
Xiang Y., Kim Y.H., Interactive hypothesis testing against independence, Proc. Ieee Int. Symp. Inf. Theory, pp. 2840-2844, (2013)
[9]  
Chen Y., Blum R.S., Sadler B.M., Zhang J., Testing the structure of a Gaussian graphical model with reduced transmissions in a distributed setting, Ieee Trans. Signal Process., 67, 20, pp. 5391-5401, (2019)
[10]  
Zhang S., Khanduri P., Varshney P.K., Distributed sequential detection: Dependent observations and imperfect communication, Ieee Trans. Signal Process., 68, pp. 830-842, (2019)