Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054680
I. Esnaola, J. Garcia-Frías
Recent work has shown that compressed sensing can be successfully applied in distributed scenarios. In this framework, we study the exploitation of the correlation statistics in the encoding and recovery processes for independently transmitted Gaussian correlated sources, obtaining the optimal projection matrices in the MMSE sense. Encoding is performed separately for each source using either random or the aforementioned optimized projections. The effect of correlation and noise on the achievable rates obtained through MMSE estimation is studied analytically. Simulation results show a perfect match with the MMSE analysis.
{"title":"Analysis and optimization of distributed linear coding of Gaussian sources","authors":"I. Esnaola, J. Garcia-Frías","doi":"10.1109/CISS.2009.5054680","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054680","url":null,"abstract":"Recent work has shown that compressed sensing can be successfully applied in distributed scenarios. In this framework, we study the exploitation of the correlation statistics in the encoding and recovery processes for independently transmitted Gaussian correlated sources, obtaining the optimal projection matrices in the MMSE sense. Encoding is performed separately for each source using either random or the aforementioned optimized projections. The effect of correlation and noise on the achievable rates obtained through MMSE estimation is studied analytically. Simulation results show a perfect match with the MMSE analysis.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130358989","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054710
I. S. Moskowitz
We discuss the bounds for capacity of a binary-input binary-output discrete memoryless communication channel. We introduce a new lower bound that gives a very good and elementary approximation to the capacity
讨论了二输入二输出离散无记忆通信信道的容量边界。我们引入了一个新的下界，它给出了一个很好的初等近似
{"title":"An approximation of the capacity of a simple channel","authors":"I. S. Moskowitz","doi":"10.1109/CISS.2009.5054710","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054710","url":null,"abstract":"We discuss the bounds for capacity of a binary-input binary-output discrete memoryless communication channel. We introduce a new lower bound that gives a very good and elementary approximation to the capacity","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134315667","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054743
C. Vaze, M. Varanasi
The problem of dirty paper coding (DPC) over the (multi-antenna) fading dirty paper channel (FDPC) Y = H(X + S) + Z is considered when there is imperfect knowledge of the channel state information H at the transmitter (CSIT). The case of FDPC with positive definite (p.d.) input covariance matrix was studied by the authors in a recent paper, and here the more general case of positive semi-definite (p.s.d.) input covariance is dealt with. Towards this end, the choice of auxiliary random variable is modified. The algorithms for determination of inflation factor proposed in the p.d. case are then generalized to the case of p.s.d. input covariance. Subsequently, the largest DPC-achievable high-SNR (signal-to-noise ratio) scaling factor over the no-CSIT FDPC with p.s.d. input covariance matrix is derived. This scaling factor is seen to be a non-trivial generalization of the one achieved for the p.d. case. Next, in the limit of low SNR, it is proved that the choice of all-zero inflation factor (thus treating interference as noise) is optimal in the ‘ratio’ sense, regardless of the covariance matrix used. Further, in the p.d. covariance case, the inflation factor optimal at high SNR is obtained when the number of transmit antennas is greater than the number of receive antennas, with the other case having been already considered in the earlier paper. Finally, the problem of joint optimization of the input covariance matrix and the inflation factor is dealt with, and an iterative numerical algorithm is developed.
考虑了多天线衰落脏纸信道(FDPC) Y = H(X + S) + Z时发射机信道状态信息H不完全的情况下，脏纸编码(DPC)问题。作者在最近的一篇文章中研究了具有正定输入协方差矩阵的FDPC的情况，这里讨论了更一般的正半定输入协方差的情况。为此，对辅助随机变量的选择进行了修改。然后将在psd情况下提出的确定膨胀因子的算法推广到psd输入协方差的情况。随后，导出了具有psd输入协方差矩阵的无csit FDPC上可实现的最大高信噪比(信噪比)比例因子。这个比例因子被看作是对p.d.案例的非平凡推广。接下来，在低信噪比的极限下，证明了选择全零膨胀因子(从而将干扰视为噪声)在“比率”意义上是最优的，而不管使用的协方差矩阵是什么。此外，在p.d.协方差情况下，当发射天线数量大于接收天线数量时，在高信噪比下膨胀系数最优，另一种情况在前面的文章中已经考虑过。最后，研究了输入协方差矩阵与膨胀因子的联合优化问题，并提出了一种迭代数值算法。
{"title":"On the achievable rate of the fading dirty paper channel with imperfect CSIT","authors":"C. Vaze, M. Varanasi","doi":"10.1109/CISS.2009.5054743","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054743","url":null,"abstract":"The problem of dirty paper coding (DPC) over the (multi-antenna) fading dirty paper channel (FDPC) Y = H(X + S) + Z is considered when there is imperfect knowledge of the channel state information H at the transmitter (CSIT). The case of FDPC with positive definite (p.d.) input covariance matrix was studied by the authors in a recent paper, and here the more general case of positive semi-definite (p.s.d.) input covariance is dealt with. Towards this end, the choice of auxiliary random variable is modified. The algorithms for determination of inflation factor proposed in the p.d. case are then generalized to the case of p.s.d. input covariance. Subsequently, the largest DPC-achievable high-SNR (signal-to-noise ratio) scaling factor over the no-CSIT FDPC with p.s.d. input covariance matrix is derived. This scaling factor is seen to be a non-trivial generalization of the one achieved for the p.d. case. Next, in the limit of low SNR, it is proved that the choice of all-zero inflation factor (thus treating interference as noise) is optimal in the ‘ratio’ sense, regardless of the covariance matrix used. Further, in the p.d. covariance case, the inflation factor optimal at high SNR is obtained when the number of transmit antennas is greater than the number of receive antennas, with the other case having been already considered in the earlier paper. Finally, the problem of joint optimization of the input covariance matrix and the inflation factor is dealt with, and an iterative numerical algorithm is developed.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133312469","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054740
Özgü Alay, Xin Pan, E. Erkip, Yao Wang
In this paper, we consider randomized distributed cooperation for multicasting a source signal with end-to-end distortion used as a performance metric. In order to provide differentiated quality to users with different channel strengths, we study layered cooperation where layers are transmitted simultaneously using superposition coding. We first formulate the problem and investigate the effect of power allocation of different layers on the distribution of end-to-end quality of users under a real-time delivery requirement. We then compare the proposed scheme with sequential layered transmission in which the layers are transmitted sequentially in time. Our results show that layered cooperation with superimposed layers outperforms sequential layered cooperation and provides a good alternative for multicast applications.
{"title":"Layered randomized cooperative multicast for lossy data: A superposition approach","authors":"Özgü Alay, Xin Pan, E. Erkip, Yao Wang","doi":"10.1109/CISS.2009.5054740","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054740","url":null,"abstract":"In this paper, we consider randomized distributed cooperation for multicasting a source signal with end-to-end distortion used as a performance metric. In order to provide differentiated quality to users with different channel strengths, we study layered cooperation where layers are transmitted simultaneously using superposition coding. We first formulate the problem and investigate the effect of power allocation of different layers on the distribution of end-to-end quality of users under a real-time delivery requirement. We then compare the proposed scheme with sequential layered transmission in which the layers are transmitted sequentially in time. Our results show that layered cooperation with superimposed layers outperforms sequential layered cooperation and provides a good alternative for multicast applications.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133713277","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054825
Benedito J. B. Fonseca, J. A. Gubner
This paper studies large distributed detection systems that are constrained to use local sample detectors in which sensors produce a binary output by comparing the measurement sample against a threshold. We focus on the problem of choosing between two system design options: spend resources to find optimum local thresholds or deploy additional sensors to compensate for non-optimum thresholds. To provide guidance for this decision, we determine sufficient conditions on the noise distribution to ensure that the overdeployment ratio required by the second option decreases to 1 as the signal-to-noise ratio decreases. We further illustrate that this conclusion is not reached by many noise distributions, including the uniform distribution.
{"title":"On the use of sample detectors in large distributed detection systems","authors":"Benedito J. B. Fonseca, J. A. Gubner","doi":"10.1109/CISS.2009.5054825","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054825","url":null,"abstract":"This paper studies large distributed detection systems that are constrained to use local sample detectors in which sensors produce a binary output by comparing the measurement sample against a threshold. We focus on the problem of choosing between two system design options: spend resources to find optimum local thresholds or deploy additional sensors to compensate for non-optimum thresholds. To provide guidance for this decision, we determine sufficient conditions on the noise distribution to ensure that the overdeployment ratio required by the second option decreases to 1 as the signal-to-noise ratio decreases. We further illustrate that this conclusion is not reached by many noise distributions, including the uniform distribution.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130014338","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054717
Chandrashekhar Thejaswi Pataguppe Suryanarayan Bha, D. Cochran, Junshan Zhang
This paper compares the efficacy of digital versus analog relaying in a sensor network when the ultimate goal is detection. A simplified scenario is considered in which a binary decision is to be made at a fusion center based on data it receives from a single sensor. The sensor computes a statistic corresponding to its observations and forwards it over a noisy channel to the fusion center. Two relay schemes: “estimate-and-forward” (analog relaying) and “detect-and-forward” (digital relaying) are compared, in terms of the ultimate detection performance they support at the fusion center. With this performance criterion, the relative merit of the two schemes is shown to depend on the observation SNR at the sensor and the SNR of the communication link connecting the sensor and the fusion center. A sufficient condition, in terms of these SNRs, for the superiority of digital relaying over analog relaying is derived for this simple network model.
{"title":"A sufficient condition for optimality of digital versus analog relaying in a sensor network","authors":"Chandrashekhar Thejaswi Pataguppe Suryanarayan Bha, D. Cochran, Junshan Zhang","doi":"10.1109/CISS.2009.5054717","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054717","url":null,"abstract":"This paper compares the efficacy of digital versus analog relaying in a sensor network when the ultimate goal is detection. A simplified scenario is considered in which a binary decision is to be made at a fusion center based on data it receives from a single sensor. The sensor computes a statistic corresponding to its observations and forwards it over a noisy channel to the fusion center. Two relay schemes: “estimate-and-forward” (analog relaying) and “detect-and-forward” (digital relaying) are compared, in terms of the ultimate detection performance they support at the fusion center. With this performance criterion, the relative merit of the two schemes is shown to depend on the observation SNR at the sensor and the SNR of the communication link connecting the sensor and the fusion center. A sufficient condition, in terms of these SNRs, for the superiority of digital relaying over analog relaying is derived for this simple network model.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130050684","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054693
Yichuan Hu, J. Garcia-Frías
We propose an analog joint source-channel coding scheme for the transmission of analog Gaussian sources over AWGN channels. The key idea is the combination of a 1:1 uncoded system in which source symbols are directly sent through the noisy channel and a 2:1 non-linear system in which two source outputs are mapped to one channel symbol using spacefilling curves. By doing so, the proposed scheme can achieve any bandwidth reduction ratio between 1:1 and 2:1. The main contribution of this paper is the derivation of the optimal power allocation between the two constituent systems in order to maximize the overall signal-to-distortion ratio (SDR).
{"title":"Optimizing power allocation in analog joint source-channel coding","authors":"Yichuan Hu, J. Garcia-Frías","doi":"10.1109/CISS.2009.5054693","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054693","url":null,"abstract":"We propose an analog joint source-channel coding scheme for the transmission of analog Gaussian sources over AWGN channels. The key idea is the combination of a 1:1 uncoded system in which source symbols are directly sent through the noisy channel and a 2:1 non-linear system in which two source outputs are mapped to one channel symbol using spacefilling curves. By doing so, the proposed scheme can achieve any bandwidth reduction ratio between 1:1 and 2:1. The main contribution of this paper is the derivation of the optimal power allocation between the two constituent systems in order to maximize the overall signal-to-distortion ratio (SDR).","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130107073","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054707
W. Liu, Biao Chen
Motivated by [1], we consider the problem of simultaneous message transmission and state estimation over Gaussian broadcast channels. In particular, two independent messages are transmitted over a state dependent Gaussian broadcast channel with noncausal side information at the transmitter. The receivers, in addition to decode their own messages, also try to estimate the state information. Using squared-error distortion, we provide in this paper an inner bound and an outer bound for the optimal rate distortion tradeoff.
{"title":"Message transmission and state estimation over Gaussian broadcast channels","authors":"W. Liu, Biao Chen","doi":"10.1109/CISS.2009.5054707","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054707","url":null,"abstract":"Motivated by [1], we consider the problem of simultaneous message transmission and state estimation over Gaussian broadcast channels. In particular, two independent messages are transmitted over a state dependent Gaussian broadcast channel with noncausal side information at the transmitter. The receivers, in addition to decode their own messages, also try to estimate the state information. Using squared-error distortion, we provide in this paper an inner bound and an outer bound for the optimal rate distortion tradeoff.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"6 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113959882","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054690
M. Tinston, Y. Ephraim
In this paper we develop a subspace speech enhancement approach for estimating a signal which has been degraded by additive uncorrelated noise. This problem has numerous applications such as in hearing aids and automatic speech recognition in noisy environments. The proposed approach utilizes the multistage Wiener filter (MWF). This filter is constructed from a Krylov subspace associated with the Wiener filter for this problem. The principles and performance of this approach are described. The approach provides signals with higher quality compared to the fullWiener filter and the signal subspace method as evident from informal subjective listening tests, the commonly used PESQ objective test and improved speech recognition performance. In informal listening tests the listeners preferred the MWF enhancement over the other enhancement methods.
{"title":"Speech enhancement using the multistage Wiener filter","authors":"M. Tinston, Y. Ephraim","doi":"10.1109/CISS.2009.5054690","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054690","url":null,"abstract":"In this paper we develop a subspace speech enhancement approach for estimating a signal which has been degraded by additive uncorrelated noise. This problem has numerous applications such as in hearing aids and automatic speech recognition in noisy environments. The proposed approach utilizes the multistage Wiener filter (MWF). This filter is constructed from a Krylov subspace associated with the Wiener filter for this problem. The principles and performance of this approach are described. The approach provides signals with higher quality compared to the fullWiener filter and the signal subspace method as evident from informal subjective listening tests, the commonly used PESQ objective test and improved speech recognition performance. In informal listening tests the listeners preferred the MWF enhancement over the other enhancement methods.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"67 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113983482","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 : 2009-03-18DOI: 10.1109/CISS.2009.5054733
P. Sethuraman, L. Rajamani
This paper studies the latest research concept in Database Tree Encoding namely leveraging Carry-along Sort in Nested Set. To start with, the paper gives an introduction to the concept called “Carry-along Sort” and then applies this concept in Nested Set for generating hierarchies dynamically. There is no algorithm provides a flexibility to generate Nested Set as well materialized path together except “Carry-along Sort” algorithm. The paper also highlights on the future work that can be carried over in this area. The implementation of this new algorithm was done in Oracle and the complete algorithm was tested.
{"title":"Generating nested sets by leveraging “Carry-along Sort” algorithm","authors":"P. Sethuraman, L. Rajamani","doi":"10.1109/CISS.2009.5054733","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054733","url":null,"abstract":"This paper studies the latest research concept in Database Tree Encoding namely leveraging Carry-along Sort in Nested Set. To start with, the paper gives an introduction to the concept called “Carry-along Sort” and then applies this concept in Nested Set for generating hierarchies dynamically. There is no algorithm provides a flexibility to generate Nested Set as well materialized path together except “Carry-along Sort” algorithm. The paper also highlights on the future work that can be carried over in this area. The implementation of this new algorithm was done in Oracle and the complete algorithm was tested.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849584","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
扫码关注我们
求助内容：
应助结果提醒方式：