D. Rodohan, S. Saunders, S. Cvetkovic, P. Beavis, R. Glover
{"title":"Parallel simulation of electromagnetic fields for telecommunication applications","authors":"D. Rodohan, S. Saunders, S. Cvetkovic, P. Beavis, R. Glover","doi":"10.1109/ICCS.1994.474215","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474215","url":null,"abstract":"The finite difference time domain (FDTD) algorithm has become a popular-technique with which to solve many different electromagnetic problems. However, for real problems the mesh size becomes large and as a result the computation time on a workstation is in the region of tens of hours. In fact, in some cases there will be insufficient memory available on a workstation to solve large problems. We describe a general method based on distributed computing to reduce both the memory requirements and the computation time of the FDTD algorithm. An implementation of the FDTD algorithm on a network of workstations is then evaluated. The implementation is shown to give a peak speed up of 7.5 on a network of 8 workstations over the sequential computation time.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114387861","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":"Wideband signal estimation using Karhunen-Loeve filters","authors":"D. Mohd.","doi":"10.1109/ICCS.1994.474075","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474075","url":null,"abstract":"Karhunen-Loeve (K-L) transform is known as an optimum transform in the mean square sense and it has been used in many areas such as in signal and image processing applications. In this paper, the K-L transform is used in the design of Wiener filters for wideband signal estimation. These filters are formulated based on nonlinear smoothing algorithms which produce circulant, Toeplitz and diagonal impulse response matrices. The performance of these filters is investigated based on the mean-squared-error (MSE) and percent distortion. Computer simulations show that the filters perform well in estimating the signal embedded in white noise.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116692739","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 analysis of modulation codes for fiber optic network","authors":"Y. Su, Z. Li, Y. Xin","doi":"10.1109/ICCS.1994.474086","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474086","url":null,"abstract":"Five kinds of modulation code for fiber optic network are analyzed. They are bilevel Manchester, trilevel Manchester, pulse position modulation (PPM) Manchester, pulse frequency keying (PFK) and the partial trilevel Manchester code. The modified Personick (1973) formulas for the special cases are derived. With these formulas we calculate the sensitivities of optical receiver with configurations of PIN-FET, PIN-BJT, APD-FET and APD-BJT. Other practical characteristics are also analyzed. Although each modulation code has its advantages and disadvantages, PPM, bilevel Manchester and PFK are better modulation codes for fiber optic networks.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606435","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.B. Zhang, T. Yeo, P. Kooi, Y.H. Lu, L.P. Deng, C. Tsao
{"title":"SAR real time motion compensation: average cancellation method for aircraft","authors":"C.B. Zhang, T. Yeo, P. Kooi, Y.H. Lu, L.P. Deng, C. Tsao","doi":"10.1109/ICCS.1994.474113","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474113","url":null,"abstract":"Effective motion compensation is the key for achieving high quality SAR images. A frequency domain method which is based on an analysis of the azimuth spectrum of SAR raw data to extract aircraft's motion-error, has the advantage of having the ability to operate without accelerometer and INS. However, an antenna with a wide azimuth beam is required. Furthermore,its accuracy depends heavily on the contrast of the ground reflectivity function. A new method based on the time domain approach is presented. Compared with the existing method, the new approach not only has all the mentioned features, but also the advantages of low computation requirement as well as the wide-band motion-error extraction capability. Furthermore, it relaxes some requirements on azimuth antenna beamwidth as well as the ground reflectivity function contrast.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114658172","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":"Multicasting the ITU MCS: integrating point-to-point and multicast transport","authors":"J. Ott, C. Borgmann","doi":"10.1109/ICCS.1994.474250","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474250","url":null,"abstract":"Many designs for multicast transport protocols presume a homogeneous view of the network environment they are operating in, the latter hiding the various networks' features from the transport layer. However, knowing its underlying network characteristics enables a multicast transport protocol to adjust itself to particular networks. This can be important for providing a scalable, reliable multicast transport. A multicast group often is faced with different topologies (point-to-point links vs. broadcast capable networks) and different network service qualities (e.g. packet loss probability, throughput, and delay). For some parts of the group, network connectivity allows multicasting and the usage of negative acknowledgment schemes, for others, point-to-point connections with positive ACKs are required. Trying to unite both service types within a single type of transport is inefficient and often not possible at all. We present a hybrid approach to a multicast transport that extends a standardized multicast service based on point-to-point connections to be efficiently applicable in multicast capable networks as well. A typical teleconferencing scenario we have in mind consists of several sites, interconnected via WANs, each of which may involve several participants via LANs.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114976898","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 a credit manager for traffic regulation in a high speed network system with finite buffer","authors":"Ming-Shan Kwok, R. Yeung","doi":"10.1109/ICCS.1994.474252","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474252","url":null,"abstract":"We investigate a high speed network system with finite buffer subject to flow control by a credit manager. The main purpose of the credit manager is to smooth out the burstiness of the input process, thereby making it easier for the network to handle large amount of data without undue delays, congestion or buffer overflow. We model the system as a quasi-birth-death (QBD) process for which the steady state distribution is obtained by using the folding algorithm. From the steady state distribution of the QBD process, we determine the queue length distribution and the average sojourn time of the packets. The characteristics of such system are investigated and the optimum buffer size can be obtained in the analysis.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131844918","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":"Enhancement of sinusoidal waveform by forward and backward difference function","authors":"N. Kunieda, T. Shimamura, J. Suzuki","doi":"10.1109/ICCS.1994.474078","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474078","url":null,"abstract":"This paper proposes a new function \"forward and backward difference function\" to enhance a single sinusoidal waveform corrupted by noise. Improvements in SNR are evaluated for sinusoidal waveform embedded in white noise, and the effects of this function is greater than that of the correlation function.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132230270","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":"Comparison of correlation parameters of binary codes for DS/CDMA systems","authors":"T. Lang, Xiao-hua Chen","doi":"10.1109/ICCS.1994.474316","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474316","url":null,"abstract":"In this paper, a comprehensive study is carried out to analyze different spreading codes for a DS/CDMA system, and an objective way is presented to measure the performance of different codes based on various correlation parameters such as aperiodic, even, odd, maximal, mean and square-sum cross-correlations. The codes concerned in this paper include m-sequence, Gold, Kasami, GMW, No and Walsh codes with length from 31 to 2047.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134471610","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":"Communication processing techniques for multimedia systems","authors":"M. Maruyama, O. Nakano, K. Nishimura, H. Nakano","doi":"10.1109/ICCS.1994.474258","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474258","url":null,"abstract":"Key techniques required for communication processing in multimedia systems are (1) high-speed protocol processing of every data packet and (2) simultaneously processing of many sessions. This paper proposes three solutions of high-performance protocol processing: protocol data unit management using page management method, assembling and disassembling of header and contents in hardware, and rescheduling of protocol processing. The feasibility of these techniques have been experimentally verified applying these to the transmission control protocol/internet protocol (TCP/IP) over an fiber-distributed data interface (FDDI) network. As a result, the maximum throughput of 78 Mbps is obtained. The total communication throughput of 64 sessions is 75.6 Mbps, only 3% less than the maximum throughput.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134183280","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 evaluation of a software architecture for real-time call processing","authors":"T. Hou","doi":"10.1109/ICCS.1994.474285","DOIUrl":"https://doi.org/10.1109/ICCS.1994.474285","url":null,"abstract":"Computers running under the UNIX operating system are used as adjunct processors to a switch to share call-processing responsibilities. In this architecture, call-processing tasks inside the adjunct processors are embedded in UNIX user processes. The author built a discrete-event driven, C-based, UNIX simulation model at a level of detail that allows one to obtain the statistics of many system task overheads. The model can give an accurate estimate of the system capacity by providing the breakdown of CPU time spent in context switches, I/O, IPC system calls, and user processes. In addition, the author found that the system can be trapped in a deadlock or \"livelock\" situation if not properly controlled. Causes and solutions to the deadlock/livelock condition were investigated.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132996147","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}