Pub Date : 1996-03-31DOI: 10.1109/SSST.1996.493529
Z. Jiang, Nan Chen, D. Zhou
Digital audio signal processing has become increasingly popular in multimedia systems, largely thanks to the advent of general digital signal processor (DSP) chips and high-precision oversampling A/D and D/A converters. For portable and home entertainment audio systems, however the general-DSP-chip-based solution might be too costly and consume too much power. Then a low-cost and low power solution for this purpose should be sought. By carefully examining digital audio processing applications, the authors believe that there exist two possible approaches that can reduce the chip area and power consumption: one is the simplification of the audio processor structure, and the other is to reduce the chip supply voltage. This paper presents a low-power and low-cost two-channel (stereo) digital audio processor that exploits these two approaches.
{"title":"A low-cost and low-power digital audio processor","authors":"Z. Jiang, Nan Chen, D. Zhou","doi":"10.1109/SSST.1996.493529","DOIUrl":"https://doi.org/10.1109/SSST.1996.493529","url":null,"abstract":"Digital audio signal processing has become increasingly popular in multimedia systems, largely thanks to the advent of general digital signal processor (DSP) chips and high-precision oversampling A/D and D/A converters. For portable and home entertainment audio systems, however the general-DSP-chip-based solution might be too costly and consume too much power. Then a low-cost and low power solution for this purpose should be sought. By carefully examining digital audio processing applications, the authors believe that there exist two possible approaches that can reduce the chip area and power consumption: one is the simplification of the audio processor structure, and the other is to reduce the chip supply voltage. This paper presents a low-power and low-cost two-channel (stereo) digital audio processor that exploits these two approaches.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132614000","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 : 1996-03-31DOI: 10.1109/SSST.1996.493555
O. Ismail
This paper presents multipoint Pade approximation for discrete interval systems. The numerator and denominator of the reduced model are obtained such that G/sub m/(z) to be a Pade approximant of G/sub s/(z), about 2r points. The expansion points used in the approximation could be a mixture of real, imaginary, complex and multiple points, many of the computational difficulties for such a combination of points are eliminated by this method. Numerical examples illustrate the procedure.
{"title":"On multipoint Pade approximation for discrete interval systems","authors":"O. Ismail","doi":"10.1109/SSST.1996.493555","DOIUrl":"https://doi.org/10.1109/SSST.1996.493555","url":null,"abstract":"This paper presents multipoint Pade approximation for discrete interval systems. The numerator and denominator of the reduced model are obtained such that G/sub m/(z) to be a Pade approximant of G/sub s/(z), about 2r points. The expansion points used in the approximation could be a mixture of real, imaginary, complex and multiple points, many of the computational difficulties for such a combination of points are eliminated by this method. Numerical examples illustrate the procedure.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132733610","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 : 1996-03-31DOI: 10.1109/SSST.1996.493461
Xiang Chen, Kemin Zhou
Uses the Nash game approach to solve a mixed H/sub 2//H/sub /spl infin// feedback control problem. The basic idea is: using Nash type index as the H/sub 2/ and H/sub /spl infin// performance functional, the authors then are able to obtain, the necessary and sufficient conditions for the existence of linear memoryless feedback gain. By solving a set of coupled algebraic matrix equations, the authors can get the required feedback-control. Both continuous and discrete time system are considered.
{"title":"On mixed H/sub 2//H/sub /spl infin// control","authors":"Xiang Chen, Kemin Zhou","doi":"10.1109/SSST.1996.493461","DOIUrl":"https://doi.org/10.1109/SSST.1996.493461","url":null,"abstract":"Uses the Nash game approach to solve a mixed H/sub 2//H/sub /spl infin// feedback control problem. The basic idea is: using Nash type index as the H/sub 2/ and H/sub /spl infin// performance functional, the authors then are able to obtain, the necessary and sufficient conditions for the existence of linear memoryless feedback gain. By solving a set of coupled algebraic matrix equations, the authors can get the required feedback-control. Both continuous and discrete time system are considered.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533897","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 : 1996-03-31DOI: 10.1109/SSST.1996.493539
B. Joshi, S. Hosseini, K. Vairavan
Load balancing is the process of improving the performance of a system through a redistribution of loads among the processors. In this paper the authors present the stability analysis of a load balancing algorithm based on graph coloring. In this algorithm the processors use local knowledge for the purpose of load balancing. Unlike threshold based algorithms whose efficiency depends on the threshold level selected, the graph coloring based load balancing algorithm does not use any such global parameter. Furthermore, it uses the edge coloring concept to pair the processors. This avoids the selection/rejection operations encountered in many load balancing algorithms proposed in the literature. Also, there is no central controller and the algorithm is easily adaptable to changes in the system configurations.
{"title":"Stability analysis of a load balancing algorithm","authors":"B. Joshi, S. Hosseini, K. Vairavan","doi":"10.1109/SSST.1996.493539","DOIUrl":"https://doi.org/10.1109/SSST.1996.493539","url":null,"abstract":"Load balancing is the process of improving the performance of a system through a redistribution of loads among the processors. In this paper the authors present the stability analysis of a load balancing algorithm based on graph coloring. In this algorithm the processors use local knowledge for the purpose of load balancing. Unlike threshold based algorithms whose efficiency depends on the threshold level selected, the graph coloring based load balancing algorithm does not use any such global parameter. Furthermore, it uses the edge coloring concept to pair the processors. This avoids the selection/rejection operations encountered in many load balancing algorithms proposed in the literature. Also, there is no central controller and the algorithm is easily adaptable to changes in the system configurations.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123874516","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 : 1996-03-31DOI: 10.1109/SSST.1996.493477
G. Gu, Jian Huang
This paper considers the design of quadrature mirror filter (QMF) banks whose analysis and synthesis filters have linear phase and are of FIR. An iterative algorithm for minimizing the reconstruction error of QMF banks as well as the stopband error of the prototype filter has been developed in the literature. the authors' results provide new derivations for an explicit expression of the error function to be minimized and the necessary condition for minimality. These results offer new insight to the design of QMF banks and relates it to a more general nonlinear optimization problem. Moreover a new iterative algorithm is proposed that generalizes the one from Chen and Lee (1992). It is shown that this new algorithm is a descending one and is essentially a modified Newton's algorithm. Thus the iterative algorithm not only converges, but also admits a fast convergent rate.
{"title":"Design of QMF banks and nonlinear optimization","authors":"G. Gu, Jian Huang","doi":"10.1109/SSST.1996.493477","DOIUrl":"https://doi.org/10.1109/SSST.1996.493477","url":null,"abstract":"This paper considers the design of quadrature mirror filter (QMF) banks whose analysis and synthesis filters have linear phase and are of FIR. An iterative algorithm for minimizing the reconstruction error of QMF banks as well as the stopband error of the prototype filter has been developed in the literature. the authors' results provide new derivations for an explicit expression of the error function to be minimized and the necessary condition for minimality. These results offer new insight to the design of QMF banks and relates it to a more general nonlinear optimization problem. Moreover a new iterative algorithm is proposed that generalizes the one from Chen and Lee (1992). It is shown that this new algorithm is a descending one and is essentially a modified Newton's algorithm. Thus the iterative algorithm not only converges, but also admits a fast convergent rate.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125480028","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 : 1996-03-31DOI: 10.1109/SSST.1996.493518
S. Soergel, P. Rastgoufard
Predictive maintenance for large electric motors has generally consisted of traditional tests used to determine the condition of the groundwall insulation of the stator and the integrity of the rotor bars. These tests are trended and an attempt is made to estimate the remaining life of the motor by analyzing the past performance of motors under study. An alternate scheme is proposed which consists of some traditional tests correlated with new techniques. Capacitance tests, balance of resistance tests, and balance of inductance tests are not used widely today. Another promising predictive test indirectly measures the negative sequence currents which are produced by the fault. Furthermore, there is some discrepancy as to how to perform and analyze common procedures which can yield useful information. This paper clarifies the best techniques and procedures through theory and experience in an industrial setting. It examines each test and determines its value according to effectiveness and practicality.
{"title":"An analysis of induction motor predictive maintenance techniques","authors":"S. Soergel, P. Rastgoufard","doi":"10.1109/SSST.1996.493518","DOIUrl":"https://doi.org/10.1109/SSST.1996.493518","url":null,"abstract":"Predictive maintenance for large electric motors has generally consisted of traditional tests used to determine the condition of the groundwall insulation of the stator and the integrity of the rotor bars. These tests are trended and an attempt is made to estimate the remaining life of the motor by analyzing the past performance of motors under study. An alternate scheme is proposed which consists of some traditional tests correlated with new techniques. Capacitance tests, balance of resistance tests, and balance of inductance tests are not used widely today. Another promising predictive test indirectly measures the negative sequence currents which are produced by the fault. Furthermore, there is some discrepancy as to how to perform and analyze common procedures which can yield useful information. This paper clarifies the best techniques and procedures through theory and experience in an industrial setting. It examines each test and determines its value according to effectiveness and practicality.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117165745","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 : 1996-03-31DOI: 10.1109/SSST.1996.493562
A. B. Ogunye
Two anti-windup algorithms, the optimal set-point sequence algorithm (OSSA) and the simplified set-point sequence algorithm (SSSA), are presented in this paper to deal with the problem of controller windup and the subsequent degradation in output performance as a result of set-point changes. These algorithms are computationally simple and extremely effective. The proposed anti-windup algorithms use an understanding of the causes of the problem in order to prevent the problem from occurring or minimizing it in the first place. The author has shown through simulations, and where possible through experimental verifications, that the results are applicable to single-input single-output, and multiple-input multiple-output processes.
{"title":"A new approach to the problem of input saturation and controller windup in model-based digital controllers","authors":"A. B. Ogunye","doi":"10.1109/SSST.1996.493562","DOIUrl":"https://doi.org/10.1109/SSST.1996.493562","url":null,"abstract":"Two anti-windup algorithms, the optimal set-point sequence algorithm (OSSA) and the simplified set-point sequence algorithm (SSSA), are presented in this paper to deal with the problem of controller windup and the subsequent degradation in output performance as a result of set-point changes. These algorithms are computationally simple and extremely effective. The proposed anti-windup algorithms use an understanding of the causes of the problem in order to prevent the problem from occurring or minimizing it in the first place. The author has shown through simulations, and where possible through experimental verifications, that the results are applicable to single-input single-output, and multiple-input multiple-output processes.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365437","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 : 1996-03-31DOI: 10.1109/SSST.1996.493563
A. B. Ogunye, A. Penlidis, P. Reilly
This paper describes a collection of algorithms developed in a computer algebra package (MapleV) using polynomial matrix theory. The developed algorithms provide a medium in which polynomial matrix operations are carried out. Most importantly, these polynomid matrix procedures, enable the design and analysis of multivariable control systems using the algebraic or polynomial equation approach. This algebraic design would have been extremely difficult to carry out in a strict numeric computing environment. The use of MapleV has provided symbolic results quickly and efficiently, with a tremendous gain in time and with minimal effort.
{"title":"Polynomial matrices for the design of multivariable control systems using symbolic computation","authors":"A. B. Ogunye, A. Penlidis, P. Reilly","doi":"10.1109/SSST.1996.493563","DOIUrl":"https://doi.org/10.1109/SSST.1996.493563","url":null,"abstract":"This paper describes a collection of algorithms developed in a computer algebra package (MapleV) using polynomial matrix theory. The developed algorithms provide a medium in which polynomial matrix operations are carried out. Most importantly, these polynomid matrix procedures, enable the design and analysis of multivariable control systems using the algebraic or polynomial equation approach. This algebraic design would have been extremely difficult to carry out in a strict numeric computing environment. The use of MapleV has provided symbolic results quickly and efficiently, with a tremendous gain in time and with minimal effort.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129590755","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 : 1996-03-31DOI: 10.1109/SSST.1996.493556
D. Benjamin
System theory has been used extensively by human researchers as a tool to model parts of the world with the goal of permitting effective analysis and synthesis. This paper describes part of a research project in which systems theory is used as the representational mechanism by an artificial intelligence. The goal is the same: to permit the effective analysis of a complex environment and the synthesis of efficient control. This paper focuses on the problem of how to formulate systems properly.
{"title":"Formulating systems","authors":"D. Benjamin","doi":"10.1109/SSST.1996.493556","DOIUrl":"https://doi.org/10.1109/SSST.1996.493556","url":null,"abstract":"System theory has been used extensively by human researchers as a tool to model parts of the world with the goal of permitting effective analysis and synthesis. This paper describes part of a research project in which systems theory is used as the representational mechanism by an artificial intelligence. The goal is the same: to permit the effective analysis of a complex environment and the synthesis of efficient control. This paper focuses on the problem of how to formulate systems properly.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599578","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 : 1996-03-31DOI: 10.1109/SSST.1996.493484
J.J. Zhu
In this paper some previously developed series and parallel differential spectral concepts for scalar linear time-varying (LTV) systems are extended to some subclasses of multi-input-multi-output (MIMO) LTV systems. The extension is facilitated by the new concepts of differential determinant and differential adjoint matrix introduced herein, which are natural extensions of the familiar concepts of determinant and adjoint matrix to a noncommutative differential ring. Explicit matrix fractional representations are obtained for the subclasses of MIMO LTV systems for which the new results are applicable. The new results have important applications in the analysis and control of MIMO LTV systems.
{"title":"Series and parallel D-spectra for multi-input-multi-output linear time-varying systems","authors":"J.J. Zhu","doi":"10.1109/SSST.1996.493484","DOIUrl":"https://doi.org/10.1109/SSST.1996.493484","url":null,"abstract":"In this paper some previously developed series and parallel differential spectral concepts for scalar linear time-varying (LTV) systems are extended to some subclasses of multi-input-multi-output (MIMO) LTV systems. The extension is facilitated by the new concepts of differential determinant and differential adjoint matrix introduced herein, which are natural extensions of the familiar concepts of determinant and adjoint matrix to a noncommutative differential ring. Explicit matrix fractional representations are obtained for the subclasses of MIMO LTV systems for which the new results are applicable. The new results have important applications in the analysis and control of MIMO LTV systems.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133413073","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
扫码关注我们
求助内容：
应助结果提醒方式：