Pub Date : 1996-03-31DOI: 10.1109/SSST.1996.493551
F.Y. Busaba
The mainstream of current digital circuit design strategy is top-down, where the design process is divided into many phases. A designer starts with a high level description of a circuit, e.g. VHDL, and goes through the design phases to reach mask layout level. This paper develops a set of rules that can be applied to any VHDL description of a logic circuit such that the synthesized gate level circuit is self-checking. Therefore, for a given VHDL description of a logic circuit these rules will transform/modify the existing VHDL code into another equivalent code such that the resulting synthesized circuit will be self-checking. Such a VHDL code is called self-checking VHDL.
{"title":"VHDL description of self-checking logic circuits","authors":"F.Y. Busaba","doi":"10.1109/SSST.1996.493551","DOIUrl":"https://doi.org/10.1109/SSST.1996.493551","url":null,"abstract":"The mainstream of current digital circuit design strategy is top-down, where the design process is divided into many phases. A designer starts with a high level description of a circuit, e.g. VHDL, and goes through the design phases to reach mask layout level. This paper develops a set of rules that can be applied to any VHDL description of a logic circuit such that the synthesized gate level circuit is self-checking. Therefore, for a given VHDL description of a logic circuit these rules will transform/modify the existing VHDL code into another equivalent code such that the resulting synthesized circuit will be self-checking. Such a VHDL code is called self-checking VHDL.","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":"115240216","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.493505
D. Silver, E. Barbieri
This paper considers the self-motion problem on a four degree of freedom planar manipulator, (TUMA I). A major goal of this experiment was to test the effectiveness and value of the TUMA I-dSPACE setup. Thus, for this experiment a simple proportional derivative (PD) control was designed in Simulink and implemented with dSPACE DSP hardware. Experimental results are included.
{"title":"Self-motion control experiments using TUMA I and dSPACE","authors":"D. Silver, E. Barbieri","doi":"10.1109/SSST.1996.493505","DOIUrl":"https://doi.org/10.1109/SSST.1996.493505","url":null,"abstract":"This paper considers the self-motion problem on a four degree of freedom planar manipulator, (TUMA I). A major goal of this experiment was to test the effectiveness and value of the TUMA I-dSPACE setup. Thus, for this experiment a simple proportional derivative (PD) control was designed in Simulink and implemented with dSPACE DSP hardware. Experimental results are included.","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":"124883310","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.493552
A. Barbir
The results of a research project conducted at Gandalf, a leader in real time data networking products, to develop a fast arithmetic coder are presented. The speed improvement comes from the development of a hybrid model that generates normalized frequency distributions of the sequence of input symbols. This approach enables the implementation of an arithmetic coder with a reduced number of divide instructions. The new coder obtains significantly improved throughput with minimal loss in compression efficiency. Simulation results showed a doubling in computational speed over standard implementations of the algorithm with minimal reduction in efficiency. The algorithm achieves up to 50% more compression efficiency than the commercially available Stacker LZS compressor.
{"title":"A new fast approximate arithmetic coder","authors":"A. Barbir","doi":"10.1109/SSST.1996.493552","DOIUrl":"https://doi.org/10.1109/SSST.1996.493552","url":null,"abstract":"The results of a research project conducted at Gandalf, a leader in real time data networking products, to develop a fast arithmetic coder are presented. The speed improvement comes from the development of a hybrid model that generates normalized frequency distributions of the sequence of input symbols. This approach enables the implementation of an arithmetic coder with a reduced number of divide instructions. The new coder obtains significantly improved throughput with minimal loss in compression efficiency. Simulation results showed a doubling in computational speed over standard implementations of the algorithm with minimal reduction in efficiency. The algorithm achieves up to 50% more compression efficiency than the commercially available Stacker LZS compressor.","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":"128146493","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.493497
N.C. Propes
The purpose of this paper is to introduce the reader to Poincare sections, bifurcations, and a chaotic circuit. Poincare sections are described by examining a periodically forced system. Bifurcation analysis follows from the Poincare sections, and a few different types of bifurcations are mentioned. The use of these techniques is shown on the R-L-diode circuit.
{"title":"Poincare sections and the R-L-diode circuit","authors":"N.C. Propes","doi":"10.1109/SSST.1996.493497","DOIUrl":"https://doi.org/10.1109/SSST.1996.493497","url":null,"abstract":"The purpose of this paper is to introduce the reader to Poincare sections, bifurcations, and a chaotic circuit. Poincare sections are described by examining a periodically forced system. Bifurcation analysis follows from the Poincare sections, and a few different types of bifurcations are mentioned. The use of these techniques is shown on the R-L-diode circuit.","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":"130554383","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.493501
M. Tarbouchi, H. Le-Huy
In this paper, a simulation and implementation using a DSP with nonlinear input-output linearization technique to control an induction motor is presented. The rotor flux observation, stator currents and speed measurements are required.
{"title":"Nonlinear control of an induction motor using a DSP","authors":"M. Tarbouchi, H. Le-Huy","doi":"10.1109/SSST.1996.493501","DOIUrl":"https://doi.org/10.1109/SSST.1996.493501","url":null,"abstract":"In this paper, a simulation and implementation using a DSP with nonlinear input-output linearization technique to control an induction motor is presented. The rotor flux observation, stator currents and speed measurements are required.","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":"131397239","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.493514
William Dale Blair, M. Brandt-Pearce
The radar cross section (RCS) of most targets is sensitive to the aspect angle of the target with respect to the radar and fluctuates from pulse-to-pulse or scan-to-scan. The RCS fluctuations are typically characterized as one of four Swerling types. Examining the receiver operating characteristic (ROCs) curves for detection of Swerling targets shows that Swerling targets of type 3 and 4 can be detected with similar probabilities at lower transmitted energy than that required by Swerling targets of type 1 or 2. Thus, effective discrimination between Swerling types can be used to improved the utilization of radar resources by coordinating the waveform type and duration with the target type. Since waveforms with frequency diversity that induces pulse-to-pulse fluctuations are of interest, parameter estimation and discrimination for Swerling targets of types 2 and 4 are considered in the paper. Maximum Likelihood (ML) estimation of the amplitude parameters (i.e., SNR) is developed for both Swerling types, and techniques for discriminating between Swerling 2 and Swerling 4 targets are discussed.
{"title":"Estimation and discrimination for Swerling targets","authors":"William Dale Blair, M. Brandt-Pearce","doi":"10.1109/SSST.1996.493514","DOIUrl":"https://doi.org/10.1109/SSST.1996.493514","url":null,"abstract":"The radar cross section (RCS) of most targets is sensitive to the aspect angle of the target with respect to the radar and fluctuates from pulse-to-pulse or scan-to-scan. The RCS fluctuations are typically characterized as one of four Swerling types. Examining the receiver operating characteristic (ROCs) curves for detection of Swerling targets shows that Swerling targets of type 3 and 4 can be detected with similar probabilities at lower transmitted energy than that required by Swerling targets of type 1 or 2. Thus, effective discrimination between Swerling types can be used to improved the utilization of radar resources by coordinating the waveform type and duration with the target type. Since waveforms with frequency diversity that induces pulse-to-pulse fluctuations are of interest, parameter estimation and discrimination for Swerling targets of types 2 and 4 are considered in the paper. Maximum Likelihood (ML) estimation of the amplitude parameters (i.e., SNR) is developed for both Swerling types, and techniques for discriminating between Swerling 2 and Swerling 4 targets are discussed.","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":"115086237","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.493493
Guoqing Tang, Zidong Wang
Uses the techniques of jump vectors, distributional inputs, decompositions of the state, control, and output spaces as direct sums of proper subspaces as well as the existence of an optimal synthesis for linear quadratic regular optimal control problems with a fixed terminal point to give a simple and constructive proof of the existence of a generalized optimal synthesis for linear quadratic singular optimal control problems with a fixed terminal point.
{"title":"On the existence of a generalized optimal synthesis for linear quadratic singular optimal control problems with a fixed terminal point","authors":"Guoqing Tang, Zidong Wang","doi":"10.1109/SSST.1996.493493","DOIUrl":"https://doi.org/10.1109/SSST.1996.493493","url":null,"abstract":"Uses the techniques of jump vectors, distributional inputs, decompositions of the state, control, and output spaces as direct sums of proper subspaces as well as the existence of an optimal synthesis for linear quadratic regular optimal control problems with a fixed terminal point to give a simple and constructive proof of the existence of a generalized optimal synthesis for linear quadratic singular optimal control problems with a fixed terminal point.","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":"123460647","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.493526
A. Srivastava, N. George
Reports the design of a bulk-micromachined gas sensor fabricated in commercial 2 /spl mu/m n-well CMOS technology using a high level computer aided design tool. The gas sensor is a palladium-oxide-polysilicon micromachined MOS structure. The design includes an additional layer in CMOS called 'open' which enables the formation of a 'cavity' in the silicon substrate. After the fabrication of CMOS chips single maskless etch in an aqueous solution of ethylenediamine-pyrocatechol (EDP) or xenon difluoride (XeF/sub 2/) is done to create a cavity. This results in a micromachined structure with the polysilicon and the oxide on it, suspended over the 'cavity' formed. Finally palladium is deposited over the micromachined structure in a high vacuum evaporator. The adsorption of the hydrogen gas in palladium changes C-V characteristics of the MOS structure. In the present work we report part of the studies on gas sensor development.
{"title":"Gas sensor fabricated in commercial CMOS technology","authors":"A. Srivastava, N. George","doi":"10.1109/SSST.1996.493526","DOIUrl":"https://doi.org/10.1109/SSST.1996.493526","url":null,"abstract":"Reports the design of a bulk-micromachined gas sensor fabricated in commercial 2 /spl mu/m n-well CMOS technology using a high level computer aided design tool. The gas sensor is a palladium-oxide-polysilicon micromachined MOS structure. The design includes an additional layer in CMOS called 'open' which enables the formation of a 'cavity' in the silicon substrate. After the fabrication of CMOS chips single maskless etch in an aqueous solution of ethylenediamine-pyrocatechol (EDP) or xenon difluoride (XeF/sub 2/) is done to create a cavity. This results in a micromachined structure with the polysilicon and the oxide on it, suspended over the 'cavity' formed. Finally palladium is deposited over the micromachined structure in a high vacuum evaporator. The adsorption of the hydrogen gas in palladium changes C-V characteristics of the MOS structure. In the present work we report part of the studies on gas sensor development.","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":"122598983","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.493558
J. Sabharwal, Jianhua Chen
This study explores the application of a fuzzy clustering algorithm in the field of chemical process control. The control problem considered is a two level cascade control of the pH of a chemical stream. The pH is controlled by the addition of two chemicals-sulfuric acid (to lower the pH) and caustic (to increase the pH). The fuzzy clustering algorithm developed by Bezdek et al. (1993), and independently by Kundu and Chen (1994) is used in this study to identify fuzzy rules from numerical I/O data points. The algorithm replaces the notion of a single representative point of a cluster with a more general notion of a hyperplane for each cluster. In this study, a simulation of the control problem has been generated and a menu driven GUI has been developed which enables the user to simulate different states of the control problem by modifying the tuning parameters. Preliminary experiments show that the rules learned by the fuzzy clustering perform well. These results provide support for the use of fuzzy clustering algorithms in process control.
{"title":"Intelligent pH control using fuzzy linear invariant clustering","authors":"J. Sabharwal, Jianhua Chen","doi":"10.1109/SSST.1996.493558","DOIUrl":"https://doi.org/10.1109/SSST.1996.493558","url":null,"abstract":"This study explores the application of a fuzzy clustering algorithm in the field of chemical process control. The control problem considered is a two level cascade control of the pH of a chemical stream. The pH is controlled by the addition of two chemicals-sulfuric acid (to lower the pH) and caustic (to increase the pH). The fuzzy clustering algorithm developed by Bezdek et al. (1993), and independently by Kundu and Chen (1994) is used in this study to identify fuzzy rules from numerical I/O data points. The algorithm replaces the notion of a single representative point of a cluster with a more general notion of a hyperplane for each cluster. In this study, a simulation of the control problem has been generated and a menu driven GUI has been developed which enables the user to simulate different states of the control problem by modifying the tuning parameters. Preliminary experiments show that the rules learned by the fuzzy clustering perform well. These results provide support for the use of fuzzy clustering algorithms in process control.","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":"127154588","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.493527
J. Placer, A. Sagahyroon, M. Massoumi
Assessing the maximum power dissipated by a CMOS combinational circuit is a complex problem because the power dissipated is input-pattern dependent. Simulation techniques are impractical, especially for large circuits, since the number of simulation runs needed increases exponentially with the number of inputs to the circuit. In this paper a genetic algorithm (GA) based approach is presented for generating a sequence of input vectors that tend to continuously maximize the switching activity of the circuit and hence the maximum power dissipated. The GA used evolves candidate input vectors while making use of a logic simulator to compute the fitness of each candidate. Experimentation with different GA parameters was carried out in order to derive an optimal set of working parameters for the GA. The performance of the GA technique was evaluated using "test circuits" whose topology allows simple analysis to determine the maximum number of simultaneous transitions possible for the circuits. In addition to this, some circuits from the ISAC-85 benchmark suite of circuits were also tested. The GA method was found to significantly out perform simulation-based techniques, especially in terms of CPU time expenditures.
{"title":"A framework for estimating maximum power dissipation in CMOS combinational circuits using genetic algorithms","authors":"J. Placer, A. Sagahyroon, M. Massoumi","doi":"10.1109/SSST.1996.493527","DOIUrl":"https://doi.org/10.1109/SSST.1996.493527","url":null,"abstract":"Assessing the maximum power dissipated by a CMOS combinational circuit is a complex problem because the power dissipated is input-pattern dependent. Simulation techniques are impractical, especially for large circuits, since the number of simulation runs needed increases exponentially with the number of inputs to the circuit. In this paper a genetic algorithm (GA) based approach is presented for generating a sequence of input vectors that tend to continuously maximize the switching activity of the circuit and hence the maximum power dissipated. The GA used evolves candidate input vectors while making use of a logic simulator to compute the fitness of each candidate. Experimentation with different GA parameters was carried out in order to derive an optimal set of working parameters for the GA. The performance of the GA technique was evaluated using \"test circuits\" whose topology allows simple analysis to determine the maximum number of simultaneous transitions possible for the circuits. In addition to this, some circuits from the ISAC-85 benchmark suite of circuits were also tested. The GA method was found to significantly out perform simulation-based techniques, especially in terms of CPU time expenditures.","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":"114909082","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
扫码关注我们
求助内容：
应助结果提醒方式：