Pub Date : 1991-05-14DOI: 10.1109/MWSCAS.1991.252064
M. Barjaktarovic, K. Jabbour
Presents an evaluation of the TCP/IP (Transmission Control Protocol/Internet Protocol) under various traffic conditions by simulating file transfer between two Ethernet stations connected via an FDDI (Fiber Distributed Data Interface) backbone. The model is built using a simulation language called Research Queueing Package. The results presented indicate that TCP works slower for smaller files, partly because of the chosen parameter values (e.g. buffer sizes, the initial window size, the initial timeout value) and partly because of the long wait for the retransmission timeout to expire. The simulation results and data from a real FTP (file transfer protocol) show that TCP/IP is sensitive to different parameter values, especially the timeout values. It is also found that TCP introduces a significant overhead. Therefore, it is concluded that TCP is not very efficient for strictly local area networks, and that a more efficient protocol for this purpose must be developed.<>
{"title":"Simulation and evaluation of FTP and TCP/IP on FDDI backbone network","authors":"M. Barjaktarovic, K. Jabbour","doi":"10.1109/MWSCAS.1991.252064","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252064","url":null,"abstract":"Presents an evaluation of the TCP/IP (Transmission Control Protocol/Internet Protocol) under various traffic conditions by simulating file transfer between two Ethernet stations connected via an FDDI (Fiber Distributed Data Interface) backbone. The model is built using a simulation language called Research Queueing Package. The results presented indicate that TCP works slower for smaller files, partly because of the chosen parameter values (e.g. buffer sizes, the initial window size, the initial timeout value) and partly because of the long wait for the retransmission timeout to expire. The simulation results and data from a real FTP (file transfer protocol) show that TCP/IP is sensitive to different parameter values, especially the timeout values. It is also found that TCP introduces a significant overhead. Therefore, it is concluded that TCP is not very efficient for strictly local area networks, and that a more efficient protocol for this purpose must be developed.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"34 1","pages":"912-915 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91322153","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.252038
S. Burns, R. Weber
The authors report on the use of sputter-deposited, thin-film, aluminum nitride resonators as the feedback element in hybrid single-mode, combline, and voltage-controlled UHF and L-band oscillators. The resonators have also been cointegrated on the same substrate with 2-GHz BJTs (bipolar junction transistors). Design techniques and suggestions for novel architectures using this technology are presented.<>
{"title":"Design and performance of UHF and L-band oscillators using thin-film resonators on semiconductor substrates","authors":"S. Burns, R. Weber","doi":"10.1109/MWSCAS.1991.252038","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252038","url":null,"abstract":"The authors report on the use of sputter-deposited, thin-film, aluminum nitride resonators as the feedback element in hybrid single-mode, combline, and voltage-controlled UHF and L-band oscillators. The resonators have also been cointegrated on the same substrate with 2-GHz BJTs (bipolar junction transistors). Design techniques and suggestions for novel architectures using this technology are presented.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"22 1","pages":"307-310 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82768870","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.252107
M. Broughton
To manage the movement of the state vector among the various linear subsystems comprising a piecewise linear system, the author introduces a decision vector d which is a linear combination D of the state components, configured so that the transition of d through zero is essential to the transfer of the state to the next feasible subsystem. Boolean (0/1) vectors associated with the polarity of d and a Boolean mask matrix implement the logical operations controlling the selection of the next subsystem. Following the development of a simulation model based on the concepts described, a computer program for solving it is given. An illustration from the field of power-electronic circuits is presented.<>
{"title":"A general state-space method for modelling piecewise linear systems","authors":"M. Broughton","doi":"10.1109/MWSCAS.1991.252107","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252107","url":null,"abstract":"To manage the movement of the state vector among the various linear subsystems comprising a piecewise linear system, the author introduces a decision vector d which is a linear combination D of the state components, configured so that the transition of d through zero is essential to the transfer of the state to the next feasible subsystem. Boolean (0/1) vectors associated with the polarity of d and a Boolean mask matrix implement the logical operations controlling the selection of the next subsystem. Following the development of a simulation model based on the concepts described, a computer program for solving it is given. An illustration from the field of power-electronic circuits is presented.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"277 1","pages":"529-532 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83070193","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.252106
T. Kitamura, K. Nishioka, A. Ito, E. Hayahara
A spoken word recognition method using dynamic features of speech and neural networks is presented. Dynamic features of speech are obtained from a two-dimensional mel-cepstrum (TDMC). The TDMC is defined as the two-dimensional Fourier transform of mel-frequency scaled log spectra in the frequency and time domains. It has averaged spectral features, dynamic spectral features, and averaged and dynamic features of power of the two-dimensional mel-log spectra in the analyzed interval. The neural network in this study is a three-layered feedforward neural network and learns automatically using a back-propagation algorithm. Dynamic spectral features, and averaged and dynamic features of power are used as the input of a neural network. The experimental results of speaker-dependent word recognition experiments for 100 Japanese city names uttered by nine speakers show that dynamic spectral features smoothed with respect to time are effective, and a recognition accuracy of 99.1% was obtained.<>
{"title":"Speaker-dependent 100 word recognition using dynamic spectral features of speech and neural networks","authors":"T. Kitamura, K. Nishioka, A. Ito, E. Hayahara","doi":"10.1109/MWSCAS.1991.252106","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252106","url":null,"abstract":"A spoken word recognition method using dynamic features of speech and neural networks is presented. Dynamic features of speech are obtained from a two-dimensional mel-cepstrum (TDMC). The TDMC is defined as the two-dimensional Fourier transform of mel-frequency scaled log spectra in the frequency and time domains. It has averaged spectral features, dynamic spectral features, and averaged and dynamic features of power of the two-dimensional mel-log spectra in the analyzed interval. The neural network in this study is a three-layered feedforward neural network and learns automatically using a back-propagation algorithm. Dynamic spectral features, and averaged and dynamic features of power are used as the input of a neural network. The experimental results of speaker-dependent word recognition experiments for 100 Japanese city names uttered by nine speakers show that dynamic spectral features smoothed with respect to time are effective, and a recognition accuracy of 99.1% was obtained.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"29 1","pages":"533-536 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84303626","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.251983
S. Chow, V. Rao
A modified balance-truncation reduced-order model is developed by introducing a weighting factor which provides an extra degree of freedom in emphasizing the relative magnitude of the model reduction errors at low and high frequencies. The maximum model reduction error can be reduced to a lower value by an appropriate choice of the weighting factor. The direct model of B.C. Moore (1982) and the singular perturbation approximation method will become two special cases in the modified technique. A stability criterion for the reduced-order model and a procedure for selection of the weighting factor are developed. The formulae for the L/sub infinity /-norm error bound on the reduction at zero and infinite frequencies are also derived. The proposed model reduction method is demonstrated by designing lower-order controllers for a Phillips Laboratory experimental flexible grid structure.<>
{"title":"Model reduction using balance-truncation method with lower error bounds","authors":"S. Chow, V. Rao","doi":"10.1109/MWSCAS.1991.251983","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.251983","url":null,"abstract":"A modified balance-truncation reduced-order model is developed by introducing a weighting factor which provides an extra degree of freedom in emphasizing the relative magnitude of the model reduction errors at low and high frequencies. The maximum model reduction error can be reduced to a lower value by an appropriate choice of the weighting factor. The direct model of B.C. Moore (1982) and the singular perturbation approximation method will become two special cases in the modified technique. A stability criterion for the reduced-order model and a procedure for selection of the weighting factor are developed. The formulae for the L/sub infinity /-norm error bound on the reduction at zero and infinite frequencies are also derived. The proposed model reduction method is demonstrated by designing lower-order controllers for a Phillips Laboratory experimental flexible grid structure.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"9 1","pages":"934-938 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81949353","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.252128
M. Sobhy, E. A. Hosny, A. Nasser
It is demonstrated that chaotic behavior can occur in practical microwave nonlinear circuits, and methods of analysis that can predict such behavior are presented. Theoretical and practical results are presented for IMPATT and Gunn diode oscillators. The method of analysis presented helps the designer to understand the behavior and to design chaos-free oscillators.<>
{"title":"Chaos in microwave oscillators","authors":"M. Sobhy, E. A. Hosny, A. Nasser","doi":"10.1109/MWSCAS.1991.252128","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252128","url":null,"abstract":"It is demonstrated that chaotic behavior can occur in practical microwave nonlinear circuits, and methods of analysis that can predict such behavior are presented. Theoretical and practical results are presented for IMPATT and Gunn diode oscillators. The method of analysis presented helps the designer to understand the behavior and to design chaos-free oscillators.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"1 1","pages":"68-71 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79802713","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.252000
C.P. Silva
The author investigates a large class of three-region, piecewise-linear, continuous vector fields on R/sup 3/, termed the double-hook family F/sub s/, which is a derivative of the well-known double-scroll circuit family and exhibits chaotic behavior both numerically and experimentally. The author performs a comprehensive analysis of the family's piecewise-linear geometry, discusses the double-hook attractor's structure, and presents a normal form equation for the family's dynamics. He then commences a detailed qualitative study of its behavior by means of characteristic Poincare maps, after which he applies the Sil'nikov's method to establish formally the existence of horseshoe chaos for a particular member of F/sub s/. The present results are extended to the complementary dual double-hook family.<>
{"title":"Analytical study of the double-hook attractor","authors":"C.P. Silva","doi":"10.1109/MWSCAS.1991.252000","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252000","url":null,"abstract":"The author investigates a large class of three-region, piecewise-linear, continuous vector fields on R/sup 3/, termed the double-hook family F/sub s/, which is a derivative of the well-known double-scroll circuit family and exhibits chaotic behavior both numerically and experimentally. The author performs a comprehensive analysis of the family's piecewise-linear geometry, discusses the double-hook attractor's structure, and presents a normal form equation for the family's dynamics. He then commences a detailed qualitative study of its behavior by means of characteristic Poincare maps, after which he applies the Sil'nikov's method to establish formally the existence of horseshoe chaos for a particular member of F/sub s/. The present results are extended to the complementary dual double-hook family.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"63 1","pages":"764-771 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86463931","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.252101
J.S. Kim, H. Singh
Using the neural network approach for determination of the constrained state-space realization from Markov parameters of the transfer function is proposed. The neural network approach is suggested for determining realization A, B, and C in such a manner that there are some constraints on some of the elements of A, B, and C. Such constraint cases cannot be achieved using conventional algorithms. A single-layer neural network and heuristic random optimization algorithm are used for constrained state-space realization.<>
{"title":"Neural net approach for constrained state-space realization","authors":"J.S. Kim, H. Singh","doi":"10.1109/MWSCAS.1991.252101","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252101","url":null,"abstract":"Using the neural network approach for determination of the constrained state-space realization from Markov parameters of the transfer function is proposed. The neural network approach is suggested for determining realization A, B, and C in such a manner that there are some constraints on some of the elements of A, B, and C. Such constraint cases cannot be achieved using conventional algorithms. A single-layer neural network and heuristic random optimization algorithm are used for constrained state-space realization.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"1 1","pages":"553-556 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88327886","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.252046
N. Yassine
The author describes an improved technique for transforming a residue number into a mixed-radix weighted representation using matrix techniques. The mixed-radix digits of the proposed conversion procedure are factorized into a product of two terms each. One term is invariant and predetermined, while the other is variable and depends on the particular residue number being converted. In comparison with previous conversion techniques, the proposed conversion method achieves a considerable reduction in the number of arithmetic multiplications needed during the conversion process.<>
{"title":"Matrix mixed-radix conversion for RNS arithmetic architectures","authors":"N. Yassine","doi":"10.1109/MWSCAS.1991.252046","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252046","url":null,"abstract":"The author describes an improved technique for transforming a residue number into a mixed-radix weighted representation using matrix techniques. The mixed-radix digits of the proposed conversion procedure are factorized into a product of two terms each. One term is invariant and predetermined, while the other is variable and depends on the particular residue number being converted. In comparison with previous conversion techniques, the proposed conversion method achieves a considerable reduction in the number of arithmetic multiplications needed during the conversion process.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"206 1","pages":"273-278 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80433810","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.252168
D. Hiser, R. Geiger
An architecture is presented of a digitally programmable CMOS OTA-C (operational transconductance amplifier and capacitor) analog filter which is controlled, characterized, and tuned by a microprocessor in the field. Two elements of this architecture, the highly accurate performance measurement system and the tuning algorithm are discussed in detail. Experimental results show that this versatile architecture is suitable for high-accuracy, high-frequency, or high-Q continuous-time filtering applications, as well as those requiring in-field self-tests or in-field programming.<>
{"title":"A programmable digitally-tuned CMOS OTA-C bandpass filter architecture for high-accuracy applications","authors":"D. Hiser, R. Geiger","doi":"10.1109/MWSCAS.1991.252168","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252168","url":null,"abstract":"An architecture is presented of a digitally programmable CMOS OTA-C (operational transconductance amplifier and capacitor) analog filter which is controlled, characterized, and tuned by a microprocessor in the field. Two elements of this architecture, the highly accurate performance measurement system and the tuning algorithm are discussed in detail. Experimental results show that this versatile architecture is suitable for high-accuracy, high-frequency, or high-Q continuous-time filtering applications, as well as those requiring in-field self-tests or in-field programming.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"21 1","pages":"348-351 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82148729","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
扫码关注我们
求助内容：
应助结果提醒方式：