Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160666
S. Haykin
A discussion is presented of adaptivity and multidimensionality in the context of ocean surveillance using a surface-based radar. This environment is used to emphasize the basic notions of complexity and efficiency and the signal-processing roles of chaotic modeling, neural networks, Doppler-polarization (multidimensional) processing, and wavelet-inspired time-frequency analysis. The discussion is supported with experimental results obtained using data collected with a world-class quality-instrument facility known as the IPIX radar.<>
{"title":"Adaptive multidimensional signal processing for ocean surveillance","authors":"S. Haykin","doi":"10.1109/PACRIM.1991.160666","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160666","url":null,"abstract":"A discussion is presented of adaptivity and multidimensionality in the context of ocean surveillance using a surface-based radar. This environment is used to emphasize the basic notions of complexity and efficiency and the signal-processing roles of chaotic modeling, neural networks, Doppler-polarization (multidimensional) processing, and wavelet-inspired time-frequency analysis. The discussion is supported with experimental results obtained using data collected with a world-class quality-instrument facility known as the IPIX radar.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123119670","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160687
J. Huang
The error performances of multiple trellis-coded multilevel differential PSK (MTC-MDPSK) with two different decoding schemes, where scheme 1 uses the multiple symbol detection metric developed by D. Divsalar et al. (1990) and scheme 2 uses the conventional trellis-coded MDPSK metric, are analyzed and compared. An explicit asymptotic approximation to the tail probability of a general indefinite Gaussian quadratic form is developed. Two simple MTC-MDPSK examples show that scheme 1 has better performance consistency for different codes while scheme 2 has similar performance but simpler metric and longer code diversity.<>
{"title":"Performance analysis of multiple trelis coded MDPSK in an AWGN channel","authors":"J. Huang","doi":"10.1109/PACRIM.1991.160687","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160687","url":null,"abstract":"The error performances of multiple trellis-coded multilevel differential PSK (MTC-MDPSK) with two different decoding schemes, where scheme 1 uses the multiple symbol detection metric developed by D. Divsalar et al. (1990) and scheme 2 uses the conventional trellis-coded MDPSK metric, are analyzed and compared. An explicit asymptotic approximation to the tail probability of a general indefinite Gaussian quadratic form is developed. Two simple MTC-MDPSK examples show that scheme 1 has better performance consistency for different codes while scheme 2 has similar performance but simpler metric and longer code diversity.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132339786","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160723
C.R. Smith, G. Erickson
Multisensor data fusion is concerned with the integration and extraction of information from data obtained by two or more sensors. Assuming the data contaminated with noise, the authors present the necessary definitions and concepts to formulate multisensor data fusion as a problem of inference. The types of problems addressed include detection, resolution, discrimination, and parameter estimation. Specifically, the authors show how to assign probabilities to hypotheses (propositions) when data from different sensors supply information relevant to the hypotheses. Several examples involving two-sensor data fusion are discussed.<>
{"title":"Multisensor data fusion: concepts and principles","authors":"C.R. Smith, G. Erickson","doi":"10.1109/PACRIM.1991.160723","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160723","url":null,"abstract":"Multisensor data fusion is concerned with the integration and extraction of information from data obtained by two or more sensors. Assuming the data contaminated with noise, the authors present the necessary definitions and concepts to formulate multisensor data fusion as a problem of inference. The types of problems addressed include detection, resolution, discrimination, and parameter estimation. Specifically, the authors show how to assign probabilities to hypotheses (propositions) when data from different sensors supply information relevant to the hypotheses. Several examples involving two-sensor data fusion are discussed.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066975","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160865
D. Allstot
A tutorial overview of current-mode analog and digital circuit design techniques is presented. Basic current-mode analog signal processing circuits are reviewed. Switched-current sampled-data filtering techniques are covered, and recent advances in current-mode continuous-time filtering techniques are described. Current-mode digital techniques for use in precision mixed-mode applications are summarized. Current-mode circuits are a viable alternative to voltage-mode circuits for implementation in low-voltage scaled CMOS and BiCMOS technologies.<>
{"title":"Current-mode analog signal processing: a tutorial","authors":"D. Allstot","doi":"10.1109/PACRIM.1991.160865","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160865","url":null,"abstract":"A tutorial overview of current-mode analog and digital circuit design techniques is presented. Basic current-mode analog signal processing circuits are reviewed. Switched-current sampled-data filtering techniques are covered, and recent advances in current-mode continuous-time filtering techniques are described. Current-mode digital techniques for use in precision mixed-mode applications are summarized. Current-mode circuits are a viable alternative to voltage-mode circuits for implementation in low-voltage scaled CMOS and BiCMOS technologies.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131759865","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160792
E. B. Olasz, K. Scott, M. Fattouche, S. Nichols
The performance of diversity in cellular FM radio was analyzed using a digitally simulated FM system which includes such components as a compandor, pre-emphasis and de-emphasis, limiters and filters, as well as the modulation and limiter-discriminator-type demodulation. The propagation model used was a modified Hashemi (1979) model. The simulation using digitized speech provides a method to compare the performance of various diversity combining schemes. The diversity combining methods included selective switching using a switch and stay strategy, audio level combining using two receivers, and equal ratio combining using a cophasing technique. These are compared to the performance of the system with no diversity. Comparisons are made to field trials.<>
{"title":"Antenna diversity in cellular FM radio","authors":"E. B. Olasz, K. Scott, M. Fattouche, S. Nichols","doi":"10.1109/PACRIM.1991.160792","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160792","url":null,"abstract":"The performance of diversity in cellular FM radio was analyzed using a digitally simulated FM system which includes such components as a compandor, pre-emphasis and de-emphasis, limiters and filters, as well as the modulation and limiter-discriminator-type demodulation. The propagation model used was a modified Hashemi (1979) model. The simulation using digitized speech provides a method to compare the performance of various diversity combining schemes. The diversity combining methods included selective switching using a switch and stay strategy, audio level combining using two receivers, and equal ratio combining using a cophasing technique. These are compared to the performance of the system with no diversity. Comparisons are made to field trials.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126767985","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160866
M. Zeytinoglu, S. Foda
The authors discuss high-speed implementation of the MUSIC algorithm as applied to circular array configurations. The authors first introduce the underlying signal and array models and summarize the MUSIC algorithm. The need for properly calibrating the algorithm by means of alternate array response models that incorporate mutual coupling effects between array sensors is discussed. The authors consider the circular symmetry and demonstrate how it can be utilized to devise systolic array implementation of the MUSIC algorithm complete with array calibration based on array steering vectors derived from alternate array response models.<>
{"title":"Parallel implementation of high-resolution direction-finding algorithms with circular arrays","authors":"M. Zeytinoglu, S. Foda","doi":"10.1109/PACRIM.1991.160866","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160866","url":null,"abstract":"The authors discuss high-speed implementation of the MUSIC algorithm as applied to circular array configurations. The authors first introduce the underlying signal and array models and summarize the MUSIC algorithm. The need for properly calibrating the algorithm by means of alternate array response models that incorporate mutual coupling effects between array sensors is discussed. The authors consider the circular symmetry and demonstrate how it can be utilized to devise systolic array implementation of the MUSIC algorithm complete with array calibration based on array steering vectors derived from alternate array response models.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563773","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160767
Gu Ningjiang, Guo Longxiang
The optimal location of communication and broadcasting satellites in a static satellite orbit is discussed. Every country should choose the most advantageous orbit location on the limited arc-sector so that the loss of power flux density in its particular area will be lower, the receiving elevation will be higher, the receiving effect will be better, and the user's cost will be decreased. From the viewpoint of raising receiving elevation and reducing loss of power flux density, a mathematical model of optimization location is given. The optimal satellite location for China is computed to be longitude 104.25 degrees east.<>
{"title":"The optimization location of communication and broadcasting satellite","authors":"Gu Ningjiang, Guo Longxiang","doi":"10.1109/PACRIM.1991.160767","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160767","url":null,"abstract":"The optimal location of communication and broadcasting satellites in a static satellite orbit is discussed. Every country should choose the most advantageous orbit location on the limited arc-sector so that the loss of power flux density in its particular area will be lower, the receiving elevation will be higher, the receiving effect will be better, and the user's cost will be decreased. From the viewpoint of raising receiving elevation and reducing loss of power flux density, a mathematical model of optimization location is given. The optimal satellite location for China is computed to be longitude 104.25 degrees east.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116852879","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160719
A. Srinivasan, G. Shoja
A distributed algorithm for providing fault-tolerant optimal scheduling in a simply periodic distributed real-time system based on the deadline mechanism is proposed. Each job is serviced by a primary algorithm or by an alternative algorithm. The primary algorithm provides a desirable service that may not satisfy the timing constraints, whereas an alternate algorithm provides acceptable service, while always satisfying the timing constraints. After using the deadline mechanism for scheduling the jobs on individual nodes, the proposed algorithm is invoked to schedule additional primaries on the other nodes. Since primaries provide accurate results, the distributed scheduling algorithm provides better results without disturbing the timing accuracy. The proposed distributed scheduling algorithm was tested for various randomly generated data.<>
{"title":"A fault-tolerant scheduler for distributed real-time systems","authors":"A. Srinivasan, G. Shoja","doi":"10.1109/PACRIM.1991.160719","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160719","url":null,"abstract":"A distributed algorithm for providing fault-tolerant optimal scheduling in a simply periodic distributed real-time system based on the deadline mechanism is proposed. Each job is serviced by a primary algorithm or by an alternative algorithm. The primary algorithm provides a desirable service that may not satisfy the timing constraints, whereas an alternate algorithm provides acceptable service, while always satisfying the timing constraints. After using the deadline mechanism for scheduling the jobs on individual nodes, the proposed algorithm is invoked to schedule additional primaries on the other nodes. Since primaries provide accurate results, the distributed scheduling algorithm provides better results without disturbing the timing accuracy. The proposed distributed scheduling algorithm was tested for various randomly generated data.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123677580","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160830
M. Kai, H. Kasahara
The authors describe a PROLOG OR-parallel processing scheme. An OR-tree representing an execution process of a PROLOG program, is searched from the right and left sides of each subtree in the whole tree by a plurality of processors. Each processor performs the depth-first search independently. The search allows coarse task granularity to be obtained, and reduces the frequency of the task assignment or the data transfers among the processors. Introducing a special pointer (selection pointer) which indicates a position of the processors in the OR-tree, minimizes the data transfer caused by each task assignment. The depth-first searches from both sides of subtrees extract the acceleration anomaly efficiently and reduce parallel processing time in some cases. The effectiveness of the scheme is demonstrated on a multiprocessor minisupercomputer Alliant FX/80.<>
{"title":"An efficient OR-parallel processing scheme of PROLOG: hierarchical pincers attack search","authors":"M. Kai, H. Kasahara","doi":"10.1109/PACRIM.1991.160830","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160830","url":null,"abstract":"The authors describe a PROLOG OR-parallel processing scheme. An OR-tree representing an execution process of a PROLOG program, is searched from the right and left sides of each subtree in the whole tree by a plurality of processors. Each processor performs the depth-first search independently. The search allows coarse task granularity to be obtained, and reduces the frequency of the task assignment or the data transfers among the processors. Introducing a special pointer (selection pointer) which indicates a position of the processors in the OR-tree, minimizes the data transfer caused by each task assignment. The depth-first searches from both sides of subtrees extract the acceleration anomaly efficiently and reduce parallel processing time in some cases. The effectiveness of the scheme is demonstrated on a multiprocessor minisupercomputer Alliant FX/80.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115261410","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160684
G. Morrison, H. Zaghloul, M. Fattouche, M. Smith, A. McGirr
A method for measuring the transfer function of the indoor channel using an HP network analyzer is presented. The theory of system operation is discussed and data confirming the validity of this technique are given. The complex impulse response is obtained from an inverse discrete Fourier transform (IDFT) of the frequency response and the resulting implications are examined. Results from autoregressive moving average (ARMA) modeling using the transient error reconstruction analysis (TERA) method to avoid resolution loss associated with data windows is briefly presented. It is shown that an impulse response with 60 dB dynamic range and 5 ns resolution is realizable.<>
{"title":"Frequency measurements of the indoor channel: system evaluation and post processing using IDFT and ARMA modeling","authors":"G. Morrison, H. Zaghloul, M. Fattouche, M. Smith, A. McGirr","doi":"10.1109/PACRIM.1991.160684","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160684","url":null,"abstract":"A method for measuring the transfer function of the indoor channel using an HP network analyzer is presented. The theory of system operation is discussed and data confirming the validity of this technique are given. The complex impulse response is obtained from an inverse discrete Fourier transform (IDFT) of the frequency response and the resulting implications are examined. Results from autoregressive moving average (ARMA) modeling using the transient error reconstruction analysis (TERA) method to avoid resolution loss associated with data windows is briefly presented. It is shown that an impulse response with 60 dB dynamic range and 5 ns resolution is realizable.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682341","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
扫码关注我们
求助内容：
应助结果提醒方式：