The paper considers the effect of channel spectral nulls on the performance in communication systems. It is first demonstrated that there exists a natural coordinate system in which one can study the performance of a broad class of communication systems operating over finite impulse response channels. Moreover, in this coordinate system, there exists a sensible measure of performance which is convex. The key result of this paper is that channels with spectral nulls are geometrically significant; they form the bases of the convex set of all possible channels in the natural coordinate system. The convex geometry immediately implies that the worst performance of a communication system is achieved over some channel having the most spectral nulls.
{"title":"The geometric significance of spectral nulls","authors":"J. Manton","doi":"10.1109/IDC.2002.995374","DOIUrl":"https://doi.org/10.1109/IDC.2002.995374","url":null,"abstract":"The paper considers the effect of channel spectral nulls on the performance in communication systems. It is first demonstrated that there exists a natural coordinate system in which one can study the performance of a broad class of communication systems operating over finite impulse response channels. Moreover, in this coordinate system, there exists a sensible measure of performance which is convex. The key result of this paper is that channels with spectral nulls are geometrically significant; they form the bases of the convex set of all possible channels in the natural coordinate system. The convex geometry immediately implies that the worst performance of a communication system is achieved over some channel having the most spectral nulls.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114588316","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}
Introduces an application of the robust extended Kalman filter (REKF) in the precision missile guidance problem where only the relative line of sight angle is used as measurements in the design of a successful intercept criterion. The robust extended Kalman filter emerges as a practical approximation to the solution of robust filtering for a class of nonlinear systems with solutions involving set valued state estimates obtained by solving a Hamilton-Jacobi-Bellman equation. The underlying system in this problem is a time-varying uncertain nonlinear system in which the uncertainty satisfies a certain integral quadratic constraint. In this REKF application of state estimation, an H/sup /spl infin// type controller was used as a precision guidance controller. The performance of this REKF application was compared with linear output feedback H/sup /spl infin// controllers.
{"title":"Precision missile guidance with angle only measurements","authors":"P. N. Pathirana, A. Savkin, F. Faruqi","doi":"10.1109/IDC.2002.995410","DOIUrl":"https://doi.org/10.1109/IDC.2002.995410","url":null,"abstract":"Introduces an application of the robust extended Kalman filter (REKF) in the precision missile guidance problem where only the relative line of sight angle is used as measurements in the design of a successful intercept criterion. The robust extended Kalman filter emerges as a practical approximation to the solution of robust filtering for a class of nonlinear systems with solutions involving set valued state estimates obtained by solving a Hamilton-Jacobi-Bellman equation. The underlying system in this problem is a time-varying uncertain nonlinear system in which the uncertainty satisfies a certain integral quadratic constraint. In this REKF application of state estimation, an H/sup /spl infin// type controller was used as a precision guidance controller. The performance of this REKF application was compared with linear output feedback H/sup /spl infin// controllers.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114161248","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}
The paper presents a recursive algorithm for joint registration and track-to-track fusion based on equivalent measurements generated by geographically separated multitarget radar trackers. The input data for the algorithm are clutter-free decorrelated equivalent measurements and associated covariances that have been extracted from sensor-level track estimates. Simulation results show that the proposed algorithm adequately estimates sensor biases, and the resulting central-level track estimates are free of registration errors. Furthermore, equivalent measurements generated for this algorithm are also suitable for processing by existing batch-processing registration algorithms.
{"title":"Track-level registration for networked trackers","authors":"N. Okello, S. Challa","doi":"10.1109/IDC.2002.995389","DOIUrl":"https://doi.org/10.1109/IDC.2002.995389","url":null,"abstract":"The paper presents a recursive algorithm for joint registration and track-to-track fusion based on equivalent measurements generated by geographically separated multitarget radar trackers. The input data for the algorithm are clutter-free decorrelated equivalent measurements and associated covariances that have been extracted from sensor-level track estimates. Simulation results show that the proposed algorithm adequately estimates sensor biases, and the resulting central-level track estimates are free of registration errors. Furthermore, equivalent measurements generated for this algorithm are also suitable for processing by existing batch-processing registration algorithms.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121983049","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}
We study singular output regulation of affine nonlinear system by modified steepest descent control. The modified steepest descent control is a dynamic feedback control which is generated by trajectory following method. By assuming that system is zero state detectable, output of the system can be regulated globally asymptotically.
{"title":"Dynamic output feedback regulation for affine nonlinear control systems with relative degree is not well defined","authors":"J. Naiborhu","doi":"10.1109/IDC.2002.995432","DOIUrl":"https://doi.org/10.1109/IDC.2002.995432","url":null,"abstract":"We study singular output regulation of affine nonlinear system by modified steepest descent control. The modified steepest descent control is a dynamic feedback control which is generated by trajectory following method. By assuming that system is zero state detectable, output of the system can be regulated globally asymptotically.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128124070","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}
A high frequency sector scan sonar emulator has been developed as part of DSTO's advanced mine warfare sonar research program. The emulator is used to produce benchmarking results of existing (conventional) sector scan sonar systems, to understand quantitatively their limitations, and to develop novel intelligent signal/image processing algorithms to enhance the sonar detection and classification performance. This paper details the conventional data preprocessing and beamforming of a high frequency sector scan sonar, and describes the preliminary study of a time-frequency filtering method for suppressing reverberation noise in the sensor data and an adaptive beam forming technique for reducing the masking effect of a strong target on a weak target located at the same range bin in the sonar image.
{"title":"High frequency sector scan sonar data preprocessing and beamforming","authors":"K. Lo","doi":"10.1109/IDC.2002.995402","DOIUrl":"https://doi.org/10.1109/IDC.2002.995402","url":null,"abstract":"A high frequency sector scan sonar emulator has been developed as part of DSTO's advanced mine warfare sonar research program. The emulator is used to produce benchmarking results of existing (conventional) sector scan sonar systems, to understand quantitatively their limitations, and to develop novel intelligent signal/image processing algorithms to enhance the sonar detection and classification performance. This paper details the conventional data preprocessing and beamforming of a high frequency sector scan sonar, and describes the preliminary study of a time-frequency filtering method for suppressing reverberation noise in the sensor data and an adaptive beam forming technique for reducing the masking effect of a strong target on a weak target located at the same range bin in the sonar image.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134265497","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}
The hybrid MRSD (multirate sampled-data) system is considered which consist of a continuous time plant and a digital lifted controller. The paper focuses on an explicit solution to the multirate /spl Hscr//sub /spl infin//-optimal control problem using Nehari's theorem. The solution is based on a lifting method, where an equivalent LTI system is obtained for the given periodic multirate problem. The causality constraint on the controller structure in lifting based solutions is automatically satisfied. By solving a standard Nehari's problem, we get the optimal parameterization of a linear stabilizing controller in the worst case l/sub 2/ to l/sub 2/ sense and hence the optimal h-periodic controller for the multirate systems.
{"title":"Optimal control design of multirate sampled-data systems","authors":"A. Azad, T.H. Esketh","doi":"10.1109/IDC.2002.995400","DOIUrl":"https://doi.org/10.1109/IDC.2002.995400","url":null,"abstract":"The hybrid MRSD (multirate sampled-data) system is considered which consist of a continuous time plant and a digital lifted controller. The paper focuses on an explicit solution to the multirate /spl Hscr//sub /spl infin//-optimal control problem using Nehari's theorem. The solution is based on a lifting method, where an equivalent LTI system is obtained for the given periodic multirate problem. The causality constraint on the controller structure in lifting based solutions is automatically satisfied. By solving a standard Nehari's problem, we get the optimal parameterization of a linear stabilizing controller in the worst case l/sub 2/ to l/sub 2/ sense and hence the optimal h-periodic controller for the multirate systems.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133475399","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}
Multiuser detectors for CDMA system that use the successive interference cancellation (SIC) and parallel interference cancellation (PIC) techniques have been studied separately in the past. In this paper, we propose two new multiuser detectors which are the hybrid between the SIC and PIC. Simulation results show these proposed detectors outperform the conventional detector and achieve near single-user performance in both ideal and no power control systems that we have considered. In addition, we also present a generalised framework for convergence analysis of the PIC scheme.
{"title":"Interference cancellation schemes for CDMA systems","authors":"V. Nguyen, L. White","doi":"10.1109/IDC.2002.995364","DOIUrl":"https://doi.org/10.1109/IDC.2002.995364","url":null,"abstract":"Multiuser detectors for CDMA system that use the successive interference cancellation (SIC) and parallel interference cancellation (PIC) techniques have been studied separately in the past. In this paper, we propose two new multiuser detectors which are the hybrid between the SIC and PIC. Simulation results show these proposed detectors outperform the conventional detector and achieve near single-user performance in both ideal and no power control systems that we have considered. In addition, we also present a generalised framework for convergence analysis of the PIC scheme.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130652754","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}
The Global Hawk high altitude endurance unmanned aerial vehicle was deployed to Australia in April 2001 for six weeks. The system conducted eleven missions with the focus on maritime surveillance. This was the culmination of two years collaboration between the United States and Australia which included development of three new sensor modes, sensor control and exploitation techniques to efficiently perform surveillance with a system primarily developed for the reconnaissance role. The paper describes the Australian contribution to the Global Hawk deployment. It describes the sensor, system integration, system control, mission management and ground element challenges presented by shifting the operational focus from reconnaissance to surveillance.
{"title":"The Global Hawk UAV Australian deployment-sensor, HCI and ground element design for surveillance missions","authors":"N. Stacy, D. Craig, J. Staromlynska, R. Smith","doi":"10.1109/IDC.2002.995369","DOIUrl":"https://doi.org/10.1109/IDC.2002.995369","url":null,"abstract":"The Global Hawk high altitude endurance unmanned aerial vehicle was deployed to Australia in April 2001 for six weeks. The system conducted eleven missions with the focus on maritime surveillance. This was the culmination of two years collaboration between the United States and Australia which included development of three new sensor modes, sensor control and exploitation techniques to efficiently perform surveillance with a system primarily developed for the reconnaissance role. The paper describes the Australian contribution to the Global Hawk deployment. It describes the sensor, system integration, system control, mission management and ground element challenges presented by shifting the operational focus from reconnaissance to surveillance.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738385","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}
To improve the network management of large enterprise data networks we propose a novel approach to abnormal network change detection. Periodic observations of logical communications within a network are represented as a time series of graphs. Based on two different graph distance measures, the concept of median graph is introduced. The median of a time series of graphs is a graph that is most representative of all graphs in the series. In the application to time series of communication networks considered in this paper, constraints exist that greatly decrease the computational complexity of the construction of median graphs. An application of median graphs to the analysis of a large data network is given.
{"title":"Median graphs and anomalous change detection in communication networks","authors":"P. Dickinson, Horst Bunke, A. Dadej, M. Kraetzl","doi":"10.1109/IDC.2002.995366","DOIUrl":"https://doi.org/10.1109/IDC.2002.995366","url":null,"abstract":"To improve the network management of large enterprise data networks we propose a novel approach to abnormal network change detection. Periodic observations of logical communications within a network are represented as a time series of graphs. Based on two different graph distance measures, the concept of median graph is introduced. The median of a time series of graphs is a graph that is most representative of all graphs in the series. In the application to time series of communication networks considered in this paper, constraints exist that greatly decrease the computational complexity of the construction of median graphs. An application of median graphs to the analysis of a large data network is given.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148300","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}
It is well known that optimal server placement is NP-hard. We present an approximate model of a content distribution network for the case when both clients and servers are dense, and propose a simple server allocation and placement algorithm based on high-rate quantization theory. The key idea is to regard the location of a request as a random variable with probability density that is proportional to the demand at that location, and the problem of server placement as source coding, i.e., to optimally map a source value (request location) to a codeword (server location) to minimize distortion (network cost). This view leads to a joint server allocation and placement algorithm that has a time-complexity that is linear in the number of users.
{"title":"High-density model of content distribution network","authors":"C. Cameron, S. Low, D. Wei","doi":"10.1109/IDC.2002.995378","DOIUrl":"https://doi.org/10.1109/IDC.2002.995378","url":null,"abstract":"It is well known that optimal server placement is NP-hard. We present an approximate model of a content distribution network for the case when both clients and servers are dense, and propose a simple server allocation and placement algorithm based on high-rate quantization theory. The key idea is to regard the location of a request as a random variable with probability density that is proportional to the demand at that location, and the problem of server placement as source coding, i.e., to optimally map a source value (request location) to a codeword (server location) to minimize distortion (network cost). This view leads to a joint server allocation and placement algorithm that has a time-complexity that is linear in the number of users.","PeriodicalId":385351,"journal":{"name":"Final Program and Abstracts on Information, Decision and Control","volume":"os-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128076735","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
扫码关注我们
求助内容：
应助结果提醒方式：