Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.254906
E. Dalle Mese, S. Giordano, F. Berizzi, A. Pinizzotto, R. Pinto
SCPC-DAMA VSAT networks (single channel per carrier-demand assignment multiple access very small aperture terminal) are usually adopted where many small remote stations are present, each with a low traffic intensity. This represents the typical scenario of a developing country, from which the alternative expression of 'rural satellite networks'. The authors started by building a simulation model of the communication system. The design of signalling management protocol (SMP), which is the strategy used by the remote station for signalling management and scheduling, is very important in order to improve the network performance. Three different SMPs are proposed and compared by means of simulation results. A second important aspect in the network design is to minimize the communication resources without modifying global performance. To this end they have defined a method which allows a suitable sizing of the modem number per station. An analysis of the network behaviour under standard and overload traffic conditions is presented and discussed.<>
{"title":"Design analysis of a satellite SCPC-DAMA VSAT network","authors":"E. Dalle Mese, S. Giordano, F. Berizzi, A. Pinizzotto, R. Pinto","doi":"10.1109/ICCS.1992.254906","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254906","url":null,"abstract":"SCPC-DAMA VSAT networks (single channel per carrier-demand assignment multiple access very small aperture terminal) are usually adopted where many small remote stations are present, each with a low traffic intensity. This represents the typical scenario of a developing country, from which the alternative expression of 'rural satellite networks'. The authors started by building a simulation model of the communication system. The design of signalling management protocol (SMP), which is the strategy used by the remote station for signalling management and scheduling, is very important in order to improve the network performance. Three different SMPs are proposed and compared by means of simulation results. A second important aspect in the network design is to minimize the communication resources without modifying global performance. To this end they have defined a method which allows a suitable sizing of the modem number per station. An analysis of the network behaviour under standard and overload traffic conditions is presented and discussed.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599887","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255066
S. Uehara, K. Imamura
The weighted distribution of an m-sequence is defined and some partial correlation properties are proved.<>
定义了m序列的加权分布，并证明了其部分相关性质。
{"title":"Some properties of the partial correlation of M-sequences","authors":"S. Uehara, K. Imamura","doi":"10.1109/ICCS.1992.255066","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255066","url":null,"abstract":"The weighted distribution of an m-sequence is defined and some partial correlation properties are proved.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876234","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255075
K. Takahashi, S. Mori
The normalized signed regressor algorithm is the NLMS algorithm based on clipping of the input samples which are elements of the input data vector. In the new algorithm, a clipped sample is used to update coefficients when the absolute value of the sample is larger than the average of the absolute values of the input samples. Analysis shows that the proposed algorithm has better convergence characteristics than the conventional normalized signed regressor algorithm.<>
{"title":"A new normalized signed regressor LMS algorithm","authors":"K. Takahashi, S. Mori","doi":"10.1109/ICCS.1992.255075","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255075","url":null,"abstract":"The normalized signed regressor algorithm is the NLMS algorithm based on clipping of the input samples which are elements of the input data vector. In the new algorithm, a clipped sample is used to update coefficients when the absolute value of the sample is larger than the average of the absolute values of the input samples. Analysis shows that the proposed algorithm has better convergence characteristics than the conventional normalized signed regressor algorithm.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"17 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120877014","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255191
Yuan-Xing Li
The author shows the new proof of Blahut's theorem (1979, 1983) by use of the Z-transformation. By applying the finite field DFT and Blahut's theorem, they present two theorems which can be used to solve the lower bound on the minimum distance of Goppa codes. Given the generator matrix G or the parity check matrix H of a Goppa code, it is very convenient to get the lower bounds on the minimum distance of the Goppa code by use of these theorems. These lower bounds are more effective than the known lower bound of Mac Williams (1977), sometimes it is not as effective as the lower bound given by Loeloeian and Conan (1987), however using these theorems to solve the lower bound is much simpler than using the L-C bound. Some examples are illustrated employing the two theorems, the known bound and the L-C bound, respectively.<>
{"title":"The new theorems of solving lower bound on the minimum distance of Goppa codes","authors":"Yuan-Xing Li","doi":"10.1109/ICCS.1992.255191","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255191","url":null,"abstract":"The author shows the new proof of Blahut's theorem (1979, 1983) by use of the Z-transformation. By applying the finite field DFT and Blahut's theorem, they present two theorems which can be used to solve the lower bound on the minimum distance of Goppa codes. Given the generator matrix G or the parity check matrix H of a Goppa code, it is very convenient to get the lower bounds on the minimum distance of the Goppa code by use of these theorems. These lower bounds are more effective than the known lower bound of Mac Williams (1977), sometimes it is not as effective as the lower bound given by Loeloeian and Conan (1987), however using these theorems to solve the lower bound is much simpler than using the L-C bound. Some examples are illustrated employing the two theorems, the known bound and the L-C bound, respectively.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125162391","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255001
T. P. Choo, K.H. Li, V. Dubey
The paper looks into the performance of a trellis coded spread spectrum multiple access (SSMA) system. Performance in an additive white Gaussian noise channel is investigated with K users transmitting simultaneously. Degradation in the system performance due to interuser interference is modelled using the method of moments, since normal bounding techniques cannot be used. Results are given for four and eight state, rate /sup 1///sub 2/ trellis codes in conjunction with 4-PSK constellations. The paper also addresses some problems encountered and simplifications in the use of the method of moments.<>
{"title":"Performance of a trellis coded SSMA system","authors":"T. P. Choo, K.H. Li, V. Dubey","doi":"10.1109/ICCS.1992.255001","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255001","url":null,"abstract":"The paper looks into the performance of a trellis coded spread spectrum multiple access (SSMA) system. Performance in an additive white Gaussian noise channel is investigated with K users transmitting simultaneously. Degradation in the system performance due to interuser interference is modelled using the method of moments, since normal bounding techniques cannot be used. Results are given for four and eight state, rate /sup 1///sub 2/ trellis codes in conjunction with 4-PSK constellations. The paper also addresses some problems encountered and simplifications in the use of the method of moments.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125535085","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255123
Moon-sik Kang, Kee-Hyun Park, Sangbae Lee
A cyclic distributed queue ring (CDQR) is proposed for high-speed communication based on ATM (asynchronous transfer mode), DQ (distributed queue) scheme, and is capable of achieving multimedia communication capabilities, supporting integrated access mechanism. Also there is a special access control station (ACS) to set parameters and monitor network operating states. The proposed protocol is verified with the analytic analysis and computer simulation, comparing with the other schemes. CDQR protocol is appropriate for the high-speed communication using dual ring topology, destination release, and cyclic control scheme.<>
{"title":"A new network protocol: CDQR protocol for high-speed communication","authors":"Moon-sik Kang, Kee-Hyun Park, Sangbae Lee","doi":"10.1109/ICCS.1992.255123","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255123","url":null,"abstract":"A cyclic distributed queue ring (CDQR) is proposed for high-speed communication based on ATM (asynchronous transfer mode), DQ (distributed queue) scheme, and is capable of achieving multimedia communication capabilities, supporting integrated access mechanism. Also there is a special access control station (ACS) to set parameters and monitor network operating states. The proposed protocol is verified with the analytic analysis and computer simulation, comparing with the other schemes. CDQR protocol is appropriate for the high-speed communication using dual ring topology, destination release, and cyclic control scheme.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883073","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.254949
C. C. Sim, W. Wong, K. Ong
The authors describe a parallel processor architecture for real-time digital image processing. The processors used are the AT&T WE DSP16A digital signal processors. The system designed consists of multiple DSP16As, and is constructed to perform computations in parallel. The completed hardware system has five DSP16As, and it is expandable to eight. The system uses a customized frame-grabber for image acquisition and display. It is specially tailored to suit the design of the multiple DSP hardware system. The system uses an IBM PC/AT, or compatible as the host. There are two communication paths between the system and the PC. The first uses memory mapped I/O for downloading DSP programs from the PC, and the other for full duplex data and command communication between the DSP and PC during run time.<>
作者描述了一种用于实时数字图像处理的并行处理器体系结构。使用的处理器是AT&T WE DSP16A数字信号处理器。该系统由多个dsp16a组成，用于并行计算。完整的硬件系统有5个dsp16a，可扩展到8个。该系统使用定制的帧采集器进行图像采集和显示。它是专门为适应多DSP硬件系统的设计而设计的。系统采用IBM PC/AT或兼容的主机作为主机。系统与PC机之间有两条通信路径。第一个使用内存映射I/O从PC机下载DSP程序，另一个在运行时DSP和PC机之间进行全双工数据和命令通信
{"title":"A parallel processor architecture for real-time digital image processing","authors":"C. C. Sim, W. Wong, K. Ong","doi":"10.1109/ICCS.1992.254949","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254949","url":null,"abstract":"The authors describe a parallel processor architecture for real-time digital image processing. The processors used are the AT&T WE DSP16A digital signal processors. The system designed consists of multiple DSP16As, and is constructed to perform computations in parallel. The completed hardware system has five DSP16As, and it is expandable to eight. The system uses a customized frame-grabber for image acquisition and display. It is specially tailored to suit the design of the multiple DSP hardware system. The system uses an IBM PC/AT, or compatible as the host. There are two communication paths between the system and the PC. The first uses memory mapped I/O for downloading DSP programs from the PC, and the other for full duplex data and command communication between the DSP and PC during run time.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115259462","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255076
S. Drakul, G. M. Drakul
The performance of 16QAM and 16CMSK (Convolved-MSK) is described. Computer simulation results show the superiority of the 16CMSK scheme over nonlinear channels.<>
{"title":"Analysis of error performance of two modulation schemes in Rayleigh fading channel","authors":"S. Drakul, G. M. Drakul","doi":"10.1109/ICCS.1992.255076","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255076","url":null,"abstract":"The performance of 16QAM and 16CMSK (Convolved-MSK) is described. Computer simulation results show the superiority of the 16CMSK scheme over nonlinear channels.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115463020","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.254972
F. Callegati, C. Raffaelli
An ATM multiplexer with different classes of bursty sources is considered for evaluation of the effects of bursty traffic variations on its performance. A discrete-time Markov chain model is developed to obtain cell loss probability both for the whole set of sources and for each class. Calculations carried out for the particular case of two classes, with a first class behaving as declared at call set up and a second class violating that reference situation by variation of some of the bursty traffic parameters. The results show that the most dangerous violation is represented by burst length increase, which will play a key role for the definition of congestion avoidance strategies.<>
{"title":"Performance analysis of an ATM multiplexer with different classes of bursty sources","authors":"F. Callegati, C. Raffaelli","doi":"10.1109/ICCS.1992.254972","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254972","url":null,"abstract":"An ATM multiplexer with different classes of bursty sources is considered for evaluation of the effects of bursty traffic variations on its performance. A discrete-time Markov chain model is developed to obtain cell loss probability both for the whole set of sources and for each class. Calculations carried out for the particular case of two classes, with a first class behaving as declared at call set up and a second class violating that reference situation by variation of some of the bursty traffic parameters. The results show that the most dangerous violation is represented by burst length increase, which will play a key role for the definition of congestion avoidance strategies.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122417962","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}
Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.255100
A. Chung
Mastery learning requires a student to master the basic concepts of one particular topic before proceeding to the next. This paper reports the advantages, design and implementation of a computer-assisted testing system. Its major components and the method of question classification are described in detail.<>
{"title":"Computer-assisted testing of mastery knowledge with Chinese characters","authors":"A. Chung","doi":"10.1109/ICCS.1992.255100","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255100","url":null,"abstract":"Mastery learning requires a student to master the basic concepts of one particular topic before proceeding to the next. This paper reports the advantages, design and implementation of a computer-assisted testing system. Its major components and the method of question classification are described in detail.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122939839","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：