Pub Date : 1998-10-05DOI: 10.1109/ICUPC.1998.733696
O. Nakamura, H. Matsuki, T. Oono, T. Tanaka
A new selective-repeat (SR) ARQ scheme using the pre-repeat (PR) technique is proposed. The proposed scheme is efficient in digital cordless-phone systems employing TDMA-TDD under slow fading environments. Because fading affects both up-link channel and down-link channel simultaneously, the occurrence of error in the up-link channel is closely correlated with that in the down-link channel. This characteristic can be applied to predict errors in transmitted data by observing received signal. In this paper, throughput efficiency of the proposed scheme is investigated by computer simulation, and is compared with conventional SR-ARQ. It indicates that the proposed scheme is advantageous to transmission with a long round-trip delay.
{"title":"Pre-repeat selective-repeat ARQ in fading channel","authors":"O. Nakamura, H. Matsuki, T. Oono, T. Tanaka","doi":"10.1109/ICUPC.1998.733696","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733696","url":null,"abstract":"A new selective-repeat (SR) ARQ scheme using the pre-repeat (PR) technique is proposed. The proposed scheme is efficient in digital cordless-phone systems employing TDMA-TDD under slow fading environments. Because fading affects both up-link channel and down-link channel simultaneously, the occurrence of error in the up-link channel is closely correlated with that in the down-link channel. This characteristic can be applied to predict errors in transmitted data by observing received signal. In this paper, throughput efficiency of the proposed scheme is investigated by computer simulation, and is compared with conventional SR-ARQ. It indicates that the proposed scheme is advantageous to transmission with a long round-trip delay.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"27 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":"128034681","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.732823
A. Kramling, M. Scheibenbogen
During the last few years extensive research has been carried out to extend fixed ATM networks to the mobile user. Several access protocols have been developed and international projects are building the first wireless ATM (WATM) demonstrators. Up to now nearly no research has been done in the area of dynamic channel allocation for WATM networks, which is an essential issue for a future communication system. In the case of a WATM system two different aspects have to be combined: on one hand the ATM like statistical multiplexing leads to a very dynamic assignment of capacity, while on the other hand, dynamic channel allocation requires a steady behaviour. Due to these opposing requirements, a new allocation scheme is required. This paper focuses on the influence on the transmission delay via the ATM air interface caused by this allocation scheme.
{"title":"Influence of dynamic channel allocation on the transmission delay in wireless ATM networks","authors":"A. Kramling, M. Scheibenbogen","doi":"10.1109/ICUPC.1998.732823","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732823","url":null,"abstract":"During the last few years extensive research has been carried out to extend fixed ATM networks to the mobile user. Several access protocols have been developed and international projects are building the first wireless ATM (WATM) demonstrators. Up to now nearly no research has been done in the area of dynamic channel allocation for WATM networks, which is an essential issue for a future communication system. In the case of a WATM system two different aspects have to be combined: on one hand the ATM like statistical multiplexing leads to a very dynamic assignment of capacity, while on the other hand, dynamic channel allocation requires a steady behaviour. Due to these opposing requirements, a new allocation scheme is required. This paper focuses on the influence on the transmission delay via the ATM air interface caused by this allocation scheme.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"57 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":"124535141","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.732838
C. Johansson, L. De Verdier, F. Khan
The introduction of packet switched data in cellular systems requires new radio resource algorithms. For example, a scheduling algorithm is needed when more than one user may share the same physical channel, to determine the order in which users on the same channel should be allowed to transmit. This paper discusses the scheduling problem in general, and investigates the performance of three basic scheduling algorithms in an enhanced data rates for global GSM evolution/general packet radio service (EDGE/GPRS) system. Effort has been spent on modeling the bursty interference of a packet data network and using appropriate performance measures for the evaluation of such a network. The results indicate that the choice of scheduling discipline is very important, especially in a highly loaded system. With the performance measures used here, it is more important to consider the packet sizes than the users' different channel qualities.
{"title":"Performance of different scheduling strategies in a packet radio system","authors":"C. Johansson, L. De Verdier, F. Khan","doi":"10.1109/ICUPC.1998.732838","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732838","url":null,"abstract":"The introduction of packet switched data in cellular systems requires new radio resource algorithms. For example, a scheduling algorithm is needed when more than one user may share the same physical channel, to determine the order in which users on the same channel should be allowed to transmit. This paper discusses the scheduling problem in general, and investigates the performance of three basic scheduling algorithms in an enhanced data rates for global GSM evolution/general packet radio service (EDGE/GPRS) system. Effort has been spent on modeling the bursty interference of a packet data network and using appropriate performance measures for the evaluation of such a network. The results indicate that the choice of scheduling discipline is very important, especially in a highly loaded system. With the performance measures used here, it is more important to consider the packet sizes than the users' different channel qualities.","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":"130949919","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.733644
E. Okamoto, Huan-Bang Li, T. Ikegami
Pilot symbol assisted modulation (PSAM) has been proposed to compensate the distortion of the transmission lines. It is mainly targeted at fading such as Rayleigh and Rician. In one of the PSAM techniques, the compensation scheme using the fast Fourier transform (FFT) has characteristics including a simple zero insertion and precise estimation even in fast fading environments. We use this scheme to create a PSAM that compensates fading and carrier frequency offset. This proposed scheme estimates the fading and frequency offset from the received pilot symbols and compensates both of them at the same time. The scheme is introduced, and the examples of applying this to 16QAM are given through computer simulations.
{"title":"A pilot symbol assisted compensation scheme of fading and frequency offset for 16QAM","authors":"E. Okamoto, Huan-Bang Li, T. Ikegami","doi":"10.1109/ICUPC.1998.733644","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733644","url":null,"abstract":"Pilot symbol assisted modulation (PSAM) has been proposed to compensate the distortion of the transmission lines. It is mainly targeted at fading such as Rayleigh and Rician. In one of the PSAM techniques, the compensation scheme using the fast Fourier transform (FFT) has characteristics including a simple zero insertion and precise estimation even in fast fading environments. We use this scheme to create a PSAM that compensates fading and carrier frequency offset. This proposed scheme estimates the fading and frequency offset from the received pilot symbols and compensates both of them at the same time. The scheme is introduced, and the examples of applying this to 16QAM are given through computer simulations.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"2 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":"128854276","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.733676
X. Wang, H. Poor
The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath CDMA channels. An iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft-interference cancellation and linear MMSE filtering. Simulation results demonstrate that the proposed receiver offers significant performance gain over the traditional non-iterative receiver structure. Moreover, at high SNR, the detrimental effects of MAI and ISI can be almost completely overcome by iterative processing, and single-user performance can be approached.
{"title":"Turbo multiuser detection and equalization for coded CDMA in multipath channels","authors":"X. Wang, H. Poor","doi":"10.1109/ICUPC.1998.733676","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733676","url":null,"abstract":"The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath CDMA channels. An iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft-interference cancellation and linear MMSE filtering. Simulation results demonstrate that the proposed receiver offers significant performance gain over the traditional non-iterative receiver structure. Moreover, at high SNR, the detrimental effects of MAI and ISI can be almost completely overcome by iterative processing, and single-user performance can be approached.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"14 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":"125605827","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.733633
H. Matsue, M. Umehira, T. Murase
The system concept of ATM wireless access is presented, and technical issues on ATM wireless access are clarified. An ATM wireless access prototype based on the concept is developed. This paper describes design and performance of the prototype.
{"title":"Design and performance of ATM wireless access prototype","authors":"H. Matsue, M. Umehira, T. Murase","doi":"10.1109/ICUPC.1998.733633","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733633","url":null,"abstract":"The system concept of ATM wireless access is presented, and technical issues on ATM wireless access are clarified. An ATM wireless access prototype based on the concept is developed. This paper describes design and performance of the prototype.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"66 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":"116000306","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.733023
O. Baldo, A. Aghvami
A new mobility-specific call admission control (CAC), using a distributed approach, is introduced in this work. This new CAC reduces the load on the mobile-specific ATM switch and prevents it from becoming a bottleneck in the system. The proposed distributed CAC is executed partially in the serving base station (BS) and partially at the ATM switch. Compared to the centralised approach, the new CAC shows substantial reduction in CAC delay and considerable improvement in overall network performance.
{"title":"Base-station supported call admission control for wireless ATM","authors":"O. Baldo, A. Aghvami","doi":"10.1109/ICUPC.1998.733023","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733023","url":null,"abstract":"A new mobility-specific call admission control (CAC), using a distributed approach, is introduced in this work. This new CAC reduces the load on the mobile-specific ATM switch and prevents it from becoming a bottleneck in the system. The proposed distributed CAC is executed partially in the serving base station (BS) and partially at the ATM switch. Compared to the centralised approach, the new CAC shows substantial reduction in CAC delay and considerable improvement in overall network performance.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"153 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":"122289893","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.733695
A. Annamalai, V. Bhargava
The throughput of conventional ARQ protocols, such as the stop-and-wait, go-back-N and selective-repeat, can be improved by dynamically adapting the protocol packet length with the changes in channel conditions. Such an action requires a method for sensing the channel state and detecting a change in it. This paper examines four simple algorithms to implement such an adaptive system in a slowly varying mobile radio channel. It is shown that these algorithms performs remarkably well in spite of their simplicity. In particular, the algorithm based on counting the contiguous positive and/or negative acknowledgment messages provides a reliable channel state information (CSI) within only a few block transmissions, and requires the shortest observation interval among the four schemes.
{"title":"Efficient ARQ error control strategies with adaptive packet length for mobile radio networks","authors":"A. Annamalai, V. Bhargava","doi":"10.1109/ICUPC.1998.733695","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.733695","url":null,"abstract":"The throughput of conventional ARQ protocols, such as the stop-and-wait, go-back-N and selective-repeat, can be improved by dynamically adapting the protocol packet length with the changes in channel conditions. Such an action requires a method for sensing the channel state and detecting a change in it. This paper examines four simple algorithms to implement such an adaptive system in a slowly varying mobile radio channel. It is shown that these algorithms performs remarkably well in spite of their simplicity. In particular, the algorithm based on counting the contiguous positive and/or negative acknowledgment messages provides a reliable channel state information (CSI) within only a few block transmissions, and requires the shortest observation interval among the four schemes.","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":"125997850","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.732837
Jinsung Choi, J. Silvester
Reuse partitioning is a technique of using differing reuse factors to provide an increase in system capacity. Furthermore additional capacity increase can be accomplished by allowing calls to overflow from inner zones and outer zones. We consider this asymmetric channel borrowing scheme between zones in two-zone reuse partitioning. In this scheme, however, calls initiated in outer zones have fewer channels available than those in inner zones and therefore they experience higher blocking rates unless some channel borrowing control is used. In this paper, we address the problem of guaranteeing a specified call blocking probability of outer zone calls and search for a fair-optimal control policy that can support such a guarantee. Throughout the study two classes of calls, namely narrowband calls and broadband calls are taken into account. The problem is formulated as a constrained continuous Markov decision problem (CCMDP), and is shown to be solved by a linear program for the case of two types of services.
{"title":"A fair-optimal channel borrowing scheme in multiservice cellular networks with reuse partitioning","authors":"Jinsung Choi, J. Silvester","doi":"10.1109/ICUPC.1998.732837","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732837","url":null,"abstract":"Reuse partitioning is a technique of using differing reuse factors to provide an increase in system capacity. Furthermore additional capacity increase can be accomplished by allowing calls to overflow from inner zones and outer zones. We consider this asymmetric channel borrowing scheme between zones in two-zone reuse partitioning. In this scheme, however, calls initiated in outer zones have fewer channels available than those in inner zones and therefore they experience higher blocking rates unless some channel borrowing control is used. In this paper, we address the problem of guaranteeing a specified call blocking probability of outer zone calls and search for a fair-optimal control policy that can support such a guarantee. Throughout the study two classes of calls, namely narrowband calls and broadband calls are taken into account. The problem is formulated as a constrained continuous Markov decision problem (CCMDP), and is shown to be solved by a linear program for the case of two types of services.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"77 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":"126095594","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.732801
I. Sohn, S.C. Gupta
This paper studies the performance of a blind adaptive multiuser receiver in slow and fast fading channels. The receiver consists of fractionally spaced equalizer, adaptive weight mechanism, matched filter, and differential decoder. Thus, the complexity of the receiver is slightly higher than the conventional receiver. The main problem of an adaptive multiuser receiver is the requirement of training sequences for the adaptation process. Due to time-varying interference and fading effect in time-correlated channels, the training sequence is difficult to obtain or becomes defective. The blind multiuser receiver considered in this paper does not require any training sequences, but retains all the advantages that adaptive receivers have. Simulation results show that the receiver is effective in fading channels with perfect power control and with near-far effect. The blind adaptive multiuser receiver is an attractive alternative to the conventional receiver in Rayleigh fading CDMA channels.
{"title":"Differentially coherent blind multiuser receiver for Rayleigh fading CDMA channels","authors":"I. Sohn, S.C. Gupta","doi":"10.1109/ICUPC.1998.732801","DOIUrl":"https://doi.org/10.1109/ICUPC.1998.732801","url":null,"abstract":"This paper studies the performance of a blind adaptive multiuser receiver in slow and fast fading channels. The receiver consists of fractionally spaced equalizer, adaptive weight mechanism, matched filter, and differential decoder. Thus, the complexity of the receiver is slightly higher than the conventional receiver. The main problem of an adaptive multiuser receiver is the requirement of training sequences for the adaptation process. Due to time-varying interference and fading effect in time-correlated channels, the training sequence is difficult to obtain or becomes defective. The blind multiuser receiver considered in this paper does not require any training sequences, but retains all the advantages that adaptive receivers have. Simulation results show that the receiver is effective in fading channels with perfect power control and with near-far effect. The blind adaptive multiuser receiver is an attractive alternative to the conventional receiver in Rayleigh fading CDMA channels.","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":"124108112","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}