Pub Date : 1992-11-16DOI: 10.1109/ICCS.1992.254977
E. Gunawan, P. Tan, Nansi Shi
Computer networks are large and complex systems. The use of natural language to design and analyse communications protocols will lead to ambiguous representations. This inadequacy of the natural language gives rise to the many recent research works on formal description techniques (FDTs). FDTs are methods to define the behaviour of an information processing system in a language with formal syntax and semantics. FDT has been chosen as a basis for the design of protocol converter. A survey of existing widely accepted FDTs is presented. From this survey, a selection is made for an appropriate FDT to be used as the basis for future research work on FDT-based protocol converter.<>
{"title":"Selection of a formal description technique (FDT) for a FDT based protocol converter","authors":"E. Gunawan, P. Tan, Nansi Shi","doi":"10.1109/ICCS.1992.254977","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254977","url":null,"abstract":"Computer networks are large and complex systems. The use of natural language to design and analyse communications protocols will lead to ambiguous representations. This inadequacy of the natural language gives rise to the many recent research works on formal description techniques (FDTs). FDTs are methods to define the behaviour of an information processing system in a language with formal syntax and semantics. FDT has been chosen as a basis for the design of protocol converter. A survey of existing widely accepted FDTs is presented. From this survey, a selection is made for an appropriate FDT to be used as the basis for future research work on FDT-based protocol converter.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"44 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":"116692118","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.255124
R. Macario, M. Dababneh
Certain radio mobile communication systems have better spectrum efficiency performance than others. If these good systems can be identified then it would be easier to choose the system with the highest capacity. An extensive literature survey has yielded a sparsity of work addressing this issue. The paper aims at developing a model in support of this hypothesis, using simple mathematical procedures and the factors that affect spectrum utilization discussed. It is confirmed that maximum spectrum efficiency is achieved by adopting low transmission rates, small zone layout, an efficient access method, moderately large frame size (N/sub f/>1) and FEC at a certain coding rate (K). This model is also used to estimate the overall system capacity.<>
{"title":"A model to study spectrum efficiency of narrow band TDMA cellular radio","authors":"R. Macario, M. Dababneh","doi":"10.1109/ICCS.1992.255124","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255124","url":null,"abstract":"Certain radio mobile communication systems have better spectrum efficiency performance than others. If these good systems can be identified then it would be easier to choose the system with the highest capacity. An extensive literature survey has yielded a sparsity of work addressing this issue. The paper aims at developing a model in support of this hypothesis, using simple mathematical procedures and the factors that affect spectrum utilization discussed. It is confirmed that maximum spectrum efficiency is achieved by adopting low transmission rates, small zone layout, an efficient access method, moderately large frame size (N/sub f/>1) and FEC at a certain coding rate (K). This model is also used to estimate the overall system capacity.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"136 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":"116929613","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.255101
R. Gangopadhyay, S. Majumder, E. Forestieri
A hybrid modulation scheme is analysed taking into account the effect of laser phase noise and receiver noise. Both theoretical and simulation performance results of the proposed scheme are provided. The MSK-FM system is found to counteract effectively the laser nonuniform FM characteristic, leaving only a small penalty of 0.2 dB.<>
{"title":"MSK-FM hybrid scheme insensitive to the laser non-uniform FM response","authors":"R. Gangopadhyay, S. Majumder, E. Forestieri","doi":"10.1109/ICCS.1992.255101","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255101","url":null,"abstract":"A hybrid modulation scheme is analysed taking into account the effect of laser phase noise and receiver noise. Both theoretical and simulation performance results of the proposed scheme are provided. The MSK-FM system is found to counteract effectively the laser nonuniform FM characteristic, leaving only a small penalty of 0.2 dB.<<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":"116946812","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.255146
S. M. Si, A. M. Alvarez
Describes the interworking standard between an automode modem and other CCITT and Bell modems. The methodology to develop the automode modem is discussed. A software simulator is built to simulate the complete modem system (including the environment and impairments) in order to evaluate and monitor the performance of the modem. The hardware implementation of the automode modem is carried out by using a single Analog Devices ADSP-2101 digital signal processor.<>
{"title":"Digital signal processing for automode modem","authors":"S. M. Si, A. M. Alvarez","doi":"10.1109/ICCS.1992.255146","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255146","url":null,"abstract":"Describes the interworking standard between an automode modem and other CCITT and Bell modems. The methodology to develop the automode modem is discussed. A software simulator is built to simulate the complete modem system (including the environment and impairments) in order to evaluate and monitor the performance of the modem. The hardware implementation of the automode modem is carried out by using a single Analog Devices ADSP-2101 digital signal processor.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"519 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":"117031520","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.255035
Fang Yichen, Tao Shangping, Ye Peida
Laser diode to single mode fibre coupling efficiency including lens aberration is derived for a coupler with planoconvex GRIN-rod lens as a function of lens parameters. The spherical end effects on reducing aberration loss are analyzed and numerical results are given.<>
{"title":"A LD to SMF coupling circuit using a planoconvex GRIN-rod lens","authors":"Fang Yichen, Tao Shangping, Ye Peida","doi":"10.1109/ICCS.1992.255035","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255035","url":null,"abstract":"Laser diode to single mode fibre coupling efficiency including lens aberration is derived for a coupler with planoconvex GRIN-rod lens as a function of lens parameters. The spherical end effects on reducing aberration loss are analyzed and numerical results are given.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"46 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":"117285736","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.255137
Yunxin Li, B. Vucetic, Y. Sato
For decoding of convolutional codes by the Viterbi algorithm, the knowledge of channel parameters on non-Gaussian channels is either essential or preferable. When the considered channel is fast time-varying, reliable and robust estimation of the channel parameters by the conventional decision-directed adaptive algorithms is hardly possible. In the present paper, the Viterbi algorithm is applied in a modified way. Firstly a new trellis diagram is constructed at the receiver side according to modified definitions of trellis state and branch. Secondly a new branch metric is defined so that its expression does not explicitly depend on the channel parameters. With these modifications, decoding can be achieved without the knowledge of channel parameters. This method provides a robust alternative for decoding of convolutional codes on fast fading (especially frequency-selective) channels where the estimation of channel parameters becomes more and more difficult.<>
{"title":"Decoding of convolutional codes by Viterbi blind algorithm","authors":"Yunxin Li, B. Vucetic, Y. Sato","doi":"10.1109/ICCS.1992.255137","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255137","url":null,"abstract":"For decoding of convolutional codes by the Viterbi algorithm, the knowledge of channel parameters on non-Gaussian channels is either essential or preferable. When the considered channel is fast time-varying, reliable and robust estimation of the channel parameters by the conventional decision-directed adaptive algorithms is hardly possible. In the present paper, the Viterbi algorithm is applied in a modified way. Firstly a new trellis diagram is constructed at the receiver side according to modified definitions of trellis state and branch. Secondly a new branch metric is defined so that its expression does not explicitly depend on the channel parameters. With these modifications, decoding can be achieved without the knowledge of channel parameters. This method provides a robust alternative for decoding of convolutional codes on fast fading (especially frequency-selective) channels where the estimation of channel parameters becomes more and more difficult.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"34 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":"115516717","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.254967
M. Abbas, Z. A. Ahmad
High-speed packet switching networks such as asynchronous transfer mode (ATM) had made it possible to deliver real-time information. However, the various kinds of media which it must handle have diverse characteristics and thus traffic control becomes essential to satisfy their various quality requirements. Therefore, some form of priority control is needed. One form of priority control is selective cell discarding (SCD) scheme which uses an embedded coding technique. The authors focus on the performance evaluation of SCD by applying the matrix-analytic approach.<>
{"title":"Performance evaluation of selective cell discarding control in ATM networks","authors":"M. Abbas, Z. A. Ahmad","doi":"10.1109/ICCS.1992.254967","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254967","url":null,"abstract":"High-speed packet switching networks such as asynchronous transfer mode (ATM) had made it possible to deliver real-time information. However, the various kinds of media which it must handle have diverse characteristics and thus traffic control becomes essential to satisfy their various quality requirements. Therefore, some form of priority control is needed. One form of priority control is selective cell discarding (SCD) scheme which uses an embedded coding technique. The authors focus on the performance evaluation of SCD by applying the matrix-analytic approach.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"49 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":"115336808","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.255151
S. Gazor, B. Farhang-Boroujeny
An efficient state space method for implementing the fast Fourier transform over rectangular windows is proposed for the cases when there is a large overlap between the consecutive input signals. This is called the generalized sliding FFT (GSFFT). To minimize the computational complexity of the GSFFT. The intermediate result of the FFT structure which can be used in the next iterations are preserved. The complexity of this method is compared with that of standard FFT. The GSFFT is then used to propose an efficient implementation of the frequency domain block least mean square adaptive (FBLMS) filters, which are known to be efficient when filter length is large.<>
{"title":"A state space approach for efficient implementation of block LMS adaptive filters","authors":"S. Gazor, B. Farhang-Boroujeny","doi":"10.1109/ICCS.1992.255151","DOIUrl":"https://doi.org/10.1109/ICCS.1992.255151","url":null,"abstract":"An efficient state space method for implementing the fast Fourier transform over rectangular windows is proposed for the cases when there is a large overlap between the consecutive input signals. This is called the generalized sliding FFT (GSFFT). To minimize the computational complexity of the GSFFT. The intermediate result of the FFT structure which can be used in the next iterations are preserved. The complexity of this method is compared with that of standard FFT. The GSFFT is then used to propose an efficient implementation of the frequency domain block least mean square adaptive (FBLMS) filters, which are known to be efficient when filter length is large.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"50 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":"115616249","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.254943
L. Popken
In the telecommunications area there are different opinions on the applicability of the Fokker-Planck (F-P) method. One group of researchers and engineers applies the F-P equation to processes which in terms of their probability density function (PDF) may be considered as a subset of the Markov processes, i.e. as (approximately) continuous Markov processes. Another group of researchers and engineers applies the F-P equation to physical processes irrespective of the amplitude distribution of the (noise) process which drives the system, as long as this driving process is of bandwidth considerably wider than the system bandwidth. The author focusses on the incompatibility of the two opinions which can be observed in the relevant synchronization literature. Examples, in particular synchronization systems, are considered and the potentially severe discrepancies are visualized as they can occur between actual system performances on one hand and analytical results from an unjustified application of the F-P method on the other hand.<>
{"title":"On the applicability of the Fokker-Planck method in telecommunications","authors":"L. Popken","doi":"10.1109/ICCS.1992.254943","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254943","url":null,"abstract":"In the telecommunications area there are different opinions on the applicability of the Fokker-Planck (F-P) method. One group of researchers and engineers applies the F-P equation to processes which in terms of their probability density function (PDF) may be considered as a subset of the Markov processes, i.e. as (approximately) continuous Markov processes. Another group of researchers and engineers applies the F-P equation to physical processes irrespective of the amplitude distribution of the (noise) process which drives the system, as long as this driving process is of bandwidth considerably wider than the system bandwidth. The author focusses on the incompatibility of the two opinions which can be observed in the relevant synchronization literature. Examples, in particular synchronization systems, are considered and the potentially severe discrepancies are visualized as they can occur between actual system performances on one hand and analytical results from an unjustified application of the F-P method on the other hand.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"17 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":"114675949","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.254891
Y. Onodera, Hisayoshi Watanabe, A. Taguchi, N. Iijima, M. Sone, H. Mitsui
The authors present a new translation and rotation invariant pattern recognition method using a neural network. It is clear that the left-right, up-down translation or/and rotation invariance are achieved by simple preprocessing of the original patterns without improvement of the network structure. They use a three layer feed-forward network with back-propagation for learning and recognition. The proposed method has the following merits: the net size is relative small, learning and recognition is easy. Moreover, a 100 percent recognition rate is realized by the proposed method, for the alphabet.<>
{"title":"Translation and rotation-invariant pattern recognition method using neural network with back-propagation","authors":"Y. Onodera, Hisayoshi Watanabe, A. Taguchi, N. Iijima, M. Sone, H. Mitsui","doi":"10.1109/ICCS.1992.254891","DOIUrl":"https://doi.org/10.1109/ICCS.1992.254891","url":null,"abstract":"The authors present a new translation and rotation invariant pattern recognition method using a neural network. It is clear that the left-right, up-down translation or/and rotation invariance are achieved by simple preprocessing of the original patterns without improvement of the network structure. They use a three layer feed-forward network with back-propagation for learning and recognition. The proposed method has the following merits: the net size is relative small, learning and recognition is easy. Moreover, a 100 percent recognition rate is realized by the proposed method, for the alphabet.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"129 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":"127388010","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}