Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404726
Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham
In this paper we generalize an existing distributed zero-delay joint source-channel coding scheme for communication of a multivariate Gaussian on a Gaussian Multiple Access Channel named Distributed Quantization Linear Coder (DQLC) to arbitrary code length. Although the DQLC is well performing, it leaves a certain gap to the performance upper bound (or distortion lower bound) based on arbitrary code length. The purpose of this paper is to determine if the generalization of the DQLC to arbitrary code length, named Vector Quantization Linear Coder (VQLC), can close the gap to the bound when the code length is large. Our results show that the VQLC mapping has the potential to reach the upper bound for any number of Gaussian sources at high SNR when the sources are uncorrelated. We also approximately determine the VQLC performance as a function of code length for the special case of two sources.
{"title":"On transmission of multiple Gaussian sources over a Gaussian MAC using a VQLC mapping","authors":"Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham","doi":"10.1109/ITW.2012.6404726","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404726","url":null,"abstract":"In this paper we generalize an existing distributed zero-delay joint source-channel coding scheme for communication of a multivariate Gaussian on a Gaussian Multiple Access Channel named Distributed Quantization Linear Coder (DQLC) to arbitrary code length. Although the DQLC is well performing, it leaves a certain gap to the performance upper bound (or distortion lower bound) based on arbitrary code length. The purpose of this paper is to determine if the generalization of the DQLC to arbitrary code length, named Vector Quantization Linear Coder (VQLC), can close the gap to the bound when the code length is large. Our results show that the VQLC mapping has the potential to reach the upper bound for any number of Gaussian sources at high SNR when the sources are uncorrelated. We also approximately determine the VQLC performance as a function of code length for the special case of two sources.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127856376","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404670
C. H. Heymann, H. C. Ferreira, J. Weber
An RDS-minimizing, multi-mode modulation coding scheme, using maximum run-length violating markers and based on the Knuth balancing approach, is applied to run-length limited sequences. Simulations are used to measure spectra and DC suppression performance. A comparison to EFM is included.
{"title":"A DC-free multi-mode run-length limited coding scheme","authors":"C. H. Heymann, H. C. Ferreira, J. Weber","doi":"10.1109/ITW.2012.6404670","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404670","url":null,"abstract":"An RDS-minimizing, multi-mode modulation coding scheme, using maximum run-length violating markers and based on the Knuth balancing approach, is applied to run-length limited sequences. Simulations are used to measure spectra and DC suppression performance. A comparison to EFM is included.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133187932","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404696
S. S. Bidokhti, V. Prabhakaran, S. Diggavi
In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.
{"title":"On multicasting nested message sets over combination networks","authors":"S. S. Bidokhti, V. Prabhakaran, S. Diggavi","doi":"10.1109/ITW.2012.6404696","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404696","url":null,"abstract":"In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127153828","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404642
A. Bracher, A. Lapidoth, Y. Steinberg
We show that the capacity region of the state-dependent multiple-access channel (SD-MAC) with strictly-causally cribbing encoders is not enlarged if strictly-causal state-information (SI) and feedback are furnished to the encoders. We also derive the capacity region of the SD-MAC with causal SI at the cribbing encoders and show that Shannon strategies are optimal. Such strategies are generally suboptimal if the encoders access distinct SI. However, Shannon strategies are optimal and we have a characterization of the capacity region for the case where both encoders crib, causal SI is revealed to one encoder, and feedback is available to the other encoder.
{"title":"On feedback, cribbing, and causal state-information on the multiple-access channel","authors":"A. Bracher, A. Lapidoth, Y. Steinberg","doi":"10.1109/ITW.2012.6404642","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404642","url":null,"abstract":"We show that the capacity region of the state-dependent multiple-access channel (SD-MAC) with strictly-causally cribbing encoders is not enlarged if strictly-causal state-information (SI) and feedback are furnished to the encoders. We also derive the capacity region of the SD-MAC with causal SI at the cribbing encoders and show that Shannon strategies are optimal. Such strategies are generally suboptimal if the encoders access distinct SI. However, Shannon strategies are optimal and we have a characterization of the capacity region for the case where both encoders crib, causal SI is revealed to one encoder, and feedback is available to the other encoder.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"143 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116715899","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404649
Chiranjib Choudhuri, U. Mitra
Motivated by the presence of an implicit communication channel in the asymptotic version of Witsenhausen's counterexample, implicit discrete memoryless channels (IDMC) with discrete memoryless (DM) states are considered. Information-theoretic lower and upper bounds (based respectively on the ideas from rate-distortion theory and hybrid-coding) are derived on the optimal distortion in estimating the input of the implicit channel. The intuition gained from the DMIC with DM state model is then used to evaluate the optimal distortion for the asymptotic version of the Witsenhausen counterexample. The minimum distortion is characterized for the counterexample and it is shown that a combination of linear coding and dirty-paper coding (DPC) proposed in [1] achieves the minimum distortion.
{"title":"On Witsenhausen's counterexample: The asymptotic vector case","authors":"Chiranjib Choudhuri, U. Mitra","doi":"10.1109/ITW.2012.6404649","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404649","url":null,"abstract":"Motivated by the presence of an implicit communication channel in the asymptotic version of Witsenhausen's counterexample, implicit discrete memoryless channels (IDMC) with discrete memoryless (DM) states are considered. Information-theoretic lower and upper bounds (based respectively on the ideas from rate-distortion theory and hybrid-coding) are derived on the optimal distortion in estimating the input of the implicit channel. The intuition gained from the DMIC with DM state model is then used to evaluate the optimal distortion for the asymptotic version of the Witsenhausen counterexample. The minimum distortion is characterized for the counterexample and it is shown that a combination of linear coding and dirty-paper coding (DPC) proposed in [1] achieves the minimum distortion.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116743418","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404693
Grégory Demay, U. Maurer
Common randomness is an important resource in many areas such as game theory and cryptography. We discuss the general problem of common randomness amplification between two distrustful parties connected by a communication channel and sharing some initial randomness. In this setting, both parties wish to agree on a common value distributed according to a target distribution by using their initial amount of common randomness and exchanging messages. Our results show that no protocol which is secure in a composable sense can significantly amplify the entropy initially shared by the parties.
{"title":"Common randomness amplification: A constructive view","authors":"Grégory Demay, U. Maurer","doi":"10.1109/ITW.2012.6404693","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404693","url":null,"abstract":"Common randomness is an important resource in many areas such as game theory and cryptography. We discuss the general problem of common randomness amplification between two distrustful parties connected by a communication channel and sharing some initial randomness. In this setting, both parties wish to agree on a common value distributed according to a target distribution by using their initial amount of common randomness and exchanging messages. Our results show that no protocol which is secure in a composable sense can significantly amplify the entropy initially shared by the parties.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563824","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404710
Arash Einolghozati, Mohsen Sardari, F. Fekri
Molecular communication is an expanding body of research. Recent advances in biology have encouraged using genetically engineered bacteria as the main component in the molecular communication. This has stimulated a new line of research that attempts to study molecular communication among bacteria from an information-theoretic point of view. Due to high randomness in the individual behavior of the bacterium, reliable communication between two bacteria is almost impossible. Therefore, we recently proposed that a population of bacteria in a cluster is considered as a node capable of molecular transmission and reception. This proposition enables us to form a reliable node out of many unreliable bacteria. The bacteria inside a node sense the environment and respond accordingly. In this paper, we study the communication between two nodes, one acting as the transmitter and the other as the receiver. We consider the case in which the information is encoded in the concentration of molecules by the transmitter. The molecules produced by the bacteria in the transmitter node propagate in the environment via the diffusion process. Then, their concentration sensed by the bacteria in the receiver node would decode the information. The randomness in the communication is caused by both the error in the molecular production at the transmitter and the reception of molecules at the receiver. We study the theoretical limits of the information transfer rate in such a setup versus the number of bacteria per node. Finally, we consider M-ary modulation schemes and study the achievable rates and their error probabilities.
{"title":"Molecular communication between two populations of bacteria","authors":"Arash Einolghozati, Mohsen Sardari, F. Fekri","doi":"10.1109/ITW.2012.6404710","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404710","url":null,"abstract":"Molecular communication is an expanding body of research. Recent advances in biology have encouraged using genetically engineered bacteria as the main component in the molecular communication. This has stimulated a new line of research that attempts to study molecular communication among bacteria from an information-theoretic point of view. Due to high randomness in the individual behavior of the bacterium, reliable communication between two bacteria is almost impossible. Therefore, we recently proposed that a population of bacteria in a cluster is considered as a node capable of molecular transmission and reception. This proposition enables us to form a reliable node out of many unreliable bacteria. The bacteria inside a node sense the environment and respond accordingly. In this paper, we study the communication between two nodes, one acting as the transmitter and the other as the receiver. We consider the case in which the information is encoded in the concentration of molecules by the transmitter. The molecules produced by the bacteria in the transmitter node propagate in the environment via the diffusion process. Then, their concentration sensed by the bacteria in the receiver node would decode the information. The randomness in the communication is caused by both the error in the molecular production at the transmitter and the reception of molecules at the receiver. We study the theoretical limits of the information transfer rate in such a setup versus the number of bacteria per node. Finally, we consider M-ary modulation schemes and study the achievable rates and their error probabilities.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607150","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404641
Kumar Viswanatha, E. Akyol, Tejaswi Nanjundaswamy, K. Rose
This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer and the enhancement layer. The first decoder, which receives only the base layer, produces a coarse reconstruction of the source, whereas the second decoder, which receives both the layers, uses the enhancement layer to refine the information further leading to a finer reconstruction. It is popularly known that asymptotic rate-distortion optimality at both the decoders is possible if and only if the source-distortion pair is successively refinable. However when the source is not successively refinable under the given distortion metric, it is impossible to achieve rate-distortion optimality at both the layers simultaneously. For this reason, most practical system designers resort to storing two individual representations of the source leading to significant overhead in transmission/storage costs. Inspired by the breadth of applications, in this paper, we propose a new framework for scalable coding wherein a subset of the bits sent to the first decoder is not sent to the second decoder. That is, the encoder generates one common bit stream which is routed to both the decoders, but unlike the conventional successive refinement setting, both the decoders receive an additional individual bitstream. By relating the proposed framework with the problem of common information of two dependent random variables, we derive a single letter characterization for the minimum sum rate achievable for the proposed setting when the two decoders are constrained to receive information at their respective rate-distortion functions. We show using a simple example that the proposed framework provides a strictly better asymptotic sum rate as opposed to the conventional scalable coding setup when the source-distortion pair is not successively refinable.
{"title":"On common information and the encoding of sources that are not successively refinable","authors":"Kumar Viswanatha, E. Akyol, Tejaswi Nanjundaswamy, K. Rose","doi":"10.1109/ITW.2012.6404641","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404641","url":null,"abstract":"This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer and the enhancement layer. The first decoder, which receives only the base layer, produces a coarse reconstruction of the source, whereas the second decoder, which receives both the layers, uses the enhancement layer to refine the information further leading to a finer reconstruction. It is popularly known that asymptotic rate-distortion optimality at both the decoders is possible if and only if the source-distortion pair is successively refinable. However when the source is not successively refinable under the given distortion metric, it is impossible to achieve rate-distortion optimality at both the layers simultaneously. For this reason, most practical system designers resort to storing two individual representations of the source leading to significant overhead in transmission/storage costs. Inspired by the breadth of applications, in this paper, we propose a new framework for scalable coding wherein a subset of the bits sent to the first decoder is not sent to the second decoder. That is, the encoder generates one common bit stream which is routed to both the decoders, but unlike the conventional successive refinement setting, both the decoders receive an additional individual bitstream. By relating the proposed framework with the problem of common information of two dependent random variables, we derive a single letter characterization for the minimum sum rate achievable for the proposed setting when the two decoders are constrained to receive information at their respective rate-distortion functions. We show using a simple example that the proposed framework provides a strictly better asymptotic sum rate as opposed to the conventional scalable coding setup when the source-distortion pair is not successively refinable.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128391862","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404679
Panu Luosto, C. Giurcăneanu, P. Kontkanen
Theoretical advances of the last decade have led to novel methodologies for probability density estimation by irregular histograms and penalized maximum likelihood. Here we consider two of them: the first one is based on the idea of minimizing the excess risk, while the second one employs the concept of the normalized maximum likelihood (NML). Apparently, the previous literature does not contain any comparison of the two approaches. To fill the gap, we provide in this paper theoretical and empirical results for clarifying the relationship between the two methodologies. Additionally, we introduce a new variant of the NML histogram. For the sake of completeness, we consider also a more advanced NML-based method that uses the measurements to approximate the unknown density by a mixture of densities selected from a predefined family.
{"title":"Construction of irregular histograms by penalized maximum likelihood: A comparative study","authors":"Panu Luosto, C. Giurcăneanu, P. Kontkanen","doi":"10.1109/ITW.2012.6404679","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404679","url":null,"abstract":"Theoretical advances of the last decade have led to novel methodologies for probability density estimation by irregular histograms and penalized maximum likelihood. Here we consider two of them: the first one is based on the idea of minimizing the excess risk, while the second one employs the concept of the normalized maximum likelihood (NML). Apparently, the previous literature does not contain any comparison of the two approaches. To fill the gap, we provide in this paper theoretical and empirical results for clarifying the relationship between the two methodologies. Additionally, we introduce a new variant of the NML histogram. For the sake of completeness, we consider also a more advanced NML-based method that uses the measurements to approximate the unknown density by a mixture of densities selected from a predefined family.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130720618","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404688
François Simon
In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.
{"title":"From channel codes to computation codes","authors":"François Simon","doi":"10.1109/ITW.2012.6404688","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404688","url":null,"abstract":"In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125544839","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
扫码关注我们
求助内容：
应助结果提醒方式：