{"title":"A reduced complexity RAKE receiver with decision feedback equalization for DS/SS communication over multipath fading channels","authors":"K. Wuyts, H. Moeneclaey","doi":"10.1109/ICC.1995.524426","DOIUrl":"https://doi.org/10.1109/ICC.1995.524426","url":null,"abstract":"Spread spectrum communication over a multipath fading channel usually outperforms narrowband communication because the number of resolvable paths is higher when the signal bandwidth is larger. Unfortunately, the complexity of the optimum RAKE receiver is proportional to the ratio of the channel delay spread to the chip duration, which might be very large when the delay spread exceeds the symbol duration. We introduce a reduced complexity RAKE receiver, followed by decision feedback equalization. Assuming the multipath intensity profile of the channel consisting of distinct clusters with random delays (as is the case for the HF radio channel), we compare the performance of the proposed receiver with the performances of the optimum RAKE receiver for spread spectrum communication and the receiver for narrowband communication. Although the proposed receiver structure has a performance loss of a few dB as compared to the optimum RAKE receiver, we find that it still outperforms narrowband communication.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124690063","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 parallel concatenated codes","authors":"S. Benedetto, G. Montorsi","doi":"10.1109/ICC.1995.524187","DOIUrl":"https://doi.org/10.1109/ICC.1995.524187","url":null,"abstract":"A parallel concatenated coding scheme consists of two simple systematic constituent encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits followed by the parity check bits of both encoders. The authors propose a method to evaluate the bit error probability of a parallel concatenated coding scheme in a way which is independent from the interleaver used. The two cases of parallel concatenated block codes and parallel concatenated convolutional codes are considered.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123625468","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":"Code division multiple access (CDMA) enhancement of wavelength division multiplexing (WDM) systems","authors":"A. Mendez, R. Gagliardi","doi":"10.1109/ICC.1995.525177","DOIUrl":"https://doi.org/10.1109/ICC.1995.525177","url":null,"abstract":"Wavelength division multiplexing (WDM) is a mainstream technology for optical communications ranging from long haul applications to interconnections between and within high speed digital systems. WDM is, however, constrained (1) in density by the crosstalk associated with channel spacing and (2) by total number of channels which can be uniformly amplified by optical amplifiers. This number of effective WDM channels can be enhanced by overlaying code division multiple access (CDMA) on each WDM channel. The authors show by analysis and example that the number of effective WDM/CDMA hybrid channels exceeds the number of effective WDM channels, and with a reduced WDM crosstalk penalty.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121052518","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 new differential detector for GMSK","authors":"J. Gu, G. Stuber","doi":"10.1109/ICC.1995.525189","DOIUrl":"https://doi.org/10.1109/ICC.1995.525189","url":null,"abstract":"A new and simple differential detector is presented for Gaussian minimum shift keying (GMSK). The new detector includes the well-known two-bit differential detector as a special case. Simulation results show that the performance of the new detector is at least 1 dB better than the two-bit differential detector, and much better than the conventional one-bit differential detector in AWGN channels. Also, noticeable improvements on error floors are observed in channels with fast Rayleigh fading and/or cochannel interference.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124284995","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":"Temporal and spatial error concealment techniques for hierarchical MPEG-2 video codec","authors":"S. Aign, K. Fazel","doi":"10.1109/ICC.1995.524505","DOIUrl":"https://doi.org/10.1109/ICC.1995.524505","url":null,"abstract":"The MPEG-2 source coding algorithm is very sensitive to the channel disturbances. For instance a single bit error in the bitstream will cause a high degradation of picture quality due to error propagation. Hence, for picture replenishment error concealment techniques (ECTs) may be required at the receiver. The aim of the article is to study different ECTs for MPEG-2 hierarchical coded pictures applied for terrestrial broadcasting. For the base layer different temporal and spatial ECTs are investigated. Two temporal ECTs are considered: a simple temporal error concealment (EC) and a temporal EC with motion compensation. The latter method provides the best results in inter coded pictures (where motion vectors exist). For the intra coded pictures, where no motion information exists, two spatial interpolation techniques are considered. The main problem for spatial EC in MPEG-2 coded pictures is that only the top and the bottom macroblock can be used for interpolation, since one error in the bitstream causes one damaged horizontal stripe of macroblocks in the picture. Different ECTs for the upper layer of hierarchical coded pictures are also investigated. The possibility of upsampling the base layer for concealing the upper layer made by spatial scalability gives best results.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125178666","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":"Spectrum sharing through dynamic channel assignment for open access to personal communications services","authors":"H. Salgado, M. Sirbu, J. Peha","doi":"10.1109/ICC.1995.525204","DOIUrl":"https://doi.org/10.1109/ICC.1995.525204","url":null,"abstract":"This paper focuses on a narrow band technical solution that uses decentralized spectrum sharing to facilitate open access among competing personal communications services (PCS) operators. Existing policies that apportion spectrum by fixed channel assignment (FCA) involve inefficiencies resulting from fragmentation of the available resource into mutually exclusive frequency blocks. Dynamic channel assignment (DCA) has been previously demonstrated to be flexible in handling traffic variability and to simplify frequency planning for a single network operator. We use a discrete event simulation to demonstrate that DCA with autonomous reuse partitioning (ARP) provides more capacity than standard DCA; this property still holds when channels are shared among multiple operators, with partially overlapping networks and unequal traffic shares. We explore the impact of limiting the maximum number of channels that can be assigned to one cell site as an incentive for operators to build more cells, rather than simply appropriating channels from competitors.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126181974","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 method for detecting and eliminating feature interactions using a frame model","authors":"Mitsuhiro Nakamura, Yoji Tsuboi","doi":"10.1109/ICC.1995.525146","DOIUrl":"https://doi.org/10.1109/ICC.1995.525146","url":null,"abstract":"The feature interaction problem in telecommunication software is a major issue in providing new services rapidly and reliably. This paper proposes a method for detecting and eliminating feature interaction using a frame model. In the model construction, each specification is mapped onto the frame and analyzed. A detection method is proposed for three types of interaction, exclusive, connective and recursive. Detected interaction is automatically eliminated in the design process. Using frames to express the organization and relationships of various items of knowledge, our method can detect and eliminate feature interaction according to the designer's requirements. It should be possible to add new specifications without consideration of the existing specifications or program organization.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129256889","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":"The asymptotic distribution of the number of failures of a separately maintained system","authors":"Laurence A. Baxter, Norman A. Marlow","doi":"10.1109/ICC.1995.525159","DOIUrl":"https://doi.org/10.1109/ICC.1995.525159","url":null,"abstract":"Markov models are commonly used to analyze the reliability of complex systems with separately maintained components that operate and are restored independently. In such a model, a system failure occurs whenever a given class of states is entered from outside the class. This paper derives expressions for the expected value and variance of the number of system failures during a given time interval together with their asymptotic forms. Using these results, a central limit theorem for regenerative processes is applied to show that the number of system failures is asymptotically normally distributed. As an application of the results, a telecommunications system is considered, e.g., a switching system, of n components modeled by a binary structure.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130164790","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":"Lookahead routing for ring networks with random extra links","authors":"M. Kovacevic","doi":"10.1109/ICC.1995.524475","DOIUrl":"https://doi.org/10.1109/ICC.1995.524475","url":null,"abstract":"We study the performance of ring topology networks enhanced with additional, randomly assigned links. In particular, we consider unidirectional and bidirectional rings where each node has an extra link to another node chosen randomly. Scalable routing algorithms with various degrees of lookahead are proposed, and it is shown that a small increase in lookahead can significantly improve the performance (such as the number of hops, delay and throughput) compared to the simplest greedy routing algorithm. It is also shown that with such routing, the ring networks with random assignment of extra links can outperform (with respect to both throughput and delay) the networks where the distance between pairs of nodes connected by an extra link is constant. The results of our study also show that the average number of hops in a large ring network with random extra links is close to a theoretical lower bound when the shortest path routing is used.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122476204","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":"Design and analysis of a novel fiber-based PCS optical network","authors":"J. Fan, C.L. Lu, R. Kalman, L. Kazovsky","doi":"10.1109/ICC.1995.525238","DOIUrl":"https://doi.org/10.1109/ICC.1995.525238","url":null,"abstract":"We propose a passive antenna remote unit (PARU) architecture which can be used in future optical fiber-based PCS networks. This system is robust, easy to maintain, and upgradeable to multi-GHz frequencies. By using externally modulated Nd:YAG lasers and coherent detection on the uplink, the system is far more efficient than for a direct detection (DD) uplink in terms of subcarrier multiplexed (SCM) voice and video channels per laser, meeting an spurious-free dynamic range (SFDR) requirement of 55 dB. For voice channels, a coherent FM uplink, a coherent AM uplink, and a DD uplink support, per laser with 200 mW optical power, over 1600 channels, 352 channels, and 96 channels, respectively. For moderate quality video, a coherent FM uplink supports over 1000 channels but a coherent AM uplink and a DD uplink cannot achieve the required SFDR due to the Brillouin threshold.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116358092","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}