{"title":"An improved architecture and implementation of cascaded integrator-comb decimation filters","authors":"Yonghong Gao, Lihong Jia, H. Tenhunen","doi":"10.1109/PACRIM.1999.799540","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799540","url":null,"abstract":"In this paper an improved version of the nonrecursive carry-save-adder-based structure for CIC (cascaded-integrator-comb) decimation filters is proposed for high speed applications. By employing parallel processing techniques, the improved structure can further increase the sampling rate of CIC filters. Low-complexity implementation of the parallel stages is also discussed.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"29 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":"126863775","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}
{"title":"A new approach for ATM network traffic modeling and simulation","authors":"D. G. Daut, Ming Yu","doi":"10.1109/PACRIM.1999.799465","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799465","url":null,"abstract":"The main objective of this paper is to develop a tractable model for self-similar traffic and to apply it to ATM networks. We develop a new traffic model derived from the arrival processes of the type M/G//spl infin/. This modeling method not only provides us an explicit and analytical expression for the self-similar traffic processes, but also sets up a connection between the two most popular self-similar processes. This model has a structure similar to that of a fractional ARIMA, with a driven process of fBm (fractional Brownian motion). But the coefficients of the fBm are derived from the Pareto distribution of the active periods of the arrival process. We also derive an explicit buffer level equation based on the proposed traffic model, which matches Norros' (1994) storage model. So this method can be also served as a verification of Norros' assumptions. The queueing behavior of a single server to self-similar input can be analytically investigated with the proposed equation. The effectiveness of these methods has been demonstrated by some practical applications.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"23 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":"126557638","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}
{"title":"Flow Initiation and ReServation Tree (FIRST): a new Internet resource reservation protocol","authors":"T. Chung, Henry C. B. Chan, V. Leung","doi":"10.1109/PACRIM.1999.799551","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799551","url":null,"abstract":"The best effort service provided by the current Internet is not suitable for supporting real-time multimedia applications which require quality of service (QoS) guarantees. To provide QoS over the Internet, a reservation mechanism is required to reserve resources along the data-delivery path. In this paper, we give an overview of three Internet reservation protocols: RSVP, ST-2+ and YESSIR, and compare their features. With the aim of combining the advantages of the above reservation protocols, a new reservation protocol called Flow Initiation and ReServation Tree (FIRST) is proposed. The operations of FIRST are explained with a number of examples.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"133 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":"116139979","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}
{"title":"Using formal approach to specify distributed multimedia systems","authors":"Lichen Zhang, P. Yuan","doi":"10.1109/PACRIM.1999.799575","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799575","url":null,"abstract":"A formal approach can benefit multimedia in a number of ways. For example, formal system development can aid the development of correct systems. Formal specification and verification techniques have been extensively investigated, but these techniques have generally not addressed the requirement of distributed multimedia computing. The central issue in multimedia is dealing with real-time. In particular, there is a need for software development techniques that support the specification and verification of real-time properties. In this paper, we propose a new approach to the formal specification and verification of distributed multimedia computing. This new approach is based on the extension of LOTOS to incorporate timing in it. Thus, succinct expressions of communicating concurrent processes can be made. Similarly, the emphasis on non-determinism in process algebraic techniques facilitates abstract specification, hiding implementation details. Furthermore, rich and tractable mathematical models of the semantics of process algebra have been developed. The key characteristic of the new approach lies in the specification of behavior, requirements and different types of time in a specification.","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":"131686835","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}
{"title":"ABR rate-based control scheme with background VBR traffic","authors":"Xiaojing Yuan, B. Soong, Liren Zhang","doi":"10.1109/PACRIM.1999.799491","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799491","url":null,"abstract":"The ABR service is mainly designed for data transmission in the ATM network and ABR congestion control is an active research area. We propose a control algorithm that is simple to implement and it does not require much network resource for its operation. Both the load factor and the change of queue length are incorporated in the control, based upon which traffic is adjusted. In underload, the increase in the source rate depends on the load factor of the ABR. The lower the load factor, the faster the source rate is increased. When the load approaches the target level, the traffic is increased very slowly. Under congestion, the suppression of the source rate is determined by the increasing queue rate. An exponential average is provided as the approximation to the fair share. Simulation shows that the algorithm exhibits fairness and stability.","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":"114153949","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}
{"title":"Computation/communication balance-point modeling in multiprocessors","authors":"V. Hamacher","doi":"10.1109/PACRIM.1999.799497","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799497","url":null,"abstract":"An analytic model for predicting processor utilization in a CC-NUMA (cache coherent non-uniform memory access) shared-memory multiprocessor is developed. The interconnection network in such systems transfers cache line messages between processor caches and memory modules on read and write misses. The major component of the miss penalty, for the case of large systems, is the network delay. Using only a relatively small number of node parameters (cache miss rate, cache line length, number of outstanding transfer requests allowed, memory access time, proportion of Reads to Writes), along with the bandwidth and delay versus throughput characteristics of the network, the analytic model is shown to give good estimates of the processor utilization values derived from an independent detailed simulation study. In particular, for multiprocessor sizes of 72 and 108 nodes, and for variations in the node parameters, the processor utilization values determined by the analytic model are within 10% of the simulation results. Processor utilizations vary from 0.41 to 0.88. The interconnection network involved is a hierarchical slotted-ring system.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"6 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":"117073925","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}
{"title":"Performance of a multicarrier decorrelating multiuser receiver for a DS/CDMA system","authors":"J.Y. Kim, Wan Choi","doi":"10.1109/PACRIM.1999.799590","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799590","url":null,"abstract":"In this paper, a new multiuser detection scheme combining decorrelating detection and multicarrier transmission is proposed and analyzed in a frequency-selective Rayleigh fading channel. The bit error probability and asymptotic multiuser efficiency are derived and compared for the proposed and the conventional decorrelating detector scheme. From the numerical results, it is shown that the proposed scheme achieves better BER performance and lower computational complexity than the conventional decorrelating detector. It is also shown that the proposed scheme is more robust than the conventional scheme when there is partial narrowband interference, and alleviates near-far problem more effectively.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"43 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":"115900345","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}
{"title":"Suppression of ringing artifacts with an adaptive shrinkage algorithm","authors":"N. Law, W. Siu, Degan Feng","doi":"10.1109/PACRIM.1999.799507","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799507","url":null,"abstract":"A non-iterative wavelet-based algorithm was proposed to reduce the ringing artifacts associated with a lossy compressed image. The proposed algorithm is based on the fact that increases in magnitude of the quantized wavelet coefficients lead to decreases in visual smoothness. Thus a shrinkage algorithm is applied to maintain visual smoothness. The proposed algorithm is, however, adaptive in nature, in which the amount of shrinkage depends on edge strength, region activity and compression ratio. Experimental results have confirmed that the adaptive algorithm could suppress the ringing artifacts and improve visual smoothness, especially around edges where ringing is severe.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"43 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":"123088642","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}
{"title":"Capacity and performance of multiple-input multiple-output wireless systems in a cellular context","authors":"S. Catreux, R. Kirlin, P. Driessen","doi":"10.1109/PACRIM.1999.799589","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799589","url":null,"abstract":"The use of multiple element antennas-both transmitting and receiving-has great potential for increasing the capacity of wireless systems. The capacity is derived as a function of the eigenvalues of the channel matrix and computed for an \"edge-excited cell\" with 3 base sites and a subscriber terminal with a 3 element array, for line-of-sight channels. In an attempt to approach this capacity, we use a blind source separation technique at the receiver. We show that the multiple-input multiple-output system, implemented with such innovative signal processing, offers great enhanced capacity compared to conventional single-input single-output (SISO) systems.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"87 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":"124492967","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}
{"title":"Performance driven coefficient optimization for high throughput energy efficient digital matched filter design","authors":"Sangjin Hong, W. Stark","doi":"10.1109/PACRIM.1999.799541","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799541","url":null,"abstract":"A high throughput energy efficient digital matched filter design method for low power communication systems is presented. The filter coefficients are designed to optimize spectral concentration in the transmission bandwidth of the channel with zero intersymbol interference while minimizing the energy dissipation. The optimum matched filter coefficients are searched from the discrete powers-of-two number space and each of the coefficients are restricted to contain at most a finite number of nonzero bits to reduce power dissipation and to increase throughput.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"63 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":"124951932","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}