Pub Date : 1991-05-14DOI: 10.1109/MWSCAS.1991.252036
K. Gopalakrishnan, B. Bhattacharya
M. Abramovici, P.R. Menon, and D.T. Miller (see IEEE Trans. on Computers, vol.C-35, no.8, p.760-71, Aug. 1986) observed that the checkpoint faults are not sufficient target faults for test generation in combinational circuits and presented an algorithm to select the additional target faults so as to ensure sufficiency. A critical review of their algorithm is presented, and certain disadvantages of that algorithm are brought to light. A revised algorithm incorporating an additional stage of fault simulation and judicious selection of noncheckpoint target faults based on a probabilistic model is developed. The concepts of cover forest and benefit indicators are developed and used effectively in guiding the judicious selection of noncheckpoint target faults, thus minimizing the total number of calls made to the test generation routine.<>
M. Abramovici, P.R. Menon和D.T. Miller(见IEEE译)。《论计算机》，c -35卷，第5期。8, p.760-71, 1986年8月)观察到检查点故障不是组合电路中测试生成的足够目标故障，并提出了一种选择额外目标故障以确保充分性的算法。对他们的算法进行了批判性的回顾，并指出了该算法的某些缺点。提出了一种改进的基于概率模型的故障模拟和非检查点目标故障的明智选择算法。开发了覆盖森林和效益指标的概念，并将其有效地用于指导非检查点目标故障的明智选择，从而最大限度地减少对测试生成例程的调用总数。
{"title":"Noncheckpoint target faults-how to order them?","authors":"K. Gopalakrishnan, B. Bhattacharya","doi":"10.1109/MWSCAS.1991.252036","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252036","url":null,"abstract":"M. Abramovici, P.R. Menon, and D.T. Miller (see IEEE Trans. on Computers, vol.C-35, no.8, p.760-71, Aug. 1986) observed that the checkpoint faults are not sufficient target faults for test generation in combinational circuits and presented an algorithm to select the additional target faults so as to ensure sufficiency. A critical review of their algorithm is presented, and certain disadvantages of that algorithm are brought to light. A revised algorithm incorporating an additional stage of fault simulation and judicious selection of noncheckpoint target faults based on a probabilistic model is developed. The concepts of cover forest and benefit indicators are developed and used effectively in guiding the judicious selection of noncheckpoint target faults, thus minimizing the total number of calls made to the test generation routine.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"13 1","pages":"619-622 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76841709","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.252073
B. Karimi, L. G. Johnson
For a given method of design for testability a mechanism is proposed to reduce the number of test inputs by connecting two or more test inputs together. It is shown that by preprocessing the reconvergent fanouts it is possible to identify and remove some of the redundant reconvergent paths. Reconvergent fanouts with multiple reconvergent gates are investigated, and their application in design for testability is discussed.<>
{"title":"Reduction of test inputs for combinational circuits","authors":"B. Karimi, L. G. Johnson","doi":"10.1109/MWSCAS.1991.252073","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252073","url":null,"abstract":"For a given method of design for testability a mechanism is proposed to reduce the number of test inputs by connecting two or more test inputs together. It is shown that by preprocessing the reconvergent fanouts it is possible to identify and remove some of the redundant reconvergent paths. Reconvergent fanouts with multiple reconvergent gates are investigated, and their application in design for testability is discussed.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"8 1","pages":"874-878 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77003668","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.252039
R. Weber
The author describes a closed-form solution and supporting computer program for an oscillator design based on S-parameters, a predetermined Q of a resonator, and a predetermined load or source impedance for the active device. Design steps for synthesizing an oscillator meeting these conditions are presented. The oscillator design sequence allows the circuit designer to design the oscillator with two- or three-port device data as appropriate. The equation includes the losses of the feedback elements.<>
{"title":"A microwave oscillator, S-parameter design and computer algorithm","authors":"R. Weber","doi":"10.1109/MWSCAS.1991.252039","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252039","url":null,"abstract":"The author describes a closed-form solution and supporting computer program for an oscillator design based on S-parameters, a predetermined Q of a resonator, and a predetermined load or source impedance for the active device. Design steps for synthesizing an oscillator meeting these conditions are presented. The oscillator design sequence allows the circuit designer to design the oscillator with two- or three-port device data as appropriate. The equation includes the losses of the feedback elements.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"5 1","pages":"303-306 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75248835","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.251949
M. Hindy, A. Mitkees, A. Elsohly
The normalized longitudinal and transverse current distributions of microstrip line on ferrite substrate are obtained using the spectral domain approach for vertical magnetization. The dispersive properties of the line, i.e. characteristic impedance and effective permeability, are accurately evaluated. The new current distributions speed up the numerical computation of the parameters at different frequencies.<>
{"title":"Application of convolution approach for microstrip lines on ferrite substrate","authors":"M. Hindy, A. Mitkees, A. Elsohly","doi":"10.1109/MWSCAS.1991.251949","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.251949","url":null,"abstract":"The normalized longitudinal and transverse current distributions of microstrip line on ferrite substrate are obtained using the spectral domain approach for vertical magnetization. The dispersive properties of the line, i.e. characteristic impedance and effective permeability, are accurately evaluated. The new current distributions speed up the numerical computation of the parameters at different frequencies.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"22 1","pages":"1073-1076 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75249797","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.252188
A. Dao, G. Branner
Active microwave subsystems such as mixers and other frequency translation devices find increasing application with the advent of MIMIC (monolithic microwave integrated circuit) technology. The authors consider the use of a silicon bipolar MMIC device for such an application. A systematic technique to develop a precision general model for application to such subsystem design is described. The modeling technique described provides an optimum computer model which accurately predicts both linear and nonlinear device behavior with excellent fidelity upon comparison with measured data.<>
{"title":"A novel technique for active device modeling for microwave mixer applications","authors":"A. Dao, G. Branner","doi":"10.1109/MWSCAS.1991.252188","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252188","url":null,"abstract":"Active microwave subsystems such as mixers and other frequency translation devices find increasing application with the advent of MIMIC (monolithic microwave integrated circuit) technology. The authors consider the use of a silicon bipolar MMIC device for such an application. A systematic technique to develop a precision general model for application to such subsystem design is described. The modeling technique described provides an optimum computer model which accurately predicts both linear and nonlinear device behavior with excellent fidelity upon comparison with measured data.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"119 1","pages":"429-431 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74888271","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.252132
T. Kitamura, K. Nishioka, A. Iwata, E. Hayahara
Present speaker-dependent 100-word recognition using CombNET, which consists of a four-layered neural network with a comb structure, and dynamic spectral features of speech based on a two-dimensional mel-cepstrum. CombNET consists of two types of neural network. The first one is a stem network which utilizes a self-organizing algorithm and roughly classifies an input pattern. The second one consists of many branch networks using a back-propagation algorithm and precisely classifies the pattern. Experimental results on speaker-dependent word recognition for 100 Japanese city names uttered by nine male speakers show that the recognition accuracy is 97.3%.<>
{"title":"Speaker-dependent 100 word recognition using CombNET and dynamic spectral features of speech","authors":"T. Kitamura, K. Nishioka, A. Iwata, E. Hayahara","doi":"10.1109/MWSCAS.1991.252132","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252132","url":null,"abstract":"Present speaker-dependent 100-word recognition using CombNET, which consists of a four-layered neural network with a comb structure, and dynamic spectral features of speech based on a two-dimensional mel-cepstrum. CombNET consists of two types of neural network. The first one is a stem network which utilizes a self-organizing algorithm and roughly classifies an input pattern. The second one consists of many branch networks using a back-propagation algorithm and precisely classifies the pattern. Experimental results on speaker-dependent word recognition for 100 Japanese city names uttered by nine male speakers show that the recognition accuracy is 97.3%.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"50 1","pages":"83-86 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74941469","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.252013
L.-M. Jin, S.-P. Chan
A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit.<>
{"title":"A new and efficient partitioning algorithm: genetic partitioning","authors":"L.-M. Jin, S.-P. Chan","doi":"10.1109/MWSCAS.1991.252013","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252013","url":null,"abstract":"A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"80 1","pages":"712-715 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74958923","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.252184
E.A.F. Abdalla, E. Hosny, M. A. Nassef, A. M. Moselhy
Microwave integrated circuits whose elements are linear and nonlinear lumped/distributed are analyzed using an efficient topological method. The state and output equations of these circuits are derived in explicit form with no restriction on the network topology. A computer program has been developed for the analysis of these circuits in both frequency and time domains. An illustrative example is successfully analyzed using the developed program.<>
{"title":"Computer-aided analysis of microwave integrated circuits using an efficient topological method","authors":"E.A.F. Abdalla, E. Hosny, M. A. Nassef, A. M. Moselhy","doi":"10.1109/MWSCAS.1991.252184","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252184","url":null,"abstract":"Microwave integrated circuits whose elements are linear and nonlinear lumped/distributed are analyzed using an efficient topological method. The state and output equations of these circuits are derived in explicit form with no restriction on the network topology. A computer program has been developed for the analysis of these circuits in both frequency and time domains. An illustrative example is successfully analyzed using the developed program.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"35 1","pages":"410-413 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75314533","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.251968
M. Ilyas, S. Bhatia
The authors present a congestion avoidance scheme that is simple yet effective. This scheme basically exercises access control for the incoming calls. In this scheme, an incoming call is accepted only if its resource requirement is not more than a certain predefined percentage of the remaining resources at the intermediate points of a BISDN (broadband integrated services digital network). The authors simulate this scheme for a simple network and present results in terms of blocking probabilities as the arrival rates of different kinds of calls are varied. Some results are shown in terms of effects of varying the threshold on the blocking probabilities. Some of the effects are depicted in terms of delay histograms for different situations. Generally, the results show that the calls with higher bandwidth requirements are affected the most as compared to the calls that have lower bandwidth requirements. The model developed is useful in the design of BISDN that can handle a wide variety of traffic characteristics of different applications.<>
{"title":"Congestion avoidance in broadband ISDN","authors":"M. Ilyas, S. Bhatia","doi":"10.1109/MWSCAS.1991.251968","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.251968","url":null,"abstract":"The authors present a congestion avoidance scheme that is simple yet effective. This scheme basically exercises access control for the incoming calls. In this scheme, an incoming call is accepted only if its resource requirement is not more than a certain predefined percentage of the remaining resources at the intermediate points of a BISDN (broadband integrated services digital network). The authors simulate this scheme for a simple network and present results in terms of blocking probabilities as the arrival rates of different kinds of calls are varied. Some results are shown in terms of effects of varying the threshold on the blocking probabilities. Some of the effects are depicted in terms of delay histograms for different situations. Generally, the results show that the calls with higher bandwidth requirements are affected the most as compared to the calls that have lower bandwidth requirements. The model developed is useful in the design of BISDN that can handle a wide variety of traffic characteristics of different applications.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"65 1","pages":"997-1000 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75930272","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.252049
M. S. Lam
Linear recursive sequences generated from irreducible polynomials over GF(q), q=P/sup m/, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed.<>
{"title":"Generation of linear recursive sequences from irreducible polynomials over GF(Q)","authors":"M. S. Lam","doi":"10.1109/MWSCAS.1991.252049","DOIUrl":"https://doi.org/10.1109/MWSCAS.1991.252049","url":null,"abstract":"Linear recursive sequences generated from irreducible polynomials over GF(q), q=P/sup m/, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"7 14 1","pages":"261-264 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76061351","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
扫码关注我们
求助内容：
应助结果提醒方式：