Pub Date : 1996-11-18DOI: 10.1109/APCAS.1996.585471
R. Campbell
Summary form only given. This talk will explore the future of multimedia on the global Internet. It will examine the convergence of the web and video. Amongst the issues addressed, it will examine how users will access the Internet in the future and the impact of the access media on the services. It will examine how smart messaging, database access and hyperlinking of video can provide a framework for future video service. We will examine converging interests in collaborative computing and entertainment with respect to the shared common problems of time-event synchronization and multi-stream multimedia bandwidth management. The talk will discuss issues of bandwidth conservation and how specialized network protocols and compression schemes for Internet video can improve performance significantly. Long term, we will consider the advantages of bandwidth reservation, standards, and inexpensive java-enabled stations and how they may contribute towards the solution of ubiqituous video.
{"title":"Multimedia futures for the global Internet","authors":"R. Campbell","doi":"10.1109/APCAS.1996.585471","DOIUrl":"https://doi.org/10.1109/APCAS.1996.585471","url":null,"abstract":"Summary form only given. This talk will explore the future of multimedia on the global Internet. It will examine the convergence of the web and video. Amongst the issues addressed, it will examine how users will access the Internet in the future and the impact of the access media on the services. It will examine how smart messaging, database access and hyperlinking of video can provide a framework for future video service. We will examine converging interests in collaborative computing and entertainment with respect to the shared common problems of time-event synchronization and multi-stream multimedia bandwidth management. The talk will discuss issues of bandwidth conservation and how specialized network protocols and compression schemes for Internet video can improve performance significantly. Long term, we will consider the advantages of bandwidth reservation, standards, and inexpensive java-enabled stations and how they may contribute towards the solution of ubiqituous video.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"10 1","pages":"5-"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82269345","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.569317
T. Matsumoto
Petri nets are useful in modeling concurrent/parallel systems. But, their applications in practice have been slow due to lack of computational tools and techniques capable of dealing with large scale nets. In this paper, first, optimal-control-base analysis aspect of the sub-marking reachability problems (SMR) included the well-known reachability problems (MR) and MR with a firing count vector (MR-FV) is discussed and a semi-polynomial time algorithm for SMR/spl sup/MR is shown by applying the discrete-time Pontryagin's minimum principle (PMP) which includes the linear programming (LP) for each sub-problem optimization, where the checking procedure for critical siphons at each time, however, is neglected in the above time-complexity evaluation. Secondly, it is shown that the reachability problems and their inverse problems with no intermediate marking constraints, including the generalized sub-marking problems (GSMR) and the generalized sub-marking reachability on a minimum initial marking (MIS), are classified into five problems. Thirdly, it is briefly discussed that other problems with an unknown firing count vector can be reduced to SMR/spl sup/MR.
{"title":"Generalized submarking reachability problems under unknown firing count vectors and their inverse problems of Petri nets","authors":"T. Matsumoto","doi":"10.1109/APCAS.1996.569317","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569317","url":null,"abstract":"Petri nets are useful in modeling concurrent/parallel systems. But, their applications in practice have been slow due to lack of computational tools and techniques capable of dealing with large scale nets. In this paper, first, optimal-control-base analysis aspect of the sub-marking reachability problems (SMR) included the well-known reachability problems (MR) and MR with a firing count vector (MR-FV) is discussed and a semi-polynomial time algorithm for SMR/spl sup/MR is shown by applying the discrete-time Pontryagin's minimum principle (PMP) which includes the linear programming (LP) for each sub-problem optimization, where the checking procedure for critical siphons at each time, however, is neglected in the above time-complexity evaluation. Secondly, it is shown that the reachability problems and their inverse problems with no intermediate marking constraints, including the generalized sub-marking problems (GSMR) and the generalized sub-marking reachability on a minimum initial marking (MIS), are classified into five problems. Thirdly, it is briefly discussed that other problems with an unknown firing count vector can be reduced to SMR/spl sup/MR.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"71 1","pages":"476-479"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78057101","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.569296
I. Peters, P. Molitor, M. Weber
We present a generalized center terminal cell model and propose over-the-cell (OTC) routing algorithms, utilizing the new feature of the model, i.e., Vertical Floating Pins (VFPs). We approach the problem by linear integer programming and by dynamic programming. For further channel density reduction, both approaches have been combined with linear channel pin assignment. Experiments show a total density reduction by 45% compared to other OTC routing algorithms for center terminal cells.
{"title":"Vertical floating pins in OTC routing [VLSI layout]","authors":"I. Peters, P. Molitor, M. Weber","doi":"10.1109/APCAS.1996.569296","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569296","url":null,"abstract":"We present a generalized center terminal cell model and propose over-the-cell (OTC) routing algorithms, utilizing the new feature of the model, i.e., Vertical Floating Pins (VFPs). We approach the problem by linear integer programming and by dynamic programming. For further channel density reduction, both approaches have been combined with linear channel pin assignment. Experiments show a total density reduction by 45% compared to other OTC routing algorithms for center terminal cells.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"15 1","pages":"385-388"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79053898","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.569277
Kyung-Sik Jang, H. Kunieda
We propose a systematic method which synthesizes the data path and control path of CPU Core from the instruction sequence compiled and translated from C language description of target algorithm in hardware-software codesign environment. We use a graphical representation method to describe instructions in register transfer level. To explore design space more broadly, we apply synthesis parameters selectively, which change the architecture of data path. The number of data transfer paths is reduced by replacing the rarely used path with its bypass route. To select the best among the candidate CPU cores, the data path cost and control path cost are synthesized together.
{"title":"CPU core generation for hardware-software codesign","authors":"Kyung-Sik Jang, H. Kunieda","doi":"10.1109/APCAS.1996.569277","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569277","url":null,"abstract":"We propose a systematic method which synthesizes the data path and control path of CPU Core from the instruction sequence compiled and translated from C language description of target algorithm in hardware-software codesign environment. We use a graphical representation method to describe instructions in register transfer level. To explore design space more broadly, we apply synthesis parameters selectively, which change the architecture of data path. The number of data transfer paths is reduced by replacing the rarely used path with its bypass route. To select the best among the candidate CPU cores, the data path cost and control path cost are synthesized together.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"6 1","pages":"306-309"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80532283","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.569312
A. Katsaggelos
Many digital consumer products which utilize digital images and video are on the horizon today. Items such as personal communication systems (PCS) which utilize video may provide a great deal of opportunity for the application of restoration ideas to coded images. It is important to obtain a perspective on the future of image restoration which considers the driving importance of consumer applications. Specific restoration techniques are described and various experimental restoration results with video and still images are demonstrated.
{"title":"Recent trends in image restoration and enhancement techniques","authors":"A. Katsaggelos","doi":"10.1109/APCAS.1996.569312","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569312","url":null,"abstract":"Many digital consumer products which utilize digital images and video are on the horizon today. Items such as personal communication systems (PCS) which utilize video may provide a great deal of opportunity for the application of restoration ideas to coded images. It is important to obtain a perspective on the future of image restoration which considers the driving importance of consumer applications. Specific restoration techniques are described and various experimental restoration results with video and still images are demonstrated.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"2011 1","pages":"458-459"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73308512","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.569236
Jeong-Ho Park, Jae-Ho Choi, Hooq-Sung Kwak
The recent attention of image coding community is paid to wavelet transform, which is of interest for the nonstationary signal analysis because it provides good localization in time and frequency. There are two directions of study in decomposing an image by wavelet transform, that is octave form and wavelet packet. Of this, wavelet packet works adequately for all images with various properties, but it has a difficulty of requiring relatively massive processing time. In this paper, using a statistical properties, such as correlation and variance, in spatial domain and octave band, a new algorithm for generating wavelet packet is presented. The described scheme has an ability of decomposing a image fastly. Simulation results have shown us a good performance in a view point of processing time and band decomposition ability comparing to the Vetterli's method.
{"title":"A fast algorithm for wavelet packet decomposition using statistical properties of images","authors":"Jeong-Ho Park, Jae-Ho Choi, Hooq-Sung Kwak","doi":"10.1109/APCAS.1996.569236","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569236","url":null,"abstract":"The recent attention of image coding community is paid to wavelet transform, which is of interest for the nonstationary signal analysis because it provides good localization in time and frequency. There are two directions of study in decomposing an image by wavelet transform, that is octave form and wavelet packet. Of this, wavelet packet works adequately for all images with various properties, but it has a difficulty of requiring relatively massive processing time. In this paper, using a statistical properties, such as correlation and variance, in spatial domain and octave band, a new algorithm for generating wavelet packet is presented. The described scheme has an ability of decomposing a image fastly. Simulation results have shown us a good performance in a view point of processing time and band decomposition ability comparing to the Vetterli's method.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"29 1","pages":"129-132"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85482739","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.569270
T. Deng
This paper proposes a new method for designing variable two-dimensional (2-D) linear phase recursive digital filters whose stability is always guaranteed. The method finds each variable filter coefficient as a multidimensional (M-D) polynomial of a few variables. The variables specify different frequency-domain characteristics, thus they are called the spectral parameters. In applying the resulting variable filters, substituting different spectral parameter values into the M-D polynomials will obtain different filter coefficients and thus different frequency-domain characteristics. To guarantee the stability, we first perform coefficient transformations on the denominator coefficients such that they satisfy the stability conditions. These both denominator and numerator coefficients are determined as M-D polynomials.
{"title":"Design of variable 2-D linear phase IIR filters with guaranteed stability","authors":"T. Deng","doi":"10.1109/APCAS.1996.569270","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569270","url":null,"abstract":"This paper proposes a new method for designing variable two-dimensional (2-D) linear phase recursive digital filters whose stability is always guaranteed. The method finds each variable filter coefficient as a multidimensional (M-D) polynomial of a few variables. The variables specify different frequency-domain characteristics, thus they are called the spectral parameters. In applying the resulting variable filters, substituting different spectral parameter values into the M-D polynomials will obtain different filter coefficients and thus different frequency-domain characteristics. To guarantee the stability, we first perform coefficient transformations on the denominator coefficients such that they satisfy the stability conditions. These both denominator and numerator coefficients are determined as M-D polynomials.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"63 1","pages":"278-281"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88048993","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.569210
Seung Jun Lee, J. Song, ChoongWoong Lee
For memory constrained high-order entropy coding, (i) the number of Huffman tables and (ii) the size of each Huffman table have to be appropriately reduced. Recently, we developed a Huffman table sharing and a memory allocation methods, each of which efficiently reduces either (i) or (ii) to meet the given memory constraint while keeping the increase in average bitrate as small as possible. However, given a memory constraint, the Huffman table sharing and the memory allocation methods have to be employed at the same time to achieve the better result. This paper presents several efficient schemes for combining the two methods along with simulation results.
{"title":"Memory-constrained high-order entropy coding by Huffman table sharing and memory allocation","authors":"Seung Jun Lee, J. Song, ChoongWoong Lee","doi":"10.1109/APCAS.1996.569210","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569210","url":null,"abstract":"For memory constrained high-order entropy coding, (i) the number of Huffman tables and (ii) the size of each Huffman table have to be appropriately reduced. Recently, we developed a Huffman table sharing and a memory allocation methods, each of which efficiently reduces either (i) or (ii) to meet the given memory constraint while keeping the increase in average bitrate as small as possible. However, given a memory constraint, the Huffman table sharing and the memory allocation methods have to be employed at the same time to achieve the better result. This paper presents several efficient schemes for combining the two methods along with simulation results.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"76 ","pages":"26-29"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91455216","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.569298
Wonjong Kim, K. Kim, Hyunchul Shin
An effective hierarchical placement technique has been developed based on improved clustering and region refinement algorithms. The region refinement algorithm has been developed for an efficient and effective iterative improvement of row-based cell placement. For efficiency, the placement refinement is performed using multiple levels of hierarchy and "closely connected" cells are clustered. The physical layout area containing cells is hierarchically partitioned into bins. In the region refinement algorithm, each bin becomes the active bin by turns and the placement is optimized by moving cells between the active bin and its neighbor bins. To obtain optimal placement results, partitioning and region refinement algorithms are performed several times at each hierarchical level. Several standard cell benchmark circuits from MCNC are placed using the suggested placement technique and about 8% better results have been obtained when compared with TW7.0.
{"title":"An improved hierarchical placement technique using clustering and region refinement","authors":"Wonjong Kim, K. Kim, Hyunchul Shin","doi":"10.1109/APCAS.1996.569298","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569298","url":null,"abstract":"An effective hierarchical placement technique has been developed based on improved clustering and region refinement algorithms. The region refinement algorithm has been developed for an efficient and effective iterative improvement of row-based cell placement. For efficiency, the placement refinement is performed using multiple levels of hierarchy and \"closely connected\" cells are clustered. The physical layout area containing cells is hierarchically partitioned into bins. In the region refinement algorithm, each bin becomes the active bin by turns and the placement is optimized by moving cells between the active bin and its neighbor bins. To obtain optimal placement results, partitioning and region refinement algorithms are performed several times at each hierarchical level. Several standard cell benchmark circuits from MCNC are placed using the suggested placement technique and about 8% better results have been obtained when compared with TW7.0.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"39 1","pages":"393-396"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90107427","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.569264
O. Kwon, C. Un
In a Korean connected digit recognizer, insertion and deletion errors amount to about half of the total recognition errors because there exists two monophonemic digits in the Korean language. Previous studies showed that these errors are not corrected even by discriminative training algorithms. To reduce those errors, we propose to model and incorporate context-dependent word duration information directly in a decoding algorithm. Experimental results show that while incorporating duration information in the postprocessing stage does not achieve significant improvements over a baseline system, the proposed method reduces word error rates by as much as 10% for unknown length decoding when the recognizer is trained by the maximum likelihood estimation and generalized probabilistic descent methods. Further simple duration modeling by a bounded uniform distribution shows it is possible to achieve performance improvements comparable to detailed duration modeling by a gamma or Gaussian distribution, and hence it is a good compromise between performance and complexity.
{"title":"Performance of connected digit recognizers with context-dependent word duration modeling","authors":"O. Kwon, C. Un","doi":"10.1109/APCAS.1996.569264","DOIUrl":"https://doi.org/10.1109/APCAS.1996.569264","url":null,"abstract":"In a Korean connected digit recognizer, insertion and deletion errors amount to about half of the total recognition errors because there exists two monophonemic digits in the Korean language. Previous studies showed that these errors are not corrected even by discriminative training algorithms. To reduce those errors, we propose to model and incorporate context-dependent word duration information directly in a decoding algorithm. Experimental results show that while incorporating duration information in the postprocessing stage does not achieve significant improvements over a baseline system, the proposed method reduces word error rates by as much as 10% for unknown length decoding when the recognizer is trained by the maximum likelihood estimation and generalized probabilistic descent methods. Further simple duration modeling by a bounded uniform distribution shows it is possible to achieve performance improvements comparable to detailed duration modeling by a gamma or Gaussian distribution, and hence it is a good compromise between performance and complexity.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":"78 1","pages":"243-246"},"PeriodicalIF":0.0,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90328441","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
扫码关注我们
求助内容：
应助结果提醒方式：