Pub Date : 1996-11-18DOI: 10.1109/APCAS.1996.569225
F. Lau, M. Yip
A partial convergence speedup technique has been incorporated into the waveform relaxation method and applied to the transient analysis of transmission lines. Simulation results show another 20% speed improvement compared with that without using the speedup technique.
{"title":"Speed improvement in the transient analysis of transmission lines","authors":"F. Lau, M. Yip","doi":"10.1109/APCAS.1996.569225","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569225","url":null,"abstract":"A partial convergence speedup technique has been incorporated into the waveform relaxation method and applied to the transient analysis of transmission lines. Simulation results show another 20% speed improvement compared with that without using the speedup technique.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"50 1","pages":"85-88"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75012121","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-11-18DOI: 10.1109/APCAS.1996.569326
H. Lee, J. Paik
In this paper, we study examine the validity of space-frequency adaptive image restoration in the wavelet domain. In order to utilize adaptivity in both space and frequency domain, both the convolution operator and the signal is subband-decomposed using the wavelet transform, which maintains perfect reconstruction. A wiener-based wavelet decomposed image restoration technique has been proposed in the literature. In spite of outstanding restoration performance, wavelet decomposed wiener filter is restricted in use since it requires the original power spectrum and adaptive implementation is not easy. By this reason, we propose adaptive wavelet-decomposed CLS filters with some promising experimental results.
{"title":"Space-frequency adaptive image restoration based on wavelet decomposition","authors":"H. Lee, J. Paik","doi":"10.1109/APCAS.1996.569326","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569326","url":null,"abstract":"In this paper, we study examine the validity of space-frequency adaptive image restoration in the wavelet domain. In order to utilize adaptivity in both space and frequency domain, both the convolution operator and the signal is subband-decomposed using the wavelet transform, which maintains perfect reconstruction. A wiener-based wavelet decomposed image restoration technique has been proposed in the literature. In spite of outstanding restoration performance, wavelet decomposed wiener filter is restricted in use since it requires the original power spectrum and adaptive implementation is not easy. By this reason, we propose adaptive wavelet-decomposed CLS filters with some promising experimental results.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"11 1","pages":"512-515"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75192175","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-11-18DOI: 10.1109/APCAS.1996.569222
E. Leelarasmee, Methee Hwangkhunnatham
This paper presents a few techniques based on an efficient use of memory resources to speed up the transient analysis of piecewise linear circuits, such as power electronic circuits. These techniques use the fact that the matrix in the linear equation solving routines can only have a finite number of different values. Hence, by adding a cache memory management technique to store the LU factor of these matrices for future reuse, the linear equation solver can be performed much faster than that of a general purpose simulation program in which these LU factors have to be recomputed every time. Since most of the CPU analysis time is spent in solving linear equations, these techniques can actually speed up the transient analysis of piecewise linear circuits significantly (100-600%).
{"title":"The use of a matrix cache to speed up the conventional transient simulation of piecewise linear circuits","authors":"E. Leelarasmee, Methee Hwangkhunnatham","doi":"10.1109/APCAS.1996.569222","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569222","url":null,"abstract":"This paper presents a few techniques based on an efficient use of memory resources to speed up the transient analysis of piecewise linear circuits, such as power electronic circuits. These techniques use the fact that the matrix in the linear equation solving routines can only have a finite number of different values. Hence, by adding a cache memory management technique to store the LU factor of these matrices for future reuse, the linear equation solver can be performed much faster than that of a general purpose simulation program in which these LU factors have to be recomputed every time. Since most of the CPU analysis time is spent in solving linear equations, these techniques can actually speed up the transient analysis of piecewise linear circuits significantly (100-600%).","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"55 1","pages":"73-76"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75083199","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-11-18DOI: 10.1109/APCAS.1996.569333
Jae-Ho Chung
In this paper, an abrupt scene change detection algorithm is suggested. The algorithm is developed based on the temporal activity distribution that derived from the temporal subband analysis. Computer simulation results show that the proposed scheme is capable of detecting abrupt scene changes in video sequence accurately and efficiently.
{"title":"Abrupt scene change detection based on the temporal activity distributions","authors":"Jae-Ho Chung","doi":"10.1109/APCAS.1996.569333","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569333","url":null,"abstract":"In this paper, an abrupt scene change detection algorithm is suggested. The algorithm is developed based on the temporal activity distribution that derived from the temporal subband analysis. Computer simulation results show that the proposed scheme is capable of detecting abrupt scene changes in video sequence accurately and efficiently.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"6 1","pages":"540-543"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82168272","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-11-18DOI: 10.1109/APCAS.1996.569232
C. Hwang, A. Motamed, M. Ismail
In this paper a new differential pair architecture with programmable rail-to-rail constant-g/sub m/ is presented. Since the architecture adopts a signal processing method to obtain constant-g/sub m/ it can be implemented in any complementary VLSI technology and it functions regardless of transistor operating regions. An MOS implementation is discussed and is shown to operate in both weak and strong inversion, resulting in a programmable g/sub m/ over a very wide range.
{"title":"LV complementary differential pair with programmable rail-to-rail constant-g/sub m/","authors":"C. Hwang, A. Motamed, M. Ismail","doi":"10.1109/APCAS.1996.569232","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569232","url":null,"abstract":"In this paper a new differential pair architecture with programmable rail-to-rail constant-g/sub m/ is presented. Since the architecture adopts a signal processing method to obtain constant-g/sub m/ it can be implemented in any complementary VLSI technology and it functions regardless of transistor operating regions. An MOS implementation is discussed and is shown to operate in both weak and strong inversion, resulting in a programmable g/sub m/ over a very wide range.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"90 1","pages":"113-116"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83903782","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-11-18DOI: 10.1109/APCAS.1996.569217
S. Takagi, K. Wada, N. Fujii, M. Ismail, D. Y. Kim
This paper proposes a novel area-efficient and cost-effective design methodology for MOSFET-C continuous-time filters. The new methodology reduces the number of MOS transistors used in the previously reported work by almost a factor of two. A third-order leapfrog low-pass Chebyschev filter is realized and simulated as an example to demonstrate the validity of the new design methodology.
{"title":"A novel area-efficient MOSFET-C filter design methodology","authors":"S. Takagi, K. Wada, N. Fujii, M. Ismail, D. Y. Kim","doi":"10.1109/APCAS.1996.569217","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569217","url":null,"abstract":"This paper proposes a novel area-efficient and cost-effective design methodology for MOSFET-C continuous-time filters. The new methodology reduces the number of MOS transistors used in the previously reported work by almost a factor of two. A third-order leapfrog low-pass Chebyschev filter is realized and simulated as an example to demonstrate the validity of the new design methodology.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"39 1","pages":"53-56"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81432726","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-11-18DOI: 10.1109/APCAS.1996.569284
H. Uno, K. Kumatami, H. Okuhata, I. Shirakawa, T. Chiba
A high performance and low power architecture is devised for a 4 Mbps infrared wireless communication system dedicated to the mobile computing. In this architecture, 4PPM(4-Pulse Position Modulation) infrared signals detected by an infrared receiver are digitized into TTL interface level pulses, and the digitized pulses are demodulated by a 1-bit digital demodulator. To improve the dynamic range of the link length, a 4PPM demodulator is synthesized to implement a demodulation algorithm which is constructed so as to accommodate the output tolerance of the infrared receiver. A part of experimental results shows that the realized 4 Mbps infrared communication system can achieve an error free link in the range of 0-140 cm at 90 mW power consumption.
{"title":"A 4 Mbps infrared wireless communication system dedicated to mobile computing","authors":"H. Uno, K. Kumatami, H. Okuhata, I. Shirakawa, T. Chiba","doi":"10.1109/APCAS.1996.569284","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569284","url":null,"abstract":"A high performance and low power architecture is devised for a 4 Mbps infrared wireless communication system dedicated to the mobile computing. In this architecture, 4PPM(4-Pulse Position Modulation) infrared signals detected by an infrared receiver are digitized into TTL interface level pulses, and the digitized pulses are demodulated by a 1-bit digital demodulator. To improve the dynamic range of the link length, a 4PPM demodulator is synthesized to implement a demodulation algorithm which is constructed so as to accommodate the output tolerance of the infrared receiver. A part of experimental results shows that the realized 4 Mbps infrared communication system can achieve an error free link in the range of 0-140 cm at 90 mW power consumption.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"37 1","pages":"334-337"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81204261","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-11-18DOI: 10.1109/APCAS.1996.569285
K. Nakano, H. Yoshioka, M. Sengoku, S. Shinoda
Dynamic Channel Assignment (DCA), which improves the efficiency of channel use in cellular mobile communication systems, requires finding an available channel for a new call after the call origination. This causes the delay which is defined as the time elapsing between call origination and completion of the channel search. For system planning, it is important to evaluate the delay characteristic of DCA because the delay corresponds to the waiting time of a call and influences service quality. It is, however, difficult to theoretically analyze the delay characteristics except its worst case behavior. The objective of this paper is to analyze the distribution and the mean value of the delay theoretically. This analysis is based on the Clique Packing model for analyzing the blocking rate performance of DCA.
{"title":"Analysis of connection delay caused by dynamic channel assignment in cellular mobile communication systems","authors":"K. Nakano, H. Yoshioka, M. Sengoku, S. Shinoda","doi":"10.1109/APCAS.1996.569285","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569285","url":null,"abstract":"Dynamic Channel Assignment (DCA), which improves the efficiency of channel use in cellular mobile communication systems, requires finding an available channel for a new call after the call origination. This causes the delay which is defined as the time elapsing between call origination and completion of the channel search. For system planning, it is important to evaluate the delay characteristic of DCA because the delay corresponds to the waiting time of a call and influences service quality. It is, however, difficult to theoretically analyze the delay characteristics except its worst case behavior. The objective of this paper is to analyze the distribution and the mean value of the delay theoretically. This analysis is based on the Clique Packing model for analyzing the blocking rate performance of DCA.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"49 4 1","pages":"338-341"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89534569","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-11-18DOI: 10.1109/APCAS.1996.569294
H. Mitsubayashi, A. Takahashi, Y. Kajitani
The most crucial factor that degrades a high speed VLSI is the signal propagation delay in a routing tree. It is estimated additively by the amount of the source-to-sink path length and total length. To design a routing tree in which these two are balancingly small, we propose an algorithm to construct a spanning tree, by which a tree is constructed in a hybrid way of the Minimum-Tree and Shortest-Path Tree algorithms. The idea is extended to finding such a rectilinear Steiner tree. Experiments are given to show how the source-to-sink path length and total length are balanced and small.
{"title":"Cost-radius balanced spanning/Steiner trees","authors":"H. Mitsubayashi, A. Takahashi, Y. Kajitani","doi":"10.1109/APCAS.1996.569294","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569294","url":null,"abstract":"The most crucial factor that degrades a high speed VLSI is the signal propagation delay in a routing tree. It is estimated additively by the amount of the source-to-sink path length and total length. To design a routing tree in which these two are balancingly small, we propose an algorithm to construct a spanning tree, by which a tree is constructed in a hybrid way of the Minimum-Tree and Shortest-Path Tree algorithms. The idea is extended to finding such a rectilinear Steiner tree. Experiments are given to show how the source-to-sink path length and total length are balanced and small.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"60 1","pages":"377-380"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77892776","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-11-18DOI: 10.1109/APCAS.1996.569289
Yong-Suk Kim, Kyu-Phil Han, Eung-Joo Lee, Yeong-Ho Ha
In this paper, a genetic algorithm-based optimization technique for stereo matching is proposed. Stereo matching is the essential process for recovering the three-dimensional structure of objects. The geometrical difference of left and right images, called disparity, is constructed as two-dimensional chromosomes with fitness values inversely proportional to their costs. The cost function is composed of the intensity-difference between two images and smoothness of disparity. The crossover and mutation operators in the two-dimensional chromosomes are described. The operations are affected by the disparities of neighbor pixels. The knowledge-augmented operators are shown to result in a rapid convergence and stable result. The genetic algorithm for stereo matching is tested on synthetic and natural images. Experimental results for various images show that the proposed algorithm has good performance even if the image has unfavorable conditions.
{"title":"Robust 3-D depth estimation using genetic algorithm in stereo image pairs","authors":"Yong-Suk Kim, Kyu-Phil Han, Eung-Joo Lee, Yeong-Ho Ha","doi":"10.1109/APCAS.1996.569289","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569289","url":null,"abstract":"In this paper, a genetic algorithm-based optimization technique for stereo matching is proposed. Stereo matching is the essential process for recovering the three-dimensional structure of objects. The geometrical difference of left and right images, called disparity, is constructed as two-dimensional chromosomes with fitness values inversely proportional to their costs. The cost function is composed of the intensity-difference between two images and smoothness of disparity. The crossover and mutation operators in the two-dimensional chromosomes are described. The operations are affected by the disparities of neighbor pixels. The knowledge-augmented operators are shown to result in a rapid convergence and stable result. The genetic algorithm for stereo matching is tested on synthetic and natural images. Experimental results for various images show that the proposed algorithm has good performance even if the image has unfavorable conditions.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"18 1","pages":"357-360"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85113490","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
扫码关注我们
求助内容：
应助结果提醒方式：