Pub Date : 1993-11-01DOI: 10.1109/ACSSC.1993.342488
Y.M. Cho, P. Dankoski, Y. C. Pati, G. Xu, T. Kailath
Precise wafer temperature control is crucial to the viability of the emerging technology of rapid thermal processing (RTP) for semiconductor manufacturing. The authors examine the problem of accurate noninvasive measurement of wafer temperature, which is required for precise temperature control. The paper extends the work of Khuri-Yakub et al. (1993) on acoustic techniques for noninvasive wafer temperature measurement. The authors propose a method for estimation of wafer temperatures via regularized tomographic inversion using a priori knowledge of properties of the temperature distribution and data obtained by their technique. Results of simulation studies of the methods proposed are described.<>
{"title":"Numerical aspects of temperature profile reconstruction using acoustic tomography in RTP","authors":"Y.M. Cho, P. Dankoski, Y. C. Pati, G. Xu, T. Kailath","doi":"10.1109/ACSSC.1993.342488","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342488","url":null,"abstract":"Precise wafer temperature control is crucial to the viability of the emerging technology of rapid thermal processing (RTP) for semiconductor manufacturing. The authors examine the problem of accurate noninvasive measurement of wafer temperature, which is required for precise temperature control. The paper extends the work of Khuri-Yakub et al. (1993) on acoustic techniques for noninvasive wafer temperature measurement. The authors propose a method for estimation of wafer temperatures via regularized tomographic inversion using a priori knowledge of properties of the temperature distribution and data obtained by their technique. Results of simulation studies of the methods proposed are described.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"150 2 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":"130931216","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.342547
F. Harris, B. Caulfield, B. McKnight
This paper presents and compares the structure and performance of new alternate architectures developed for spectral noise shaping in over-sampled analog-to-digital and digital-to-analog converters. These architectures differ from conventional design approaches in two ways. The primary difference is in the distribution of transmission zeros in the noise transfer function, while the secondary difference is the manner in which the architecture forms these transmission zeros.<>
{"title":"New architectures with distributed zeros for improved noise shaping of delta-sigma analog to digital converters","authors":"F. Harris, B. Caulfield, B. McKnight","doi":"10.1109/ACSSC.1993.342547","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342547","url":null,"abstract":"This paper presents and compares the structure and performance of new alternate architectures developed for spectral noise shaping in over-sampled analog-to-digital and digital-to-analog converters. These architectures differ from conventional design approaches in two ways. The primary difference is in the distribution of transmission zeros in the noise transfer function, while the secondary difference is the manner in which the architecture forms these transmission zeros.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"4 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":"125360651","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.342631
P. S. Kumar, K. Prabhu
Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods.<>
{"title":"A set of new fast algorithms for DCTs and DSTs","authors":"P. S. Kumar, K. Prabhu","doi":"10.1109/ACSSC.1993.342631","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342631","url":null,"abstract":"Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"2008 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":"125593898","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.342515
M.J. Sorell, M. Krieg, C. Stewart
The Australian Defence Science and Technology Organisation is developing a single-platform sensor fusion test-bed based around an experimental X-band generic pulse Doppler radar. Initial research will examine real-time fusion of amplitude monopulse radar azimuth and elevation and video position estimates and the tracking ability of the combined sensor system. The addition of further signal processing and sensors will allow experimental verification of a variety of sensor fusion and management algorithms. Examples of preliminary data are shown and the continuing development of the test-bed and its applications are discussed.<>
{"title":"On-platform radar and optical track fusion","authors":"M.J. Sorell, M. Krieg, C. Stewart","doi":"10.1109/ACSSC.1993.342515","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342515","url":null,"abstract":"The Australian Defence Science and Technology Organisation is developing a single-platform sensor fusion test-bed based around an experimental X-band generic pulse Doppler radar. Initial research will examine real-time fusion of amplitude monopulse radar azimuth and elevation and video position estimates and the tracking ability of the combined sensor system. The addition of further signal processing and sensors will allow experimental verification of a variety of sensor fusion and management algorithms. Examples of preliminary data are shown and the continuing development of the test-bed and its applications are discussed.<<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":"126699606","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.342423
A. Nehorai, E. Paldi
Develops methods for localizing particle sources using detector arrays. Projection-based arrays are used and general convex, cubical, and spherical surfaces are investigated. Lower bounds are computed on the mean-square angular error (MSAE) for these arrays. The authors propose an algorithm for direction finding with the cubical array and analyze its MSAE. Potential applications of the proposed methods include finding radiation sources, localizing weak light sources, studying the environment, and verifying compliance of nuclear nonproliferation treaties.<>
{"title":"Localization of particle sources with detector arrays","authors":"A. Nehorai, E. Paldi","doi":"10.1109/ACSSC.1993.342423","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342423","url":null,"abstract":"Develops methods for localizing particle sources using detector arrays. Projection-based arrays are used and general convex, cubical, and spherical surfaces are investigated. Lower bounds are computed on the mean-square angular error (MSAE) for these arrays. The authors propose an algorithm for direction finding with the cubical array and analyze its MSAE. Potential applications of the proposed methods include finding radiation sources, localizing weak light sources, studying the environment, and verifying compliance of nuclear nonproliferation treaties.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"260 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":"126902599","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.342299
V. D. Vaughn, Timothy S. Wilkinson, L. S. Kalman
Multispectral image compression has been identified as a critical technology area for future advanced land remote sensing systems. The nature of multispectral imagery is such that, with correlated spectral bands, additional redundancy exists between registered pixels which can be exploited for compression gains. Because of the stringent requirements placed upon multispectral compression by various exploitation activities, designing a multispectral compression algorithm is not trivial. This paper will concentrate, not on compression algorithms, but upon some of the system design requirements, image properties and other issues that face compression algorithm designers.<>
{"title":"Multispectral image compression for future LANDSAT remote sensing systems","authors":"V. D. Vaughn, Timothy S. Wilkinson, L. S. Kalman","doi":"10.1109/ACSSC.1993.342299","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342299","url":null,"abstract":"Multispectral image compression has been identified as a critical technology area for future advanced land remote sensing systems. The nature of multispectral imagery is such that, with correlated spectral bands, additional redundancy exists between registered pixels which can be exploited for compression gains. Because of the stringent requirements placed upon multispectral compression by various exploitation activities, designing a multispectral compression algorithm is not trivial. This paper will concentrate, not on compression algorithms, but upon some of the system design requirements, image properties and other issues that face compression algorithm designers.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"27 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":"121551092","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.342371
J. L. Rasmussen, D. Etter
Given a set of filters with the same magnitude response, the minimum phase filter is the one with the minimum phase lag. This filter will also have the minimum group delay and the minimum energy delay. Obtaining the minimum phase FIR estimate of an unknown system is a constrained optimization problem because the zeros of the model must be constrained to be within the unit circle. The authors compare several structures for adaptively obtaining the optimum FIR minimum phase filter model for an unknown FIR system.<>
{"title":"A comparison of methods for adaptively designing minimum phase FIR models","authors":"J. L. Rasmussen, D. Etter","doi":"10.1109/ACSSC.1993.342371","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342371","url":null,"abstract":"Given a set of filters with the same magnitude response, the minimum phase filter is the one with the minimum phase lag. This filter will also have the minimum group delay and the minimum energy delay. Obtaining the minimum phase FIR estimate of an unknown system is a constrained optimization problem because the zeros of the model must be constrained to be within the unit circle. The authors compare several structures for adaptively obtaining the optimum FIR minimum phase filter model for an unknown FIR system.<<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":"122241595","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.342526
S. White
By increasing the radix of an FFT building block, we can reduce the total number of arithmetic operations required to perform short-term spectral analyses. For a number of analysis points equal to or slightly less than a power of 12, use of the radix-12 building block reduces power consumption by a factor that lies typically between 2 and 5.<>
{"title":"A radix-12 FFT building block","authors":"S. White","doi":"10.1109/ACSSC.1993.342526","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342526","url":null,"abstract":"By increasing the radix of an FFT building block, we can reduce the total number of arithmetic operations required to perform short-term spectral analyses. For a number of analysis points equal to or slightly less than a power of 12, use of the radix-12 building block reduces power consumption by a factor that lies typically between 2 and 5.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"12 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":"126604686","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.342298
A. Naguib, A. Paulraj, T. Kailath
In this paper, the use of antenna arrays at base-station for cellular CDMA is discussed. We present a performance analysis for a multiple cell CDMA cellular system with an antenna array at base-station for both base-station to mobile (downlink) and mobile to base station (uplink) links. Considering the effects of path loss, Rayleigh fading, log-normal shadowing, multiple access interference, and the thermal noise, we show that using an antenna array at base-station, both in receiving and transmitting, to resolve angular positions of the mobiles, leads to a many-fold increase in system capacity. We also present simulation results.<>
{"title":"Capacity improvement of base-station antenna arrays cellular CDMA","authors":"A. Naguib, A. Paulraj, T. Kailath","doi":"10.1109/ACSSC.1993.342298","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342298","url":null,"abstract":"In this paper, the use of antenna arrays at base-station for cellular CDMA is discussed. We present a performance analysis for a multiple cell CDMA cellular system with an antenna array at base-station for both base-station to mobile (downlink) and mobile to base station (uplink) links. Considering the effects of path loss, Rayleigh fading, log-normal shadowing, multiple access interference, and the thermal noise, we show that using an antenna array at base-station, both in receiving and transmitting, to resolve angular positions of the mobiles, leads to a many-fold increase in system capacity. We also present simulation results.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"6 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":"115270187","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.342374
Ta‐Hsin Li
The paper shows that when the input signal to a linear system is discrete-valued the blind deconvolution problem of simultaneously estimating the system and recovering the input can be solved more efficiently by taking into account the discreteness of the input signal. Two situations are considered. One deals with noiseless data by an inverse-filtering procedure which minimizes a cost function that measures the discreteness of the output of an inverse filter. For noisy data, observed from FIR systems, the Gibbs sampling approach is employed to simulate the posteriors of the unknowns under the assumption that the input signal is a Markov chain. It is shown that in the noiseless case the method leads to a highly efficient estimator for parametric systems so that the estimation error decays exponentially as the sample size grows. The Gibbs sampling approach also provides rather precise results for noisy data, even if the initial and transition probabilities of the input signal and the variance of the noise are completely unknown.<>
{"title":"Blind deconvolution of discrete-valued signals","authors":"Ta‐Hsin Li","doi":"10.1109/ACSSC.1993.342374","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342374","url":null,"abstract":"The paper shows that when the input signal to a linear system is discrete-valued the blind deconvolution problem of simultaneously estimating the system and recovering the input can be solved more efficiently by taking into account the discreteness of the input signal. Two situations are considered. One deals with noiseless data by an inverse-filtering procedure which minimizes a cost function that measures the discreteness of the output of an inverse filter. For noisy data, observed from FIR systems, the Gibbs sampling approach is employed to simulate the posteriors of the unknowns under the assumption that the input signal is a Markov chain. It is shown that in the noiseless case the method leads to a highly efficient estimator for parametric systems so that the estimation error decays exponentially as the sample size grows. The Gibbs sampling approach also provides rather precise results for noisy data, even if the initial and transition probabilities of the input signal and the variance of the noise are completely unknown.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"43 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":"120945447","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
扫码关注我们
求助内容：
应助结果提醒方式：