Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799515
P.H.J. Chong, C. Leung
Reuse partitioning (RP) is a simple technique that can be used to increase system capacity. With RP a cell is divided into several concentric regions, each associated with a different cluster size. In this paper the call blocking probability P/sub B/ in a cellular system which employs an n-region RP scheme with fixed channel allocation (FCA) is studied. For an n-region RP scheme with multiple channel switching, an analytic expression for P/sub B/ can be obtained. A comparison of no, single and multiple channel switching is made. It was found that the performances of single and multiple channel switching are very close. The system capacity of a two region (four region) RP scheme can be increased by about 25% (45%) compared to conventional FCA system without RP. Comparison with a previously studied simplified model indicates that the latter can yield overly optimistic blocking probabilities.
{"title":"Performance analysis of reuse partitioning in cellular systems","authors":"P.H.J. Chong, C. Leung","doi":"10.1109/PACRIM.1999.799515","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799515","url":null,"abstract":"Reuse partitioning (RP) is a simple technique that can be used to increase system capacity. With RP a cell is divided into several concentric regions, each associated with a different cluster size. In this paper the call blocking probability P/sub B/ in a cellular system which employs an n-region RP scheme with fixed channel allocation (FCA) is studied. For an n-region RP scheme with multiple channel switching, an analytic expression for P/sub B/ can be obtained. A comparison of no, single and multiple channel switching is made. It was found that the performances of single and multiple channel switching are very close. The system capacity of a two region (four region) RP scheme can be increased by about 25% (45%) compared to conventional FCA system without RP. Comparison with a previously studied simplified model indicates that the latter can yield overly optimistic blocking probabilities.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"35 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":"128952261","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.799484
S. Arseneau, J. Cooperstock
In order to recognize actions of a human properly, an algorithm must be able to detect a person accurately in any given image. This data will be used to ascertain what action the user is performing. Many methods have been proposed that use a difference picture technique in which the image of the user is subtracted from a previously known image with the same background, without the user. These methods, however, are plagued with problems of noise and "ghosting", the undesirable introduction of image fragments as a result of changes in light intensity and moving objects in the background. The proposed algorithm combines several image processing methods in order to produce a clean difference image, while being far more robust to changes in light intensities and in the background scene.
{"title":"Real-time image segmentation for action recognition","authors":"S. Arseneau, J. Cooperstock","doi":"10.1109/PACRIM.1999.799484","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799484","url":null,"abstract":"In order to recognize actions of a human properly, an algorithm must be able to detect a person accurately in any given image. This data will be used to ascertain what action the user is performing. Many methods have been proposed that use a difference picture technique in which the image of the user is subtracted from a previously known image with the same background, without the user. These methods, however, are plagued with problems of noise and \"ghosting\", the undesirable introduction of image fragments as a result of changes in light intensity and moving objects in the background. The proposed algorithm combines several image processing methods in order to produce a clean difference image, while being far more robust to changes in light intensities and in the background scene.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"1 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":"130089176","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.799482
P. Sristi, W. Lu, A. Antoniou
Filter banks used for subband decomposition in echo cancellation need to be perfect reconstruction filter banks, and to achieve better performance of the echo canceller, the filters need to be perfect half-band filters. A method of designing filter banks for use in echo cancellation is proposed. This method is based on linear parametrization of half-band filters. The main advantage of using this method is the orthogonality of the resultant filter banks. Experimental results based on simulated echo are given and discussed.
{"title":"Design and application of an optimum orthogonal wavelet filter for echo cancellation","authors":"P. Sristi, W. Lu, A. Antoniou","doi":"10.1109/PACRIM.1999.799482","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799482","url":null,"abstract":"Filter banks used for subband decomposition in echo cancellation need to be perfect reconstruction filter banks, and to achieve better performance of the echo canceller, the filters need to be perfect half-band filters. A method of designing filter banks for use in echo cancellation is proposed. This method is based on linear parametrization of half-band filters. The main advantage of using this method is the orthogonality of the resultant filter banks. Experimental results based on simulated echo are given and discussed.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"15 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":"125303149","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.799480
M. Liu, S. Verma, C. Zarowski, F. Fairman
To recall, Cooklev (1995) made some extensions to the Bernstein polynomial method of Caglar and Akansu (1993) for the design of regular half-band filters leading to orthogonal wavelets. However, the ad hoc methodology of Cooklev had many shortcomings which we eliminate by expressing the problem in the form of a quadratic programming problem with linear inequality constraints. This problem is solved with the Goldfarb-Idnani (1983) algorithm, and the methodology we adopt allows for the minimization of half-band filter stopband energy while simultaneously upper bounding the stopband response. This allows us to make the peak sidelobe level (PSL) and stopband energy (SE) tradeoff explained in Adams and Sullivan (see IEEE Trans. on Signal Proc., vol. 46, p.306-20, 1998). Regular half-band filters designed in this way lead to regular orthogonal wavelets. This paper therefore presents a solution to all difficulties noted in Zarowski (see PACRIM'97, Victoria, BC, Canada, p.477-80, 1997).
{"title":"Peak-constrained least-squares half-band filters and orthogonal wavelets","authors":"M. Liu, S. Verma, C. Zarowski, F. Fairman","doi":"10.1109/PACRIM.1999.799480","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799480","url":null,"abstract":"To recall, Cooklev (1995) made some extensions to the Bernstein polynomial method of Caglar and Akansu (1993) for the design of regular half-band filters leading to orthogonal wavelets. However, the ad hoc methodology of Cooklev had many shortcomings which we eliminate by expressing the problem in the form of a quadratic programming problem with linear inequality constraints. This problem is solved with the Goldfarb-Idnani (1983) algorithm, and the methodology we adopt allows for the minimization of half-band filter stopband energy while simultaneously upper bounding the stopband response. This allows us to make the peak sidelobe level (PSL) and stopband energy (SE) tradeoff explained in Adams and Sullivan (see IEEE Trans. on Signal Proc., vol. 46, p.306-20, 1998). Regular half-band filters designed in this way lead to regular orthogonal wavelets. This paper therefore presents a solution to all difficulties noted in Zarowski (see PACRIM'97, Victoria, BC, Canada, p.477-80, 1997).","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"15 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":"121123109","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.799523
L. Chu
A failure prediction method for a noisy uncoded QPSK upstream HFC communication channel has been derived in this paper. This implementation is based on the relationship between the higher layer error (packet loss) and the physical layer error (bit error rate) for the HFC network. With the laboratory measurements on the HFC upstream channel characteristics and the channel analysis and modeling, we have derived an implementation plan for broadband HFC network failure prediction with additive white Gaussian noise (AWGN) impairment. This study provides more information on fault management for HFC networks and also provides benefits in the development of a network management information base for the HFC network.
{"title":"A study on noisy HFC network upstream channel failure prediction and implementation","authors":"L. Chu","doi":"10.1109/PACRIM.1999.799523","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799523","url":null,"abstract":"A failure prediction method for a noisy uncoded QPSK upstream HFC communication channel has been derived in this paper. This implementation is based on the relationship between the higher layer error (packet loss) and the physical layer error (bit error rate) for the HFC network. With the laboratory measurements on the HFC upstream channel characteristics and the channel analysis and modeling, we have derived an implementation plan for broadband HFC network failure prediction with additive white Gaussian noise (AWGN) impairment. This study provides more information on fault management for HFC networks and also provides benefits in the development of a network management information base for the HFC network.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"85 4 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":"116305765","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.799582
Y. Zhang, M. Zeytinoglu
Time-varying orthogonal filter bank approaches for block wavelet transform (WT) and wavelet packet (WP) based subband coding methods have two common problems: (1) severe block effects in subbands caused by sudden level changes at the boundaries; (2) more complicated reconstruction filterbanks than the decomposition filterbank due to a larger number of switching operations. The recently introduced lifting scheme is based on the idea of generating biorthogonal systems using simple and invertible stages. As such the lifting scheme is suitable for block subband coding. However, the lifting scheme continues to exhibit block effects for even-length blocks. This is due to the big prediction errors at right boundaries caused by extrapolation. In this paper we present an improved lifting scheme (ILS) for independent block subband coding. The ILS is free of block effects and the boundary treatments are more efficient. The reconstruction has the same simplicity as the decomposition.
{"title":"Improved lifting scheme for block subband coding","authors":"Y. Zhang, M. Zeytinoglu","doi":"10.1109/PACRIM.1999.799582","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799582","url":null,"abstract":"Time-varying orthogonal filter bank approaches for block wavelet transform (WT) and wavelet packet (WP) based subband coding methods have two common problems: (1) severe block effects in subbands caused by sudden level changes at the boundaries; (2) more complicated reconstruction filterbanks than the decomposition filterbank due to a larger number of switching operations. The recently introduced lifting scheme is based on the idea of generating biorthogonal systems using simple and invertible stages. As such the lifting scheme is suitable for block subband coding. However, the lifting scheme continues to exhibit block effects for even-length blocks. This is due to the big prediction errors at right boundaries caused by extrapolation. In this paper we present an improved lifting scheme (ILS) for independent block subband coding. The ILS is free of block effects and the boundary treatments are more efficient. The reconstruction has the same simplicity as the decomposition.","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":"128520398","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.799600
A. Elkateeb, M. Elbeshti
The embedded RISC core can be used efficiently to design high-speed scalable ATM network interfaces. Such core could also make the design of these interfaces simple, shorten the developing cycle and reduce their developing cost. In this paper, we have studied the design issues related to reduced instruction set computer (RISC) core and specifically for high-speed ATM host-network interfaces applications. We have investigated the processing and the instruction types that the RISC core is usually performed in addition to its structure.
{"title":"A RISC core design for an ATM network interfaces","authors":"A. Elkateeb, M. Elbeshti","doi":"10.1109/PACRIM.1999.799600","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799600","url":null,"abstract":"The embedded RISC core can be used efficiently to design high-speed scalable ATM network interfaces. Such core could also make the design of these interfaces simple, shorten the developing cycle and reduce their developing cost. In this paper, we have studied the design issues related to reduced instruction set computer (RISC) core and specifically for high-speed ATM host-network interfaces applications. We have investigated the processing and the instruction types that the RISC core is usually performed in addition to its structure.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"26 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131839098","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.799466
D. G. Daut, Ming Yu
This paper presents an improved self-similar traffic generator, based on fast fractional Gaussian noise, for the purpose of fast simulation of long term correlation of self-similar traffic. The algorithm developed in this study is more efficient than existing methods since it only requires Hurst parameter and can arrive higher accurate sample points if necessary. The effectiveness of these methods has been demonstrated by some numerical examples.
{"title":"An improved fast algorithm for simulating self-similar traffic with application in ATM networks","authors":"D. G. Daut, Ming Yu","doi":"10.1109/PACRIM.1999.799466","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799466","url":null,"abstract":"This paper presents an improved self-similar traffic generator, based on fast fractional Gaussian noise, for the purpose of fast simulation of long term correlation of self-similar traffic. The algorithm developed in this study is more efficient than existing methods since it only requires Hurst parameter and can arrive higher accurate sample points if necessary. The effectiveness of these methods has been demonstrated by some numerical examples.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"70 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":"133951119","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.799516
T.K. Kim, C. Leung
Two paging schemes which can be used to locate a mobile user in a cellular communication system are proposed. Based on a directional random walk user mobility model and a dynamic location updating scheme, the performances of the schemes, as measured by the average paging delay and traffic, are examined. It is found that these paging schemes offer significant gains over a previously studied selective paging scheme. The performance degradation of the paging schemes due to uncertainty in user mobility parameter values is also investigated.
{"title":"Generalized paging schemes for cellular communication systems","authors":"T.K. Kim, C. Leung","doi":"10.1109/PACRIM.1999.799516","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799516","url":null,"abstract":"Two paging schemes which can be used to locate a mobile user in a cellular communication system are proposed. Based on a directional random walk user mobility model and a dynamic location updating scheme, the performances of the schemes, as measured by the average paging delay and traffic, are examined. It is found that these paging schemes offer significant gains over a previously studied selective paging scheme. The performance degradation of the paging schemes due to uncertainty in user mobility parameter values is also investigated.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"8 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":"131175660","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.799611
I. Sandberg
A central role in the theory of discrete-time linear systems is played by the idea that every such system has an input-output map that can be represented by a convolution or the familiar generalization of a convolution. This thinking involves an oversight that was previously corrected by adding an additional term to the representation. A need for an additional term arises also in connection with representations for continuous-time linear systems. We survey these results and, in particular, discuss a corresponding result for the important case of representations of multidimensional continuous-space system maps.
{"title":"A survey of representations for multidimensional linear systems: the extra term","authors":"I. Sandberg","doi":"10.1109/PACRIM.1999.799611","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799611","url":null,"abstract":"A central role in the theory of discrete-time linear systems is played by the idea that every such system has an input-output map that can be represented by a convolution or the familiar generalization of a convolution. This thinking involves an oversight that was previously corrected by adding an additional term to the representation. A need for an additional term arises also in connection with representations for continuous-time linear systems. We survey these results and, in particular, discuss a corresponding result for the important case of representations of multidimensional continuous-space system maps.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"57 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":"134366917","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
扫码关注我们
求助内容：
应助结果提醒方式：