{"title":"Trellis-coded DPSK for mobile fading channels","authors":"Y. Wu, P. Ho","doi":"10.1109/PACRIM.1989.48386","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48386","url":null,"abstract":"The error performances of the trellis-coded 8DPSK signals in Rayleigh fading channels are presented. The interrelationships between the bit error rate, the fade rate, the interleaving depth, and the decision depth of the decoder are examined. It is found that for fade rates between 0.01 and 0.03, one can safely choose an interleaving depth of 20 symbols and an interleaving span of 10 symbols to achieve about 10-dB fade margin at a 10/sup -3/ bit error rate. It is also found that the differential detection of PSK breaks down for fade rates greater than or equal to 0.06, due to the severe differential phase jitter introduced by the fading process.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392294","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}
C. Collet, N. Fumai, M. Petroni, S. Malowany, J. Panisset, A. Malowany, F. Carnevale, R. Gottesman, A. Rousseau
{"title":"A patient data management system for an intensive care unit","authors":"C. Collet, N. Fumai, M. Petroni, S. Malowany, J. Panisset, A. Malowany, F. Carnevale, R. Gottesman, A. Rousseau","doi":"10.1109/PACRIM.1989.48434","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48434","url":null,"abstract":"A patient data management system (PDMS) based on a local area network linking fourteen bedside instrument monitors to a personal computer is presented. The PDMS acquires real-time data and graphically displays their trends using interactive menus. Fluid balance data, medical dosage calculations based on the patient data, and medical observations are also managed by the PDMS. It provides this information for online use by the medical personnel, produces the special forms and summary reports, and archives this data for storage and retrieval. The PDMS is designed and developed for an IBM PS/2 running under the OS/2 multitasking operating system and equipped with an 8514/A high-resolution color video display. The design of the PDMS is described here, with added emphasis on its software structure. Sample results are presented.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122789517","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 generalized algorithm for the recursive implementation of polynomial filters","authors":"P. Agathoklis, H. Xu","doi":"10.1109/PACRIM.1989.48333","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48333","url":null,"abstract":"A generalized recursive algorithm is developed for nth-order polynomial filters. The parameters of the filter are determined by applying a weighted least-squares performance index, and thus the stability of the polynomial filter is guaranteed. The implementations of the nonrecursive and the recursive polynomial filters are obtained, and the performances of both filters are compared.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115823582","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":"Object recognition using fast adaptive Hough transform","authors":"D. Haule, A. Malowany","doi":"10.1109/PACRIM.1989.48313","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48313","url":null,"abstract":"A fast adaptive Hough transform (FAHT) approach is developed for detecting shapes which can be characterized by two parameters. This class of shapes includes both linear and circular image features. The method is based on identifying linear and circular segments in images by searching for clusters of evidence in two-dimensional parameter spaces. The FAHT differs from HT in the degree of freedom allowed in the placement and choice of shape of the window which defines the range of parameters under study at each resolution. This method is superior to that of HT implementation in both storage and computational requirements. The ideas of the FAHT are illustrated by tackling the problem of identifying linear segments in images by searching for clusters of evidence in two-dimensional parameter spaces. It is shown that the method is robust to the addition of extraneous noise and can be used to analyze complex images containing more than one shape.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132561782","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 performance study of a user access strategy for ISDN","authors":"M. Ali, M. Comeau","doi":"10.1109/PACRIM.1989.48409","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48409","url":null,"abstract":"An ISDN user access strategy for wideband and narrowband traffic is studied. Wideband traffic is assumed to be blocked, while narrowband traffic is allowed to queue up. Each user may require a random number of bandwidth units (slots). The exact blocking probability for the wideband users is given, while an approximate solution is given for the message delay of narrowband users. This latter solution is based on an extension of the product-form solution for the queuing network models of J.S. Kaufman (1981) and S.S. Lam (1977).<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131108332","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":"On a statistical space-time modulation theory","authors":"Y. V. Lo","doi":"10.1109/PACRIM.1989.48432","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48432","url":null,"abstract":"To characterize the space-time system, a number of theorems related to optimal space-time information processing, transmission, and storage are introduced. These theorems summarize various properties of the space-time system including space-time sampling, signal classification, and channel capacity optimization. The results generalize the communication theory of Gabor (1946), Shannon (1948), and Nyquist (1928). Test verifications and applications of the space-time modulation theory are discussed.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126241395","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":"On the performance of the MLE of adaptive array weights: a comparison","authors":"Shen-De Lin","doi":"10.1109/PACRIM.1989.48397","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48397","url":null,"abstract":"The maximum-likelihood (ML) adaptive weight vector is derived, and its performance is compared with those of the sample matrix inversion (SMI) method and the least-mean-square (LMS) algorithm. The ML adaptive weight vector and the SMI method achieve identical convergence rates for the average SNR. With the desired signal absent, they are superior to the LMS algorithm. However, when the desired signal is present and the optimum SNR which depends on the received SNR is large, they lose their superiority. For the average MSE performance, the convergence of the ML adaptive weights is the fastest when the optimum SNR is high enough. With a small optimum SNR, the SMI method performs better than the other algorithms.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114763147","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 real-time interpreter for the programming and control of a robotic workcell","authors":"G. Carayannis, A. Malowany","doi":"10.1109/PACRIM.1989.48352","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48352","url":null,"abstract":"A framework for programming multielement robotic workcells has been proposed, developed, and implemented as a two-part solution (SAGE/WRAP). SAGE generates a time-optional sequence of operations for each workcell element which then becomes the basis of the runtime program that performs the application. This program is interpreted and executed by the hierarchical workcell runtime environment WRAP. The WRAP interpreter, which interprets a workcell program and coordinates its execution, is discussed. The architecture and the algorithm implemented by the interpreter are emphasized.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124066211","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":"Acoustic test bed for underwater communications: system modeling and performance","authors":"E. Lo, R. Hardy, C. Anderson, J. Bird","doi":"10.1109/PACRIM.1989.48423","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48423","url":null,"abstract":"The network model and the calculated and measured performance results for an instrumentation system for underwater acoustic measurements are discussed. This instrumentation network is part of an acoustic test bed or an experimental acoustic system intended to support an investigation of the characteristics of underwater acoustic wave propagation. The local area network is required to transfer data, generated in real-time by the instrumentation system, within time deadlines imposed by the nature of the input data and by the size of the intermediate data buffers. Details of the network model, calculated performance results, and preliminary measured performance data are presented using network traffic applicable to this underwater instrumentation application.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121831187","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 an order statistic based diversity combining frequency-hopping BFSK system in a partial-band jamming environment","authors":"S. March, J. Ritcey","doi":"10.1109/PACRIM.1989.48316","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48316","url":null,"abstract":"An order-statistic-based combining technique is evaluated for fast frequency hopping spread spectrum receivers operating in the presence of partial-band noise jamming. The method replaces the linear combining receiver with an outlier-resistant estimator based on order statistics. It is applicable to noncoherent frequency shift keying modulation, at the expense of sorting and linear combining in each of the channels. Two different receiver designs are examined, one has separate pseudorandom (PN) codes for each of the channels, while the other receiver structure uses a single PN code leading to a contiguous jamming environment. The performances of both the linear combining and order-statistic-based receivers, including thermal noise, are evaluated and compared when operating in either a contiguous or independent partial-band jamming environment. The probability of a bit error is evaluated for both a selection of a single order statistic and a linear combination of the sum of the 1/sub st/ to K/sub th/ smallest from a sample of L hops/b. A diversity combining gain is realized, and a practical algorithm is advocated which sums all but the largest of the received hops.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117019885","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}