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":null,"pages":null},"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.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":null,"pages":null},"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.569220
K. Wada, S. Takagi, N. Fujii
This paper proposes a design method for integrated continuous-time filters with low group-delay sensitivities. For minimization of worst-case errors of a group delay by deviations of element values, the sum of absolute values of group-delay sensitivities for element values is considered and conditions for the minimization are proved. Although equations of group-delay sensitivities only at DC are used for the determination of element values in general signal-flow graphs, relatively low sensitivities at the other frequencies are confirmed by computer analysis.
{"title":"Design of integrated continuous-time filters with low group-delay sensitivities","authors":"K. Wada, S. Takagi, N. Fujii","doi":"10.1109/APCAS.1996.569220","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569220","url":null,"abstract":"This paper proposes a design method for integrated continuous-time filters with low group-delay sensitivities. For minimization of worst-case errors of a group delay by deviations of element values, the sum of absolute values of group-delay sensitivities for element values is considered and conditions for the minimization are proved. Although equations of group-delay sensitivities only at DC are used for the determination of element values in general signal-flow graphs, relatively low sensitivities at the other frequencies are confirmed by computer analysis.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83277498","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.569265
Hang-Seop Lee
This paper describes a Korean spontaneous speech recognition system that is part of a speech-to-speech translation system being developed in ETRI. The features of this system are as follows. First, we have compiled two large human to human dialog databases. The speech database used in training and evaluation of this system was composed of two task domains: 339 dialogs collected in appointment scheduling domain and 535 dialogs collected in the travel planning domain. Second, recognition performance was evaluated not only on no out-of-vocabulary (OoV) case but also on the OoV case. From the evaluation result of spontaneous speech recognition with high OoV rate, we addressed the problem of Korean language and proposed a solution.
{"title":"Spontaneous dialogue recognition with large out-of-vocabularies","authors":"Hang-Seop Lee","doi":"10.1109/APCAS.1996.569265","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569265","url":null,"abstract":"This paper describes a Korean spontaneous speech recognition system that is part of a speech-to-speech translation system being developed in ETRI. The features of this system are as follows. First, we have compiled two large human to human dialog databases. The speech database used in training and evaluation of this system was composed of two task domains: 339 dialogs collected in appointment scheduling domain and 535 dialogs collected in the travel planning domain. Second, recognition performance was evaluated not only on no out-of-vocabulary (OoV) case but also on the OoV case. From the evaluation result of spontaneous speech recognition with high OoV rate, we addressed the problem of Korean language and proposed a solution.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83285523","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":null,"pages":null},"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.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":null,"pages":null},"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}
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":null,"pages":null},"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.569224
A. Kahng, S. Muddu
In this paper, we analyze coupled transmission lines and obtain a relationship between the moments of the coupled transfer functions. We then derive expressions for the first and second moments of the coupled transfer function which can be used to compute the response and threshold delays under various input excitations. We can compute the interconnect delay under parasitic coupling effects by using the previously derived analytic delay formulas for step and ramp inputs. We also present the analysis to compute the general k/sup th/ moment for the coupled interconnect lines.
{"title":"Delay analysis of coupled transmission lines","authors":"A. Kahng, S. Muddu","doi":"10.1109/APCAS.1996.569224","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569224","url":null,"abstract":"In this paper, we analyze coupled transmission lines and obtain a relationship between the moments of the coupled transfer functions. We then derive expressions for the first and second moments of the coupled transfer function which can be used to compute the response and threshold delays under various input excitations. We can compute the interconnect delay under parasitic coupling effects by using the previously derived analytic delay formulas for step and ramp inputs. We also present the analysis to compute the general k/sup th/ moment for the coupled interconnect lines.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73047044","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":null,"pages":null},"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.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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：