Pub Date : 1996-10-13DOI: 10.1109/ICECS.1996.582786
M. Punzenberger, C. Enz
A companding current-mode integrator is proposed for very low voltage /spl Sigma//spl Delta/-converters. Neither the input nor the output current of this integrator is limited by the biasing current as it operates in class AB. This property allows the design of integrators with low biasing current levels and therefore low average power consumption, which are still able to process large signals. The proposed integrator operates at 1.2 V and has a power consumption of 21 /spl mu/W. It is used as a building block for a first order /spl Sigma//spl Delta/-converter for voice-band applications.
{"title":"A 1.2 V BiCMOS companding current-mode integrator for /spl Sigma//spl Delta/-modulators","authors":"M. Punzenberger, C. Enz","doi":"10.1109/ICECS.1996.582786","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582786","url":null,"abstract":"A companding current-mode integrator is proposed for very low voltage /spl Sigma//spl Delta/-converters. Neither the input nor the output current of this integrator is limited by the biasing current as it operates in class AB. This property allows the design of integrators with low biasing current levels and therefore low average power consumption, which are still able to process large signals. The proposed integrator operates at 1.2 V and has a power consumption of 21 /spl mu/W. It is used as a building block for a first order /spl Sigma//spl Delta/-converter for voice-band applications.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880752","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-10-13DOI: 10.1109/ICECS.1996.584443
M. Brucoli, D. Cafagna, L. Carnimeo, G. Grassi
In this paper an efficient method is illustrated to obtain a secure communication system by means of the synchronization of hyperchaotic circuits. The approach consists in driving the receiver with a proper number of transmitted signals, each of them constituted by a chaotic masking waveform added to an information-bearing signal, and by keeping the transmitting system equivalent to the receiving one by means of a feedback technique. The suggested method assures a recovery of the information signals without degradation, and enhances the security of the communication scheme, since the utilization of several driving signals makes more difficult for an undesirable listener to synchronize with the transmitter. Simulation results are reported to confirm the capability of the proposed approach.
{"title":"Hyperchaotic circuits for secure communications: an efficient synchronization technique","authors":"M. Brucoli, D. Cafagna, L. Carnimeo, G. Grassi","doi":"10.1109/ICECS.1996.584443","DOIUrl":"https://doi.org/10.1109/ICECS.1996.584443","url":null,"abstract":"In this paper an efficient method is illustrated to obtain a secure communication system by means of the synchronization of hyperchaotic circuits. The approach consists in driving the receiver with a proper number of transmitted signals, each of them constituted by a chaotic masking waveform added to an information-bearing signal, and by keeping the transmitting system equivalent to the receiving one by means of a feedback technique. The suggested method assures a recovery of the information signals without degradation, and enhances the security of the communication scheme, since the utilization of several driving signals makes more difficult for an undesirable listener to synchronize with the transmitter. Simulation results are reported to confirm the capability of the proposed approach.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804161","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-10-13DOI: 10.1109/ICECS.1996.582824
R. Vahldieck
The frequency-domain transmission line matrix (FDTLM) method is a computationally efficient analysis tool for the characterization of planar transmission lines and waveguides. The method relates network quantities like voltages and currents to fields and utilizes network theory to quantify the field parameters. This paper gives a brief review of the FDTLM method and shows how the network approach is utilized to simulate propagation and scattering of electromagnetic fields in planar guided wave structures etched on insulating and semiconducting substrate (MIS CPW). A dispersion analysis illustrates the accuracy of the numerical result. Various application examples demonstrate the flexibility of this new technique.
{"title":"Simulation of electromagnetic fields in guided wave structures using a quasi-network approach: the frequency-domain transmission line matrix method","authors":"R. Vahldieck","doi":"10.1109/ICECS.1996.582824","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582824","url":null,"abstract":"The frequency-domain transmission line matrix (FDTLM) method is a computationally efficient analysis tool for the characterization of planar transmission lines and waveguides. The method relates network quantities like voltages and currents to fields and utilizes network theory to quantify the field parameters. This paper gives a brief review of the FDTLM method and shows how the network approach is utilized to simulate propagation and scattering of electromagnetic fields in planar guided wave structures etched on insulating and semiconducting substrate (MIS CPW). A dispersion analysis illustrates the accuracy of the numerical result. Various application examples demonstrate the flexibility of this new technique.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128277463","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-10-13DOI: 10.1109/ICECS.1996.584477
G. Konstantoulakis, K. Pramataris, D. Reisis, G. Stassinopoulos
This paper describes an efficient shared-buffer component suitable for high-speed ATM networks. The component stores incoming ATM cells into individual virtual linked lists, according to the network connection that the cell belongs to. All linked lists are realized utilizing a single memory component, thus achieving maximal memory utilization. Furthermore, using the proposed buffering technique, it is feasible to control and monitor buffered data on a per connection basis, enabling network nodes to perform sophisticated policing and control functions on the incoming data streams. Although the particular component has been designed for ATM networks, the proposed buffering architecture can be efficiently used in other packet networks as well. The shared-buffer component, which has been used in an existing ATM multiplexer, is presented from an implementation point of view and specific ideas concerning the hardware realization are given. Furthermore, additional features that the component can support are presented along with hardware realization. Some possible utilization scenarios, where the component could be efficiently used, are finally presented.
{"title":"An efficient shared-buffer for high speed ATM networks","authors":"G. Konstantoulakis, K. Pramataris, D. Reisis, G. Stassinopoulos","doi":"10.1109/ICECS.1996.584477","DOIUrl":"https://doi.org/10.1109/ICECS.1996.584477","url":null,"abstract":"This paper describes an efficient shared-buffer component suitable for high-speed ATM networks. The component stores incoming ATM cells into individual virtual linked lists, according to the network connection that the cell belongs to. All linked lists are realized utilizing a single memory component, thus achieving maximal memory utilization. Furthermore, using the proposed buffering technique, it is feasible to control and monitor buffered data on a per connection basis, enabling network nodes to perform sophisticated policing and control functions on the incoming data streams. Although the particular component has been designed for ATM networks, the proposed buffering architecture can be efficiently used in other packet networks as well. The shared-buffer component, which has been used in an existing ATM multiplexer, is presented from an implementation point of view and specific ideas concerning the hardware realization are given. Furthermore, additional features that the component can support are presented along with hardware realization. Some possible utilization scenarios, where the component could be efficiently used, are finally presented.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964392","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-10-13DOI: 10.1109/ICECS.1996.584457
N. I. Glumov, V. Myasnikov, V. Sergeyev
For image processing using sliding window mode, it is shown that the algorithms realizing the parallel-recursive calculation of the convolution with the approximation of the impulse response FIR-filter by polynomial bases are the best suited.
{"title":"Parallel-recursive local image processing and polynomial bases","authors":"N. I. Glumov, V. Myasnikov, V. Sergeyev","doi":"10.1109/ICECS.1996.584457","DOIUrl":"https://doi.org/10.1109/ICECS.1996.584457","url":null,"abstract":"For image processing using sliding window mode, it is shown that the algorithms realizing the parallel-recursive calculation of the convolution with the approximation of the impulse response FIR-filter by polynomial bases are the best suited.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124624533","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-10-13DOI: 10.1109/ICECS.1996.584466
L. Hepplewhite, T. Stonham, R. Glover
This paper presents a novel approach to automating the visual inspection of magnetic disks. In commercial production, quality control is currently achieved by means of functional tests. However, due to increasing storage densities these methods are becoming obsolete. Automated visual inspection of the disk surface is required to achieve improved reliability. In this paper the defect classification stage of the inspection system is presented. Suitable methods of imaging and image processing are presented. In particular a novel method of texture recognition, based on n-tuple pattern recognition, is presented as a computationally efficient method of defect classification. The performance of this novel method is first compared with existing texture algorithms using the Brodatz texture album before preliminary results are shown for some frequently occurring disk faults.
{"title":"Automated visual inspection of magnetic disk media","authors":"L. Hepplewhite, T. Stonham, R. Glover","doi":"10.1109/ICECS.1996.584466","DOIUrl":"https://doi.org/10.1109/ICECS.1996.584466","url":null,"abstract":"This paper presents a novel approach to automating the visual inspection of magnetic disks. In commercial production, quality control is currently achieved by means of functional tests. However, due to increasing storage densities these methods are becoming obsolete. Automated visual inspection of the disk surface is required to achieve improved reliability. In this paper the defect classification stage of the inspection system is presented. Suitable methods of imaging and image processing are presented. In particular a novel method of texture recognition, based on n-tuple pattern recognition, is presented as a computationally efficient method of defect classification. The performance of this novel method is first compared with existing texture algorithms using the Brodatz texture album before preliminary results are shown for some frequently occurring disk faults.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129452808","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-10-13DOI: 10.1109/ICECS.1996.582811
E. Pencheva
A critical issue in achieving flexibility and extendibility in telecommunications networks, where the network data bases are increasingly involved in call processing, is the data model, and the application interface to network services data. The data model should provide application independent data structures and interfaces. The paper presents an object database model of Intelligent Network (IN) services that describes the data as objects and includes dynamicity (operations are associated to objects) and deals with distinctions between persistent and non persistent data. The structure is oriented to Service Independent Building Blocks (SIBs) that are abstract representations of network capabilities existing in an IN. Objects of similar structure and behaviour are grouped together in classes. Classes are organized in a class hierarchy. A service is invoked and activated by request for method (operation) execution connected to the object representing the service.
{"title":"An object-oriented data model for Intelligent Network services","authors":"E. Pencheva","doi":"10.1109/ICECS.1996.582811","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582811","url":null,"abstract":"A critical issue in achieving flexibility and extendibility in telecommunications networks, where the network data bases are increasingly involved in call processing, is the data model, and the application interface to network services data. The data model should provide application independent data structures and interfaces. The paper presents an object database model of Intelligent Network (IN) services that describes the data as objects and includes dynamicity (operations are associated to objects) and deals with distinctions between persistent and non persistent data. The structure is oriented to Service Independent Building Blocks (SIBs) that are abstract representations of network capabilities existing in an IN. Objects of similar structure and behaviour are grouped together in classes. Classes are organized in a class hierarchy. A service is invoked and activated by request for method (operation) execution connected to the object representing the service.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396113","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-10-13DOI: 10.1109/ICECS.1996.582696
L. Bisdounis, S. Nikolaidis, O. Koufopavlou, C. Goutis
This paper introduces an accurate, analytical timing model for the CMOS inverter. Analytical output waveform expressions for all the inverter operation regions and input waveform slopes are derived, which take into account the complete expression of the short-circuit current and the gate-to-drain coupling capacitance.
{"title":"Accurate timing model for the CMOS inverter","authors":"L. Bisdounis, S. Nikolaidis, O. Koufopavlou, C. Goutis","doi":"10.1109/ICECS.1996.582696","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582696","url":null,"abstract":"This paper introduces an accurate, analytical timing model for the CMOS inverter. Analytical output waveform expressions for all the inverter operation regions and input waveform slopes are derived, which take into account the complete expression of the short-circuit current and the gate-to-drain coupling capacitance.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129232421","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-10-13DOI: 10.1109/ICECS.1996.582859
R. Akbari-Dilmaghani, John T. Taylor
A new approach to the implementation of cellular neural networks (CNNs) with cloning templates of smaller dimensions is presented. The method is based on the assumptions that the circuit transients are short and possibly monotonic, and that the values of the initial state variables are taken into consideration in the design. Using the proposed method we can reduce the size of A template with any dimension (r/spl ges/1) into a single element a (ij, ij) which results in a significant reduction in the circuit complexity of a VLSI implementation of CNNs. Simulation results are presented to confirm the viability of the proposed method.
{"title":"Implementation of cellular neural networks with cloning templates of smaller dimensions","authors":"R. Akbari-Dilmaghani, John T. Taylor","doi":"10.1109/ICECS.1996.582859","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582859","url":null,"abstract":"A new approach to the implementation of cellular neural networks (CNNs) with cloning templates of smaller dimensions is presented. The method is based on the assumptions that the circuit transients are short and possibly monotonic, and that the values of the initial state variables are taken into consideration in the design. Using the proposed method we can reduce the size of A template with any dimension (r/spl ges/1) into a single element a (ij, ij) which results in a significant reduction in the circuit complexity of a VLSI implementation of CNNs. Simulation results are presented to confirm the viability of the proposed method.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"83 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123456566","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-10-13DOI: 10.1109/ICECS.1996.582810
C. Djeraba, H. Briand
We present an approach for temporal and interactive relation composition of media. The approach is based on time-interval and dependency temporal relations. We consider the seven relations of Allen (equals, meets, finishes, starts, before, overlaps, during) with the following features. Firstly, the temporal relations are designed to specify relations between multimedia objects of both determined and undetermined duration. Secondly, the temporal relations describe both the existing arrangement of the medium, and dependency relations between media. Finally, a powerful temporal Petri net is considered to model the temporal and interactive relations.
{"title":"Temporal and interactive relations in a multimedia database system","authors":"C. Djeraba, H. Briand","doi":"10.1109/ICECS.1996.582810","DOIUrl":"https://doi.org/10.1109/ICECS.1996.582810","url":null,"abstract":"We present an approach for temporal and interactive relation composition of media. The approach is based on time-interval and dependency temporal relations. We consider the seven relations of Allen (equals, meets, finishes, starts, before, overlaps, during) with the following features. Firstly, the temporal relations are designed to specify relations between multimedia objects of both determined and undetermined duration. Secondly, the temporal relations describe both the existing arrangement of the medium, and dependency relations between media. Finally, a powerful temporal Petri net is considered to model the temporal and interactive relations.","PeriodicalId":402369,"journal":{"name":"Proceedings of Third International Conference on Electronics, Circuits, and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121195585","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
扫码关注我们
求助内容：
应助结果提醒方式：