发布求助
文献互助 智能选刊 最新文献

2019 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Secrecy and Error Exponents of k-Transmitter Multiple Access Wire-tap Channel k-发射机多址有线监听信道的保密性和误差指数
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989099
Masahito Hayashi, Yanling Chen
{"title":"Secrecy and Error Exponents of k-Transmitter Multiple Access Wire-tap Channel","authors":"Masahito Hayashi, Yanling Chen","doi":"10.1109/ITW44776.2019.8989099","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989099","url":null,"abstract":"This paper strengthens the known secrecy results for a k-transmitter multiple access channel (MAC) with an external eavesdropper from weak to strong without any rate loss on the achievable region. More specifically, the results are derived under a strong secrecy metric defined by the information leakage to the eavesdropper, instead of the weaker secrecy criteria defined by the information leakage rate or the (average) variation distance. To this end, different approaches are taken to analyze the information leakage and the decoding error probability. Interestingly, both the secrecy and error exponents could be characterized by the (conditional) Rényi mutual information in a concise form. Thus, the region is guaranteed with both information leakage and decoding error probability decreasing exponentially in the code length. Our technique for strong secrecy analysis reflects the resolvability for the k-transmitter MAC; while our error exponent could be regarded as a generalization of Gallager’s error exponent.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133777635","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}
引用次数: 4
Distributed Detection with Empirically Observed Statistics 基于经验观察统计的分布式检测
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989062
Haiyun He, Lin Zhou, V. Tan
{"title":"Distributed Detection with Empirically Observed Statistics","authors":"Haiyun He, Lin Zhou, V. Tan","doi":"10.1109/ITW44776.2019.8989062","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989062","url":null,"abstract":"We consider a binary distributed detection problem in which the distributions of the sensor observations are unknown and only empirically observed statistics are available to the fusion center. The source (test) sequences are transmitted through different channels to the fusion center, which also observes noisy versions of labelled training sequences generated independently from the two underlying distributions. The fusion center decides which distribution the source sequence is sampled from based on the observed statistics, i.e., the noisy training data. We derive the optimal type-II error exponent given that the type-I error decays exponentially fast. We further maximize the type-II error exponent over the proportions of channels for both source and training sequences and conclude that as the ratio of the lengths of training to test sequences tends to infinity, using only one channel is optimal. Finally, we relate our results to the distributed detection problem studied by Tsitsiklis.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132908893","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}
引用次数: 0
Estimation of Bounded Normal Mean: An Alternative Proof for the Discreteness of the Least Favorable Prior 有界正态均值的估计:最不利先验离散性的另一种证明
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988927
S. Yagli, Alex Dytso, H. Poor
{"title":"Estimation of Bounded Normal Mean: An Alternative Proof for the Discreteness of the Least Favorable Prior","authors":"S. Yagli, Alex Dytso, H. Poor","doi":"10.1109/ITW44776.2019.8988927","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988927","url":null,"abstract":"This paper studies the classical Bayesian normal mean estimation problem where the estimand is assumed to be contained in a bounded set. It is known that the least favorable distribution for this mean estimation problem is discrete with finitely many mass points. This work offers an alternative proof utilizing the variational diminishing property of Gaussian kernels.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115521420","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}
引用次数: 3
On the Information-Theoretic Limits of Noisy Sparse Phase Retrieval 噪声稀疏相位恢复的信息论极限
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989363
Lan V. Truong, J. Scarlett
{"title":"On the Information-Theoretic Limits of Noisy Sparse Phase Retrieval","authors":"Lan V. Truong, J. Scarlett","doi":"10.1109/ITW44776.2019.8989363","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989363","url":null,"abstract":"The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model consisting of noisy phaseless measurements, which arises in a diverse range of settings such as optical detection, X-ray crystallography, electron microscopy, and coherent diffractive imaging. Our focus is on information- theoretic fundamental limits under an approximate recovery criterion, with Gaussian measurements and a simple discrete model for the sparse non-zero entries. Our bounds provide sharp thresholds with near-matching constant factors in several scaling regimes on the sparsity and signal-to-noise ratio.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917184","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}
引用次数: 0
Partially Information Coupled Bit-Interleaved Polar Coded Modulation for 16-QAM 16-QAM部分信息耦合位交错极化编码调制
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989376
Xiaowei Wu, Jinhong Yuan
{"title":"Partially Information Coupled Bit-Interleaved Polar Coded Modulation for 16-QAM","authors":"Xiaowei Wu, Jinhong Yuan","doi":"10.1109/ITW44776.2019.8989376","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989376","url":null,"abstract":"We investigate the spatial coupling technique for coded modulation schemes. In particular, we design partially information coupled bit-interleaved polar coded modulation (PIC-BIPCM) schemes for Gray-labelled 16-ary quadrature-amplitude modulation (16-QAM) over AWGN channels. In order to improve the error performance of the BIPCM, we propose a method to appropriately choose the coupled information bits between consecutive polar code blocks (CBs). We also derive a closed form expression for the CB error rate of the designed PIC-BIPCM. Simulation results show that the proposed PIC-BIPCM can achieve a considerable gain over the uncoupled counterparts for variable code rates.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131833067","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}
引用次数: 2
A Mismatched Decoding Perspective of Channel Output Quantization 信道输出量化的错配解码视角
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989278
Mehdi Dabirnia, Alfonso Martinez, A. G. Fàbregas
{"title":"A Mismatched Decoding Perspective of Channel Output Quantization","authors":"Mehdi Dabirnia, Alfonso Martinez, A. G. Fàbregas","doi":"10.1109/ITW44776.2019.8989278","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989278","url":null,"abstract":"Channel output quantization to a smaller number of outputs is modeled as a mismatched decoding problem. The conditions that a mismatched decoding metric should satisfy in order to represent an output quantizer are derived. In addition, a mismatched decoding metric and hypothesis test that minimizes the average error probability are found. It is shown that the best possible mismatched decoder is equivalent to maximum-likelihood decoding for the channel between the channel input and the quantized output. This gives a class of mismatched decoding problems where the mismatch capacity is known. This result supports previous studies on quantizer design and optimization over the quantized channel.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"84 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127981246","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}
引用次数: 2
Rate-Flexible Fast Polar Decoders 速率灵活的快速极性解码器
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989275
Seyyed Ali Hashemi, C. Condo, Marco Mondelli, W. Gross
{"title":"Rate-Flexible Fast Polar Decoders","authors":"Seyyed Ali Hashemi, C. Condo, Marco Mondelli, W. Gross","doi":"10.1109/ITW44776.2019.8989275","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989275","url":null,"abstract":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132551575","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}
引用次数: 3
Guesswork for Inference in Machine Translation with Seq2seq Model 基于Seq2seq模型的机器翻译推理猜测
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989008
Litian Liu, Derya Malak, M. Médard
{"title":"Guesswork for Inference in Machine Translation with Seq2seq Model","authors":"Litian Liu, Derya Malak, M. Médard","doi":"10.1109/ITW44776.2019.8989008","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989008","url":null,"abstract":"One-shot inference is used in machine translation today. In practice, the output probability distribution is not concentrated since there might be multiple valid translations. Therefore, we propose to use a multi-shot inference mechanism in this paper. We analyze the Markovian property of sequence to sequence (seq2seq) model. Based on a large deviation principle satisfied by guesswork on Markov process, we derive theoretical upper bounds on the accuracy of the seq2seq model with single correct answer under one-shot inference and multi-shot inference. We establish analogous bounds when there are multiple correct answers in translating. We also discuss the extension of the results to translation with distortion tolerance.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105889","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}
引用次数: 2
Practical Universal Data Exchange using Polar Codes 实用通用数据交换使用极地代码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989022
S. Banerjee, Himanshu Tyagi
{"title":"Practical Universal Data Exchange using Polar Codes","authors":"S. Banerjee, Himanshu Tyagi","doi":"10.1109/ITW44776.2019.8989022","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989022","url":null,"abstract":"In the multiparty data exchange problem, parties with correlated data seek to recover each-other’s data. We study practical, universal schemes for this problem that accomplish data exchange using optimal rate communication for any distribution of observations. Our focus in this work is on binary symmetric distributions where each user observes bit sequences with uniform marginals. We consider binary symmetric Markov trees as a natural multiparty extension of the binary symmetric source and seek universally rate optimal algorithms for this family. Our main theoretical result is a completeness theorem which shows that any universal Slepian-Wolf scheme can be converted efficiently to a universal data exchange scheme for a subfamily of binary symmetric Markov trees. We instantiate this result using Polar codes. In particular, we provide a universal Slepian-Wolf code using Polar codes and use our reduction algorithm to convert it to a multiparty data exchange protocol. The resulting scheme provides the first practical construction of codes for universal data exchange, which we evaluate numerically.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125685652","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}
引用次数: 2
Transforming an arbitrary code for the wiretap channel of type I into a code for the wiretap channel of type II 将用于类型I的窃听信道的任意代码转换为用于类型II的窃听信道的代码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989048
Eric Graves, Allison Beemer
{"title":"Transforming an arbitrary code for the wiretap channel of type I into a code for the wiretap channel of type II","authors":"Eric Graves, Allison Beemer","doi":"10.1109/ITW44776.2019.8989048","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989048","url":null,"abstract":"We construct a modular scheme which extends codes for wiretap channels of type I for use in wiretap channels of type II. This is done by using a concatenate and permute strategy, wherein multiple uses of the wiretap type I code are concatenated and then the joint sequence of symbols permuted. The choice of permutation is then encoded with a short code and appended to the transmitted sequence. Analysis shows essentially no degradation in operational parameters (rate, error rate, leakage) for the new code over the wiretap type II channel when compared to those of multiple uses of the original code over the wiretap type I channel.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248400","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信