Pub Date : 2016-07-10DOI: 10.1109/ISIT.2016.7541617
Erman Koken, E. Tuncel
The energy-distortion tradeoff for the transmission of a white Gaussian source over the additive white Gaussian broadcast channel is investigated by translating the known upper and lower bounds into the infinite bandwidth regime. While a gap continues to exist between the bounds in this regime, it is shown that in a certain region on the distortion plane, the energy difference between the best known upper and lower bounds is quantifiably small.
{"title":"On the energy-distortion tradeoff for the Gaussian broadcast problem","authors":"Erman Koken, E. Tuncel","doi":"10.1109/ISIT.2016.7541617","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541617","url":null,"abstract":"The energy-distortion tradeoff for the transmission of a white Gaussian source over the additive white Gaussian broadcast channel is investigated by translating the known upper and lower bounds into the infinite bandwidth regime. While a gap continues to exist between the bounds in this regime, it is shown that in a certain region on the distortion plane, the energy difference between the best known upper and lower bounds is quantifiably small.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"39 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124258294","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541555
Y. Jitsumatsu, Y. Oohama
The form of Dueck and Körner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and Körner's exponent. In this paper, we give an algorithm for computing Csiszár and Körner's exponent. The proposed algorithm can also be used to compute cutoff rate and the rate distortion function.
{"title":"Computing the optimal exponent of correct decoding for discrete memoryless sources","authors":"Y. Jitsumatsu, Y. Oohama","doi":"10.1109/ISIT.2016.7541555","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541555","url":null,"abstract":"The form of Dueck and Körner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and Körner's exponent. In this paper, we give an algorithm for computing Csiszár and Körner's exponent. The proposed algorithm can also be used to compute cutoff rate and the rate distortion function.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116661398","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541490
Lluis Pamies-Juarez, Cyril Guyot, R. Mateescu
Distributed storage systems use erasure codes to reliably store data with a small storage overhead. To further improve system performance, some novel erasure codes introduce new features such as the regenerating property or symbol locality, enabling these codes to have optimal repair times and optimal degraded read performance. Unfortunately, the introduction of these new features often exacerbates the performance of other system metrics such as encoding throughput, data reliability, and storage overhead, among others. In this paper we describe the intricate relationships between erasure code properties and system-level performance metrics, showing the different tradeoffs distributed storage designers need to face. We also present Spider Codes, a new erasure code achieving a practical trade-off between the different system-level performance metrics.
{"title":"Spider Codes: Practical erasure codes for distributed storage systems","authors":"Lluis Pamies-Juarez, Cyril Guyot, R. Mateescu","doi":"10.1109/ISIT.2016.7541490","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541490","url":null,"abstract":"Distributed storage systems use erasure codes to reliably store data with a small storage overhead. To further improve system performance, some novel erasure codes introduce new features such as the regenerating property or symbol locality, enabling these codes to have optimal repair times and optimal degraded read performance. Unfortunately, the introduction of these new features often exacerbates the performance of other system metrics such as encoding throughput, data reliability, and storage overhead, among others. In this paper we describe the intricate relationships between erasure code properties and system-level performance metrics, showing the different tradeoffs distributed storage designers need to face. We also present Spider Codes, a new erasure code achieving a practical trade-off between the different system-level performance metrics.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121273133","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541775
Chunhua Geng, S. Jafar
In this work, we first establish that for the class of interference channels identified by Geng et al. where treating interference as noise (TIN) is optimal from the generalized degrees-of-freedom (GDoF) perspective, if the number of antennas at each node is scaled by a common constant factor, then the GDoF region scales by the same factor almost surely, and the TIN scheme remains optimal for the entire GDoF region. Next, we demonstrate that for K-user MIMO interference channels with different antenna numbers for transmitters and receivers, there exist non-trivial parameter regimes where a simple scheme of zero-forcing strong interference and treating the others as noise achieves the sum GDoF.
{"title":"On the optimality of zero-forcing and treating interference as noise for K-user MIMO interference channels","authors":"Chunhua Geng, S. Jafar","doi":"10.1109/ISIT.2016.7541775","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541775","url":null,"abstract":"In this work, we first establish that for the class of interference channels identified by Geng et al. where treating interference as noise (TIN) is optimal from the generalized degrees-of-freedom (GDoF) perspective, if the number of antennas at each node is scaled by a common constant factor, then the GDoF region scales by the same factor almost surely, and the TIN scheme remains optimal for the entire GDoF region. Next, we demonstrate that for K-user MIMO interference channels with different antenna numbers for transmitters and receivers, there exist non-trivial parameter regimes where a simple scheme of zero-forcing strong interference and treating the others as noise achieves the sum GDoF.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114190309","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541403
Arise Kuriya, Toshiyuki TANAKA
Approximate Massage Passing (AMP) algorithm is derived from Belief Propagation (BP) algorithm by introducing approximations. While the properties and behaviors of AMP in large systems are well studied and understood, there are few studies about AMP applied to relatively small sized problems where the effect of the approximations are neither negligible nor trivial. We investigate AMP in small-sized problems, especially focusing on the effects of the approximations and the mechanism of the performance degradation. To observe the effects of the approximations, we conduct numerical experiments which compare AMP and BP algorithms. We apply these algorithms to the problems of CDMA-MUD and Ising perceptron learning. In the numerical experiments, the results via Bayes optimal estimation obtained via exactly calculating marginals and an approximated BP algorithm which is obtained as an intermediate step to derive AMP from BP are also provided and discussed for the comparisons.
{"title":"Effects of the approximations from BP to AMP for small-sized problems","authors":"Arise Kuriya, Toshiyuki TANAKA","doi":"10.1109/ISIT.2016.7541403","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541403","url":null,"abstract":"Approximate Massage Passing (AMP) algorithm is derived from Belief Propagation (BP) algorithm by introducing approximations. While the properties and behaviors of AMP in large systems are well studied and understood, there are few studies about AMP applied to relatively small sized problems where the effect of the approximations are neither negligible nor trivial. We investigate AMP in small-sized problems, especially focusing on the effects of the approximations and the mechanism of the performance degradation. To observe the effects of the approximations, we conduct numerical experiments which compare AMP and BP algorithms. We apply these algorithms to the problems of CDMA-MUD and Ising perceptron learning. In the numerical experiments, the results via Bayes optimal estimation obtained via exactly calculating marginals and an approximated BP algorithm which is obtained as an intermediate step to derive AMP from BP are also provided and discussed for the comparisons.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114268972","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541688
Vasuki Narasimha Swamy, G. Ranade, A. Sahai
Cooperative communication to extract multi-user diversity and network coding are two ideas for improving wireless protocols. These ideas can be exploited to design protocols for low-latency high-reliability communication for control. Given the high-performance constraints for this communication, it is critical, to understand how sensitive such protocols are to modeling assumptions. We examine the impact of channel reciprocity, quasi-static fading, and the spatial independence of channel fades in this paper. This paper uses simple models to explore the performance sensitivity to assumptions. It turns out that wireless network-coding is moderately sensitive to channel reciprocity and non-reciprocity costs about 2dB SNR. The loss of the quasi-static fading assumption has a similar cost for the network coding based protocol but has a negligible effect on the protocol that doesn't use network coding. The real sensitivity of cooperative communication protocols is to the spatial independence assumptions. Capping the amount of independence to a small number degrades performance but perhaps more surprisingly, a simple Gilbert-Elliott-inspired model shows that having a random amount of independence can also severely impact performance.
{"title":"Robustness of cooperative communication schemes to channel models","authors":"Vasuki Narasimha Swamy, G. Ranade, A. Sahai","doi":"10.1109/ISIT.2016.7541688","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541688","url":null,"abstract":"Cooperative communication to extract multi-user diversity and network coding are two ideas for improving wireless protocols. These ideas can be exploited to design protocols for low-latency high-reliability communication for control. Given the high-performance constraints for this communication, it is critical, to understand how sensitive such protocols are to modeling assumptions. We examine the impact of channel reciprocity, quasi-static fading, and the spatial independence of channel fades in this paper. This paper uses simple models to explore the performance sensitivity to assumptions. It turns out that wireless network-coding is moderately sensitive to channel reciprocity and non-reciprocity costs about 2dB SNR. The loss of the quasi-static fading assumption has a similar cost for the network coding based protocol but has a negligible effect on the protocol that doesn't use network coding. The real sensitivity of cooperative communication protocols is to the spatial independence assumptions. Capping the amount of independence to a small number degrades performance but perhaps more surprisingly, a simple Gilbert-Elliott-inspired model shows that having a random amount of independence can also severely impact performance.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114271381","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541488
A. Vardy, Eitan Yaakobi
Batch codes, first studied by Ishai et al., are a coding scheme to encode n information bits into m buckets, in a way that every batch request of k bits can be decoded while at most one bit is read from each bucket. In this work we study the class of multiset primitive batch codes, in which every bucket stores a single bit and bits can be requested multiple times. We simply refer to these codes as batch codes. The main problem under this paradigm is to optimize the number of encoded bits, which is the number of buckets, for given n and k, and we denote this value by B(n, k). Since there are several asymptotically optimal constructions of these codes, we are motivated to evaluate their optimality by their redundancy. Thus we define the optimal redundancy of batch codes to be rB(n, k) ??? B(n, k) - n. Our main result in this paper claims that for any fixed k, rB(n, k) = O(√n log(n)).
{"title":"Constructions of batch codes with near-optimal redundancy","authors":"A. Vardy, Eitan Yaakobi","doi":"10.1109/ISIT.2016.7541488","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541488","url":null,"abstract":"Batch codes, first studied by Ishai et al., are a coding scheme to encode n information bits into m buckets, in a way that every batch request of k bits can be decoded while at most one bit is read from each bucket. In this work we study the class of multiset primitive batch codes, in which every bucket stores a single bit and bits can be requested multiple times. We simply refer to these codes as batch codes. The main problem under this paradigm is to optimize the number of encoded bits, which is the number of buckets, for given n and k, and we denote this value by B(n, k). Since there are several asymptotically optimal constructions of these codes, we are motivated to evaluate their optimality by their redundancy. Thus we define the optimal redundancy of batch codes to be rB(n, k) ??? B(n, k) - n. Our main result in this paper claims that for any fixed k, rB(n, k) = O(√n log(n)).","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114517341","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541861
Gregor Seiler, U. Maurer
Shared randomness is an important resource in cryptography. It is well-known that in the information-theoretic setting there is no protocol that allows two parties who do not trust each other to obtain a uniformly distributed shared bit string solely by exchanging messages such that a dishonest party can not influence the result. On the other hand, in the situation where the two parties already share a random bit string and want to use it in order to construct a longer random bit string, it is only known to be impossible when the protocols are restricted in the number of messages to be exchanged. In this paper we prove that it is also impossible when arbitrarily many messages are allowed.
{"title":"On the impossibility of information-theoretic composable coin toss extension","authors":"Gregor Seiler, U. Maurer","doi":"10.1109/ISIT.2016.7541861","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541861","url":null,"abstract":"Shared randomness is an important resource in cryptography. It is well-known that in the information-theoretic setting there is no protocol that allows two parties who do not trust each other to obtain a uniformly distributed shared bit string solely by exchanging messages such that a dishonest party can not influence the result. On the other hand, in the situation where the two parties already share a random bit string and want to use it in order to construct a longer random bit string, it is only known to be impossible when the protocols are restricted in the number of messages to be exchanged. In this paper we prove that it is also impossible when arbitrarily many messages are allowed.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"26 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116834546","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 : 2016-07-10DOI: 10.1109/ISIT.2016.7541499
Nof Abuzainab, W. Saad, H. Poor
In this paper, the problem of distributed uplink random access is studied for an Internet of Things (IoT) system, composed of heterogeneous group of nodes compromising both machine-type devices (MTDs) and human-type devices (HTDs). The problem is formulated as a noncooperative game between the heterogeneous IoT devices whose goal is to find the transmission probabilities and service rates that meet their individual quality-of-service (QoS) requirements. To solve this game while capturing the heterogeneity of the devices, in terms of resource constraints and QoS needs, a novel approach based on the behavioral game framework of cognitive hierarchy (CH) theory is proposed. This approach enables the IoT devices to reach a CH equilibrium concept that adequately factors in the various levels of rationality corresponding to the heterogeneous capabilities of MTDs and HTDs. Simulation results show that the proposed CH solution can significantly improve the performance, in terms of energy efficiency, for both MTDs and HTDs, achieving, on the average, a 67% improvement compared to the traditional Nash equilibrium-based game-theoretic solutions.
{"title":"Cognitive hierarchy theory for heterogeneous uplink multiple access in the Internet of Things","authors":"Nof Abuzainab, W. Saad, H. Poor","doi":"10.1109/ISIT.2016.7541499","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541499","url":null,"abstract":"In this paper, the problem of distributed uplink random access is studied for an Internet of Things (IoT) system, composed of heterogeneous group of nodes compromising both machine-type devices (MTDs) and human-type devices (HTDs). The problem is formulated as a noncooperative game between the heterogeneous IoT devices whose goal is to find the transmission probabilities and service rates that meet their individual quality-of-service (QoS) requirements. To solve this game while capturing the heterogeneity of the devices, in terms of resource constraints and QoS needs, a novel approach based on the behavioral game framework of cognitive hierarchy (CH) theory is proposed. This approach enables the IoT devices to reach a CH equilibrium concept that adequately factors in the various levels of rationality corresponding to the heterogeneous capabilities of MTDs and HTDs. Simulation results show that the proposed CH solution can significantly improve the performance, in terms of energy efficiency, for both MTDs and HTDs, achieving, on the average, a 67% improvement compared to the traditional Nash equilibrium-based game-theoretic solutions.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129833649","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}
We study random string-duplication systems, called Pólya string models, motivated by certain random mutation processes in the genome of living organisms. Unlike previous works that study the combinatorial capacity of string-duplication systems, or peripheral properties such as symbol frequency, this work provides exact capacity or bounds on it, for several probabilistic models. In particular, we give the exact capacity of the random tandem-duplication system, and the end-duplication system, and bound the capacity of the complement tandem-duplication system. Interesting connections are drawn between the former and the beta distribution common to population genetics, as well as between the latter system and signatures of random permutations.
{"title":"The capacity of some Pólya string models","authors":"Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck","doi":"10.1109/ISIT.2016.7541303","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541303","url":null,"abstract":"We study random string-duplication systems, called Pólya string models, motivated by certain random mutation processes in the genome of living organisms. Unlike previous works that study the combinatorial capacity of string-duplication systems, or peripheral properties such as symbol frequency, this work provides exact capacity or bounds on it, for several probabilistic models. In particular, we give the exact capacity of the random tandem-duplication system, and the end-duplication system, and bound the capacity of the complement tandem-duplication system. Interesting connections are drawn between the former and the beta distribution common to population genetics, as well as between the latter system and signatures of random permutations.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128216865","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
扫码关注我们
求助内容：
应助结果提醒方式：