Pub Date : 1996-11-18DOI: 10.1109/APCAS.1996.569214
Jong-Hyeong Lee
This paper proposes a new timing recovery method by means of utilizing service data filling rate instead of timing information of transmitter. The proposed algorithm controls the phase locked loop in the opposite direction to data filling rate of FIFO in receiver, and it is based on the fact that average of cell jitters is zero. The proposed algorithm was implemented and tested in the DS3 rate video communication system. As a result, the proposed algorithm yields good performance in terms of jitters characteristics and hardware complexity.
{"title":"A source clock recovery by receiving data filling rate in AAL1 traffic","authors":"Jong-Hyeong Lee","doi":"10.1109/APCAS.1996.569214","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569214","url":null,"abstract":"This paper proposes a new timing recovery method by means of utilizing service data filling rate instead of timing information of transmitter. The proposed algorithm controls the phase locked loop in the opposite direction to data filling rate of FIFO in receiver, and it is based on the fact that average of cell jitters is zero. The proposed algorithm was implemented and tested in the DS3 rate video communication system. As a result, the proposed algorithm yields good performance in terms of jitters characteristics and hardware complexity.","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":"85871987","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.569330
Jinwuk Scok, Seongwon Cho
We present a new learning method called the quotient canonical feature map for competitive learning neural networks. The previous neural network learning algorithms did not consider their topological properties and thus, the dynamics was not clearly defined. We show that the weight vectors obtained by competitive learning decompose the input vector space and map it to the quotient space X/R. In addition, we define /spl epsi/, the quotient function which maps [1,/spl prop/]/spl plusmn/R/sup n/) to (0,1), and induce the proposed algorithm from the performance measure with the quotient function. Experimental results for pattern recognition of remote sensing data indicate the superiority of the proposed algorithm in comparision to conventional competitive learning methods.
{"title":"Quotient canonical feature map competitive learning neural network","authors":"Jinwuk Scok, Seongwon Cho","doi":"10.1109/APCAS.1996.569330","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569330","url":null,"abstract":"We present a new learning method called the quotient canonical feature map for competitive learning neural networks. The previous neural network learning algorithms did not consider their topological properties and thus, the dynamics was not clearly defined. We show that the weight vectors obtained by competitive learning decompose the input vector space and map it to the quotient space X/R. In addition, we define /spl epsi/, the quotient function which maps [1,/spl prop/]/spl plusmn/R/sup n/) to (0,1), and induce the proposed algorithm from the performance measure with the quotient function. Experimental results for pattern recognition of remote sensing data indicate the superiority of the proposed algorithm in comparision to conventional competitive learning methods.","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":"86010872","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.569227
S. Tantaratana
In this paper, we extend the periodically time-varying (PTV) filter realization, which was proposed for the FIR filter, to be used for IIR filters. The realization consists of ternary ({0, /spl plusmn/1}) or quinary ({0, /spl plusmn/1, /spl plusmn/2}) PTV coefficients with simple input and output units. The coefficients as well as the input and output units require no hardware multiplier. This simplifies the layout for VLSI implementation and increases the processing speed.
{"title":"Multiplier-free IIR filter realizations with periodically time-varying coefficients","authors":"S. Tantaratana","doi":"10.1109/APCAS.1996.569227","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569227","url":null,"abstract":"In this paper, we extend the periodically time-varying (PTV) filter realization, which was proposed for the FIR filter, to be used for IIR filters. The realization consists of ternary ({0, /spl plusmn/1}) or quinary ({0, /spl plusmn/1, /spl plusmn/2}) PTV coefficients with simple input and output units. The coefficients as well as the input and output units require no hardware multiplier. This simplifies the layout for VLSI implementation and increases the processing speed.","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":"84770132","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.569313
H. Tamura, H. Sugawara, M. Sengoku, S. Shinoda
Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. In the previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper concerns a problem called plural cover problem. We define a generalized plural cover problem and we propose an efficient algorithm for the generalized plural cover problem.
{"title":"On a generalization of a covering problem on undirected flow networks","authors":"H. Tamura, H. Sugawara, M. Sengoku, S. Shinoda","doi":"10.1109/APCAS.1996.569313","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569313","url":null,"abstract":"Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. In the previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper concerns a problem called plural cover problem. We define a generalized plural cover problem and we propose an efficient algorithm for the generalized plural cover problem.","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":"83150146","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.569238
Seoung-Jun Oh, Byungsun Bang, E. S. Kim
We proposed a new image segmentation algorithm, called "SC-SAM", which checks the homogeneity of an image block using a statistical hypothesis test. SC-SAM consists of five processes: a split process, edge region adjustment, a merge process, postprocessing, and region representation. ShortCut test is applied to split a block as well as to merge two homogeneous regions into a region. A threshold value for the region homogeneity test can be chosen theoretically. SC-SAM can provide relatively very low computational complexity as well as keep the quality of a reconstructed image. Furthermore, SC-SAM removes the necessity of a control map used for refining the output in conventional algorithms. SC-SAM can considerably reduce the number of merged regions and computational time, while retaining the visual quality of the reconstructed image.
{"title":"A statistical hypothesis test-based image segmentation for low-bit rate coding","authors":"Seoung-Jun Oh, Byungsun Bang, E. S. Kim","doi":"10.1109/APCAS.1996.569238","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569238","url":null,"abstract":"We proposed a new image segmentation algorithm, called \"SC-SAM\", which checks the homogeneity of an image block using a statistical hypothesis test. SC-SAM consists of five processes: a split process, edge region adjustment, a merge process, postprocessing, and region representation. ShortCut test is applied to split a block as well as to merge two homogeneous regions into a region. A threshold value for the region homogeneity test can be chosen theoretically. SC-SAM can provide relatively very low computational complexity as well as keep the quality of a reconstructed image. Furthermore, SC-SAM removes the necessity of a control map used for refining the output in conventional algorithms. SC-SAM can considerably reduce the number of merged regions and computational time, while retaining the visual quality of the reconstructed image.","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":"84020277","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.569255
N. Takaya, D. Dodds, C. McCrosky
The increasing demand for Internet and World Wide Web access from the home has stimulated research into finding methods of providing access at rates greater than the 28.8 kb/s offered by current computer modems. Most copper telephone pairs have bandwidth capacities much greater than the 3.4 kHz voice-band. Using this excess bandwidth it is possible to substantially exceed current modem rates. This paper describes an inexpensive and readily deployable network access technology capable of providing bit rates ranging from hundreds of kb/s to potentially greater than 1 Mb/s on existing copper telephone lines. The usable bit rate, which varies depending on the length and gauge of the wire, is adaptively determined at system start up. The results of rate adaption testing are presented, as well as the results of throughput testing when TCP is used to provide flow control across the adaptive rate transmission line. It is also shown that current IBM compatible computers are only capable of supporting data rates of slightly more than 1 Mb/s through Ethernet adaptor cards; providing access rates beyond a few Mb/s is currently unnecessary.
{"title":"Adaptive rate subscriber loop data transmission using Ethernet interfaces","authors":"N. Takaya, D. Dodds, C. McCrosky","doi":"10.1109/APCAS.1996.569255","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569255","url":null,"abstract":"The increasing demand for Internet and World Wide Web access from the home has stimulated research into finding methods of providing access at rates greater than the 28.8 kb/s offered by current computer modems. Most copper telephone pairs have bandwidth capacities much greater than the 3.4 kHz voice-band. Using this excess bandwidth it is possible to substantially exceed current modem rates. This paper describes an inexpensive and readily deployable network access technology capable of providing bit rates ranging from hundreds of kb/s to potentially greater than 1 Mb/s on existing copper telephone lines. The usable bit rate, which varies depending on the length and gauge of the wire, is adaptively determined at system start up. The results of rate adaption testing are presented, as well as the results of throughput testing when TCP is used to provide flow control across the adaptive rate transmission line. It is also shown that current IBM compatible computers are only capable of supporting data rates of slightly more than 1 Mb/s through Ethernet adaptor cards; providing access rates beyond a few Mb/s is currently unnecessary.","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":"77156330","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.569231
S. Cho, Sang Duck Kim
This paper presents convergence analyses of the stochastic gradient adaptive algorithms based on high order error power criteria. In particular, our attention has focused on investigating the statistical behaviour of the least mean absolute third (LMAT) and the least mean fourth (LMF) adaptive algorithms. For each algorithm, under a set of mild assumptions, we have derived nonlinear evolution equations that characterize the mean and mean-squared behaviour of the algorithm. Computer simulation examples show fairly good agreement between the theoretical and actual behaviour of the two algorithms.
{"title":"Adaptive filters based on the high order error statistics","authors":"S. Cho, Sang Duck Kim","doi":"10.1109/APCAS.1996.569231","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569231","url":null,"abstract":"This paper presents convergence analyses of the stochastic gradient adaptive algorithms based on high order error power criteria. In particular, our attention has focused on investigating the statistical behaviour of the least mean absolute third (LMAT) and the least mean fourth (LMF) adaptive algorithms. For each algorithm, under a set of mild assumptions, we have derived nonlinear evolution equations that characterize the mean and mean-squared behaviour of the algorithm. Computer simulation examples show fairly good agreement between the theoretical and actual behaviour of the two algorithms.","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":"81494783","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.569275
Charles J. Alpert, L. Hagen, Andrew B. Kahng
We present a multilevel/genetic circuit partitioning algorithm that utilizes the Metis graph partitioning package, which had been previously applied to finite-element graphs. Our new technique produces better results than Metis alone, and also produces bipartitionings that are competitive with recent methods while using less CPU time.
{"title":"A hybrid multilevel/genetic approach for circuit partitioning","authors":"Charles J. Alpert, L. Hagen, Andrew B. Kahng","doi":"10.1109/APCAS.1996.569275","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569275","url":null,"abstract":"We present a multilevel/genetic circuit partitioning algorithm that utilizes the Metis graph partitioning package, which had been previously applied to finite-element graphs. Our new technique produces better results than Metis alone, and also produces bipartitionings that are competitive with recent methods while using less CPU time.","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":"76371418","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.585470
L. A. Zadeh
Fuzzy information granulation (IG) is central to human reasoning and concept formation. It is this aspect of fuzzy IG that underlies its essential role in the conception and design of intelligent systems. What is conclusive is that there are many tasks which humans can perform with ease and that no machine could perform without the use of fuzzy information granulation. This conclusion has a thought-provoking implication for AI: without the methodology of fuzzy IG in its armamentarium, AI cannot achieve its goals.
{"title":"The roles of soft computing and fuzzy logic in the conception, design and deployment of intelligent system","authors":"L. A. Zadeh","doi":"10.1109/APCAS.1996.585470","DOIUrl":"https://doi.org/10.1109/APCAS.1996.585470","url":null,"abstract":"Fuzzy information granulation (IG) is central to human reasoning and concept formation. It is this aspect of fuzzy IG that underlies its essential role in the conception and design of intelligent systems. What is conclusive is that there are many tasks which humans can perform with ease and that no machine could perform without the use of fuzzy information granulation. This conclusion has a thought-provoking implication for AI: without the methodology of fuzzy IG in its armamentarium, AI cannot achieve its goals.","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":"76664027","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.569309
B. Persic, I. Medic
Some considerations on initial partitioning the circuit within harmonic balance analysis are presented. Instead of linear and nonlinear, it is divided into resistive and reactive parts. Following the procedure presented, frequency as a parameter appears no more than once inside each equation, and most of the unknowns are expressed explicitly. The former is advantageous when examining an autonomous system, and the latter enables a simple numerical process. The method proposed is illustrated by an example.
{"title":"Extracting frequency of an autonomous system by harmonic balance","authors":"B. Persic, I. Medic","doi":"10.1109/APCAS.1996.569309","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569309","url":null,"abstract":"Some considerations on initial partitioning the circuit within harmonic balance analysis are presented. Instead of linear and nonlinear, it is divided into resistive and reactive parts. Following the procedure presented, frequency as a parameter appears no more than once inside each equation, and most of the unknowns are expressed explicitly. The former is advantageous when examining an autonomous system, and the latter enables a simple numerical process. The method proposed is illustrated by an example.","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":"77888332","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
扫码关注我们
求助内容：
应助结果提醒方式：