Pub Date : 1998-10-05DOI: 10.1109/ICUPC.1998.732842
A. De Pasquale, N. P. Magnani, P. Zanini
Frequency planning is an important process in planning and optimising second generation TDMA mobile networks. For the GSM system, frequency planning is usually performed by controlling only the downlink estimated quality in the territory. In this paper, by means of simulation results, field measurements and theoretical analysis, we verify that the uplink and downlink in the GSM system experience a different quality, and the uplink may locally exhibit the worst performance, particularly in high traffic load conditions. Thus we propose an alternative approach to take into account both links in the frequency planning process of the GSM system which could be particularly suitable for the local optimisation of an existing frequency plan, in order to improve the quality of critical cells.
{"title":"Optimizing frequency planning in the GSM system","authors":"A. De Pasquale, N. P. Magnani, P. Zanini","doi":"10.1109/ICUPC.1998.732842","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732842","url":null,"abstract":"Frequency planning is an important process in planning and optimising second generation TDMA mobile networks. For the GSM system, frequency planning is usually performed by controlling only the downlink estimated quality in the territory. In this paper, by means of simulation results, field measurements and theoretical analysis, we verify that the uplink and downlink in the GSM system experience a different quality, and the uplink may locally exhibit the worst performance, particularly in high traffic load conditions. Thus we propose an alternative approach to take into account both links in the frequency planning process of the GSM system which could be particularly suitable for the local optimisation of an existing frequency plan, in order to improve the quality of critical cells.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"146 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":"115701245","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.733025
I. Widjaja, A. Cui, J. G. Kim
One of the key issues in wireless ATM is concerned with an efficient handoff scheme that can provide seamless network connectivity to mobile terminals. The handoff scheme must be fast and reliable so that service disruption is minimized. In this paper, we investigate the performance of a backward handoff scheme, which is currently under active consideration in the ATM Forum. The main objective is to study the impact of critical parameters on end-to-end cell delay and service disruption period during connection rerouting.
{"title":"Performance of backward handoff in wireless ATM","authors":"I. Widjaja, A. Cui, J. G. Kim","doi":"10.1109/ICUPC.1998.733025","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733025","url":null,"abstract":"One of the key issues in wireless ATM is concerned with an efficient handoff scheme that can provide seamless network connectivity to mobile terminals. The handoff scheme must be fast and reliable so that service disruption is minimized. In this paper, we investigate the performance of a backward handoff scheme, which is currently under active consideration in the ATM Forum. The main objective is to study the impact of critical parameters on end-to-end cell delay and service disruption period during connection rerouting.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"44 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":"115800927","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.733693
T. Ozugur, M. Naghshineh, P. Kermani, C.M. Olsen, B. Rezvani, J. Copeland
The use of packet-level acknowledgements in the infrared medium access control layer is discussed. Currently, infrared link access control protocols use go-back-N ARQ scheme. Any ARQ scheme is optional in the MAC layer. The advantages and disadvantages of using stop-and-Wait ARQ scheme in the medium access control layer as well as go-back-N ARQ in the link control layer are discussed. The system is compared to a system in which no ARQ scheme is used in the medium access layer. The performances of both systems are investigated in the presence of adaptive data rate mechanism.
{"title":"ARQ protocol for infrared wireless LANs: packet-level ACK or no-packet-level ACK?","authors":"T. Ozugur, M. Naghshineh, P. Kermani, C.M. Olsen, B. Rezvani, J. Copeland","doi":"10.1109/ICUPC.1998.733693","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733693","url":null,"abstract":"The use of packet-level acknowledgements in the infrared medium access control layer is discussed. Currently, infrared link access control protocols use go-back-N ARQ scheme. Any ARQ scheme is optional in the MAC layer. The advantages and disadvantages of using stop-and-Wait ARQ scheme in the medium access control layer as well as go-back-N ARQ in the link control layer are discussed. The system is compared to a system in which no ARQ scheme is used in the medium access layer. The performances of both systems are investigated in the presence of adaptive data rate mechanism.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"16 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":"114979012","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.733063
Jorge Mataix Oltra, V. Casares, Pablo
A novel approach using stochastic activity networks (SAN) as a performance evaluation tool for several mobility tracking algorithms in personal communication networks (PCN) is presented. It is shown that SAN offers a systematic and flexible graphical tool to model the dynamics of the PCNs. We were dealing with location update and paging procedures. The flexibility of SAN tool allows a non-complex graphical representation of these procedures, and therefore, a very easy way to analyse and derive the system performance. Two sets of location update procedures are analysed, the local or dynamic strategies and new hybrid strategies between movement and distance. These set of strategies are envisaged for future cellular PCN, where micro and pico cells are the standard cell layout coverage in urban environments. UltraSAN is also an excellent tool for modelling and analysis of multi-step or selective paging strategies. An important contribution of this new methodology is its flexibility and adaptability to different scenarios and the required computational effort is bounded, with the major characteristic that the complexity of the model increases slightly with growing system complexity.
{"title":"Evaluation of tracking local strategies in wireless networks with stochastic activity networks","authors":"Jorge Mataix Oltra, V. Casares, Pablo","doi":"10.1109/ICUPC.1998.733063","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733063","url":null,"abstract":"A novel approach using stochastic activity networks (SAN) as a performance evaluation tool for several mobility tracking algorithms in personal communication networks (PCN) is presented. It is shown that SAN offers a systematic and flexible graphical tool to model the dynamics of the PCNs. We were dealing with location update and paging procedures. The flexibility of SAN tool allows a non-complex graphical representation of these procedures, and therefore, a very easy way to analyse and derive the system performance. Two sets of location update procedures are analysed, the local or dynamic strategies and new hybrid strategies between movement and distance. These set of strategies are envisaged for future cellular PCN, where micro and pico cells are the standard cell layout coverage in urban environments. UltraSAN is also an excellent tool for modelling and analysis of multi-step or selective paging strategies. An important contribution of this new methodology is its flexibility and adaptability to different scenarios and the required computational effort is bounded, with the major characteristic that the complexity of the model increases slightly with growing system complexity.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"194 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":"116983691","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.733058
Siavash M. Alamoutil, V. Tarokh, P. Poon
This paper presents the selection criteria for trellis codes used with the simple transmit diversity scheme proposed in Alamouti (1998) and reviewed in this paper. The optimum metrics for soft decision Viterbi decoding are derived and the asymptotic coding gains are calculated. The design method achieves both coding gain and a diversity order of 2 using 2 transmit antennas and 1 receive antenna. It is also demonstrated that trellis codes optimized for AWGN are also optimal for use in conjunction with the transmit diversity scheme in Rayleigh fading.
{"title":"Trellis-coded modulation and transmit diversity: design criteria and performance evaluation","authors":"Siavash M. Alamoutil, V. Tarokh, P. Poon","doi":"10.1109/ICUPC.1998.733058","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733058","url":null,"abstract":"This paper presents the selection criteria for trellis codes used with the simple transmit diversity scheme proposed in Alamouti (1998) and reviewed in this paper. The optimum metrics for soft decision Viterbi decoding are derived and the asymptotic coding gains are calculated. The design method achieves both coding gain and a diversity order of 2 using 2 transmit antennas and 1 receive antenna. It is also demonstrated that trellis codes optimized for AWGN are also optimal for use in conjunction with the transmit diversity scheme in Rayleigh fading.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"98 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":"123448477","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.733655
E. Del Re, R. Fantacci, L. Ronga
In asynchronous environments, the spreading signature generation is one of the main issues for CDMA communication systems. In this paper it is shown that the spectral design of the spreading signature leads to efficient band-limited signals with attractive cross-correlation properties. The behavior of the proposed spreading signals is simulated in a GSM-like multipath environment and it is compared to that of a traditional DS-CDMA using Walsh binary sequences.
{"title":"Spectral spreading signals for asynchronous CDMA","authors":"E. Del Re, R. Fantacci, L. Ronga","doi":"10.1109/ICUPC.1998.733655","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733655","url":null,"abstract":"In asynchronous environments, the spreading signature generation is one of the main issues for CDMA communication systems. In this paper it is shown that the spectral design of the spreading signature leads to efficient band-limited signals with attractive cross-correlation properties. The behavior of the proposed spreading signals is simulated in a GSM-like multipath environment and it is compared to that of a traditional DS-CDMA using Walsh binary sequences.","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":"117124777","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.733622
J. Nystrom, K. Jamal, Y. Wang, R. Esmailzadeh
Cell search within a CDMA system consists of the tasks carried out by a mobile station in order to find, identify, and synchronize to a new cell. We distinguish between initial cell search, where the mobile station after power on searches for the cell to which it has the lowest path loss, and cell search carried out for maintaining connection to the network in idle mode and to find handover candidates in active mode. In this paper, we focus on initial cell search. In cellular systems employing asynchronous base stations, no common time reference exists. Consequently, base stations cannot be identified by their relative time offset. One way to facilitate cell search in an asynchronous system is to have each cell transmitting a unique downlink scrambling code. The disadvantage is that the mobile station must now search for a large number of different scrambling codes, which leads to significantly higher complexity compared to the case of a synchronized system. One approach to cell search in an asynchronous system has been proposed for ETSI WCDMA. In this case, each cell uses a unique downlink scrambling code of length 10 ms. The set of scrambling codes is divided into groups with a limited number of codes in each group. In addition, each cell periodically transmits two special orthogonal code words, known as the primary and secondary synchronization codes, PSC and SSC respectively. In ETSI WCDMA, as well as in our work, orthogonal Gold codes are used for the PSC and SSC codes.
{"title":"Comparison of cell search methods for asynchronous wideband CDMA cellular system","authors":"J. Nystrom, K. Jamal, Y. Wang, R. Esmailzadeh","doi":"10.1109/ICUPC.1998.733622","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733622","url":null,"abstract":"Cell search within a CDMA system consists of the tasks carried out by a mobile station in order to find, identify, and synchronize to a new cell. We distinguish between initial cell search, where the mobile station after power on searches for the cell to which it has the lowest path loss, and cell search carried out for maintaining connection to the network in idle mode and to find handover candidates in active mode. In this paper, we focus on initial cell search. In cellular systems employing asynchronous base stations, no common time reference exists. Consequently, base stations cannot be identified by their relative time offset. One way to facilitate cell search in an asynchronous system is to have each cell transmitting a unique downlink scrambling code. The disadvantage is that the mobile station must now search for a large number of different scrambling codes, which leads to significantly higher complexity compared to the case of a synchronized system. One approach to cell search in an asynchronous system has been proposed for ETSI WCDMA. In this case, each cell uses a unique downlink scrambling code of length 10 ms. The set of scrambling codes is divided into groups with a limited number of codes in each group. In addition, each cell periodically transmits two special orthogonal code words, known as the primary and secondary synchronization codes, PSC and SSC respectively. In ETSI WCDMA, as well as in our work, orthogonal Gold codes are used for the PSC and SSC codes.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"343 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":"123976027","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.733674
G. Colavolpe, R. Raheli
Based on Laurent (1986) decomposition of a multilevel continuous phase modulation (CPM) as a sum of linearly modulated components, we derive new noncoherent sequence detection algorithms for M-ary CPM signals transmitted over additive white Gaussian noise (AWGN) channels. Noncoherent sequence detection based on the Viterbi algorithm (.) has been proposed for linearly modulated signals. These schemes are attractive because they closely approach the performance of coherent receivers with acceptable complexity. This paper extends previous results and proposes a general structure for noncoherent sequence detection of CPM signals. The robustness of noncoherent sequence detection schemes to phase noise and frequency offset is also demonstrated.
{"title":"On noncoherent sequence detection of continuous phase modulations","authors":"G. Colavolpe, R. Raheli","doi":"10.1109/ICUPC.1998.733674","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733674","url":null,"abstract":"Based on Laurent (1986) decomposition of a multilevel continuous phase modulation (CPM) as a sum of linearly modulated components, we derive new noncoherent sequence detection algorithms for M-ary CPM signals transmitted over additive white Gaussian noise (AWGN) channels. Noncoherent sequence detection based on the Viterbi algorithm (.) has been proposed for linearly modulated signals. These schemes are attractive because they closely approach the performance of coherent receivers with acceptable complexity. This paper extends previous results and proposes a general structure for noncoherent sequence detection of CPM signals. The robustness of noncoherent sequence detection schemes to phase noise and frequency offset is also demonstrated.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"1 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":"129450903","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.732815
Shi-Cheng Hung, C. Chiu, Chien-Hung Chen
The bit error rate performance for a high-speed personal communication service in tunnels with and without traffic is investigated. The impulse responses of tunnels with and without traffic for any transmitter-receiver location are computed by shooting and bouncing ray/image techniques. By using the impulse responses of these multipath channels, the bit error rate performance of BPSK (binary phase shift keying) system with phase and timing recovery circuits are calculated. Numerical results have showed that the multipath effect caused by the vehicles in the tunnel is an important factor in the bit error rate performance. In addition, the effect of space diversity techniques on mitigating the multipath fading is also investigated.
{"title":"Wireless communication characteristics for tunnels with and without traffic","authors":"Shi-Cheng Hung, C. Chiu, Chien-Hung Chen","doi":"10.1109/ICUPC.1998.732815","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732815","url":null,"abstract":"The bit error rate performance for a high-speed personal communication service in tunnels with and without traffic is investigated. The impulse responses of tunnels with and without traffic for any transmitter-receiver location are computed by shooting and bouncing ray/image techniques. By using the impulse responses of these multipath channels, the bit error rate performance of BPSK (binary phase shift keying) system with phase and timing recovery circuits are calculated. Numerical results have showed that the multipath effect caused by the vehicles in the tunnel is an important factor in the bit error rate performance. In addition, the effect of space diversity techniques on mitigating the multipath fading is also investigated.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"28 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":"127028512","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.733626
S. Benedetto, R. Garello, G. Montorsi
We design parallel concatenated convolutional coding (PCCC) schemes ("turbo codes") suitable for wireless applications requiring short latencies. Particular attention is devoted to the comparison of different solutions for the code interleaver. A new algorithm is applied to the evaluation of the distance spectrum of the overall PCCC, and several interleaver alternatives are analyzed and compared using analytical upper bounds at low BER and simulation through the iterative decoding algorithm at high BER. The choice of the PCCC rate and of the interleaver length are based on the GSM system, so as to be able to compare the new solution with the results obtainable by the present channel coding standard, which, for TCH/FS GSM (full rate speech traffic channel), consists of a (53,50) parity check code followed by a 16-state rate 1/2 binary convolutional code.
{"title":"Parallel concatenated coding schemes for wireless application","authors":"S. Benedetto, R. Garello, G. Montorsi","doi":"10.1109/ICUPC.1998.733626","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733626","url":null,"abstract":"We design parallel concatenated convolutional coding (PCCC) schemes (\"turbo codes\") suitable for wireless applications requiring short latencies. Particular attention is devoted to the comparison of different solutions for the code interleaver. A new algorithm is applied to the evaluation of the distance spectrum of the overall PCCC, and several interleaver alternatives are analyzed and compared using analytical upper bounds at low BER and simulation through the iterative decoding algorithm at high BER. The choice of the PCCC rate and of the interleaver length are based on the GSM system, so as to be able to compare the new solution with the results obtainable by the present channel coding standard, which, for TCH/FS GSM (full rate speech traffic channel), consists of a (53,50) parity check code followed by a 16-state rate 1/2 binary convolutional code.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"173 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":"129919695","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
扫码关注我们
求助内容：
应助结果提醒方式：