Pub Date : 1998-10-05DOI: 10.1109/ICUPC.1998.732808
Yue Ma, C. Ro, Kishor S. Trivedi
We propose and compare three channel recovery schemes for fixed channel assignment. In Scheme I, a failed channel is switched by an idle channel whenever it is available. In Scheme II, the switching strategy is employed only after an attempt to restore the failed channel within a short period of time is unsuccessful. Scheme III is a hybrid of Schemes I and II: for some of the failed channels, Scheme I is applied; for the others, Scheme II is used. To reflect the traffic pattern in a realistic way, a fixed point iteration scheme is applied to capture the dynamic behavior of the handoff arrivals. Stochastic reward nets (SRNs) are developed for the performability analysis of the three schemes.
{"title":"Performability analysis of channel allocation with channel recovery strategy in cellular networks","authors":"Yue Ma, C. Ro, Kishor S. Trivedi","doi":"10.1109/ICUPC.1998.732808","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732808","url":null,"abstract":"We propose and compare three channel recovery schemes for fixed channel assignment. In Scheme I, a failed channel is switched by an idle channel whenever it is available. In Scheme II, the switching strategy is employed only after an attempt to restore the failed channel within a short period of time is unsuccessful. Scheme III is a hybrid of Schemes I and II: for some of the failed channels, Scheme I is applied; for the others, Scheme II is used. To reflect the traffic pattern in a realistic way, a fixed point iteration scheme is applied to capture the dynamic behavior of the handoff arrivals. Stochastic reward nets (SRNs) are developed for the performability analysis of the three schemes.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700547","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733692
Roberto Cusani, J. Mattila
A transmission/equalisation strategy is proposed for frequency-selective, fast time-varying noisy digital channels. Each information data sequence is surrounded by a pair of training sequences of known symbols; these are employed by the receiver to estimate the channel impulse response (CIR) at the beginning and at the end of the timeslot, via a suitable Kalman-like filter with fast convergence properties. The CIR behavior along the data sequence is then linearly interpolated and exploited step-by-step by a maximum likelihood sequence equaliser (MLSE). A simple transmitter/receiver structure is then obtained and its performance analysed via computer simulations.
{"title":"A transmission/equalisation procedure for mobile digital radio links using interpolated channel estimates","authors":"Roberto Cusani, J. Mattila","doi":"10.1109/ICUPC.1998.733692","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733692","url":null,"abstract":"A transmission/equalisation strategy is proposed for frequency-selective, fast time-varying noisy digital channels. Each information data sequence is surrounded by a pair of training sequences of known symbols; these are employed by the receiver to estimate the channel impulse response (CIR) at the beginning and at the end of the timeslot, via a suitable Kalman-like filter with fast convergence properties. The CIR behavior along the data sequence is then linearly interpolated and exploited step-by-step by a maximum likelihood sequence equaliser (MLSE). A simple transmitter/receiver structure is then obtained and its performance analysed via computer simulations.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129229694","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733031
W. Wong, E. Sousa
This paper studies the feasibility of applying TDD technique to a conventional FDD-CDMA system. This is achieved by creating a TDD-CDMA picocell underlaying the existing FDD-CDMA macrocellular network. The system performance is measured in terms of the outage probability. From the simulation results, we discover that spectrum sharing between TDD-CDMA and FDD-CDMA is feasible and that under our assumed interference scenario the performance of the TDD-/FDD-CDMA frequency sharing cellular network is bound by the FDD forward link frequency.
{"title":"Feasibility study of TDD- and FDD-CDMA frequency sharing cellular networks","authors":"W. Wong, E. Sousa","doi":"10.1109/ICUPC.1998.733031","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733031","url":null,"abstract":"This paper studies the feasibility of applying TDD technique to a conventional FDD-CDMA system. This is achieved by creating a TDD-CDMA picocell underlaying the existing FDD-CDMA macrocellular network. The system performance is measured in terms of the outage probability. From the simulation results, we discover that spectrum sharing between TDD-CDMA and FDD-CDMA is feasible and that under our assumed interference scenario the performance of the TDD-/FDD-CDMA frequency sharing cellular network is bound by the FDD forward link frequency.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645978","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733004
T. Miyatani, K. Urabe, Y. Akaiwa
The DS-CDMA system is a strong candidate for the third generation mobile communication system. The RAKE receiver is a key technology to implement DS-CDMA systems: it is an effective countermeasure to improve the channel quality under multipath fading. It is important for the RAKE receiver to detect all available paths for path diversity, since the BER characteristics depends on the number of detected paths. The path detection affects also the capacity of the CDMA system under the quality (SIR) based power control, since false detection will increase the transmission power required to avoid degradation of the channel quality. This paper proposes a new path detection method which requires no A/D converters or DSP to interface with either analog or digital matched filter (MFs). The circuit and algorithm of the proposed system is first described, then the performance obtained by computer simulation is shown.
{"title":"A reduced-complexity path timing detection method for DS-CDMA","authors":"T. Miyatani, K. Urabe, Y. Akaiwa","doi":"10.1109/ICUPC.1998.733004","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733004","url":null,"abstract":"The DS-CDMA system is a strong candidate for the third generation mobile communication system. The RAKE receiver is a key technology to implement DS-CDMA systems: it is an effective countermeasure to improve the channel quality under multipath fading. It is important for the RAKE receiver to detect all available paths for path diversity, since the BER characteristics depends on the number of detected paths. The path detection affects also the capacity of the CDMA system under the quality (SIR) based power control, since false detection will increase the transmission power required to avoid degradation of the channel quality. This paper proposes a new path detection method which requires no A/D converters or DSP to interface with either analog or digital matched filter (MFs). The circuit and algorithm of the proposed system is first described, then the performance obtained by computer simulation is shown.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"30 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004773","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733658
P. Savazzi, L. Favalli
Recent applications of clustering and neural network techniques to channel equalization have revealed the classification nature of this problem. This paper illustrates an implementation of a GSM receiver in which channel equalization and demodulation are realized by means of the K-means algorithm. The advantage is found in the significant reduction of the computational complexity with respect to the classical MLSE equalizer. The performance of the proposed receiver, evaluated through a channel simulator for mobile radio communications, are compared with results obtained by means of a classical 16 states Viterbi processor. It is shown that despite strong simplification in the receiver, performances are still acceptable considering the ETSI parameters.
{"title":"GMSK demodulation using K-means clustering techniques","authors":"P. Savazzi, L. Favalli","doi":"10.1109/ICUPC.1998.733658","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733658","url":null,"abstract":"Recent applications of clustering and neural network techniques to channel equalization have revealed the classification nature of this problem. This paper illustrates an implementation of a GSM receiver in which channel equalization and demodulation are realized by means of the K-means algorithm. The advantage is found in the significant reduction of the computational complexity with respect to the classical MLSE equalizer. The performance of the proposed receiver, evaluated through a channel simulator for mobile radio communications, are compared with results obtained by means of a classical 16 states Viterbi processor. It is shown that despite strong simplification in the receiver, performances are still acceptable considering the ETSI parameters.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121047760","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733675
A. Vannucci, R. Raheli
Using a union bound on the error probability of optimal receivers for nonlinear channels, this work points out important factors affecting the error performance in the simple case of M-ary pulse amplitude modulation (M-PAM) with no intersymbol interference and unlimited transmission bandwidth. The performance is compared to that obtainable when the nonlinear device is perfectly linearized under a peak power constraint. Considered nonlinearities include third-order polynomials and soft-limiters. Simulation results are in good agreement with the derived theoretical bounds. The analysis suggests that margins for improved performance exist, with respect to the performance obtainable by perfect linearization, when the cardinality of the signal set is not large (e.g., 4- or 8-PAM) and the nonlinearity is not severely saturated.
{"title":"Nonlinear channels: predistortion or enhanced detection?","authors":"A. Vannucci, R. Raheli","doi":"10.1109/ICUPC.1998.733675","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733675","url":null,"abstract":"Using a union bound on the error probability of optimal receivers for nonlinear channels, this work points out important factors affecting the error performance in the simple case of M-ary pulse amplitude modulation (M-PAM) with no intersymbol interference and unlimited transmission bandwidth. The performance is compared to that obtainable when the nonlinear device is perfectly linearized under a peak power constraint. Considered nonlinearities include third-order polynomials and soft-limiters. Simulation results are in good agreement with the derived theoretical bounds. The analysis suggests that margins for improved performance exist, with respect to the performance obtainable by perfect linearization, when the cardinality of the signal set is not large (e.g., 4- or 8-PAM) and the nonlinearity is not severely saturated.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"71 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125241243","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733705
S. Chuprun, C. Bergstrom
The future of military radio networks is changing dramatically along with commercial radio systems. Users are demanding higher bandwidths to support video, image, file transfers, and high quality voice. The methods for supplying capacity retains the centralized approach for commercial systems due to improved cell coverage, hand-off requirements, and access to the wired infrastructure. The military has needs for centralized modes for minimal conflict scenarios, however, peer-to-peer modes must remain at a top priority to provide survivable communications. Timely message delivery is critical in military networks, which can have no single points of failure and must be self-organizing to be survivable.
{"title":"Comparison of FH/CDMA and DS/CDMA for wireless survivable networks","authors":"S. Chuprun, C. Bergstrom","doi":"10.1109/ICUPC.1998.733705","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733705","url":null,"abstract":"The future of military radio networks is changing dramatically along with commercial radio systems. Users are demanding higher bandwidths to support video, image, file transfers, and high quality voice. The methods for supplying capacity retains the centralized approach for commercial systems due to improved cell coverage, hand-off requirements, and access to the wired infrastructure. The military has needs for centralized modes for minimal conflict scenarios, however, peer-to-peer modes must remain at a top priority to provide survivable communications. Timely message delivery is critical in military networks, which can have no single points of failure and must be self-organizing to be survivable.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122506828","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733713
D. Patiyoot
To be able to fulfil the need of the wireless ATM user, the system has to acquire features. One of the system features required for the wireless ATM is functionality, especially the security aspect. There is so far little, or no, security consideration in the development of the wireless ATM standard. Therefore a wide range of features in the security functions are under consideration. This paper defines the security features in wireless ATM networks considering those features existing in the fixed and wireless networks. It does not attempt to define the cryptographic system, but rather provide a template in making a cryptographic system for those required features.
{"title":"Security issues for wireless ATM networks","authors":"D. Patiyoot","doi":"10.1109/ICUPC.1998.733713","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733713","url":null,"abstract":"To be able to fulfil the need of the wireless ATM user, the system has to acquire features. One of the system features required for the wireless ATM is functionality, especially the security aspect. There is so far little, or no, security consideration in the development of the wireless ATM standard. Therefore a wide range of features in the security functions are under consideration. This paper defines the security features in wireless ATM networks considering those features existing in the fixed and wireless networks. It does not attempt to define the cryptographic system, but rather provide a template in making a cryptographic system for those required features.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"77 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128082915","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733669
K. Kiasaleh
A channel-aided, decision-directed delay-locked loop (CADD-DLL) is investigated for code-division multiple-access (CDMA) communication. It is assumed that an estimate of channel multiplicative distortion (MD) is obtained at the receiver with the aid of pilot symbols. The performance of the proposed tracking loop is assessed in terms of the variance of PN code tracking error and the mean-time-to-loss (MTTL) for a frequency-selective Rayleigh fading channel in the presence of user-induced interference and lognormal shadowing.
{"title":"Channel-aided, decision-directed delay-locked loop for CDMA communications","authors":"K. Kiasaleh","doi":"10.1109/ICUPC.1998.733669","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733669","url":null,"abstract":"A channel-aided, decision-directed delay-locked loop (CADD-DLL) is investigated for code-division multiple-access (CDMA) communication. It is assumed that an estimate of channel multiplicative distortion (MD) is obtained at the receiver with the aid of pilot symbols. The performance of the proposed tracking loop is assessed in terms of the variance of PN code tracking error and the mean-time-to-loss (MTTL) for a frequency-selective Rayleigh fading channel in the presence of user-induced interference and lognormal shadowing.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132553761","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 : 1998-10-05DOI: 10.1109/ICUPC.1998.733070
C. Chiasserini, R. Lo Cigno, E. Scarrone
This paper describes protocols based on in-band signaling for two common handover procedures in wireless ATM networks. First, the network architecture and the handover reference model are introduced, explaining the rationale and advantages of using in-band signaling for handover procedures. Then, the protocols for the hard, connected, network initiated handover, and the hard, disconnected, mobile initiated handover are described. These two handover types are chosen because they are good representatives of what can be considered a 'normal' handover procedure and an 'emergency' handover procedure, to be performed when the radio channel deteriorates so suddenly, that the mobile terminal remains without any connection toward the network. Finally, the possibility of extending the protocols to other handover types is discussed.
{"title":"Handovers in wireless ATM: an in-band signaling solution","authors":"C. Chiasserini, R. Lo Cigno, E. Scarrone","doi":"10.1109/ICUPC.1998.733070","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733070","url":null,"abstract":"This paper describes protocols based on in-band signaling for two common handover procedures in wireless ATM networks. First, the network architecture and the handover reference model are introduced, explaining the rationale and advantages of using in-band signaling for handover procedures. Then, the protocols for the hard, connected, network initiated handover, and the hard, disconnected, mobile initiated handover are described. These two handover types are chosen because they are good representatives of what can be considered a 'normal' handover procedure and an 'emergency' handover procedure, to be performed when the radio channel deteriorates so suddenly, that the mobile terminal remains without any connection toward the network. Finally, the possibility of extending the protocols to other handover types is discussed.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965483","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
扫码关注我们
求助内容：
应助结果提醒方式：