Pub Date : 1990-04-25DOI: 10.1109/STIER.1990.324650
D. Parsons, B. Camp, V. Genova
The activities at IBM Owego to design and manufacture gallium arsenide (GaAs) monolithic microwave integrated circuits (MMIC) for electronic support measure (ESM) microwave receivers are reviewed. The process, circuit design concepts and elements, and completed integrated circuits with results are described. The number of circuit design iterations involving actual wafer fabrication can be significantly reduced, often to one iteration, by the use of accurate design modeling. Much time is spent checking the correlation between predicted and measured results of basic circuit elements such as FETs, coils, capacitors, resistors, diodes, and microwave transmission lines. Often the coupling between these elements is important because of the close spacing required from small size. Once these models are proven to be accurate and realistic, it is then a simple and quick process to use them in the CAD program to generate many different circuit functions. Once the active and passive element models are complete, predictable integrated circuits are readily constructed. The finished devices are mounted in gold plated kovar packages to form more complex higher level functions.<>
{"title":"Gallium arsenide monolithic microwave integrated circuits in IBM","authors":"D. Parsons, B. Camp, V. Genova","doi":"10.1109/STIER.1990.324650","DOIUrl":"https://doi.org/10.1109/STIER.1990.324650","url":null,"abstract":"The activities at IBM Owego to design and manufacture gallium arsenide (GaAs) monolithic microwave integrated circuits (MMIC) for electronic support measure (ESM) microwave receivers are reviewed. The process, circuit design concepts and elements, and completed integrated circuits with results are described. The number of circuit design iterations involving actual wafer fabrication can be significantly reduced, often to one iteration, by the use of accurate design modeling. Much time is spent checking the correlation between predicted and measured results of basic circuit elements such as FETs, coils, capacitors, resistors, diodes, and microwave transmission lines. Often the coupling between these elements is important because of the close spacing required from small size. Once these models are proven to be accurate and realistic, it is then a simple and quick process to use them in the CAD program to generate many different circuit functions. Once the active and passive element models are complete, predictable integrated circuits are readily constructed. The finished devices are mounted in gold plated kovar packages to form more complex higher level functions.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052490","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 : 1990-04-25DOI: 10.1109/STIER.1990.324636
S. Felter, D. Hill, C.A. Smith
Mission computer functions developed for the MH-53J helicopter are described, following a brief introduction of the Pave Low III system. Additional functions often found in mission computers that are not included in the MH-53J, such as flight directors and integrated communication systems, are considered. Future concepts for mission computer application are addressed.<>
{"title":"Avionics system integration for the MH-53J helicopter","authors":"S. Felter, D. Hill, C.A. Smith","doi":"10.1109/STIER.1990.324636","DOIUrl":"https://doi.org/10.1109/STIER.1990.324636","url":null,"abstract":"Mission computer functions developed for the MH-53J helicopter are described, following a brief introduction of the Pave Low III system. Additional functions often found in mission computers that are not included in the MH-53J, such as flight directors and integrated communication systems, are considered. Future concepts for mission computer application are addressed.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917300","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 : 1990-04-25DOI: 10.1109/STIER.1990.324626
W. Moussa, J. E. Morris
The state space averaging method and the pulse-width-modulation (PWM) switch method for modeling of DC-to-DC converters are reviewed. The methods are compared through the computation and plotting of typical transfer functions of a buck converter. The state space averaging method begins by writing the state equation and the state matrices describing the system, and requires matrix operations for computation of the system transfer functions. It also leads to a canonical model that represents the four basic DC-to-DC topologies. The PWM switch method leads to a simpler circuit analysis of the converter which can be easily simulated using SPICE-like simulation programs.<>
{"title":"Comparison between state space averaging and PWM switch for switch mode power supply analysis","authors":"W. Moussa, J. E. Morris","doi":"10.1109/STIER.1990.324626","DOIUrl":"https://doi.org/10.1109/STIER.1990.324626","url":null,"abstract":"The state space averaging method and the pulse-width-modulation (PWM) switch method for modeling of DC-to-DC converters are reviewed. The methods are compared through the computation and plotting of typical transfer functions of a buck converter. The state space averaging method begins by writing the state equation and the state matrices describing the system, and requires matrix operations for computation of the system transfer functions. It also leads to a canonical model that represents the four basic DC-to-DC topologies. The PWM switch method leads to a simpler circuit analysis of the converter which can be easily simulated using SPICE-like simulation programs.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131246866","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 : 1990-04-25DOI: 10.1109/STIER.1990.324646
A. Ahmed
Two different approaches for solving the traveling salesman problem (TSP) using the conventional combinatorial search method and the proposed heuristic search algorithm are presented. In the algorithms presented, the cities are traversed in a breadth first search (BFS) manner, but the heuristic approach has some mathematical intelligence embedded in it to reduce the search polynomially. Both the algorithms, for heuristic as well as combinatorial search (BFS), are implemented using LISP. The recursive nature of the LISP functions has been exploited to manipulate the wildly exploding search trees. The results of the LISP run are presented along with the performance criteria, such as percentage of node visitation in the search tree. These results show that the heuristic method yields an optimal solution in polynomial time proportional to the width of the search space.<>
{"title":"Solving traveling salesman's problem using functional language","authors":"A. Ahmed","doi":"10.1109/STIER.1990.324646","DOIUrl":"https://doi.org/10.1109/STIER.1990.324646","url":null,"abstract":"Two different approaches for solving the traveling salesman problem (TSP) using the conventional combinatorial search method and the proposed heuristic search algorithm are presented. In the algorithms presented, the cities are traversed in a breadth first search (BFS) manner, but the heuristic approach has some mathematical intelligence embedded in it to reduce the search polynomially. Both the algorithms, for heuristic as well as combinatorial search (BFS), are implemented using LISP. The recursive nature of the LISP functions has been exploited to manipulate the wildly exploding search trees. The results of the LISP run are presented along with the performance criteria, such as percentage of node visitation in the search tree. These results show that the heuristic method yields an optimal solution in polynomial time proportional to the width of the search space.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131729982","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 : 1990-04-25DOI: 10.1109/STIER.1990.324634
S. Felter
The federated Kalman filter, which combines data from multiple Kalman filters, is discussed. The federated filter can provide performance equal to that of a single Kalman filter that integrates all the independent sensor data in the system. The advantage is that a single filter is impractical with existing sensors. The federated filter is practical, but for true optimal performance it is necessary that all Kalman filters contain the same process model and make their covariance matrices available on the serial data bus. The federated filter can be reconfigured to provide a less optimal solution with a higher degree of fault tolerance. The application of the federated filter to combine data from two Kalman filters in a navigation system is simulated, and results are provided.<>
{"title":"An overview of decentralized Kalman filter techniques","authors":"S. Felter","doi":"10.1109/STIER.1990.324634","DOIUrl":"https://doi.org/10.1109/STIER.1990.324634","url":null,"abstract":"The federated Kalman filter, which combines data from multiple Kalman filters, is discussed. The federated filter can provide performance equal to that of a single Kalman filter that integrates all the independent sensor data in the system. The advantage is that a single filter is impractical with existing sensors. The federated filter is practical, but for true optimal performance it is necessary that all Kalman filters contain the same process model and make their covariance matrices available on the serial data bus. The federated filter can be reconfigured to provide a less optimal solution with a higher degree of fault tolerance. The application of the federated filter to combine data from two Kalman filters in a navigation system is simulated, and results are provided.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134040055","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 : 1990-04-25DOI: 10.1109/STIER.1990.324627
W. Moussa, J. E. Morris
A steady state analysis of an offline, high frequency series resonant converter that operates from 200 VDC and produces 5.0 VDC at 10 A is presented. Regulation is accomplished through varying the switching frequency while keeping the ON time of the switch constant. The switching cycle is split into separate stages, each stage analyzed through a description of its state equations. Some of the features of this converter are: the switches turn both on and off into zero current, the inductor (L) current and capacitor (C) voltage waveforms have finite slopes causing less electromagnetic interference (as opposed to pulse-width-modulation converters) the transformer's leakage inductance can be used in part or entirely as the resonant inductor, and the current in L and the voltage across C do not resonate continuously-instead, they assume fixed values at the end of every cycle.<>
{"title":"Steady state analysis for an off-line series resonant converter","authors":"W. Moussa, J. E. Morris","doi":"10.1109/STIER.1990.324627","DOIUrl":"https://doi.org/10.1109/STIER.1990.324627","url":null,"abstract":"A steady state analysis of an offline, high frequency series resonant converter that operates from 200 VDC and produces 5.0 VDC at 10 A is presented. Regulation is accomplished through varying the switching frequency while keeping the ON time of the switch constant. The switching cycle is split into separate stages, each stage analyzed through a description of its state equations. Some of the features of this converter are: the switches turn both on and off into zero current, the inductor (L) current and capacitor (C) voltage waveforms have finite slopes causing less electromagnetic interference (as opposed to pulse-width-modulation converters) the transformer's leakage inductance can be used in part or entirely as the resonant inductor, and the current in L and the voltage across C do not resonate continuously-instead, they assume fixed values at the end of every cycle.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134139982","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 : 1990-04-25DOI: 10.1109/STIER.1990.324639
D. Telfer
The application system (AS) provides a powerful VM/MVS host based facility to automate the tasks required to manage and control projects. The front-end menu-driven application, project management control package (PMCP), simplifies and organizes the functions AS provides for project management. PMCP provides an online method for recording and organizing project activity information, generating schedules with recommended start and end dates, recording activity progress, and project reporting both statistically and graphically. The functions provided in PMCP are utilized for the planning and execution of a sample project. PMCP on AS initially generates schedules based on effort, resources, relationships, and calendars. It facilitates progress tracking and schedule revisions. Progress reporting can be done with activity reports, Gantt charts, or graphic plots.<>
{"title":"Effective project management with PMCP on application system (AS)","authors":"D. Telfer","doi":"10.1109/STIER.1990.324639","DOIUrl":"https://doi.org/10.1109/STIER.1990.324639","url":null,"abstract":"The application system (AS) provides a powerful VM/MVS host based facility to automate the tasks required to manage and control projects. The front-end menu-driven application, project management control package (PMCP), simplifies and organizes the functions AS provides for project management. PMCP provides an online method for recording and organizing project activity information, generating schedules with recommended start and end dates, recording activity progress, and project reporting both statistically and graphically. The functions provided in PMCP are utilized for the planning and execution of a sample project. PMCP on AS initially generates schedules based on effort, resources, relationships, and calendars. It facilitates progress tracking and schedule revisions. Progress reporting can be done with activity reports, Gantt charts, or graphic plots.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114686150","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 : 1990-04-25DOI: 10.1109/STIER.1990.324632
D. R. Vogel, T. J. Mesler
The rate monotonic scheduling (RMS) theory in an analytical approach that solves the most fundamental problems in constructing real-time software: providing predictable real-time response in the face of a high processing load while still supporting modern development methodologies and ease of maintenance after product delivery. Additionally, when all time constraints cannot be met, the system must be able to shed load in a predictable manner. RMS theory assigns priorities to tasks based on their periodicity. Tasks with shorter periods receive the higher priorities. Using this analytical approach provides the predictability required of real-time systems while still supporting modern design techniques. Theorems for the RMS methodology are used to predict system behavior. There are three principal theorems used in RMS to determine the schedulability of a specified task set. A brief overview of the three RMS theorems is presented.<>
{"title":"Apply an analytical approach for predictable real-time systems","authors":"D. R. Vogel, T. J. Mesler","doi":"10.1109/STIER.1990.324632","DOIUrl":"https://doi.org/10.1109/STIER.1990.324632","url":null,"abstract":"The rate monotonic scheduling (RMS) theory in an analytical approach that solves the most fundamental problems in constructing real-time software: providing predictable real-time response in the face of a high processing load while still supporting modern development methodologies and ease of maintenance after product delivery. Additionally, when all time constraints cannot be met, the system must be able to shed load in a predictable manner. RMS theory assigns priorities to tasks based on their periodicity. Tasks with shorter periods receive the higher priorities. Using this analytical approach provides the predictability required of real-time systems while still supporting modern design techniques. Theorems for the RMS methodology are used to predict system behavior. There are three principal theorems used in RMS to determine the schedulability of a specified task set. A brief overview of the three RMS theorems is presented.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126585708","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 : 1990-04-25DOI: 10.1109/STIER.1990.324635
S. Weng, N. Wu
The issues of model simplification, stabilization and control of time-delay systems are addressed. Locating unstable poles is essential in a classical stabilization problem. Since a transfer function of an infinite dimensional system is not rational, search of its poles in the entire complex plane is not a simple task. The application of DFT (discrete Fourier transform) based approximation can completely avoid such a search. This technique is discussed. It is shown that a finite dimensional controller can be obtained from the finite dimensional approximated transfer function G'(s) immediately. The technique is detailed. Procedures for evaluating unstable poles, designing controllers and computing the coprime factorizations for infinite-dimensional systems are described.<>
{"title":"DFT based model simplification and its applications in controls","authors":"S. Weng, N. Wu","doi":"10.1109/STIER.1990.324635","DOIUrl":"https://doi.org/10.1109/STIER.1990.324635","url":null,"abstract":"The issues of model simplification, stabilization and control of time-delay systems are addressed. Locating unstable poles is essential in a classical stabilization problem. Since a transfer function of an infinite dimensional system is not rational, search of its poles in the entire complex plane is not a simple task. The application of DFT (discrete Fourier transform) based approximation can completely avoid such a search. This technique is discussed. It is shown that a finite dimensional controller can be obtained from the finite dimensional approximated transfer function G'(s) immediately. The technique is detailed. Procedures for evaluating unstable poles, designing controllers and computing the coprime factorizations for infinite-dimensional systems are described.<<ETX>>","PeriodicalId":166693,"journal":{"name":"IEEE Technical Conference on Southern Tier","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446800","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
扫码关注我们
求助内容：
应助结果提醒方式：