{"title":"Strategy in the development and establishment of the Brazilian national signalling network","authors":"J. Leite, R. Bonfa, L. M. da Silveira","doi":"10.1109/ITS.1990.175671","DOIUrl":"https://doi.org/10.1109/ITS.1990.175671","url":null,"abstract":"Basic criteria assumed by TELEBRAS when specifying the target Brazilian signalling network are described. An overview of the network and the basic characteristics of the national signalling transfer points (STPs) is presented. STPs are packet switching nodes that make up the core of the national signalling network. The national signalling network will be hierarchical, with two levels of STPs.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"231 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120910491","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":"Architecture and performance of a distributed mixed voice/data switching system with variable bit-rate lines","authors":"D. Harle, Y. Kriaras, D.G. Smith","doi":"10.1109/ITS.1990.175584","DOIUrl":"https://doi.org/10.1109/ITS.1990.175584","url":null,"abstract":"The authors discuss the major aspects of an integrated office network-the integrated switching system (ISS)-in terms of structure, operation, and behavior. The ISS provides service flexibility through the use of a line structure which provides variable bit-rates, enabling line capacity to be varied on demand, and a flexible switching strategy which increases system efficiency. The system behavior is examined to investigate the effect that the provision of variable line capacity has on overall system performance, taking into account two switching algorithms which can be supported by such a system. It is shown that one particular algorithm based on the least busy path offers significant advantage in relation to the system's ability to route calls and support a wide combination of line speeds.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121228340","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":"Security in value added networks-security requirements for EDI","authors":"B. Jerman-Blazic","doi":"10.1109/ITS.1990.175628","DOIUrl":"https://doi.org/10.1109/ITS.1990.175628","url":null,"abstract":"The author describes the security requirements for the electronic data interchange (EDI) service. The existing security services and mechanisms of X.400 are evaluated in view of the EDI security requirement. Specific security services which appear to be a necessary part of the EDI model are briefly described. The work presented is based on the security concepts in the ISO/IEC JTC1/SWG-EDI documents.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117045732","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":"Optimum transmission ranges in a frequency hopping multi-hop packet radio network","authors":"E. Sousa","doi":"10.1109/ITS.1990.175675","DOIUrl":"https://doi.org/10.1109/ITS.1990.175675","url":null,"abstract":"The authors determines optimum transmission ranges for a multi-hop packet radio network using frequency hopping spread spectrum with frequency shift keying. The results can be used in the study of routing schemes for such networks. Under the assumption of uniform traffic and a random network topology, the optimum transmission range is such that the number of terminals closer to the receiver than the transmitter is proportional to the processing gain. This contrasts with previous results for direct sequence where it was found that the optimum transmission range is such that the number of neighbors that are closer to the receiver than the transmitter is proportional to the square root of the processing gain.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116101249","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":"Varshamov-Gilbert bounds for generalized concatenated codes in Euclidean space","authors":"T. Ericson","doi":"10.1109/ITS.1990.175562","DOIUrl":"https://doi.org/10.1109/ITS.1990.175562","url":null,"abstract":"The author suggests the Varshamov-Gilbert bound as a method for evaluating and comparing various possible inner codes. The advantage is that in this way an evaluation can be obtained which is more or less neutral as far as the choice of outer code is concerned. A few examples are evaluated. It is concluded that set partitioning and generalized concatenation provide excellent possibilities for constructing codes for non-Hamming metrics. In the case of Euclidean spaces the appropriate dimension for the inner code seems to be <or=2.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126592799","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 the quantization effects of LMS complex algorithm in digital adaptive filters","authors":"W. P. Carpes, R. Seara, J. Bermudez","doi":"10.1109/ITS.1990.175618","DOIUrl":"https://doi.org/10.1109/ITS.1990.175618","url":null,"abstract":"A novel theoretical formulation is developed for the errors due to the digital implementation of the LMS algorithm in adaptive filters. An analytic expression is determined for the mean-square error at the output of the adaptive filter. This expression is valid both for transient conditions and for the steady state. The convergence conditions of the algorithm are studied and a very simple and useful expression is obtained for the residual mean-square error. Simulation results are presented to validate the proposed theoretical model.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131907854","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":"M-algorithm decoding of convolutional code combined with CPM","authors":"W. Finamore, C. Pimentel, J.B. Anderson","doi":"10.1109/ITS.1990.175658","DOIUrl":"https://doi.org/10.1109/ITS.1990.175658","url":null,"abstract":"The performance of convolutional codes combined with continuous phase modulation schemes (CC/CPM) with M-algorithm decoding is evaluated by computer simulation. New CC/CPM schemes with a feedback convolutional encoder having, in some cases, better distances than previous CC/CPM which uses a feedforward encoder, are presented. Comparison of CC/CPM and CPM, constrained to the same complexity and bandwidth, shows that the former have a better performance. The simulation results also corroborate the fact that the M-algorithm is far more efficient than the Viterbi algorithm.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"395 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132068452","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":"Frequency division multiplexing with channel constraints","authors":"E. Feig","doi":"10.1109/ITS.1990.175614","DOIUrl":"https://doi.org/10.1109/ITS.1990.175614","url":null,"abstract":"Modulation via Fourier transform division multiplexing (FTDM) has been suggested for transmission over channels whose signal-to-noise ratios, as functions of frequency, are far from flat. Original designs following the classical water-pouring theorem left a large gap between the theoretical promise of the method and the actual rates achieved. The author presents heuristic input-power allocations for enhancing the performance of such schemes. He also considers FTDM under peak-power constraints.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133315070","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 proposal of architecture for a packet switching ISPBX","authors":"Fernando M. S. Ramos, G. Arroz","doi":"10.1109/ITS.1990.175625","DOIUrl":"https://doi.org/10.1109/ITS.1990.175625","url":null,"abstract":"The authors present an integrated services private branch exchange (ISPBX) architecture based on a packet switching subnetwork, whose basic innovative aspect is the high flexibility provided by the modular organization of the system. They describe the general system organization and features, and present some examples illustrating the modular organization.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132822627","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":"Direct digital frequency synthesizer for a FH spread spectrum system: analysis and design","authors":"F. Cercas, M. Tomlinson, A. Albuquerque","doi":"10.1109/ITS.1990.175642","DOIUrl":"https://doi.org/10.1109/ITS.1990.175642","url":null,"abstract":"A complete characterization of direct digital frequency synthesizers; (DDFSs) is made, deducing exact expressions and general properties of these synthesizers. As an application example of the derived expression for the power spectrum density with phase quantization, an extremely simple algorithm is described that sequentially computes the frequency and magnitude of each component and gives exactly the, same result as an FFT. Expressions for the signal-to-noise ratio, including phase and amplitude quantization, and general design rules are also presented. An ECL (emitter coupled logic) hardware prototype was built, and its performance is shown to be in good agreement with both theoretical and simulation results.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131145982","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}