Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282965
Wenwen Zhao, L. Lai
Motivated by distributed inference over big datasets problems, we study multi-terminal distributed hypothesis testing problems in which each terminal has data related to only one random variable. We consider a case of practical interest in which each terminal is allowed to send zero-rate messages to a decision maker. Subject to a constraint that the error exponent of the type 1 error probability is larger than a certain level, we characterize the best error exponent of the type 2 error probability using basic properties of the r-divergent sequences.
{"title":"Distributed testing with zero-rate compression","authors":"Wenwen Zhao, L. Lai","doi":"10.1109/ISIT.2015.7282965","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282965","url":null,"abstract":"Motivated by distributed inference over big datasets problems, we study multi-terminal distributed hypothesis testing problems in which each terminal has data related to only one random variable. We consider a case of practical interest in which each terminal is allowed to send zero-rate messages to a decision maker. Subject to a constraint that the error exponent of the type 1 error probability is larger than a certain level, we characterize the best error exponent of the type 2 error probability using basic properties of the r-divergent sequences.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115682554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282778
Jing Yue, Zihuai Lin, Guoqiang Mao, B. Vucetic
In this paper, we investigate the performance of a wireless sensor network, in which multiple groups of source nodes communicate with their respective destination nodes with the help of a common relay network. A network code division multiplexing (NCDM) scheme is proposed to remove the inter-session interference among multiple transmission sessions at each destination. We focus on analyzing the soft processing algorithm of the NCDM scheme. Based on the analysis results, a new code design criteria for the construction of the generator matrix is proposed. Simulation results show that by following the proposed code design criteria, the bit error ratio (BER) performance gap between the scheme we studied and the serial session scheme can be managed effectively. In serial session scheme, source nodes in a number of groups communicate with their respective destinations in a time division manner.
{"title":"Design and performance analysis of network code division multiplexing for wireless sensor networks","authors":"Jing Yue, Zihuai Lin, Guoqiang Mao, B. Vucetic","doi":"10.1109/ISIT.2015.7282778","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282778","url":null,"abstract":"In this paper, we investigate the performance of a wireless sensor network, in which multiple groups of source nodes communicate with their respective destination nodes with the help of a common relay network. A network code division multiplexing (NCDM) scheme is proposed to remove the inter-session interference among multiple transmission sessions at each destination. We focus on analyzing the soft processing algorithm of the NCDM scheme. Based on the analysis results, a new code design criteria for the construction of the generator matrix is proposed. Simulation results show that by following the proposed code design criteria, the bit error ratio (BER) performance gap between the scheme we studied and the serial session scheme can be managed effectively. In serial session scheme, source nodes in a number of groups communicate with their respective destinations in a time division manner.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124441781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282515
Siddhartha Satpathi, Luca Baldassarre, V. Cevher
We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. We discuss the tractability of this problem, present a polynomial-time dynamic program for special group structures and propose two novel greedy algorithms with efficient implementations. The first is based on submodular function maximization with knapsack constraints. For the case of tree sparsity, its approximation ratio of 1 - 1/e is better than current state-of-the-art approximate algorithms. The second algorithm leverages ideas from the greedy algorithm for the Budgeted Maximum Coverage problem and obtains excellent empirical performance, shown by computing the full Pareto frontier of the tree approximations of the wavelet coefficients of an image.
{"title":"Sparse group covers and greedy tree approximations","authors":"Siddhartha Satpathi, Luca Baldassarre, V. Cevher","doi":"10.1109/ISIT.2015.7282515","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282515","url":null,"abstract":"We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. We discuss the tractability of this problem, present a polynomial-time dynamic program for special group structures and propose two novel greedy algorithms with efficient implementations. The first is based on submodular function maximization with knapsack constraints. For the case of tree sparsity, its approximation ratio of 1 - 1/e is better than current state-of-the-art approximate algorithms. The second algorithm leverages ideas from the greedy algorithm for the Budgeted Maximum Coverage problem and obtains excellent empirical performance, shown by computing the full Pareto frontier of the tree approximations of the wavelet coefficients of an image.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"74 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282438
P. Jacquet
We want to estimate the capacity of wireless networks under several models and several geometric assumptions. We consider that all nodes transmit to a single fixed access point. The nodes are randomly distributed in an infinite fractal Cantor map embedded in a space of dimension D, a model which is more realistic than the classic piecemeal uniform map model. We consider three capacity models, one is a theoretical upper bound, the two other are variations on outage capacities.
{"title":"Optimized outage capacity in random wireless networks in uniform and fractal maps","authors":"P. Jacquet","doi":"10.1109/ISIT.2015.7282438","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282438","url":null,"abstract":"We want to estimate the capacity of wireless networks under several models and several geometric assumptions. We consider that all nodes transmit to a single fixed access point. The nodes are randomly distributed in an infinite fractal Cantor map embedded in a space of dimension D, a model which is more realistic than the classic piecemeal uniform map model. We consider three capacity models, one is a theoretical upper bound, the two other are variations on outage capacities.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"72 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282833
Louis Tan, K. Mahdaviani, A. Khisti, E. Soljanin
We study a source-broadcasting problem involving an erasure broadcast channel with feedback. The receivers each require a certain fraction of a source sequence, and we are interested in the minimum latency, or transmission time, required to serve them all. We first show that for a two-user broadcast channel, a point-to-point outer bound can always be achieved. For broadcasting to three users, we propose a queue-based hybrid digital-analog coding scheme that achieves optimal performance for the duration of analog transmissions. We propose a method of characterizing the number of analog transmissions that can be sent, which involves solving a linear program, and furthermore give sufficient conditions for which all users can be optimal. In some cases, we find that users can be point-to-point optimal regardless of their distortion constraints. Finally, we propose a channel coding phase for when the analog transmissions are insufficient in meeting user demands and provide simulations that highlight the benefits of feedback.
{"title":"Coding for source-broadcasting over erasure channels with feedback","authors":"Louis Tan, K. Mahdaviani, A. Khisti, E. Soljanin","doi":"10.1109/ISIT.2015.7282833","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282833","url":null,"abstract":"We study a source-broadcasting problem involving an erasure broadcast channel with feedback. The receivers each require a certain fraction of a source sequence, and we are interested in the minimum latency, or transmission time, required to serve them all. We first show that for a two-user broadcast channel, a point-to-point outer bound can always be achieved. For broadcasting to three users, we propose a queue-based hybrid digital-analog coding scheme that achieves optimal performance for the duration of analog transmissions. We propose a method of characterizing the number of analog transmissions that can be sent, which involves solving a linear program, and furthermore give sufficient conditions for which all users can be optimal. In some cases, we find that users can be point-to-point optimal regardless of their distortion constraints. Finally, we propose a channel coding phase for when the analog transmissions are insufficient in meeting user demands and provide simulations that highlight the benefits of feedback.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282765
F. Calmon, A. Makhdoumi, M. Médard
We investigate the problem of intentionally disclosing information about a set of measurement points X (useful information), while guaranteeing that little or no information is revealed about a private variable S (private information). Given that S and X are drawn from a finite set with joint distribution pS,X, we prove that a non-trivial amount of useful information can be disclosed while not disclosing any private information if and only if the smallest principal inertia component of the joint distribution of S and X is 0. This fundamental result characterizes when useful information can be privately disclosed for any privacy metric based on statistical dependence. We derive sharp bounds for the tradeoff between disclosure of useful and private information, and provide explicit constructions of privacy-assuring mappings that achieve these bounds.
{"title":"Fundamental limits of perfect privacy","authors":"F. Calmon, A. Makhdoumi, M. Médard","doi":"10.1109/ISIT.2015.7282765","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282765","url":null,"abstract":"We investigate the problem of intentionally disclosing information about a set of measurement points X (useful information), while guaranteeing that little or no information is revealed about a private variable S (private information). Given that S and X are drawn from a finite set with joint distribution pS,X, we prove that a non-trivial amount of useful information can be disclosed while not disclosing any private information if and only if the smallest principal inertia component of the joint distribution of S and X is 0. This fundamental result characterizes when useful information can be privately disclosed for any privacy metric based on statistical dependence. We derive sharp bounds for the tradeoff between disclosure of useful and private information, and provide explicit constructions of privacy-assuring mappings that achieve these bounds.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121344311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282476
A. Pastore, M. Gastpar
For fast-fading memoryless single-user channels, we present new rate expressions that are achievable with i.i.d. Gaussian codes and successive nearest-neighbor decoders based on a Euclidian distance metric. The use of successive decoding is motivated by two factors: firstly, it was recently discovered that successive decoding potentially enhances achievable rates on single-user channels with imperfect channel-state information at the receiver (semicoherent channels); secondly, in the limit as the number of decoding steps tends to infinity, some of these rate expressions become tractable and expressible as integrals. To offer a unified view, we choose to put all rate expressions-old and new-into this integral representation inspired by the infinitesimal successive-decoding approach, in order to unveal their similarities.
{"title":"A unified view on nearest-neighbor decoding rates for noncoherent and semicoherent fading channels","authors":"A. Pastore, M. Gastpar","doi":"10.1109/ISIT.2015.7282476","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282476","url":null,"abstract":"For fast-fading memoryless single-user channels, we present new rate expressions that are achievable with i.i.d. Gaussian codes and successive nearest-neighbor decoders based on a Euclidian distance metric. The use of successive decoding is motivated by two factors: firstly, it was recently discovered that successive decoding potentially enhances achievable rates on single-user channels with imperfect channel-state information at the receiver (semicoherent channels); secondly, in the limit as the number of decoding steps tends to infinity, some of these rate expressions become tractable and expressible as integrals. To offer a unified view, we choose to put all rate expressions-old and new-into this integral representation inspired by the infinitesimal successive-decoding approach, in order to unveal their similarities.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125097623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282770
Masahito Hayashi, V. Tan
The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method, a sequence of codes of increasing blocklengths n is designed to illustrate this tradeoff. Furthermore, for additive discrete memoryless channels, the ensemble performance of a sequence of random codes is also analyzed to demonstrate the optimality of the above-mentioned codes. The tradeoff between the code rate, undetected and total errors as well as the threshold in a generalized likelihood ratio test is characterized asymptotically. In particular, the code rate tends to the capacity of the channel at a rate slower than n-1/2 corresponding to the moderate deviations regime. In this case, both error probabilities decay subexponentially and asymmetrically. The precise decay rates are characterized. The proof techniques involve applications of a modified (or “shifted”) version of the Gärtner-Ellis theorem and the type class enumerator method to characterize the asymptotic behavior of a sequence of cumulant generating functions.
{"title":"Erasure and undetected error probabilities in the moderate deviations regime","authors":"Masahito Hayashi, V. Tan","doi":"10.1109/ISIT.2015.7282770","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282770","url":null,"abstract":"The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method, a sequence of codes of increasing blocklengths n is designed to illustrate this tradeoff. Furthermore, for additive discrete memoryless channels, the ensemble performance of a sequence of random codes is also analyzed to demonstrate the optimality of the above-mentioned codes. The tradeoff between the code rate, undetected and total errors as well as the threshold in a generalized likelihood ratio test is characterized asymptotically. In particular, the code rate tends to the capacity of the channel at a rate slower than n-1/2 corresponding to the moderate deviations regime. In this case, both error probabilities decay subexponentially and asymmetrically. The precise decay rates are characterized. The proof techniques involve applications of a modified (or “shifted”) version of the Gärtner-Ellis theorem and the type class enumerator method to characterize the asymptotic behavior of a sequence of cumulant generating functions.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"46 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123420666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282985
Tarik Benaddi, C. Poulliat, M. Boucheret, B. Gadat, G. Lesthievent
In this paper, we provide a proof for the conjecture made by Abu Surra et al. [1] to simplify the computation of ensemble input output weight enumerators for protograph-based low density parity check (LDPC) codes. Furthermore, we propose a new method to compute more efficiently the ensemble weight enumerator. This approach can be applied particularly to lighten the computations for high rate codes, generalized LDPC codes or spatially coupled LDPC codes.
{"title":"Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration","authors":"Tarik Benaddi, C. Poulliat, M. Boucheret, B. Gadat, G. Lesthievent","doi":"10.1109/ISIT.2015.7282985","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282985","url":null,"abstract":"In this paper, we provide a proof for the conjecture made by Abu Surra et al. [1] to simplify the computation of ensemble input output weight enumerators for protograph-based low density parity check (LDPC) codes. Furthermore, we propose a new method to compute more efficiently the ensemble weight enumerator. This approach can be applied particularly to lighten the computations for high rate codes, generalized LDPC codes or spatially coupled LDPC codes.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125291940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-06-14DOI: 10.1109/ISIT.2015.7282475
K. Nguyen, R. Timo, L. Rasmussen
We propose a rate-adaptive error-correction coding framework for transmission over finite-length block-fading channels, with causal channel state information at the transmitter. A dynamic programming optimization approach can be use to obtain the optimal rate adaptation strategy. A suboptimal rate adaptation strategy is developed for sequential random codes. Numerical results show that significant performance gains are achievable with the proposed adaptation scheme.
{"title":"Causal-CSIT rate adaptation for block-fading channels","authors":"K. Nguyen, R. Timo, L. Rasmussen","doi":"10.1109/ISIT.2015.7282475","DOIUrl":"https://doi.org/10.1109/ISIT.2015.7282475","url":null,"abstract":"We propose a rate-adaptive error-correction coding framework for transmission over finite-length block-fading channels, with causal channel state information at the transmitter. A dynamic programming optimization approach can be use to obtain the optimal rate adaptation strategy. A suboptimal rate adaptation strategy is developed for sequential random codes. Numerical results show that significant performance gains are achievable with the proposed adaptation scheme.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116103154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：