{"title":"New algorithms and technology for analyzing gestural data","authors":"W. A. Schloss, P. Driessen","doi":"10.1109/PACRIM.2001.953517","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953517","url":null,"abstract":"We describe the ways in which we are analyzing gestural data as if they were an audio signal, and applying this technique to the radio drum, a novel three-dimensional controller that one of the authors uses regularly for concert performances. The radio drum uses capacitive sensing; a radiofrequency voltage source is conducted from the performer's mallets or sticks, and is received on the drum surface beneath. The two sticks are differentiated by using different frequencies for each one. Signals from each stick represent typical gestures. The signal processing includes two key steps. The first step is to capture all of the subtle motions associated with these gestures, so that the instrument responds in a sensitive manner to the performer's expressive technique. We seek to capture details of the entire motion represented by the x,y,z signals versus time, not just the velocity of a strike. The second step is to map the gesture signal to control musical events. This mapping can take many forms, depending on the creative ideas of the composer and/or performer.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125423833","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":"Modular architecture for statistical signal parameter measurement using multi-bit random-data representation","authors":"E. Petriu, A. Al-Dhaher, L. Zhao, M. Dostaler","doi":"10.1109/PACRIM.2001.953581","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953581","url":null,"abstract":"Generalizing von Neumans binary random-pulse machine concept, the paper discusses the multi-bit random-data representation and shows how it can be used for a modular instrumentation architecture for the measurement of first and second order statistical signal parameter measurements.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795645","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 polynomial algorithm for knowledge base revision","authors":"X. Tao, C. Miao, Z. Q. Shen, Yuan Miao, Q. Miao","doi":"10.1109/PACRIM.2001.953733","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953733","url":null,"abstract":"Propositional knowledge base revision in intractable in the general case. This paper proposes an algorithm for proportional knowledge base revision. It is shown that the computational complexity is connected with the relationship between the number of formulas and the number of variables. A sufficient condition is provided to guarantee the algorithm is polynomial.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117289088","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":"Diversity combining for MT-CDMA signals in a fading channel","authors":"Q. Rahman, A. Sesay","doi":"10.1109/PACRIM.2001.953542","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953542","url":null,"abstract":"A multi-tone code division multiple access (MT-CDMA) system with post-detection diversity combining is analyzed. The analysis is presented in terms of average bit error rate (BER). The modulator uses differential quadrature phase shift keying (DQPSK) signaling over a slowly Rician fading and frequency selective channel in the indoor environment. Here, the influence of the order of diversity and number of tones is studied for given bandwidth (BW), bit rate and transmitter power. The paper also compares the BER performance between differential binary phase shift keying (DBPSK) and DQPSK based MT-CDMA systems.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129499437","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":"Modeling online instruction knowledge using Petri nets","authors":"F. Lin","doi":"10.1109/PACRIM.2001.953560","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953560","url":null,"abstract":"This paper presents an approach to modeling online instruction knowledge for developing online training systems. To overcome the difficulty in online instruction knowledge acquisition and verification, we use Petri nets theory as a tool for specifying and verifying varied training plans and corresponding training scenarios whereby the online instruction knowledge is derived. An experimental example, the virtual reality based computerized numeric control (CNC) operations training system, shows that Petri nets based training tasks and training scenarios analysis can facilitate creating a knowledge base of online training systems.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128648875","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 real-time scheduling algorithm for continuous media tasks","authors":"M. Yoo, B. Ahn, D. Lee, H.C. Kim","doi":"10.1109/PACRIM.2001.953658","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953658","url":null,"abstract":"Real time scheduling is one of important research areas, since there is great interest in multimedia services using Internet. This paper proposes a modified proportional share scheduling algorithm considering the characteristics of continuous media such as their continuity and time dependency. The proposed scheduling algorithm shows graceful degradation of performance in overloaded condition and decreases the number of context switching. The proposed algorithm is evaluated using several numerical simulations under various conditions. The results show that the number of context switching is decreased to 8% and the variation of the loss rate is reduced to 70% compared with the rate regulating proportional share algorithm under the overloaded condition.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126922828","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}
S. Park, N. Cho, Sang Uk Lee, Kichul Kim, Jisung Oh
{"title":"Design of 2K/4K/8K-point FFT processor based on CORDIC algorithm in OFDM receiver","authors":"S. Park, N. Cho, Sang Uk Lee, Kichul Kim, Jisung Oh","doi":"10.1109/PACRIM.2001.953668","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953668","url":null,"abstract":"The architecture and the implementation of a 2K/4K/8K-point complex fast Fourier transform (FFT) processor for an OFDM system are presented. The processor can perform 8K-point FFT every 273 /spl mu/s, and 2K-point every 68.26 /spl mu/s at 30 MHz which is enough for the OFDM symbol rate. The architecture is based on the Cooley-Tukey (1965) algorithm for decomposing the long DFT into short length multi-dimensional DFTs. The transposition and shuffle memories are used for the implementation of multi-dimensional transforms. The CORDIC processor is employed for the twiddle factor multiplications in each dimension. A new twiddle factor generation method is also proposed for saving the size of ROM required for storing the twiddle factors.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121167012","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":"The design of a lossless discrete integrator digital filter with low complexity coefficients","authors":"T. W. Fox, L. Turner","doi":"10.1109/PACRIM.2001.953696","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953696","url":null,"abstract":"A method for the design of a lossless discrete integrator (LDI) digital filter with low complexity finite precision coefficients (FPC) based on a discrete constrained optimization formulation and constrained simulated annealing (CSA) is presented. Simple quantization of floating point precision coefficients and other unconstrained optimization methods cannot precisely control the number of required coefficient adders and subtractors. It is shown that it is possible to control the coefficient complexity (the number of coefficient adders and subtractors) while still meeting the passband ripple specifications and achieving a small stopband ripple. Extremely low coefficient complexity filters can be achieved at the expense of a larger stopband ripple.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122268321","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 study on multiuser DSL channel capacity with crosstalk environment","authors":"L. Chu, M. Brooke","doi":"10.1109/PACRIM.2001.953551","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953551","url":null,"abstract":"This paper describes a new approach to enhance digital subscriber line (DSL) (emphasizing DMT-ADSL) throughput with multiuser channel model. We have studied the spectral distribution of DSL interference and the capacity of a twisted pair channel. The current single user DSL approach ignores the structure of the crosstalk interference and the underlying sources of the crosstalk environment. Our study has shown a significant improvement on multiuser DSL channel capacity, while treating the crosstalk as the sum of filtered coupling of other DSL signals onto the desired DSL receiver. With this the DSL deployment restrictions may be relaxed and the DSL services can also extend the loop reach and/or increase the throughput at any given loop length. This study also has the potential implication and benefit for DSL spectral management.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354641","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":"Microcalcification detection using wavelet transform","authors":"D. Gunawan","doi":"10.1109/PACRIM.2001.953727","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953727","url":null,"abstract":"This paper presents a new method for detection of microcalcification using wavelet transform based on statistical methods. Digitized mammograms are decomposed using the wavelet transform without down sampling process at several levels in the transform space. In order to improve the contrast enhancement of images, the multiscale adaptive gain as an enhancement method was applied. Skewness, kurtosis and boxplot outlier were applied as detection method of the previous modification image with a specific size of region of interest. We have simulated this algorithm by using 30 variations of images as part of 18 digitized mammograms. Preliminary results show visually that applied detecting method has 96% in an effectiveness level.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032054","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}