Pub Date : 1993-11-01DOI: 10.1109/ACSSC.1993.342606
R. Elliott, L. Aggoun
Using a change of measure a filtering problem is discussed where both the signal and observation processes are diffusions with jumps.<>
利用测度变化讨论了信号过程和观测过程都是具有跳变的扩散的滤波问题。
{"title":"A jump process filter","authors":"R. Elliott, L. Aggoun","doi":"10.1109/ACSSC.1993.342606","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342606","url":null,"abstract":"Using a change of measure a filtering problem is discussed where both the signal and observation processes are diffusions with jumps.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123249365","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342446
Jianping Wang, I. Greenshields
The explosive growth in the availability of three-dimensional imaging technologies (such as magnetic resonance imagery (MRI) and computer-assisted tomography (CAT)) has transformed the issue of three-dimensional shape description from a purely abstract exercise in differential geometry to one with practical implications. The paper explores the problem of constructing a rotationally-invariant "sampling lattice" for objects which are diffeomorphic to the unit sphere whose shape functions are L/sup 2/ and bounded in norm with respect to their Laplacian by using local R/sup 2/ approximations to the S/sup 2/ shape functions. The approach used follows a line of argument presented by Daubechies (1990).<>
{"title":"Local approximation of curvature-bounded shape functions on S/sup 2/-diffeomorphic manifolds","authors":"Jianping Wang, I. Greenshields","doi":"10.1109/ACSSC.1993.342446","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342446","url":null,"abstract":"The explosive growth in the availability of three-dimensional imaging technologies (such as magnetic resonance imagery (MRI) and computer-assisted tomography (CAT)) has transformed the issue of three-dimensional shape description from a purely abstract exercise in differential geometry to one with practical implications. The paper explores the problem of constructing a rotationally-invariant \"sampling lattice\" for objects which are diffeomorphic to the unit sphere whose shape functions are L/sup 2/ and bounded in norm with respect to their Laplacian by using local R/sup 2/ approximations to the S/sup 2/ shape functions. The approach used follows a line of argument presented by Daubechies (1990).<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124335362","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342558
Jitendra Tugnait
A general (possibly asymmetric noncausal and/or nonminimum phase) two-dimensional autoregressive moving average random field model driven by an i.i.d. two-dimensional (2D) non-Gaussian sequence is considered. We address the problem of parameter identifiability of the model parameters given the higher-order (third- or fourth-order, for example) cumulants of the 2D signal on a finite set of lags. The signal observations may be noisy. A key result is the parameter identifiability of 2D MA models. Using the MA parameter identifiability results, the parameter identifiability of AR and ARMA models follows immediately via a novel approach.<>
{"title":"On parameter identifiability of multidimensional non-Gaussian ARMA models using cumulant matching","authors":"Jitendra Tugnait","doi":"10.1109/ACSSC.1993.342558","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342558","url":null,"abstract":"A general (possibly asymmetric noncausal and/or nonminimum phase) two-dimensional autoregressive moving average random field model driven by an i.i.d. two-dimensional (2D) non-Gaussian sequence is considered. We address the problem of parameter identifiability of the model parameters given the higher-order (third- or fourth-order, for example) cumulants of the 2D signal on a finite set of lags. The signal observations may be noisy. A key result is the parameter identifiability of 2D MA models. Using the MA parameter identifiability results, the parameter identifiability of AR and ARMA models follows immediately via a novel approach.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237913","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342307
L. C. Yun, M. Couture, J. Camagna, J. Linnartz
This paper derives the BER in synchronous (downlink) indoor direct-sequence CDMA transmission over a Ricean multipath channel with a non-uniform delay profile. Computational results will show that the performance is much better than that predicted by models which assume that all resolvable paths have i.i.d. power.<>
{"title":"BER for QPSK DS-CDMA downlink in an indoor Ricean dispersive pico-cellular channel","authors":"L. C. Yun, M. Couture, J. Camagna, J. Linnartz","doi":"10.1109/ACSSC.1993.342307","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342307","url":null,"abstract":"This paper derives the BER in synchronous (downlink) indoor direct-sequence CDMA transmission over a Ricean multipath channel with a non-uniform delay profile. Computational results will show that the performance is much better than that predicted by models which assume that all resolvable paths have i.i.d. power.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513736","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342465
Y. C. Pati, R. Rezaiifar, P. Krishnaprasad
We describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. affine (wavelet) frames. We propose a modification to the matching pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. We refer to this modified algorithm as orthogonal matching pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively.<>
{"title":"Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition","authors":"Y. C. Pati, R. Rezaiifar, P. Krishnaprasad","doi":"10.1109/ACSSC.1993.342465","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342465","url":null,"abstract":"We describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. affine (wavelet) frames. We propose a modification to the matching pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. We refer to this modified algorithm as orthogonal matching pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129274006","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342397
A. Zeira, B. Friedlander
Considers the problem of finding the directions of narrowband signals using a time-varying array, i.e., an array whose elements move during the observation interval in an arbitrary but known way. The authors derive the Cramer Rao bound and the maximum likelihood estimator for the direction-of-arrival estimates, for the Gaussian signal model. The single source case is studied in detail. Time-varying arrays are shown to be more robust to ambiguity errors than static arrays of comparable dimensions.<>
{"title":"Direction estimation using time-varying arrays","authors":"A. Zeira, B. Friedlander","doi":"10.1109/ACSSC.1993.342397","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342397","url":null,"abstract":"Considers the problem of finding the directions of narrowband signals using a time-varying array, i.e., an array whose elements move during the observation interval in an arbitrary but known way. The authors derive the Cramer Rao bound and the maximum likelihood estimator for the direction-of-arrival estimates, for the Gaussian signal model. The single source case is studied in detail. Time-varying arrays are shown to be more robust to ambiguity errors than static arrays of comparable dimensions.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130979484","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342589
F. Busaba, P. Lala
This paper introduces new technique for designing self-checking interacting machines for on-line detection of multiple stuck-at faults. The only assumption is that each constituent submachine of a composite submachine can have only one single stuck-at fault. The proposed technique adds checkers at the embedded interfaces between the submachines.<>
{"title":"Design of self-checking interacting FSMs for multiple faults","authors":"F. Busaba, P. Lala","doi":"10.1109/ACSSC.1993.342589","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342589","url":null,"abstract":"This paper introduces new technique for designing self-checking interacting machines for on-line detection of multiple stuck-at faults. The only assumption is that each constituent submachine of a composite submachine can have only one single stuck-at fault. The proposed technique adds checkers at the embedded interfaces between the submachines.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130945994","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342333
M. Dogan, J. Mendel
Cumulants can increase the effective aperture of an array, and they suppress non-Gaussian noise. Our earlier works showed these properties to be true for fourth-order cumulants. Here we show these properties are also true for third-order cumulants. We have done this because it is usually good practice to work with as lower an order cumulant as possible, if possible, in order to reduce cumulant estimation errors and to work with shorter data lengths. Our Virtual Cross-Correlation Computer (VC/sup 3/), which lets us compute cross-correlations and autocorrelations for all the sensors in an array, as well as for "virtual" sensors, using cumulants, is applicable to third- and fourth-order cumulants. It leads to increased aperture (much greater for fourth-order cumulants than for third-order cumulants), a virtual ESPRIT algorithm, and non-Gaussian noise suppression.<>
{"title":"Interpretation of cumulants for array processing","authors":"M. Dogan, J. Mendel","doi":"10.1109/ACSSC.1993.342333","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342333","url":null,"abstract":"Cumulants can increase the effective aperture of an array, and they suppress non-Gaussian noise. Our earlier works showed these properties to be true for fourth-order cumulants. Here we show these properties are also true for third-order cumulants. We have done this because it is usually good practice to work with as lower an order cumulant as possible, if possible, in order to reduce cumulant estimation errors and to work with shorter data lengths. Our Virtual Cross-Correlation Computer (VC/sup 3/), which lets us compute cross-correlations and autocorrelations for all the sensors in an array, as well as for \"virtual\" sensors, using cumulants, is applicable to third- and fourth-order cumulants. It leads to increased aperture (much greater for fourth-order cumulants than for third-order cumulants), a virtual ESPRIT algorithm, and non-Gaussian noise suppression.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128736558","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342540
A. Gopalakrishnan, Xiangping Jiang, Mu-Song Chen, M. Manry
We show that the pattern storage capability of the Gabor polynomial is much higher than the commonly used lower bound on multi-layer perceptron (MLP) pattern storage. We also show that multi-layer perceptron networks having second and third degree polynomial activations can be constructed which efficiently implement Gabor polynomials and therefore have the same high pattern storage capability. The polynomial networks can be mapped to conventional sigmoidal MLPs having the same efficiency. It is shown that training techniques like output weight optimization and conjugate gradient attain only the lower bound of pattern storage. Certainly they are not the final solutions to the MLP training problem.<>
{"title":"Constructive proof of efficient pattern storage in the multi-layer perceptron","authors":"A. Gopalakrishnan, Xiangping Jiang, Mu-Song Chen, M. Manry","doi":"10.1109/ACSSC.1993.342540","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342540","url":null,"abstract":"We show that the pattern storage capability of the Gabor polynomial is much higher than the commonly used lower bound on multi-layer perceptron (MLP) pattern storage. We also show that multi-layer perceptron networks having second and third degree polynomial activations can be constructed which efficiently implement Gabor polynomials and therefore have the same high pattern storage capability. The polynomial networks can be mapped to conventional sigmoidal MLPs having the same efficiency. It is shown that training techniques like output weight optimization and conjugate gradient attain only the lower bound of pattern storage. Certainly they are not the final solutions to the MLP training problem.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124786043","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342594
R. Pickholtz, K. Elbarbary
The constant modulus algorithm (CMA) has proved its ability to compensate the severe effect of the multipath interference and co-channel signals on the constant modulus signals. The application limitation of the CMA is mainly due to its slow rate of convergence. The paper presents a new algorithm which keeps the desired properties of the original CMA while it reduces the time required for convergence on the expense of some added mathematical complexity. The algorithm shows stable operations in both cases of compensating the effect of the multipath interference by an adaptive correction filter and separation of cochannel signals by an adaptive array followed by a signal canceler. The proposed algorithm is an order of magnitude faster than the original CMA on the average.<>
{"title":"The recursive constant modulus algorithm; a new approach for real-time array processing","authors":"R. Pickholtz, K. Elbarbary","doi":"10.1109/ACSSC.1993.342594","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342594","url":null,"abstract":"The constant modulus algorithm (CMA) has proved its ability to compensate the severe effect of the multipath interference and co-channel signals on the constant modulus signals. The application limitation of the CMA is mainly due to its slow rate of convergence. The paper presents a new algorithm which keeps the desired properties of the original CMA while it reduces the time required for convergence on the expense of some added mathematical complexity. The algorithm shows stable operations in both cases of compensating the effect of the multipath interference by an adaptive correction filter and separation of cochannel signals by an adaptive array followed by a signal canceler. The proposed algorithm is an order of magnitude faster than the original CMA on the average.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740856","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
扫码关注我们
求助内容：
应助结果提醒方式：