Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799492
T. Saito, H. Aida, U. Bunworasate, T. Muranaka, T. Aoki
The VTDM switching architecture has been proposed as a new worthwhile solution for VBR video transmission. The VTDM requires real-time and efficient time slot assignment, which is performed in every frame period. We propose two algorithms that are efficient, fast and practical for hardware implementation.
{"title":"Efficient time slot assignment algorithms in variable bit rate TDM switch","authors":"T. Saito, H. Aida, U. Bunworasate, T. Muranaka, T. Aoki","doi":"10.1109/PACRIM.1999.799492","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799492","url":null,"abstract":"The VTDM switching architecture has been proposed as a new worthwhile solution for VBR video transmission. The VTDM requires real-time and efficient time slot assignment, which is performed in every frame period. We propose two algorithms that are efficient, fast and practical for hardware implementation.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"10 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132571974","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799525
Budiarto, K. Harumoto, M. Tsukamoto, S. Nishio
The mobile computing paradigm introduces new technical issues in the area of database systems. In a mobile environment, the location of mobile users is a kind of system data that is referred most frequently. In mobile environments, location data are stored in databases. However, as the location of user is a frequently changing piece of data, queries on location data are prone to inconsistency. Aggregate queries are among the type of queries that will suffer greatly. In this paper, we propose the two-step locking protocol for location databases that can guarantee aggregate queries to get consistent results. We show that our proposed protocol performs much better than the conventional single-step locking protocol if used for location databases in mobile environment.
{"title":"Performance evaluation of two step locking protocol for location databases in mobile environment","authors":"Budiarto, K. Harumoto, M. Tsukamoto, S. Nishio","doi":"10.1109/PACRIM.1999.799525","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799525","url":null,"abstract":"The mobile computing paradigm introduces new technical issues in the area of database systems. In a mobile environment, the location of mobile users is a kind of system data that is referred most frequently. In mobile environments, location data are stored in databases. However, as the location of user is a frequently changing piece of data, queries on location data are prone to inconsistency. Aggregate queries are among the type of queries that will suffer greatly. In this paper, we propose the two-step locking protocol for location databases that can guarantee aggregate queries to get consistent results. We show that our proposed protocol performs much better than the conventional single-step locking protocol if used for location databases in mobile environment.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130922264","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799483
D. Gunawan
The wavelet transform has become a popular tool in many applications, including image processing, especially in removing noise from images. This paper presents a modified Donoho's (1995) thresholding for denoising images. The simulation results showed that modified thresholding is superior in terms of PSNR compared to Donoho's thresholding.
{"title":"Denoising images using wavelet transform","authors":"D. Gunawan","doi":"10.1109/PACRIM.1999.799483","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799483","url":null,"abstract":"The wavelet transform has become a popular tool in many applications, including image processing, especially in removing noise from images. This paper presents a modified Donoho's (1995) thresholding for denoising images. The simulation results showed that modified thresholding is superior in terms of PSNR compared to Donoho's thresholding.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131587931","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799526
T. Kasukawa, H. Matsuda, M. Nakanishi, A. Hashimoto
XML is a markup language for describing structured documents. Moreover, it has the capability to effectively represent semi-structured data. XML is expected to be widely used for exchanging semi-structured data over networks. In this paper, we study and propose a new method for maintaining a database of XML documents that can be queried for retrieval based on structure and content. Our method improves query efficiency and has low storage consumption requirements. In particular, we show that our method is very effective when it is applied to molecular biological data.
{"title":"A new method for maintaining semi-structured data described in XML","authors":"T. Kasukawa, H. Matsuda, M. Nakanishi, A. Hashimoto","doi":"10.1109/PACRIM.1999.799526","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799526","url":null,"abstract":"XML is a markup language for describing structured documents. Moreover, it has the capability to effectively represent semi-structured data. XML is expected to be widely used for exchanging semi-structured data over networks. In this paper, we study and propose a new method for maintaining a database of XML documents that can be queried for retrieval based on structure and content. Our method improves query efficiency and has low storage consumption requirements. In particular, we show that our method is very effective when it is applied to molecular biological data.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115759438","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799503
A. Skavantzos, Yuke Wang
The two most important considerations when designing RNS systems are the choices of the moduli sets and the conversion from the residue to the weighted binary system. In this paper, we unite the new progresses in both issues by applying a new general conversion algorithm, the New Chinese Remainder Theorem III, to the recently proposed conjugate moduli sets, which results in a more efficient design for the residue to binary conversion of-the given moduli sets. This more efficient design for the converter will make the conjugate moduli sets more attractive compared to other moduli sets. The result also demonstrates the effectiveness of the New Chinese Remainder Theorems.
{"title":"Application of new Chinese remainder theorems to RNS with two pairs of conjugate moduli","authors":"A. Skavantzos, Yuke Wang","doi":"10.1109/PACRIM.1999.799503","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799503","url":null,"abstract":"The two most important considerations when designing RNS systems are the choices of the moduli sets and the conversion from the residue to the weighted binary system. In this paper, we unite the new progresses in both issues by applying a new general conversion algorithm, the New Chinese Remainder Theorem III, to the recently proposed conjugate moduli sets, which results in a more efficient design for the residue to binary conversion of-the given moduli sets. This more efficient design for the converter will make the conjugate moduli sets more attractive compared to other moduli sets. The result also demonstrates the effectiveness of the New Chinese Remainder Theorems.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186892","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799610
A. Fellah, M. Abaza
We introduce the concept of working set-based page block in distributed virtual memory systems. We show that hit ratio is significantly better than that of conventional systems, where page blocks are formed from neighboring contiguous pages on the disk. Moreover, the choice of some relevant virtual memory parameters, which is usually made by the system manager and is riskier and may affect the efficiency of the system. We show that such choice becomes more reliable by using page blocks.
{"title":"On page blocks in distributed virtual memory systems","authors":"A. Fellah, M. Abaza","doi":"10.1109/PACRIM.1999.799610","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799610","url":null,"abstract":"We introduce the concept of working set-based page block in distributed virtual memory systems. We show that hit ratio is significantly better than that of conventional systems, where page blocks are formed from neighboring contiguous pages on the disk. Moreover, the choice of some relevant virtual memory parameters, which is usually made by the system manager and is riskier and may affect the efficiency of the system. We show that such choice becomes more reliable by using page blocks.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121343170","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799535
C. Costi, D.M. Miller
Design methodologies based on the reuse of existing components are needed to satisfy IC design productivity requirements. In this paper, we present our progress in developing the VHDL Assistant Low Efforts Tool (VALET) which is under development in the Department of Computer Science at the University of Victoria, Canada. VALET aims to automatically extract information from VHDL code with the goal of assisting designers in reusing components. Our motivation is that quite often the available VHDL descriptions have been developed by others, are incomplete or partially documented, and/or are too complex to promote reuse without some level of automated analysis.
{"title":"VHDL signal analysis in VALET","authors":"C. Costi, D.M. Miller","doi":"10.1109/PACRIM.1999.799535","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799535","url":null,"abstract":"Design methodologies based on the reuse of existing components are needed to satisfy IC design productivity requirements. In this paper, we present our progress in developing the VHDL Assistant Low Efforts Tool (VALET) which is under development in the Department of Computer Science at the University of Victoria, Canada. VALET aims to automatically extract information from VHDL code with the goal of assisting designers in reusing components. Our motivation is that quite often the available VHDL descriptions have been developed by others, are incomplete or partially documented, and/or are too complex to promote reuse without some level of automated analysis.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280928","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799599
M. Le, P. Hurst, X. Wang
An adaptive noise-predictive decision-feedback equalizer (DFE) for a read channel is described. This decision-feedback equalizer uses a recursive filter to whiten the noise at the input of the decision slicer, increasing the detection signal-to-noise ratio. The noise-predictive filter works in conjunction with the DFE to cancel postcursor intersymbol interference. A scheme for adapting the finite-impulse-response forward equalizer, feedback equalizer, and noise-predictive filter is presented. This read channel can perform better than a DFE with a FIR or an all-pass forward equalizer.
{"title":"An adaptive noise-predictive decision-feedback equalizer for the magnetic recording channel","authors":"M. Le, P. Hurst, X. Wang","doi":"10.1109/PACRIM.1999.799599","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799599","url":null,"abstract":"An adaptive noise-predictive decision-feedback equalizer (DFE) for a read channel is described. This decision-feedback equalizer uses a recursive filter to whiten the noise at the input of the decision slicer, increasing the detection signal-to-noise ratio. The noise-predictive filter works in conjunction with the DFE to cancel postcursor intersymbol interference. A scheme for adapting the finite-impulse-response forward equalizer, feedback equalizer, and noise-predictive filter is presented. This read channel can perform better than a DFE with a FIR or an all-pass forward equalizer.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123325690","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799536
Mitchell A. Thornton, J. D. Gaiche, J. V. Lemieux
Integer multiplication is a necessary operation for performing many tasks relevant to multimedia and telecommunications processes. Here, we discuss the results of an investigation into the effectiveness of automated synthesis tools as related to a sample of modern Programmable Logic Devices (PLDs). Although it is generally accepted that superior results in terms of required area and circuit delay can generally be obtained through manual implementation of such circuits, the exclusive use of automated synthesis tools based upon an original specification in terms of a Hardware Description Language (HDL) is presented here. The results of several different approaches to multiplier architectures are presented.
{"title":"Tradeoff analysis of integer multiplier circuits implemented in FPGAs","authors":"Mitchell A. Thornton, J. D. Gaiche, J. V. Lemieux","doi":"10.1109/PACRIM.1999.799536","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799536","url":null,"abstract":"Integer multiplication is a necessary operation for performing many tasks relevant to multimedia and telecommunications processes. Here, we discuss the results of an investigation into the effectiveness of automated synthesis tools as related to a sample of modern Programmable Logic Devices (PLDs). Although it is generally accepted that superior results in terms of required area and circuit delay can generally be obtained through manual implementation of such circuits, the exclusive use of automated synthesis tools based upon an original specification in terms of a Hardware Description Language (HDL) is presented here. The results of several different approaches to multiplier architectures are presented.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126331398","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799595
R. Hamila, G. Gunnarsson, M. Renfors
Polynomial-based interpolation techniques are an attractive approach for discrete-time processing of continuous-time signals. These techniques are employing discrete time filters for enabling arbitrary resampling of a time series, and have been used in several applications. In this contribution we investigate and analyze some new design methods and possible applications of this polynomial-based interpolation utilizing the Farrow structure.
{"title":"New design approach for polynomial-based interpolation","authors":"R. Hamila, G. Gunnarsson, M. Renfors","doi":"10.1109/PACRIM.1999.799595","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799595","url":null,"abstract":"Polynomial-based interpolation techniques are an attractive approach for discrete-time processing of continuous-time signals. These techniques are employing discrete time filters for enabling arbitrary resampling of a time series, and have been used in several applications. In this contribution we investigate and analyze some new design methods and possible applications of this polynomial-based interpolation utilizing the Farrow structure.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117055747","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
扫码关注我们
求助内容：
应助结果提醒方式：