首页 > 最新文献

2019 IEEE International Symposium on Information Theory (ISIT)最新文献

英文 中文
Gambling and Rényi Divergence 赌博和分裂
Pub Date : 2019-09-26 DOI: 10.1109/ISIT.2019.8849800
Cédric Bleuler, A. Lapidoth, Christoph Pfister
For gambling on horses, a one-parameter family of utility functions is proposed, which contains Kelly’s logarithmic criterion and the expected-return criterion as special cases. The strategies that maximize the utility function are derived, and the connection to the Rényi divergence is shown. Optimal strategies are also derived when the gambler has some side information; this setting leads to a novel conditional Rényi divergence.
针对赌马问题,提出了一种单参数效用函数族,其中凯利对数准则和期望收益准则作为特例。导出了最大化效用函数的策略,并显示了与rsamnyi分歧的联系。当赌徒有一些附带信息时,也可以得到最优策略;这一设置导致了一种新的条件r尼分歧。
{"title":"Gambling and Rényi Divergence","authors":"Cédric Bleuler, A. Lapidoth, Christoph Pfister","doi":"10.1109/ISIT.2019.8849800","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849800","url":null,"abstract":"For gambling on horses, a one-parameter family of utility functions is proposed, which contains Kelly’s logarithmic criterion and the expected-return criterion as special cases. The strategies that maximize the utility function are derived, and the connection to the Rényi divergence is shown. Optimal strategies are also derived when the gambler has some side information; this setting leads to a novel conditional Rényi divergence.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"18 1","pages":"2214-2218"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76015630","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
Irregular Product Coded Computation for High-Dimensional Matrix Multiplication 高维矩阵乘法的不规则积编码计算
Pub Date : 2019-07-11 DOI: 10.1109/ISIT.2019.8849236
Hyegyeong Park, J. Moon
In this paper, we consider the straggler problem of the high-dimensional matrix multiplication over distributed workers. To tackle this problem, we propose an irregular-product-coded computation, which is a generalized scheme of the standard-product-coded computation proposed in [1]. Introducing the irregularity to the product-coded matrix multiplication, one can further speed up the matrix multiplication, enjoying the low decoding complexity of the product code. The idea behind the irregular product code introduced in [2] is allowing different code rates for the row and column constituent codes of the product code. We provide a latency analysis of the proposed irregular-product-coded computation. In terms of the total execution time, which is defined by a function of the computation time and decoding time, it is shown that the irregular-product-coded scheme outperforms other competing schemes including the replication, MDS-coded and standard-product-coded schemes in a specific regime.
本文研究了分布工作者上的高维矩阵乘法的离散问题。为了解决这个问题,我们提出了一种不规则积编码计算,它是[1]中提出的标准积编码计算的推广方案。将不规则性引入积编码矩阵乘法中,可以进一步加快矩阵乘法的速度,享受积编码的低解码复杂度。[2]中引入的不规则产品代码背后的思想是允许产品代码的行和列组成代码的不同代码率。我们提供了提出的不规则产品编码计算的延迟分析。在计算时间和解码时间的函数定义的总执行时间方面,表明不规则产品编码方案优于其他竞争方案,包括复制,mds编码和标准产品编码方案。
{"title":"Irregular Product Coded Computation for High-Dimensional Matrix Multiplication","authors":"Hyegyeong Park, J. Moon","doi":"10.1109/ISIT.2019.8849236","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849236","url":null,"abstract":"In this paper, we consider the straggler problem of the high-dimensional matrix multiplication over distributed workers. To tackle this problem, we propose an irregular-product-coded computation, which is a generalized scheme of the standard-product-coded computation proposed in [1]. Introducing the irregularity to the product-coded matrix multiplication, one can further speed up the matrix multiplication, enjoying the low decoding complexity of the product code. The idea behind the irregular product code introduced in [2] is allowing different code rates for the row and column constituent codes of the product code. We provide a latency analysis of the proposed irregular-product-coded computation. In terms of the total execution time, which is defined by a function of the computation time and decoding time, it is shown that the irregular-product-coded scheme outperforms other competing schemes including the replication, MDS-coded and standard-product-coded schemes in a specific regime.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"2 1","pages":"1782-1786"},"PeriodicalIF":0.0,"publicationDate":"2019-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76059523","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}
引用次数: 9
Local-Encoding-Preserving Secure Network Coding for Fixed Dimension 固定维的保局部编码安全网络编码
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849331
Xuan Guang, R. Yeung
In the paradigm of network coding, information-theoretic security is considered in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, referred to as the security level. Secure network coding is applied to prevent the leakage of the source information to the wiretappers. In this paper, we consider the problem of secure network coding for flexible pairs of information rate and security level with any fixed dimension (equal to the sum of rate and security level). We present a novel approach for designing a secure linear network code (SLNC) such that the same SLNC can be applied for all the rate and security-level pairs with the fixed dimension. We further develop a polynomial-time algorithm for efficient implementation and prove that there is no penalty on the required field size for the existence of SLNCs in terms of the best known lower bound by Guang and Yeung. Finally, by applying our approach as a crucial building block, we can construct a family of SLNCs that not only can be applied to all possible pairs of rate and security level but also share a common local encoding kernel at each intermediate node in the network.
在网络编码范例中,在存在窃听者的情况下考虑信息理论安全性,窃听者可以访问任意一个边缘子集,直到一定大小,称为安全级别。采用安全网络编码,防止源信息泄露给窃听者。本文研究了任意固定维(等于速率和安全级别之和)的信息速率和安全级别的柔性对的安全网络编码问题。本文提出了一种设计安全线性网络码(SLNC)的新方法,使得相同的SLNC可以应用于所有具有固定维数的速率和安全级别对。我们进一步开发了一个多项式时间算法来有效地实现,并证明了根据广和杨最著名的下界,slnc的存在对所需的域大小没有惩罚。最后,通过将我们的方法作为一个关键的构建块,我们可以构建一个slnc族,它不仅可以应用于所有可能的速率和安全级别对,而且还可以在网络中的每个中间节点上共享一个公共的本地编码内核。
{"title":"Local-Encoding-Preserving Secure Network Coding for Fixed Dimension","authors":"Xuan Guang, R. Yeung","doi":"10.1109/ISIT.2019.8849331","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849331","url":null,"abstract":"In the paradigm of network coding, information-theoretic security is considered in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, referred to as the security level. Secure network coding is applied to prevent the leakage of the source information to the wiretappers. In this paper, we consider the problem of secure network coding for flexible pairs of information rate and security level with any fixed dimension (equal to the sum of rate and security level). We present a novel approach for designing a secure linear network code (SLNC) such that the same SLNC can be applied for all the rate and security-level pairs with the fixed dimension. We further develop a polynomial-time algorithm for efficient implementation and prove that there is no penalty on the required field size for the existence of SLNCs in terms of the best known lower bound by Guang and Yeung. Finally, by applying our approach as a crucial building block, we can construct a family of SLNCs that not only can be applied to all possible pairs of rate and security level but also share a common local encoding kernel at each intermediate node in the network.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"21 1","pages":"201-205"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77514278","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
Joint Source-Channel Coding for Gaussian Sources over AWGN Channels using Variational Autoencoders 利用变分自编码器在AWGN信道上对高斯源进行联合信路编码
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849476
Yashas Malur Saidutta, A. Abdi, F. Fekri
In this paper, we study joint source-channel coding of gaussian sources over multiple AWGN channels where the source dimension is greater than the number of channels. We model our system as a Variational Autoencoder and show that its loss function takes up a form that is an upper bound on the optimization function got from rate-distortion theory. The constructed system employs two encoders that learn to split the source input space into almost half with no constraints. The system is jointly trained in a data-driven manner, end-to-end. We achieve state of the art results for certain configurations, some of which are 0.7dB better than previous works. We also showcase that the trained encoder/decoder is robust, i.e., even if the channel conditions change by +/-5dB, the performance of the system does not vary by more than 0.7dB w.r.t. a system trained at that channel condition. The trained system, to an extent, has the ability to generalize when a single input dimension is dropped and for some scenarios it is less than 1dB away from the system trained for that reduced dimension.
本文研究了在多个AWGN信道上高斯信号源维数大于信道数的联合信源信道编码。我们将系统建模为变分自编码器,并证明其损失函数的形式是由率失真理论得到的优化函数的上界。构建的系统采用两个编码器,它们学习将源输入空间几乎分成两半,没有任何约束。该系统以数据驱动的方式进行端到端的联合训练。对于某些配置,我们获得了最先进的结果,其中一些比以前的工作好0.7dB。我们还展示了训练的编码器/解码器是鲁棒的,即,即使信道条件变化+/-5dB,系统的性能变化也不会超过0.7dB。训练后的系统在一定程度上具有泛化能力,当单个输入维度被删除时,对于某些场景,它与针对该减少维度训练的系统的距离小于1dB。
{"title":"Joint Source-Channel Coding for Gaussian Sources over AWGN Channels using Variational Autoencoders","authors":"Yashas Malur Saidutta, A. Abdi, F. Fekri","doi":"10.1109/ISIT.2019.8849476","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849476","url":null,"abstract":"In this paper, we study joint source-channel coding of gaussian sources over multiple AWGN channels where the source dimension is greater than the number of channels. We model our system as a Variational Autoencoder and show that its loss function takes up a form that is an upper bound on the optimization function got from rate-distortion theory. The constructed system employs two encoders that learn to split the source input space into almost half with no constraints. The system is jointly trained in a data-driven manner, end-to-end. We achieve state of the art results for certain configurations, some of which are 0.7dB better than previous works. We also showcase that the trained encoder/decoder is robust, i.e., even if the channel conditions change by +/-5dB, the performance of the system does not vary by more than 0.7dB w.r.t. a system trained at that channel condition. The trained system, to an extent, has the ability to generalize when a single input dimension is dropped and for some scenarios it is less than 1dB away from the system trained for that reduced dimension.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"1327-1331"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84298247","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}
引用次数: 9
Untrusted Caches in Two-layer Networks 两层网络中的不可信缓存
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849365
Ahmed A. Zewail, A. Yener
This work considers a network consisting of a server and a layer of relay nodes equipped with cache memories which aim to deliver content to end nodes that also have cache memories. The server and the end nodes consider the intermediate relay caches to be untrusted with the content. As a result, the server must design strategies to place content in relay caches not only to serve end users, but also to ensure that any a subset of them, even when colluding, cannot gain any information about the contents of the server database. The end users randomly connect to a subset of these untrusted caches at the beginning of the delivery phase via multicast links. For this network model, a coded caching scheme is developed by jointly optimizing the cache placement and delivery phases using secure regenerating codes. In addition, the scheme is extended to the setup of combination networks with untrusted relays, where the untrusted relays are connected to the end users via unicast links. The study highlights the benefits of cooperating with untrusted caches by designing the end users’ caches to provide multicast opportunities in order to minimize the delivery load.
这项工作考虑了一个由服务器和一层中继节点组成的网络,这些中继节点配备了缓存存储器,旨在将内容传递给同样具有缓存存储器的终端节点。服务器和终端节点认为中间中继缓存对内容不可信。因此,服务器必须设计策略,将内容放置在中继缓存中,不仅要为最终用户服务,而且要确保他们中的任何一个子集,即使在串通时,也不能获得关于服务器数据库内容的任何信息。终端用户在交付阶段开始时通过多播链接随机连接到这些不可信缓存的子集。针对该网络模型,采用安全再生码联合优化缓存放置和传递阶段,开发了编码缓存方案。此外,该方案还扩展到建立具有不可信中继的组合网络,其中不可信中继通过单播链路连接到最终用户。该研究通过设计终端用户的缓存来提供多播机会,以最大限度地减少传输负载,从而强调了与不可信缓存合作的好处。
{"title":"Untrusted Caches in Two-layer Networks","authors":"Ahmed A. Zewail, A. Yener","doi":"10.1109/ISIT.2019.8849365","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849365","url":null,"abstract":"This work considers a network consisting of a server and a layer of relay nodes equipped with cache memories which aim to deliver content to end nodes that also have cache memories. The server and the end nodes consider the intermediate relay caches to be untrusted with the content. As a result, the server must design strategies to place content in relay caches not only to serve end users, but also to ensure that any a subset of them, even when colluding, cannot gain any information about the contents of the server database. The end users randomly connect to a subset of these untrusted caches at the beginning of the delivery phase via multicast links. For this network model, a coded caching scheme is developed by jointly optimizing the cache placement and delivery phases using secure regenerating codes. In addition, the scheme is extended to the setup of combination networks with untrusted relays, where the untrusted relays are connected to the end users via unicast links. The study highlights the benefits of cooperating with untrusted caches by designing the end users’ caches to provide multicast opportunities in order to minimize the delivery load.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"65 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84581133","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}
引用次数: 1
Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes 串行串接Turbo码的最大后验阈值估计
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849536
Tarik Benaddi, Arti D. Yardi, C. Poulliat, I. Andriyanova
We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.
我们研究了序列串联turbo码的最大后验阈值估计问题。首先,我们提供了一种使用EBP-GEXIT图的数值近似和Maxwell构造来计算MAP阈值的方法。其次,我们探讨了空间耦合信念传播(BP)阈值相对于先前计算的MAP阈值的位置,并分析了这些方案的饱和现象。仿真结果表明,空间耦合涡轮码的BP阈值与利用EBP-GEXIT图得到的MAP阈值趋于饱和。
{"title":"Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes","authors":"Tarik Benaddi, Arti D. Yardi, C. Poulliat, I. Andriyanova","doi":"10.1109/ISIT.2019.8849536","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849536","url":null,"abstract":"We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"5 1","pages":"1347-1351"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81740846","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}
引用次数: 1
Variable-length compression and secrecy by design 可变长度压缩和保密设计
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849517
Yanina Y. Shkel, Rick S. Blum, H. Poor
The framework of secrecy by design is introduced and the fundamental limits of lossless data compression are characterized for this setting. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function fs, and then to derive fundamental limits for the performance of the resulting secrecy system. In the setting of lossless compression, it is shown that strong information-theoretic secrecy guarantees can be achieved using a reduced secret key size and a modular two-part coding strategy. Focusing on the non-asymptotic fundamental limits of lossless compression, variable-length lossless compression is studied. It is noted that completely lossless compression is not possible when perfect secrecy is required; however, it becomes meaningful under partial secrecy constraints. Moreover, although it is well known that the traditional fundamental limits of variable-length and almost lossless fixed-length compression are intimately related, this relationship collapses once the secrecy constraint is incorporated.
介绍了设计保密的框架,并对这种设置下无损数据压缩的基本限制进行了分析。设计保密背后的主要思想是从操作保密约束开始,该约束由保密函数fs建模,然后推导出最终保密系统性能的基本限制。在无损压缩的情况下,通过减小密钥大小和采用模块化的两部分编码策略,可以实现强大的信息论保密保证。针对无损压缩的非渐近基本极限,研究了变长无损压缩。需要注意的是,当需要完全保密时,完全无损压缩是不可能的;然而,它在部分保密约束下变得有意义。此外,尽管众所周知,变长度压缩和几乎无损的固定长度压缩的传统基本限制密切相关,但一旦纳入保密约束,这种关系就会崩溃。
{"title":"Variable-length compression and secrecy by design","authors":"Yanina Y. Shkel, Rick S. Blum, H. Poor","doi":"10.1109/ISIT.2019.8849517","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849517","url":null,"abstract":"The framework of secrecy by design is introduced and the fundamental limits of lossless data compression are characterized for this setting. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function fs, and then to derive fundamental limits for the performance of the resulting secrecy system. In the setting of lossless compression, it is shown that strong information-theoretic secrecy guarantees can be achieved using a reduced secret key size and a modular two-part coding strategy. Focusing on the non-asymptotic fundamental limits of lossless compression, variable-length lossless compression is studied. It is noted that completely lossless compression is not possible when perfect secrecy is required; however, it becomes meaningful under partial secrecy constraints. Moreover, although it is well known that the traditional fundamental limits of variable-length and almost lossless fixed-length compression are intimately related, this relationship collapses once the secrecy constraint is incorporated.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"11 1","pages":"1532-1536"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76431054","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}
引用次数: 1
When a Heavy Tailed Service Minimizes Age of Information 当一个密集的服务最小化信息时代
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849697
Rajat Talak, S. Karaman, E. Modiano
Age-of-information (AoI) is a newly proposed performance metric of information freshness. It differs from the traditional delay metric, because it is destination centric and measures the time that elapsed since the last received fresh information update was generated at the source. We show that AoI and packet delay differ in a fundamental way in certain systems, i.e. minimizing one can imply maximizing the other.We consider two queueing systems, namely a single server last come first serve queue with preemptive service (LCFSp) and G/G/∞ queue, and show that a heavy tailed service distribution, that results in the worst case packet delay or variance in packet delay, respectively, minimizes AoI. For the specific case of M/G/1 LCFSp and G/G/∞ queue, we also prove that deterministic service, that minimizes packet delay and variance in packet delay, respectively, results in the worst case AoI.
信息年龄(Age-of-information, AoI)是一种新提出的信息新鲜度性能指标。它与传统的延迟度量不同,因为它以目的地为中心,并且测量从源处生成最后一次接收到的新信息更新以来所经过的时间。我们表明,在某些系统中,AoI和数据包延迟以一种基本的方式不同,即最小化一个可以意味着最大化另一个。我们考虑了两种队列系统,即具有抢占式服务的单服务器后先服务队列(LCFSp)和G/G/∞队列,并证明了在最坏情况下导致数据包延迟或数据包延迟方差的重尾服务分布可以使AoI最小化。对于M/G/1 LCFSp和G/G/∞队列的具体情况,我们也证明了分别使分组延迟和分组延迟方差最小的确定性服务会导致最坏情况下的AoI。
{"title":"When a Heavy Tailed Service Minimizes Age of Information","authors":"Rajat Talak, S. Karaman, E. Modiano","doi":"10.1109/ISIT.2019.8849697","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849697","url":null,"abstract":"Age-of-information (AoI) is a newly proposed performance metric of information freshness. It differs from the traditional delay metric, because it is destination centric and measures the time that elapsed since the last received fresh information update was generated at the source. We show that AoI and packet delay differ in a fundamental way in certain systems, i.e. minimizing one can imply maximizing the other.We consider two queueing systems, namely a single server last come first serve queue with preemptive service (LCFSp) and G/G/∞ queue, and show that a heavy tailed service distribution, that results in the worst case packet delay or variance in packet delay, respectively, minimizes AoI. For the specific case of M/G/1 LCFSp and G/G/∞ queue, we also prove that deterministic service, that minimizes packet delay and variance in packet delay, respectively, results in the worst case AoI.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"75 1","pages":"345-349"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86372808","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}
引用次数: 10
Evolution Analysis of Iterative BICM Receivers with Expectation Propagation over ISI Channels ISI信道上期望传播的迭代BICM接收机演化分析
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849816
Serdar Şahin, A. Cipriano, C. Poulliat, M. Boucheret
This paper investigates the dynamic behaviour of doubly iterative bit-interleaved coded modulation (BICM) receivers based on expectation propagation (EP). When implemented in the frequency domain, for single-carrier (SC) systems, such receivers achieve attractive performance-complexity trade-offs in quasi-static wideband channels. With this category of receivers, conventional binary extrinsic information transfer (EXIT) functions are subject to a great number of parameters, including channel realizations, constellation and inner iteration parameters. Hence, this paper proposes a novel extrinsic information evolution analysis method which simplifies the receiver’s EXIT function into independent inner transfer functions. The core idea is to track state-evolution dynamics of EP through numerically stable extrinsic variance/information transfer (EXVIT) functions. Numerical results attest to the accuracy of this method for tracking the asymptotic receiver behaviour.
研究了基于期望传播(EP)的双迭代比特交织编码调制(BICM)接收机的动态特性。当在频域中实现时,对于单载波(SC)系统,这种接收器在准静态宽带信道中实现了有吸引力的性能复杂性权衡。在这类接收机中,传统的二进制外部信息传递(EXIT)函数受制于大量参数,包括信道实现、星座和内部迭代参数。为此,本文提出了一种新的外部信息演化分析方法,将接收者的EXIT函数简化为独立的内部传递函数。其核心思想是通过数值稳定的外在方差/信息传递(EXVIT)函数来跟踪EP的状态演化动力学。数值结果证明了该方法用于跟踪渐近接收机行为的准确性。
{"title":"Evolution Analysis of Iterative BICM Receivers with Expectation Propagation over ISI Channels","authors":"Serdar Şahin, A. Cipriano, C. Poulliat, M. Boucheret","doi":"10.1109/ISIT.2019.8849816","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849816","url":null,"abstract":"This paper investigates the dynamic behaviour of doubly iterative bit-interleaved coded modulation (BICM) receivers based on expectation propagation (EP). When implemented in the frequency domain, for single-carrier (SC) systems, such receivers achieve attractive performance-complexity trade-offs in quasi-static wideband channels. With this category of receivers, conventional binary extrinsic information transfer (EXIT) functions are subject to a great number of parameters, including channel realizations, constellation and inner iteration parameters. Hence, this paper proposes a novel extrinsic information evolution analysis method which simplifies the receiver’s EXIT function into independent inner transfer functions. The core idea is to track state-evolution dynamics of EP through numerically stable extrinsic variance/information transfer (EXVIT) functions. Numerical results attest to the accuracy of this method for tracking the asymptotic receiver behaviour.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"4 1","pages":"166-170"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86353145","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
Biometric Systems with Multiuser Access Structures 具有多用户访问结构的生物识别系统
Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849439
Rémi A. Chou
We propose a model for biometric systems with a multiuser access structure, where after enrollment only predefined authorized sets of participants are allowed to access the system upon presenting their biometrics. Two types of system design are considered for the enrollment. In the first one, the participants must simultaneously present their biometrics to enroll in the system. In the second one, each participant can individually enroll in the system, which is more convenient for systems with a large number of participants. For these two types of enrollment and the presence of a multiuser access structure, the fundamental trade-off between security and privacy leakage is studied.
我们提出了一个具有多用户访问结构的生物识别系统模型,在注册后,只有预定义的授权参与者可以在出示他们的生物识别信息时访问系统。招生考虑了两种类型的系统设计。在第一个系统中,参与者必须同时出示他们的生物识别信息来注册系统。在第二种方式中,每个参与者可以单独注册系统,这对于参与者数量较多的系统来说更加方便。针对这两种类型的注册和多用户访问结构的存在,研究了安全性和隐私泄漏之间的基本权衡。
{"title":"Biometric Systems with Multiuser Access Structures","authors":"Rémi A. Chou","doi":"10.1109/ISIT.2019.8849439","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849439","url":null,"abstract":"We propose a model for biometric systems with a multiuser access structure, where after enrollment only predefined authorized sets of participants are allowed to access the system upon presenting their biometrics. Two types of system design are considered for the enrollment. In the first one, the participants must simultaneously present their biometrics to enroll in the system. In the second one, each participant can individually enroll in the system, which is more convenient for systems with a large number of participants. For these two types of enrollment and the presence of a multiuser access structure, the fundamental trade-off between security and privacy leakage is studied.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"24 1","pages":"807-811"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91545779","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}
引用次数: 5
期刊
2019 IEEE International Symposium on Information Theory (ISIT)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1