Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054816
J. Spall
The Fisher information matrix summarizes the amount of information in a set of data relative to the quantities of interest and forms the basis for the Cramér-Rao (lower) bound on the uncertainty in an estimate. There are many applications of the information matrix in modeling, systems analysis, and estimation. This paper presents a resampling-based method for computing the information matrix together with some new theory related to efficient implementation. We show how certain properties associated with the likelihood function and the error in the estimates of the Hessian matrix can be exploited to improve the accuracy of the Monte Carlo-based estimate of the information matrix.
{"title":"On Monte Carlo methods for estimating the fisher information matrix in difficult problems","authors":"J. Spall","doi":"10.1109/CISS.2009.5054816","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054816","url":null,"abstract":"The Fisher information matrix summarizes the amount of information in a set of data relative to the quantities of interest and forms the basis for the Cramér-Rao (lower) bound on the uncertainty in an estimate. There are many applications of the information matrix in modeling, systems analysis, and estimation. This paper presents a resampling-based method for computing the information matrix together with some new theory related to efficient implementation. We show how certain properties associated with the likelihood function and the error in the estimates of the Hessian matrix can be exploited to improve the accuracy of the Monte Carlo-based estimate of the information matrix.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"15 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":"123841459","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.5054721
J. Wang, P. Regalia
This work considers localization of nodes in a sensor network using distance measurements. Recent methods favor projection onto convex sets (POCS), since it overcomes the multimodality problem that plagues least-squares formulations. Previous efforts in this direction require either that the sensor be located in the convex hull of the anchor nodes, or that complicated hyperbolic geometric calculations be employed. Here we propose a new algorithm which projects onto the boundary of convex sets, and features a computationally simple update procedure. Both cyclic and random projection schedules are considered, and initial convergence proofs are offered.
{"title":"Sensor network localization via boundary projections","authors":"J. Wang, P. Regalia","doi":"10.1109/CISS.2009.5054721","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054721","url":null,"abstract":"This work considers localization of nodes in a sensor network using distance measurements. Recent methods favor projection onto convex sets (POCS), since it overcomes the multimodality problem that plagues least-squares formulations. Previous efforts in this direction require either that the sensor be located in the convex hull of the anchor nodes, or that complicated hyperbolic geometric calculations be employed. Here we propose a new algorithm which projects onto the boundary of convex sets, and features a computationally simple update procedure. Both cyclic and random projection schedules are considered, and initial convergence proofs are offered.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"57 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":"127726772","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.5054775
Wei Zhang, Xiaoli Ma
To cope with the deleterious channel fading effects on the system performance, diversity-enriched transmitters and receivers have well-appreciated merits. When the channel state information is available at the transmitter, precoders are designed to suppress the channel effect and enable the diversity and low-complexity receiver designs. In addition, the peak-to-average power ratio (PAR) issue has to be considered from the energy perspective. In this paper, after reviewing existing precoding designs by providing the diversity and PAR results, we present a low-complexity transceiver design with a geometric mean decomposition based precoder at the transmitter and a novel lattice reduction aided equalizer at the receiver. The performance is analyzed in terms of diversity and the PAR. The theoretical analysis is corroborated by computer simulations.
{"title":"A novel lattice reduction aided linear precoding Scheme","authors":"Wei Zhang, Xiaoli Ma","doi":"10.1109/CISS.2009.5054775","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054775","url":null,"abstract":"To cope with the deleterious channel fading effects on the system performance, diversity-enriched transmitters and receivers have well-appreciated merits. When the channel state information is available at the transmitter, precoders are designed to suppress the channel effect and enable the diversity and low-complexity receiver designs. In addition, the peak-to-average power ratio (PAR) issue has to be considered from the energy perspective. In this paper, after reviewing existing precoding designs by providing the diversity and PAR results, we present a low-complexity transceiver design with a geometric mean decomposition based precoder at the transmitter and a novel lattice reduction aided equalizer at the receiver. The performance is analyzed in terms of diversity and the PAR. The theoretical analysis is corroborated by computer simulations.","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":"134646028","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.5054831
David J. Dorsey, M. Kam
In this paper, we consider the problem of placing, with course-grained control, a large number of wireless networked sensor nodes employing a clustering network architecture. The goal of the deployment strategy is to maximize the lifetime while ensuring connectivity between cluster-heads so that samples from the monitored area may be forwarded to a fusion center. A model is derived to approximate the lifetime of a differentially deployed random network using both the density of cluster-heads and non-clusterheads as variables. Through optimization of the lifetime expression over both variables and through simulation results, it is shown that 1) a differential node deployment with a uniform cluster-head density increases the lifetime of the network over a uniform deployment and 2) the addition of a suitable differential cluster-head density further increases lifetime over the differential node deployment with uniform cluster-head density.
{"title":"Non-uniform deployment of nodes in clustered wireless sensor networks","authors":"David J. Dorsey, M. Kam","doi":"10.1109/CISS.2009.5054831","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054831","url":null,"abstract":"In this paper, we consider the problem of placing, with course-grained control, a large number of wireless networked sensor nodes employing a clustering network architecture. The goal of the deployment strategy is to maximize the lifetime while ensuring connectivity between cluster-heads so that samples from the monitored area may be forwarded to a fusion center. A model is derived to approximate the lifetime of a differentially deployed random network using both the density of cluster-heads and non-clusterheads as variables. Through optimization of the lifetime expression over both variables and through simulation results, it is shown that 1) a differential node deployment with a uniform cluster-head density increases the lifetime of the network over a uniform deployment and 2) the addition of a suitable differential cluster-head density further increases lifetime over the differential node deployment with uniform cluster-head density.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"38 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":"114162692","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.5054737
Lan Zhang, Yan Xin, Ying-Chang Liang, Xiaodong Wang
This paper investigates cognitive radio channels with a confidential message (CRC-CM) from an information-theoretic perspective. It is assumed that the secondary user (SU) transmitter has perfect and a priori knowledge on the message being transmitted by the primary user (PU) and the message of the SU is confidential to the PU receiver. An achievable rate region of the CRC-CM in the discrete memoryless (DM) case is derived. Two achievable rate regions are obtained by extending the DM rate result to a multi-antenna Gaussian CRC-CM case with two transmission strategies. A numerical example in the multi-antenna Gaussian case is provided.
{"title":"Achievable rate regions of cognitive radio channels with a confidential message","authors":"Lan Zhang, Yan Xin, Ying-Chang Liang, Xiaodong Wang","doi":"10.1109/CISS.2009.5054737","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054737","url":null,"abstract":"This paper investigates cognitive radio channels with a confidential message (CRC-CM) from an information-theoretic perspective. It is assumed that the secondary user (SU) transmitter has perfect and a priori knowledge on the message being transmitted by the primary user (PU) and the message of the SU is confidential to the PU receiver. An achievable rate region of the CRC-CM in the discrete memoryless (DM) case is derived. Two achievable rate regions are obtained by extending the DM rate result to a multi-antenna Gaussian CRC-CM case with two transmission strategies. A numerical example in the multi-antenna Gaussian case is provided.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"40 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":"123102048","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.5054748
D. Chebanov
In this paper we study some autocorrelation properties of a train of identical signals overlaid with a phase coding. Prior publications have investigated this problem under the assumption that, for the purpose of the phase coding, the original (uncoded) signal forming the train is divided into a number of bits that are either all identical or all distinct. This paper extends the discussion to the case of repeated bits. We derive and analyze sufficient conditions for cancelation of the waveform's autocorrelation sidelobes located around the main lobe area.
{"title":"Some autocorrelation properties of phase-coded waveforms","authors":"D. Chebanov","doi":"10.1109/CISS.2009.5054748","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054748","url":null,"abstract":"In this paper we study some autocorrelation properties of a train of identical signals overlaid with a phase coding. Prior publications have investigated this problem under the assumption that, for the purpose of the phase coding, the original (uncoded) signal forming the train is divided into a number of bits that are either all identical or all distinct. This paper extends the discussion to the case of repeated bits. We derive and analyze sufficient conditions for cancelation of the waveform's autocorrelation sidelobes located around the main lobe area.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"7 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":"123512334","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.5054848
Qun Zhang, M. I. Hayee, C. Ma, M. Howieson, A. Rahman, A. Miner, R. Kapadia, C. Tavva, R. Bajracharya, H.-W. Huang
By comparing with the exact optical communication system performance obtained using a quasi-analytical BER calculation method, we systematically analyze the accuracy of the Gaussian approximation (GA) method and the threshold-based margin measurement method for performance evaluation of on-off keying (OOK) optical amplifier systems. We reveal the inherent connection between the GA and the threshold method from both the one-shot case and systems with low inter-symbol interference (ISI). For systems with strong ISI, we show that GA method may fail but the threshold method still provides accurate system performance estimates, even when large threshold bias is used in the measurement.
{"title":"On the Gaussian approximation and margin measurements in optical amplifier systems","authors":"Qun Zhang, M. I. Hayee, C. Ma, M. Howieson, A. Rahman, A. Miner, R. Kapadia, C. Tavva, R. Bajracharya, H.-W. Huang","doi":"10.1109/CISS.2009.5054848","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054848","url":null,"abstract":"By comparing with the exact optical communication system performance obtained using a quasi-analytical BER calculation method, we systematically analyze the accuracy of the Gaussian approximation (GA) method and the threshold-based margin measurement method for performance evaluation of on-off keying (OOK) optical amplifier systems. We reveal the inherent connection between the GA and the threshold method from both the one-shot case and systems with low inter-symbol interference (ISI). For systems with strong ISI, we show that GA method may fail but the threshold method still provides accurate system performance estimates, even when large threshold bias is used in the measurement.","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":"114948387","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.5054813
Yang Hong, O. Yang
Theoretical analysis and experiments have shown that TCP can become oscillatory and prone to instability in high bandwidth-delay-product networks. XCP was proposed to overcome these shortcomings by advertising an explicit window adjustment from the routers to the sources. However, XCP may under-utilize the bandwidth in a multi-bottleneck network and cause some flows to receive an arbitrarily small fraction of their max-min fair rates. Using solid control theoretical analysis and design, API-RCP has solved this potential problem of XCP successfully. Why API-RCP can achieve max-min fair bandwidth allocation and full link utilization in steady state in multi-bottleneck networks? To address this question, we made a simple theoretical analysis and then verify it by OPNET® simulations. We also propose a controller design scheme to optimize the system performance with minimum control errors. We demonstrate the improved performance through comparison between API-RCP and TCP/RED in a multi-bottleneck network.
{"title":"Can API-RCP achieve max-min fair bandwidth allocation in a multi-bottleneck network?","authors":"Yang Hong, O. Yang","doi":"10.1109/CISS.2009.5054813","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054813","url":null,"abstract":"Theoretical analysis and experiments have shown that TCP can become oscillatory and prone to instability in high bandwidth-delay-product networks. XCP was proposed to overcome these shortcomings by advertising an explicit window adjustment from the routers to the sources. However, XCP may under-utilize the bandwidth in a multi-bottleneck network and cause some flows to receive an arbitrarily small fraction of their max-min fair rates. Using solid control theoretical analysis and design, API-RCP has solved this potential problem of XCP successfully. Why API-RCP can achieve max-min fair bandwidth allocation and full link utilization in steady state in multi-bottleneck networks? To address this question, we made a simple theoretical analysis and then verify it by OPNET® simulations. We also propose a controller design scheme to optimize the system performance with minimum control errors. We demonstrate the improved performance through comparison between API-RCP and TCP/RED in a multi-bottleneck network.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"21 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":"122841598","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.5054844
Weilin Gong, Huarui Yin, Lei Ke, Quan Fu
This paper considers the practical implementation of low-resolution digital receivers in impulse radio ultra-wideband (IR-UWB) communication systems for low complexity and low power consumption. The performance of 1-bit digital receivers is investigated. The maximum mutual information per sample is derived and the structure of the maximum likelihood receiver is analyzed. The bit error rate performances under different modulation schemes are also studied. The analysis demonstrates that the signal to noise ratio degradation for 1-bit receivers in multi-path UWB channel is only 1.96 dB. The simulation is in good agreement with our analytical derivations.
{"title":"Performance analysis of IR-UWB 1-bit digital receivers","authors":"Weilin Gong, Huarui Yin, Lei Ke, Quan Fu","doi":"10.1109/CISS.2009.5054844","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054844","url":null,"abstract":"This paper considers the practical implementation of low-resolution digital receivers in impulse radio ultra-wideband (IR-UWB) communication systems for low complexity and low power consumption. The performance of 1-bit digital receivers is investigated. The maximum mutual information per sample is derived and the structure of the maximum likelihood receiver is analyzed. The bit error rate performances under different modulation schemes are also studied. The analysis demonstrates that the signal to noise ratio degradation for 1-bit receivers in multi-path UWB channel is only 1.96 dB. The simulation is in good agreement with our analytical derivations.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"28 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":"129560057","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.5054789
Cong Shen, M. Fitz
Opportunistic Spatial Orthogonalization (OSO) is a new cognitive radio scheme that allows the existence of secondary users and hence increases the system throughput, even if the primary user occupies all the frequency bands all the time. Notably, this throughput advantage is obtained without sacrificing the performance of the primary user, if the interference margin is carefully chosen. The key idea is to exploit the spatial dimensions to orthogonalize users and hence minimize interference. However, unlike the time and frequency dimensions, there is no universal basis for the set of all multi-dimensional spatial channels, which motivated the development of OSO. On one hand, OSO can be viewed as a multi-user diversity scheme that exploits the channel randomness and independence. On the other hand, OSO can be interpreted as an opportunistic interference alignment scheme, where the interference from multiple secondary users is opportunistically aligned at the direction that is orthogonal to the primary user's signal space. Throughput advantages are studied both analytically and numerically.
{"title":"Dynamic spatial spectrum access with opportunistic orthogonalization","authors":"Cong Shen, M. Fitz","doi":"10.1109/CISS.2009.5054789","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054789","url":null,"abstract":"Opportunistic Spatial Orthogonalization (OSO) is a new cognitive radio scheme that allows the existence of secondary users and hence increases the system throughput, even if the primary user occupies all the frequency bands all the time. Notably, this throughput advantage is obtained without sacrificing the performance of the primary user, if the interference margin is carefully chosen. The key idea is to exploit the spatial dimensions to orthogonalize users and hence minimize interference. However, unlike the time and frequency dimensions, there is no universal basis for the set of all multi-dimensional spatial channels, which motivated the development of OSO. On one hand, OSO can be viewed as a multi-user diversity scheme that exploits the channel randomness and independence. On the other hand, OSO can be interpreted as an opportunistic interference alignment scheme, where the interference from multiple secondary users is opportunistically aligned at the direction that is orthogonal to the primary user's signal space. Throughput advantages are studied both analytically and numerically.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"14 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":"128874440","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
扫码关注我们
求助内容：
应助结果提醒方式：