Pub Date : 1991-05-14DOI: 10.1109/MWSCAS.1991.252079
C. Choy, Tsz-Shing Cheung
Incremental design alteration usually requires complete rework on the IC layout. An algorithm is proposed which tackles the problem in minimum time and creates the least perturbation to the original layout, preserving performance. The algorithm aims at automatic adjustment of layout due to minor change on logic design. As a result, the designer need not re-execute the whole placement process or manually correct the placement. Using dynamic variables to form the database, it is more efficient to implement the algorithm. Results and computation time of the algorithm are also found advantageous.<>
{"title":"An algorithm to deal with incremental layout alteration","authors":"C. Choy, Tsz-Shing Cheung","doi":"10.1109/MWSCAS.1991.252079","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252079","url":null,"abstract":"Incremental design alteration usually requires complete rework on the IC layout. An algorithm is proposed which tackles the problem in minimum time and creates the least perturbation to the original layout, preserving performance. The algorithm aims at automatic adjustment of layout due to minor change on logic design. As a result, the designer need not re-execute the whole placement process or manually correct the placement. Using dynamic variables to form the database, it is more efficient to implement the algorithm. Results and computation time of the algorithm are also found advantageous.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"25 1","pages":"850-853 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78883093","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-14DOI: 10.1109/MWSCAS.1991.252197
A.H. Azzo, M. Sawan
Output feedback stabilization of uncertain linear systems is analyzed. A necessary and sufficient condition of quadratic stability of the closed-loop system is introduced. An algorithm is proposed to test the stability of the system. It computes rho , an uncertainty stability margin coefficient, in a two-level optimization algorithm where the region of uncertainty is approximated by a convex hyperpolyhedron.<>
{"title":"Output feedback stabilization of uncertain linear systems","authors":"A.H. Azzo, M. Sawan","doi":"10.1109/MWSCAS.1991.252197","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252197","url":null,"abstract":"Output feedback stabilization of uncertain linear systems is analyzed. A necessary and sufficient condition of quadratic stability of the closed-loop system is introduced. An algorithm is proposed to test the stability of the system. It computes rho , an uncertainty stability margin coefficient, in a two-level optimization algorithm where the region of uncertainty is approximated by a convex hyperpolyhedron.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"3 1","pages":"471-473 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78969642","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-14DOI: 10.1109/MWSCAS.1991.252063
T.-H.S. Li
Model matching control of singular perturbation systems with unmodeled high-frequency dynamics is examined. It is shown that the controller designed on the basis of the reduced-order model is able to make the full system match the stable model for sufficiently small values of the singular perturbation parameter epsilon . The maximum value of epsilon is calculated.<>
{"title":"Robust model matching control of singularly perturbed systems","authors":"T.-H.S. Li","doi":"10.1109/MWSCAS.1991.252063","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252063","url":null,"abstract":"Model matching control of singular perturbation systems with unmodeled high-frequency dynamics is examined. It is shown that the controller designed on the basis of the reduced-order model is able to make the full system match the stable model for sufficiently small values of the singular perturbation parameter epsilon . The maximum value of epsilon is calculated.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"26 1","pages":"916-919 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78987999","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-14DOI: 10.1109/MWSCAS.1991.251997
S. Prange, H. Klar
The circuit design and chip architecture for an emulator for an exemplary biology-oriented neural network are presented. This emulator is able to emulate 16 fully interconnected neurons of the Marburg type. It is cascadable to larger fully interconnected networks and multilayer networks with or without feedback. It is shown that chip architectures not suffering from a connection problem can be found even for complicated neural network architectures. The full interconnection and the multilayer architecture can be transformed to matrices. Neighborhood networks such as those used in lateral inhibition networks can also be transformed to a regular structure.<>
{"title":"Digital chip architecture for the emulation of a biology-oriented neural network","authors":"S. Prange, H. Klar","doi":"10.1109/MWSCAS.1991.251997","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.251997","url":null,"abstract":"The circuit design and chip architecture for an emulator for an exemplary biology-oriented neural network are presented. This emulator is able to emulate 16 fully interconnected neurons of the Marburg type. It is cascadable to larger fully interconnected networks and multilayer networks with or without feedback. It is shown that chip architectures not suffering from a connection problem can be found even for complicated neural network architectures. The full interconnection and the multilayer architecture can be transformed to matrices. Neighborhood networks such as those used in lateral inhibition networks can also be transformed to a regular structure.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"113 1","pages":"780-783 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75971570","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-14DOI: 10.1109/MWSCAS.1991.252055
B. Nowrouzian, A. Constantinides
Explicit relationships are presented for the parameters of the normalized lowpass discrete-time prototype reference transfer function suitable for the derivation of denormalized lowpass, highpass, bandpass, and bandstop discrete-time transfer functions having Butterworth, Chebyshev, and elliptic loss-frequency characteristics. These parameters include the required order of the discrete-time prototype reference transfer function as well as the required passband and stopband edge frequencies for its loss-frequency characteristics.<>
{"title":"Parameters of Butterworth, Tschebyscheff, and elliptic prototype reference transfer functions in discrete-time frequency transformations","authors":"B. Nowrouzian, A. Constantinides","doi":"10.1109/MWSCAS.1991.252055","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252055","url":null,"abstract":"Explicit relationships are presented for the parameters of the normalized lowpass discrete-time prototype reference transfer function suitable for the derivation of denormalized lowpass, highpass, bandpass, and bandstop discrete-time transfer functions having Butterworth, Chebyshev, and elliptic loss-frequency characteristics. These parameters include the required order of the discrete-time prototype reference transfer function as well as the required passband and stopband edge frequencies for its loss-frequency characteristics.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"15 12 1","pages":"235-238 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88105071","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-14DOI: 10.1109/MWSCAS.1991.252222
M.-S. Chen, M. Manry
Develops a polynomial basis function approach for modeling BP (backpropagation) neural networks. This method leads directly to a constructive proof of the BP approximation theorem. In addition, the basis vector approach provides a means to synthesize the BP neural network output as a polynomial function. An algorithm for pruning the useless basis vectors is also demonstrated.<>
{"title":"Basis vector analyses of back-propagation neural networks","authors":"M.-S. Chen, M. Manry","doi":"10.1109/MWSCAS.1991.252222","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252222","url":null,"abstract":"Develops a polynomial basis function approach for modeling BP (backpropagation) neural networks. This method leads directly to a constructive proof of the BP approximation theorem. In addition, the basis vector approach provides a means to synthesize the BP neural network output as a polynomial function. An algorithm for pruning the useless basis vectors is also demonstrated.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"171 1","pages":"23-26 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86733785","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-14DOI: 10.1109/MWSCAS.1991.252167
J. Choi, B. Sheu, S. Gowda
Hardware annealing and winner-take-all (WTA) functions have been implemented in 2.0- mu m technology. The hardware annealing technique has been demonstrated using a 4*4 synapse network. Measurement results of a new WTA circuit are presented. The WTA circuit uses transistors biased in saturation to achieve high-speed performance. Since the comparison among the inputs is performed on one common signal line, the circuit can be easily extended to a larger dimension with that common signal line connected throughout the entire circuit. The new high-speed analog winner-take-all circuit can be extended linearly to at least 1024 inputs.<>
{"title":"Analog VLSI neural network implementations of hardware annealing and winner-take-all functions","authors":"J. Choi, B. Sheu, S. Gowda","doi":"10.1109/MWSCAS.1991.252167","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252167","url":null,"abstract":"Hardware annealing and winner-take-all (WTA) functions have been implemented in 2.0- mu m technology. The hardware annealing technique has been demonstrated using a 4*4 synapse network. Measurement results of a new WTA circuit are presented. The WTA circuit uses transistors biased in saturation to achieve high-speed performance. Since the comparison among the inputs is performed on one common signal line, the circuit can be easily extended to a larger dimension with that common signal line connected throughout the entire circuit. The new high-speed analog winner-take-all circuit can be extended linearly to at least 1024 inputs.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"1 1","pages":"344-347 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91553844","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-14DOI: 10.1109/MWSCAS.1991.252189
Z. Jiang, W. Schaufelberger
A method for online identification of continuous time-varying linear systems is proposed based on the block pulse functions. From the relations between entries of the block pulse operational matrices, simple regression equations corresponding to the original differential equation models with time-varying parameters can be obtained, and algorithms developed in discrete-time model identification can be applied directly to estimate the time-varying parameters of the continuous models without much modification. Compared with other methods for solving the same identification problem, no analog devices, no large computations in the data preparation stage, and no initial values are involved in this new method. Therefore, the estimation procedure is much simpler. Owing to the block pulse regression equations, the proposed recursive method is suitable for online identification of continuous time-varying linear systems from their sampled input and output data by means of digital computers.<>
{"title":"A recursive identification method for continuous time-varying linear systems","authors":"Z. Jiang, W. Schaufelberger","doi":"10.1109/MWSCAS.1991.252189","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252189","url":null,"abstract":"A method for online identification of continuous time-varying linear systems is proposed based on the block pulse functions. From the relations between entries of the block pulse operational matrices, simple regression equations corresponding to the original differential equation models with time-varying parameters can be obtained, and algorithms developed in discrete-time model identification can be applied directly to estimate the time-varying parameters of the continuous models without much modification. Compared with other methods for solving the same identification problem, no analog devices, no large computations in the data preparation stage, and no initial values are involved in this new method. Therefore, the estimation procedure is much simpler. Owing to the block pulse regression equations, the proposed recursive method is suitable for online identification of continuous time-varying linear systems from their sampled input and output data by means of digital computers.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"1 1","pages":"436-439 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90162394","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-14DOI: 10.1109/MWSCAS.1991.252149
I. Aksu, F. Ildiz, J. Burl
Image motion analysis algorithms can be employed to generate the 2-D velocity, the direction of the 3-D velocity, the rotation, and/or the relative depth of objects in a sequence of images. Most of these algorithms are designed to operate on high-signal-to-noise-ratio (SNR) images (typical of optical and infrared images). The applicability of these algorithms to estimation for low-SNR images (typical of radar and sonar images) is addressed. Motion analysis algorithms can be segregated into two major categories: optical flow and feature-based algorithms. The effects of noise on the performance of a number of optical-flow-based algorithms are evaluated using Monte Carlo computer simulation on a set of standardized image sequences. The effects of feature coordinate perturbations on the performance of a feature-based algorithm are evaluated using Monte Carlo computer simulation. The 1-D FFT (fast Fourier transform) algorithm was found to yield the best results in the presence of noise. This algorithm is simple but has difficulty when multiple moving objects are present in the scene.<>
{"title":"A comparison of the performance of image motion analysis algorithms operating on low signal to noise ratio images","authors":"I. Aksu, F. Ildiz, J. Burl","doi":"10.1109/MWSCAS.1991.252149","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252149","url":null,"abstract":"Image motion analysis algorithms can be employed to generate the 2-D velocity, the direction of the 3-D velocity, the rotation, and/or the relative depth of objects in a sequence of images. Most of these algorithms are designed to operate on high-signal-to-noise-ratio (SNR) images (typical of optical and infrared images). The applicability of these algorithms to estimation for low-SNR images (typical of radar and sonar images) is addressed. Motion analysis algorithms can be segregated into two major categories: optical flow and feature-based algorithms. The effects of noise on the performance of a number of optical-flow-based algorithms are evaluated using Monte Carlo computer simulation on a set of standardized image sequences. The effects of feature coordinate perturbations on the performance of a feature-based algorithm are evaluated using Monte Carlo computer simulation. The 1-D FFT (fast Fourier transform) algorithm was found to yield the best results in the presence of noise. This algorithm is simple but has difficulty when multiple moving objects are present in the scene.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"44 1","pages":"158-161 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79202710","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-14DOI: 10.1109/MWSCAS.1991.251985
M.A. Chalhoub, M. Sawan
Closed-loop linear time-invariant systems with output feedback are considered. Based on the Lyapunov approach, allowable linear time-invariant perturbations to the nominal system are considered and calculated to ensure stability robustness and certain performance robustness of closed-loop systems in any predeterminate region.<>
{"title":"Stability robustness bounds with output feedback","authors":"M.A. Chalhoub, M. Sawan","doi":"10.1109/MWSCAS.1991.251985","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.251985","url":null,"abstract":"Closed-loop linear time-invariant systems with output feedback are considered. Based on the Lyapunov approach, allowable linear time-invariant perturbations to the nominal system are considered and calculated to ensure stability robustness and certain performance robustness of closed-loop systems in any predeterminate region.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"162 3 1","pages":"928-930 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83285447","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
扫码关注我们
求助内容：
应助结果提醒方式：