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.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.5054846
Christopher Keeser, B. Belzer, T. Fischer
We propose passive phase conjugation (PPC) with iterative demodulation and decoding for communication over the shallow underwater acoustic channel. PPC mitigates inter-symbol interference (ISI) caused by multipath in the channel. A softinput, soft-output (SISO) differential BPSK (DBPSK) demodulator and a SISO irregular repeat accumulate (IRA) channel decoder arranged in an iterative ‘turbo’ structure improve the bit error rate (BER) at higher symbol rates. A linear estimator tracks channel phase variations arising from Doppler effects and wave motion. The system was tested at Lake Pend Oreille in Idaho over a distance of 1.78 km in shallow water with BERs below 10−5 at 2,500 information bits per second.
{"title":"Shallow underwater communication with passive phase conjugation and iterative demodulation and decoding","authors":"Christopher Keeser, B. Belzer, T. Fischer","doi":"10.1109/CISS.2009.5054846","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054846","url":null,"abstract":"We propose passive phase conjugation (PPC) with iterative demodulation and decoding for communication over the shallow underwater acoustic channel. PPC mitigates inter-symbol interference (ISI) caused by multipath in the channel. A softinput, soft-output (SISO) differential BPSK (DBPSK) demodulator and a SISO irregular repeat accumulate (IRA) channel decoder arranged in an iterative ‘turbo’ structure improve the bit error rate (BER) at higher symbol rates. A linear estimator tracks channel phase variations arising from Doppler effects and wave motion. The system was tested at Lake Pend Oreille in Idaho over a distance of 1.78 km in shallow water with BERs below 10−5 at 2,500 information bits per second.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"287 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":"132313206","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.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.5054841
Hyosung Kim, Jitendra Tugnait
We present an adaptive soft-input soft-output (SISO) turbo equalization receiver for doubly-selective channels. The proposed receiver exploits the complex exponential basis expansion model (CE-BEM) for the overall channel variations, and an autoregressive (AR) model for the BEM coefficients. We extend an existing turbo equalization approach based on symbol-wise AR modeling of channels to channels based on BEMs. Simulation examples and an EXIT chart analysis demonstrate that our CE-BEM-based approach outperforms the existing symbol-wise AR model-based turbo equalizer.
{"title":"Iterative (Turbo) equalization for doubly-selective channels using exponential basis expansion models","authors":"Hyosung Kim, Jitendra Tugnait","doi":"10.1109/CISS.2009.5054841","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054841","url":null,"abstract":"We present an adaptive soft-input soft-output (SISO) turbo equalization receiver for doubly-selective channels. The proposed receiver exploits the complex exponential basis expansion model (CE-BEM) for the overall channel variations, and an autoregressive (AR) model for the BEM coefficients. We extend an existing turbo equalization approach based on symbol-wise AR modeling of channels to channels based on BEMs. Simulation examples and an EXIT chart analysis demonstrate that our CE-BEM-based approach outperforms the existing symbol-wise AR model-based turbo equalizer.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"69 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":"115911610","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.5054777
Yi Cao, Biao Chen
This paper considers the so-called cognitive Z channel, where two users transmit two independent messages to their respective receivers through a Z interference channel. User 1 (primary user) interferes with receiver 2 while user 2 (secondary user) does not interfere with receiver 1. In addition, user 2 overhears the transmission of user 1 through a noisy channel, hence the term ‘cognitive’. Capacity bounds for such channel in different parameter regimes are obtained and the impact of such causal cognition is carefully studied. In particular, depending on the channel parameters, the cognitive link may not be useful in terms of the capacity region. Numerical examples are also given.
{"title":"The cognitive Z channel","authors":"Yi Cao, Biao Chen","doi":"10.1109/CISS.2009.5054777","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054777","url":null,"abstract":"This paper considers the so-called cognitive Z channel, where two users transmit two independent messages to their respective receivers through a Z interference channel. User 1 (primary user) interferes with receiver 2 while user 2 (secondary user) does not interfere with receiver 1. In addition, user 2 overhears the transmission of user 1 through a noisy channel, hence the term ‘cognitive’. Capacity bounds for such channel in different parameter regimes are obtained and the impact of such causal cognition is carefully studied. In particular, depending on the channel parameters, the cognitive link may not be useful in terms of the capacity region. Numerical examples are also given.","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":"116492945","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.5054711
M. Charafeddine, A. Paulraj
Treating the interference as noise, the paper studies the first derivative of the frontiers which trace the achievable rates region of the 2-user interference channel. The achievable rates region in this case was found to be the convex hull of the union of two regions, each is bounded by a log-defined line. Those log-defined lines are characterized by holding one of the transmitters at full power, while the other transmitter sweeps its full power range [1]. Maximizing the sum rates for the 2-user interference channel translates to the study of the first intersection point with lines of slope -1 approaching the rates region from positive infinity. The paper achieves the same result reported in [2], that the maximum sum rates solution is one of three points: one user transmitting with full power while the other user is silent, or both users transmitting at full power simultaneously. The result in [2] is achieved through analysis of the objective function, while the solution presented herein follows from analyzing the first derivative of the rates region frontiers.
{"title":"Maximum sum rates via analysis of 2-user interference channel achievable rates region","authors":"M. Charafeddine, A. Paulraj","doi":"10.1109/CISS.2009.5054711","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054711","url":null,"abstract":"Treating the interference as noise, the paper studies the first derivative of the frontiers which trace the achievable rates region of the 2-user interference channel. The achievable rates region in this case was found to be the convex hull of the union of two regions, each is bounded by a log-defined line. Those log-defined lines are characterized by holding one of the transmitters at full power, while the other transmitter sweeps its full power range [1]. Maximizing the sum rates for the 2-user interference channel translates to the study of the first intersection point with lines of slope -1 approaching the rates region from positive infinity. The paper achieves the same result reported in [2], that the maximum sum rates solution is one of three points: one user transmitting with full power while the other user is silent, or both users transmitting at full power simultaneously. The result in [2] is achieved through analysis of the objective function, while the solution presented herein follows from analyzing the first derivative of the rates region frontiers.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"22 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":"120874364","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
扫码关注我们
求助内容：
应助结果提醒方式：