{"title":"Joint pre- and post-filter design for decimation-interpolation systems with applications to television pictures","authors":"D. Pian","doi":"10.1109/ITS.1990.175664","DOIUrl":"https://doi.org/10.1109/ITS.1990.175664","url":null,"abstract":"The author discusses the design of pre- and post-filters for a system where down-sampling (decimation) is followed by up-sampling (interpolation). This is called a decimation-interpolation system. Some important properties of decimation-interpolation systems are discussed. A theoretical result is presented where necessary and sufficient conditions are given to eliminate frequency aliasing. Based on this theoretical result, an iterative two-step joint pre- and post-filter design algorithm is presented which implicitly suppresses aliasing. Characteristics of the design method are discussed along with some examples.<<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":"129593226","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":"Loose optical cable fastening analysis","authors":"M. Tonsig, J.G. Dias de Aguiar, I.P. de Araujo","doi":"10.1109/ITS.1990.175650","DOIUrl":"https://doi.org/10.1109/ITS.1990.175650","url":null,"abstract":"The influence of fastening methods was evaluated during tensile testing on loose optical cables. Four fastening methods were tested: fastening only by sheath, fastening by strength member, fastening of all the cable's elements by a pulley system, and a mixed system. The results were analyzed and compared with a theoretical model. It is concluded that fastening of all the cable's elements by a pulley system is the only method that satisfies the installation criteria condition.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"205 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":"123334554","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 packet compression/decompression approach for very high speed optical networks","authors":"A. Acampora, S.I.A. Shah","doi":"10.1109/ITS.1990.175569","DOIUrl":"https://doi.org/10.1109/ITS.1990.175569","url":null,"abstract":"A technique to produce time-compressed optical packets for transmission over an ultra-high-speed optical network is proposed and analytically studied. The technique employs two recirculating optical loops per network node, one to optically compress a fully formatted electronic packet for transmission onto the network and one to electronically expand such a packet upon reception. Depending upon the specific parameters chosen, loss of optical power is shown to limit the packet size to the range of several tens of bits. Despite the significant spontaneous emission noise which is thereby produced, it is shown possible to maintain a bit error rate of 10/sup -9/ and a link margin of 15-30 dB over a wide range of conditions. Finally, compression/expansion techniques are shown to introduce a new network phenomenon which prohibits a node from accessing (both for transmission and reception) two or more time slots within a contiguous group of slots of number equal to the compression ratio.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"2 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":"115455166","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 game theory approach to cooperative and non-cooperative routing problems","authors":"A.A. Economides, J. Silvester","doi":"10.1109/ITS.1990.175673","DOIUrl":"https://doi.org/10.1109/ITS.1990.175673","url":null,"abstract":"Previous work on multiobjective routing takes a system optimization approach to minimize some global objective function. An approach using a game-theoretic formulation is taken. The authors focus on a simple example of two classes which minimize a delay objective. Three cases are considered. The first case (baseline) does global optimization where the routing policies for the two classes are forced to be equal. The second case is where the two classes cooperate to minimize the same objective function of global average delay. In general, this team optimization approach will have a multiplicity of solutions which make it possible to use secondary objectives to select the operating point. The third case is where each class optimizes its own objective function, which corresponds to the classical noncooperative Nash game. This allows different objectives to be adopted by the different classes.<<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":"124317863","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":"Power spectral density of a novel adaptive multilevel line code","authors":"J. A. Delgado-Penín, A. Correas-Corcobado","doi":"10.1109/ITS.1990.175660","DOIUrl":"https://doi.org/10.1109/ITS.1990.175660","url":null,"abstract":"The adaptive multilevel code (AMC) is a DC-free line code with four levels and two lengths. Both levels and lengths carry information. For a stationary memoryless source, closed-form expressions for the spectra of the AMC coded signals have been obtained analytically using the transition probability matrix method. Results comparing the one-sided spectral densities of the AMC, alternate mark inversion, and biphase waveforms are presented. The advantages of AMC are demonstrated.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"12 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":"122003057","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 discrete time analysis of the DQDB access protocol with general input traffic","authors":"T. Stock, P. Tran-Gia","doi":"10.1109/ITS.1990.175583","DOIUrl":"https://doi.org/10.1109/ITS.1990.175583","url":null,"abstract":"The authors present an approximate performance study of the DQDB (distributed queue dual bus) medium access protocol, which is an emerging IEEE 802.6 standard for local and metropolitan area networks. They investigate the influence of general traffic process characteristics on the protocol performance. Due to the consideration of general arrival and service processes, the analysis is derived in the discrete-time domain. The algorithm is based on a decomposition approach of the medium access delay, using the technique of embedded G/G/1 models. Using the analysis method, the whole distribution of delays such as medium access delay and other system characteristics can be properly calculated. Validations with simulation results show that the approximation technique developed is appropriate for a wide range of protocol parameters.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"47 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":"123186333","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":"MLSE equalization and decoding for multipath-fading channels","authors":"W. Sheen, Gordon L. Stüber","doi":"10.1109/ITS.1990.175612","DOIUrl":"https://doi.org/10.1109/ITS.1990.175612","url":null,"abstract":"A combined MLSE (maximum likelihood sequence estimation) equalizer and decoder with D-diversity reception is analyzed for slowly time-varying frequency-selective Rayleigh fading channels. An upper bound on the (decoded) bit error probability is derived. This bound is tight for high signal-to-noise ratios or when diversity reception is employed. A method based on a one-directional stack algorithm is proposed for calculating the bound that efficiently uses computer memory. Two systems have been analyzed using this procedure and compared with computer simulations: BPSK (binary phase shift keying) with a three-tap channel and coded quadrature PSK with a two-tap channel.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"61 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":"122671355","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":"Calculation of the bit error probability in a direct sequence spread spectrum system with code division multiple access","authors":"P. Jeszensky","doi":"10.1109/ITS.1990.175613","DOIUrl":"https://doi.org/10.1109/ITS.1990.175613","url":null,"abstract":"After a short introduction to the direct-sequence spread-spectrum system under study and a description of the model used for reception, the code sequences are selected. These sequences, obtained from Gold code sequences with m=9, are selected using an empirical method which tries to minimize the influence of one code sequence upon others. After selecting the code sequences the bit error probability is calculated from the mean values of these influences and a Gaussian approximation. Results confirm, in this particular case, the validity of the use of random sequences for the calculation of the bit error probability.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"32 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":"125053064","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 all-digital PSK carrier tracking loops","authors":"R. Sampaio-Neto, J. Fortes","doi":"10.1109/ITS.1990.175661","DOIUrl":"https://doi.org/10.1109/ITS.1990.175661","url":null,"abstract":"The performance of PSK (phase shift keying) carrier-tracking loops having a structure suitable for an all-digital implementation is analyzed. The analysis is based on the stochastic difference equation that governs the evolution of the loop phase error sequence. General expressions for the phase error variance, obtained through a linear analysis of the loop difference equation, are derived. An approximate nonlinear analysis is applied to first-order digital loops, yielding analytical expressions for the phase error steady-state probability density and variance. These results are used to assess the tracking performances of binary PSK and quadrature PSK all-digital carrier tracking circuits.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"109 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":"127576130","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":"Delay analysis of a packet voice multiplexer","authors":"G. Ramamurthy, B. Sengupta","doi":"10.1109/ITS.1990.175589","DOIUrl":"https://doi.org/10.1109/ITS.1990.175589","url":null,"abstract":"The performance of a statistical multiplexer whose inputs consist of a superposition of voice packets from c trunks is studied. Voice calls are established according to a Poisson process and call holding times have a general distribution. Each voice call, while in progress, generates packets at fixed intervals of Delta . Thus, when n calls are in progress, the packet generation process is a superposition of n renewal processes, each with an interarrival time of exactly Delta . These packets are fed to a transmitter whose service time for all packets is exactly beta . It is assumed that c beta < Delta , i.e. the transmitter queue is stable even when all trunks are busy. The delay for such a system is analyzed by solving the Sigma D/sub i//D/1 queue. An efficient hybrid simulation method for the packet voice multiplexer is proposed.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"29 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":"127833426","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}