{"title":"Uncoded transmission is exactly optimal for a simple Gaussian \"sensor\" network","authors":"M. Gastpar","doi":"10.1109/TIT.2008.929967","DOIUrl":"https://doi.org/10.1109/TIT.2008.929967","url":null,"abstract":"One of the simplest sensor network models has one single underlying Gaussian source of interest, observed by many sensors, subject to independent Gaussian observation noise. The sensors communicate over a standard Gaussian multiple-access channel to a fusion center whose goal is to estimate the underlying source with respect to mean-squared error. In this note, a theorem of Witsenhausen is shown to imply that an optimal communication strategy is uncoded transmission, i.e., each sensors' channel input is merely a scaled version of its noisy observation.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132573771","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}
{"title":"When Is Differential Detection Optimum for Ideal and Partially Coherent Reception/Demodulation of M-PSK?","authors":"M. Simon, D. Divsalar","doi":"10.1109/ITA.2007.4357572","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357572","url":null,"abstract":"We investigate the low SNR behavior of the optimum MAP sequence (blockwise) detection metric for ideal and partially coherent detection of differentially encoded M- PSK modulation. In particular, we show that based on an observation of N ges 2 symbols in the presence of a phase ambiguity introduced by the carrier tracking loop and assumed to be constant over the observation, this optimum coherent metric approaches that of multiple symbol differential detection (MSDD) asymptotically as the SNR approaches zero. More importantly, we show that for practical low SNR applications (e.g., error-correction coded systems), the region of SNR where the optimum coherent metric becomes synonymous with MSDD grows with the modulation order M. Finally, we consider the MSDD metric itself modified for symbol-by-symbol detection and demonstrate that for sufficiently low SNR (asymptotically as the SNR approaches zero), its behavior is equivalent to conventional (N = 2) differential detection, i.e., no gain to be had be extending the observation interval beyond two symbols. Unfortunately, unlike the sequence detection case, here the SNR region of validity of the low SNR approximation does not increase with increasing modulation order M.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125613780","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}
{"title":"On Universal Coding of Unordered Data","authors":"L. Varshney, V. K. Goyal","doi":"10.1109/ITA.2007.4357578","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357578","url":null,"abstract":"There are several applications in information transfer and storage where the order of source letters is irrelevant at the destination. For these source-destination pairs, multiset communication rather than the more difficult task of sequence communication may be performed. In this work, we study universal multiset communication. For classes of countable-alphabet sources that meet Kieffer's condition for sequence communication, we present a scheme that universally achieves a rate of n + o(n) bits per multiset letter for multiset communication. We also define redundancy measures that are normalized by the logarithm of the multiset size rather than per multiset letter and show that these redundancy measures cannot be driven to zero for the class of finite-alphabet memoryless multisets. This further implies that finite-alphabet memoryless multisets cannot be encoded universally with vanishing fractional redundancy.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589547","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}
D. Costello, A. E. Pusane, C.R. Jones, D. Divsalar
{"title":"A Comparison of ARA- and Protograph-Based LDPC Block and Convolutional Codes","authors":"D. Costello, A. E. Pusane, C.R. Jones, D. Divsalar","doi":"10.1109/ITA.2007.4357569","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357569","url":null,"abstract":"ARA- and protograph-based LDPC codes are capable of achieving error performance similar to randomly constructed codes while enjoying several implementation advantages as a result of their structure. LDPC convolutional codes can be derived from these codes through an unwrapping process. In this paper, we review the unwrapping process as well as the pipeline decoder that allows continuous decoding of LDPC convolutional codes. Computer simulations are then used to demonstrate that the unwrapped convolutional codes achieve a \"convolutional gain\" in error performance. We conjecture that this is due to the concatenation of many constraint lengths worth of received symbols in the pipeline decoding process. The consequences of this improved performance are examined in terms of factors related to decoder implementation: processor size, memory requirements, and decoding delay (latency). Finally, given identical protograph kernels, we compare derived block and convolutional codes based on the above measures.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114630780","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}
P. Hanus, J. Dingel, Juergen Zecht, J. Hagenauer, Jakob C. Mueller
{"title":"Information Theoretic Distance Measures in Phylogenomics","authors":"P. Hanus, J. Dingel, Juergen Zecht, J. Hagenauer, Jakob C. Mueller","doi":"10.1109/ITA.2007.4357613","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357613","url":null,"abstract":"A variety of distance measures has been developed in information theory, proven useful in the application to digital information systems. According to the fact, that the information for a living organism is stored digitally on the information carrier DNA, it seems intuitive to apply these methods to genome analysis. We present two applications to genetics: a compression based distance measure can be used to compute pairwise distances between genomic sequences of unequal lengths and thus recognize the content of a DNA region. The Kullback-Leibler distance will serve as basis for the estimation of evolutionary conservation across the genomes of different species in order to identify regions with potential important functionality. Moreover, we show that we can draw conclusions about the biological properties of the such analyzed sequences.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131987878","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}
O. Shental, N. Shental, S. Shamai, I. Kanter, A. Weiss, Y. Weiss
{"title":"Comments on Why Generalized BP Serves So Remarkably in 2-D Channels","authors":"O. Shental, N. Shental, S. Shamai, I. Kanter, A. Weiss, Y. Weiss","doi":"10.1109/ITA.2007.4357604","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357604","url":null,"abstract":"Generalized belief propagation (GBP) algorithm has been shown recently to infer the a-posteriori probabilities of finite-state input two-dimensional (2D) Gaussian channels with memory in a practically accurate manner, thus enabling near-optimal estimation of the transmitted symbols and the Shannon-theoretic information rates. In this note, a rationalization of this excellent performance of GBP is addressed.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129997424","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}
{"title":"Less naive Bayes spai detection","authors":"Hongming Yang, Maurice Stassen, Tjalling Tjalkens","doi":"10.1109/ITA.2007.4357608","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357608","url":null,"abstract":"We consider a binary classification problem with a feature vector of high dimensionality. Spam mail filters are a popular example hereof. A naive Bayes filter assumes conditional independence of the feature vector components. We use the context tree weighting method as an application of the minimum description length principle to allow for dependencies between the feature vector components. It turns out that, due to the limited amount of training data, we must assume conditional independence between groups of vector components. We consider several ad-hoc algorithms to find good groupings and good conditional models.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133372970","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}
{"title":"Capacity regions for linear and abelian network codes","authors":"T. Chan","doi":"10.1109/ITA.2007.4357564","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357564","url":null,"abstract":"While linear network codes are proved suboptimal in general multicast scenarios, the loss of throughput due to the use of linear network codes is still unknown. This paper attempts to investigate the loss in throughput by identifying the capacity regions for linear network codes. We prove that the capacity region can be identified by taking intersection of a set of hyperplanes induced by the network and the convex cone closure of the set of all linear representable entropy functions. We also extend the study of network coding capacity region to abelian network codes which contain linear network codes as a subclass. For the case of two multicast sessions, we obtain an inner bound making use of the convex closure of entropy functions which are abelian group representable.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"772 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614247","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}
{"title":"Multi-Terminal Communications with Confidential Messages","authors":"Ruoheng Liu, I. Marić, P. Spasojevic, R. Yates","doi":"10.1109/ITA.2007.4357605","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357605","url":null,"abstract":"The authors study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with perfect secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. This approach was first introduced by Wyner in 1975 for the wiretap channel model. In this paper, we investigate the secrecy capacity region bounds for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to the broadcast channel when one sender jointly encodes both messages and to the interference channel when two senders offer independent inputs to the channel. We consider a switch channel model which is a special case of the interference channel and show that the derived outer and inner bounds meet in this case. Finally, we focus on Gaussian interference channels with confidential messages and describe several transmission schemes and their achievable rate regions under the prefect secrecy requirement.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126929352","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}
{"title":"Space-Time Mesh Codes for the Multiple-Access Relay Network: Space vs. Time Diversity Benefits","authors":"Cheng-Chun Chang, Heung-no Lee","doi":"10.1109/ITA.2007.4357565","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357565","url":null,"abstract":"We consider a wireless multiple access network where the sender nodes are aided by a number of relay nodes. A transmission of bit-messages is completed in two phases: in the first phase each sender node originates its message which is overheard at the relay node, and in the second phase each relay node transmits the parity bit calculated from the overheard bit-messages. The low-density parity-check codes are used at the sender nodes in the time-domain, and the low-density generator-matrix code is formed across the spatial domain. At the access node, the received bits from multiple sender nodes and relay nodes are thus encoded in both the time and the spatial domain. We call this combination a space-time mesh code here. In this paper, an iterative decoding scheme is designed for the mesh code and its BER performance in AWGN, fast Rayleigh fading, and quasi-static Rayleigh fading channels are investigated. We note that there is an important trade-off relation between the time-domain and the spatial domain coding. Namely, the time-domain coding is desired when the channel exhibits fast fading; while the spatial domain coding is preferred when the channel is in quasi-static fading state.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127855628","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}