{"title":"Analysis of carrier sense multiple access with priority acknowledgements (CSMA/PA) on noisy two-way channels with finite user population","authors":"J. Onunga, R. Donaldson","doi":"10.1109/PACRIM.1989.48293","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48293","url":null,"abstract":"Carrier sense multiple access (CSMA) is discussed as an efficient and simple means for decentralized access control to a common communication channel shared by several users. The delay and throughput performance of CSMA with priority acknowledgments (CSMA/PA), a scheme which enables message and acknowledgment packets to share the same communication channel bandwidth effectively, are calculated. The analysis includes the effect of channel errors on both message and acknowledgment packets, user population size and modem detection, and synchronization delay. Excellent agreement is observed between the analytical results and those obtained from measurements on an actual noisy five-node intrabuilding power line LAN operating at transmission rates ranging from 1.2 to 9.6 kb/s.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"59 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":"122081808","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":"Analysis of transport layer and LLC sublayer performance within a local area network","authors":"David Chan, R. Hardy","doi":"10.1109/PACRIM.1989.48346","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48346","url":null,"abstract":"Results are presented on the performance of the transport layer and the logical link control (LLC) sublayer within a local area network. The time delays introduced by each of these layers are calculated, based on the performance of actual implementations of these protocols. The analysis presented seeks to quantify time delays within the context of protocols suitable for use with a high-speed local area network such as the fiber distributed data interface. The results presented verify that the transport and LLC software structures dominate the end-to-end message delays. A network interface implementation is presented which provides a merging of the layered protocols in such a way as to improve the time-critical performance of the network interface, while maintaining a logical mapping of the protocol functions to this new structure.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 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":"114142934","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}
M. Niamat, R. Molyet, M. Jamali, K. Cios, D. Raftopoulos
{"title":"Applications of systolic array architectures to motion analysis studies","authors":"M. Niamat, R. Molyet, M. Jamali, K. Cios, D. Raftopoulos","doi":"10.1109/PACRIM.1989.48306","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48306","url":null,"abstract":"Several types of systolic array architecture with applications in motion analysis studies are presented. These architectures are designed for rapid computation of velocity, acceleration, and jerk. Once the pipeline is full, the values of these parameters are obtained at every clock cycle. For the linear array, (n+1) processing cells are required for computing a derivative of order (n). Nine processing cells are needed for the triangular systolic array for computing position velocity, acceleration, and jerk.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"46 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":"114279248","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 effect of clock and carrier phase drifts on the performance of a direct sequence spread spectrum multiple-access system","authors":"E. Sousa","doi":"10.1109/PACRIM.1989.48319","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48319","url":null,"abstract":"A direct-sequence spread-spectrum multiple-access network is discussed. The probability of symbol error in such a network is dependent on the carrier and spreading code chip phases of the interfering terminals with respect to the signal of interest. As a result, for a given total interference power the performance is worse for the case of one strong interferer when compared to the case of many weak interferers where the Gaussian assumption on the multiple-access interference holds. It is shown that if there is an offset between the carrier and spreading code frequencies of the signals, then the difference in performance between the cases of a set of balanced and a set of unbalanced interferers is drastically reduced.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 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":"129580046","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}
Abraham O. Fapojuwo, D. Irvine-Halliday, W. C. Chan
{"title":"Multipacket message transmission on CSMA-CD LANs using limited and gated strategies","authors":"Abraham O. Fapojuwo, D. Irvine-Halliday, W. C. Chan","doi":"10.1109/PACRIM.1989.48294","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48294","url":null,"abstract":"The limited and gated packet transmission strategies are proposed for transmitting multipacket messages on a random-access local area network. The message response time analysis is performed using primarily Little's (1961) law in conjunction with the embedded Markov chain theory approach and some limiting results from the theory of regenerative processes. Computer simulations conducted to assess the accuracy of the analytical results are reported. The results of a numerical example show that the use of the limited and gated strategies leads to lower message response time compared with that obtained from using the conventional packet transmission strategy.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"40 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":"123115061","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":"C-2C ladder based D/A converters for two metal CMOS process","authors":"S.P. Singh, J. Hanson, J. Vlach","doi":"10.1109/PACRIM.1989.48310","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48310","url":null,"abstract":"Three 8-bit C-2C ladder based D/A converter circuits are presented that utilize interlayer capacitors available in a two-metal CMOS process and need no process modification. The capacitances, being of a similar order, are used to form individual capacitors in the C-2C ladder. This leads to a lower unit capacitor number requirement and a saving of silicon area.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"33 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":"127648823","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":"Motion analysis of a deformable object using subset correspondence","authors":"S. Chaudhuri, S. Chatterjee","doi":"10.1109/PACRIM.1989.48362","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48362","url":null,"abstract":"A method is proposed to estimate generalized three-dimensional motion parameters for a deformable object using only subset correspondences between two successive time frames, eliminating a major preprocessing step. Only a small amount of information has to be processed, reducing the computation time significantly. The movement in three-dimensional space thus can be modeled by the deformation undergone by the object during the specified time instants, a rotation about a fixed axis passing through its centroid, and a translation. The goal is to estimate the generalized motion parameters (i.e. deformation, rotation, and translational components) with as little information (i.e. point/line correspondence) as possible from the data.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"71 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":"128065929","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":"An emulated environment for studying distributed systems","authors":"Kin F Li, Eric Young","doi":"10.1109/PACRIM.1989.48356","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48356","url":null,"abstract":"A distributed testbed for investigating the issues involved in distributed applications, studying different concepts and algorithms in practice, and gaining practical experience in utilizing distributed systems of various configurations is discussed. This testbed environment uses a network of Sun workstations (connected by an Ethernet) to emulate the behavior of distributed systems, with each individual workstation host representing a node. Communication links which implement process-to-process, multicast, and broadcast communications are used for the emulation of various distributed system organizations (e.g. Ethernet, token ring, and multistage interconnection networks). Application examples are given for three typical topologies.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"105 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":"126703610","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":"Totally ordering broadcast (TO) protocol on the Ethernet","authors":"M. Takizawa, A. Nakamura","doi":"10.1109/PACRIM.1989.48295","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48295","url":null,"abstract":"The design of reliable broadcast communication systems is presented. These systems provide, on an unreliable broadcast service such as the Ethernet, a totally ordering broadcast service where every entity receives all messages in the same order. In order to provide such a reliable broadcast communication among multiple entities on the unreliable broadcast service, a data transmission procedure is proposed whose execution is controlled by all entities in a distributed scheme. Also, the correctness of the protocol is shown. The protocols can be useful in designing and implementing distributed systems such as distributed database systems and distributed operating systems.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"74 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":"129266968","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":"Underwater acoustics positioning using surface multipath","authors":"A. Zielinski, L. Wu","doi":"10.1109/PACRIM.1989.48424","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48424","url":null,"abstract":"A new acoustic navigation method is proposed which utilizes surface reflected signals for position fixing. In this method, precise angular measurements of arrival angles of direct path and multipath signals are performed and used to find the relative position of the source. Reflection from a rough surface is considered, and the effect on nonspecular scattering is discussed. The main advantage of this approach is that the acoustic source can be a free running pinger rather than a transponder. This reduces the system's complexity and cost. Furthermore, the bandwidth of the system can be considerably reduced, and therefore its range can be increased.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"3 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":"127754227","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}