Pub Date : 1996-10-15DOI: 10.1109/PIMRC.1996.568487
R. Zaffino
Through the 1980s the principal emphasis of cellular mobile radio services was on providing basic telephone communications to vehicular users over fairly large geographic areas. Initial wireless systems met a basic user need and cellular telephony became a comfortable and useful tool for managing the general business needs of mobile users. More recently, technology and manufacturing innovations have reduced the size and power requirements of mobile handsets, with the result that the larger non-vehicular population of users has been drawn to wireless communications. However, one subset of this population-in building users-has communications needs which are not adequately addressed through basic communications alone. This paper discusses the communications needs of premises users, describes several architectures for providing in building wireless services and provides an overview of access and network technologies which can be used to realize seamless in building services as an integral part of a macro network services environment.
{"title":"Wireless premises services using TDMA and the wireless intelligent network","authors":"R. Zaffino","doi":"10.1109/PIMRC.1996.568487","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.568487","url":null,"abstract":"Through the 1980s the principal emphasis of cellular mobile radio services was on providing basic telephone communications to vehicular users over fairly large geographic areas. Initial wireless systems met a basic user need and cellular telephony became a comfortable and useful tool for managing the general business needs of mobile users. More recently, technology and manufacturing innovations have reduced the size and power requirements of mobile handsets, with the result that the larger non-vehicular population of users has been drawn to wireless communications. However, one subset of this population-in building users-has communications needs which are not adequately addressed through basic communications alone. This paper discusses the communications needs of premises users, describes several architectures for providing in building wireless services and provides an overview of access and network technologies which can be used to realize seamless in building services as an integral part of a macro network services environment.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129675934","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.567527
X. H. Chen, T. Lang, J. Oksman
This paper studies several algorithms for constructing quasi-optimal m-sequence subfamilies in terms of minimized BER under co-channel interference. The results show that the performance of resultant sub-families is sensitive to the sub-family sizes and the algorithms employed. A new criterion based on combinational (even plus odd) maximum cross-correlation for the code selection is introduced, based on which both highest-peak-deleting and most-peak-deleting algorithms are effective to construct the quasi-optimal subfamilies.
{"title":"Searching for quasi-optimal subfamilies of m-sequences for CDMA systems","authors":"X. H. Chen, T. Lang, J. Oksman","doi":"10.1109/PIMRC.1996.567527","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.567527","url":null,"abstract":"This paper studies several algorithms for constructing quasi-optimal m-sequence subfamilies in terms of minimized BER under co-channel interference. The results show that the performance of resultant sub-families is sensitive to the sub-family sizes and the algorithms employed. A new criterion based on combinational (even plus odd) maximum cross-correlation for the code selection is introduced, based on which both highest-peak-deleting and most-peak-deleting algorithms are effective to construct the quasi-optimal subfamilies.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130048363","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.567533
Yi-Bing Lin, I. Chlamtac
This paper addresses two important PCS cost and performance issues: (1) are blocking probabilities (for new call blocking, forced termination or call completion) appropriate for PCS network performance measurement? (2) Should PCS service providers offer discounts to phone calls that are force terminated? In order to do that we derive the effective call holding time distributions for complete/incomplete calls by using an analytic model. We assume that the cell residence times have a general distribution so that the measured data from the field trials, after a second order approximation, can be used to drive our model. Our study on the effective call holding time distributions indicates that (1) blocking probabilities do not provide sufficient information to evaluate the performance of a PCS network, and that output measures, such as expected effective call holding times for complete/incomplete calls, are desirable; (2) for a PCS network with moderate user mobility, the service provider can offer substantial discounts to incomplete calls (to increase the user satisfaction) without significantly reducing the profit margin. A quantitative analysis is also provided that can be used to determine the discount factor.
{"title":"Large effective call holding times for a PCS network","authors":"Yi-Bing Lin, I. Chlamtac","doi":"10.1109/PIMRC.1996.567533","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.567533","url":null,"abstract":"This paper addresses two important PCS cost and performance issues: (1) are blocking probabilities (for new call blocking, forced termination or call completion) appropriate for PCS network performance measurement? (2) Should PCS service providers offer discounts to phone calls that are force terminated? In order to do that we derive the effective call holding time distributions for complete/incomplete calls by using an analytic model. We assume that the cell residence times have a general distribution so that the measured data from the field trials, after a second order approximation, can be used to drive our model. Our study on the effective call holding time distributions indicates that (1) blocking probabilities do not provide sufficient information to evaluate the performance of a PCS network, and that output measures, such as expected effective call holding times for complete/incomplete calls, are desirable; (2) for a PCS network with moderate user mobility, the service provider can offer substantial discounts to incomplete calls (to increase the user satisfaction) without significantly reducing the profit margin. A quantitative analysis is also provided that can be used to determine the discount factor.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933023","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.567415
M. Reed, S. S. Pietrobon
A coding scheme, termed turbo-codes was proposed, which achieves results very close to the Shannon-limit. The encoding and decoding of turbo-codes is reviewed. In particular, a comparison of the current methods used for terminating the trellis of the turbo-code are described. A novel approach to termination of the code is introduced which removes the need to transmit tail bits across the channel. A reduction in transmitted symbols by 2 percent is achieved for PCS CDMA type applications. Simulations confirm that the novel approach is better in terms of BER than other methods of termination.
{"title":"Turbo-code termination schemes and a novel alternative for short frames","authors":"M. Reed, S. S. Pietrobon","doi":"10.1109/PIMRC.1996.567415","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.567415","url":null,"abstract":"A coding scheme, termed turbo-codes was proposed, which achieves results very close to the Shannon-limit. The encoding and decoding of turbo-codes is reviewed. In particular, a comparison of the current methods used for terminating the trellis of the turbo-code are described. A novel approach to termination of the code is introduced which removes the need to transmit tail bits across the channel. A reduction in transmitted symbols by 2 percent is achieved for PCS CDMA type applications. Simulations confirm that the novel approach is better in terms of BER than other methods of termination.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518282","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.568428
Char-Horng Liu, Chia-Chi Huang
A median-rate speech delta coder with low complexity is presented in this paper. It combines the features of one-step look-ahead decision, syllabic companding, instantaneous companding, and adaptive prediction. This coder uses not only short-term prediction filter but also long-term prediction filter to estimate the current speech sample. The performance for this coder with and without pitch prediction is compared by computer simulation. Comparisons between the performance of this coder and the performance of CVSD are also included.
{"title":"A new controlled adaptive prediction delta coder for wireless PCN applications","authors":"Char-Horng Liu, Chia-Chi Huang","doi":"10.1109/PIMRC.1996.568428","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.568428","url":null,"abstract":"A median-rate speech delta coder with low complexity is presented in this paper. It combines the features of one-step look-ahead decision, syllabic companding, instantaneous companding, and adaptive prediction. This coder uses not only short-term prediction filter but also long-term prediction filter to estimate the current speech sample. The performance for this coder with and without pitch prediction is compared by computer simulation. Comparisons between the performance of this coder and the performance of CVSD are also included.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127982759","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.567535
S. Tasaka, H. Imura
This paper describes an experiment of a temporal resolution control scheme of stored video traffic in a wireless LAN. The scheme switches the resolution between two levels according to the network load. We propose a simple method of detecting network congestion which uses only local information. We have implemented the scheme on a wireless LAN based on ALTAIR and have made performance measurement in terms of throughput and total output time. As a result, we observe that although the scheme does not improve the throughput performance, it is effective in suppressing an increase of the total output time due to the network delays.
{"title":"Dynamic resoltuion control of stored video traffic in a wireless LAN","authors":"S. Tasaka, H. Imura","doi":"10.1109/PIMRC.1996.567535","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.567535","url":null,"abstract":"This paper describes an experiment of a temporal resolution control scheme of stored video traffic in a wireless LAN. The scheme switches the resolution between two levels according to the network load. We propose a simple method of detecting network congestion which uses only local information. We have implemented the scheme on a wireless LAN based on ALTAIR and have made performance measurement in terms of throughput and total output time. As a result, we observe that although the scheme does not improve the throughput performance, it is effective in suppressing an increase of the total output time due to the network delays.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908043","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.568402
B. Ibrahim, H. Aghvami
In frequency selective channels, the delay-lock loop, and tracking systems derived from it are not ideal candidates for PN code tracking. This is because they are primarily designed for the AWGN channel. A tracking system designed specifically for use in frequency selective channels is presented. It is shown that with the knowledge of the channel response of the first few resolvable paths, an extended Kalman filter can be used to generate estimates of the PN code delay from the output of baseband inphase and quadrature early-late detectors, similar to those used in delay-lock loops. From computer simulation results of a practical model of the tracking system, it is shown that the tracking system is quite robust to errors in the parameters used to describe the PN code timing process. It is also shown that a simple channel noise estimation system can be used to provide the extended Kalman algorithm with reliable estimates of the channel noise. The performance of the tracking system in PN code clock drift situations is also presented.
{"title":"The performance of a direct sequence spread spectrum PN code tracking system for frequency selective channels","authors":"B. Ibrahim, H. Aghvami","doi":"10.1109/PIMRC.1996.568402","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.568402","url":null,"abstract":"In frequency selective channels, the delay-lock loop, and tracking systems derived from it are not ideal candidates for PN code tracking. This is because they are primarily designed for the AWGN channel. A tracking system designed specifically for use in frequency selective channels is presented. It is shown that with the knowledge of the channel response of the first few resolvable paths, an extended Kalman filter can be used to generate estimates of the PN code delay from the output of baseband inphase and quadrature early-late detectors, similar to those used in delay-lock loops. From computer simulation results of a practical model of the tracking system, it is shown that the tracking system is quite robust to errors in the parameters used to describe the PN code timing process. It is also shown that a simple channel noise estimation system can be used to provide the extended Kalman algorithm with reliable estimates of the channel noise. The performance of the tracking system in PN code clock drift situations is also presented.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127253972","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.568471
J. Mar, Hung-Yi Chen
An effect of multipath on the performance of cellular code division multiple access (CDMA) is investigated. The bit error rate (BER) for both the forward link and reverse link over Rayleigh frequency-selective fading channels are derived. The coherent BPSK modulation with asynchronous direct-sequence (DS) spreading is assumed. The analysis results show the performance degradation of cellular CDMA system as the number of simultaneous users increase. The impact of imperfect power control on the performance of the cellular CDMA system is also investigated.
{"title":"Performance evaluation of a cellular CDMA system over frequency-selective fading channels","authors":"J. Mar, Hung-Yi Chen","doi":"10.1109/PIMRC.1996.568471","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.568471","url":null,"abstract":"An effect of multipath on the performance of cellular code division multiple access (CDMA) is investigated. The bit error rate (BER) for both the forward link and reverse link over Rayleigh frequency-selective fading channels are derived. The coherent BPSK modulation with asynchronous direct-sequence (DS) spreading is assumed. The analysis results show the performance degradation of cellular CDMA system as the number of simultaneous users increase. The impact of imperfect power control on the performance of the cellular CDMA system is also investigated.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814654","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.568474
W. Tsuchiya, H. Morikawa
Uplink/downlink independent radio resource management is one solution for emerging multimedia wireless networks. This paper presents six downlink channel assignment algorithms for packet-based TDMA/FDMA systems. The goal is to minimize the channel setup delay while attaining high transmission quality. Computer simulations are used to evaluate system performance in terms of dropped packet ratio and average channel setup delay. Only the bursty voice traffic is considered for real-time transmission. Priority-based two-stage algorithms are found to provide good performance, where the first stage is the selection of carrier to be scanned, and the second stage is the selection of time-slot to be assigned. The effect of priority determination algorithms is also discussed.
{"title":"Downlink channel assignment algorithms for packet-based wireless TDMA/FDMA networks","authors":"W. Tsuchiya, H. Morikawa","doi":"10.1109/PIMRC.1996.568474","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.568474","url":null,"abstract":"Uplink/downlink independent radio resource management is one solution for emerging multimedia wireless networks. This paper presents six downlink channel assignment algorithms for packet-based TDMA/FDMA systems. The goal is to minimize the channel setup delay while attaining high transmission quality. Computer simulations are used to evaluate system performance in terms of dropped packet ratio and average channel setup delay. Only the bursty voice traffic is considered for real-time transmission. Priority-based two-stage algorithms are found to provide good performance, where the first stage is the selection of carrier to be scanned, and the second stage is the selection of time-slot to be assigned. The effect of priority determination algorithms is also discussed.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"91 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171843","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 : 1996-10-15DOI: 10.1109/PIMRC.1996.567532
H. Olofsson, S. Magnusson, M. Almgren
In the near future, capacity needs will lead to cellular systems with a complex mixture of cells with different sizes and unpredictable coverage areas. Such complex systems will increase the need for manual radio network planning dramatically, unless intelligent tools are developed to assist in the planning. This paper addresses the problem of determining which cells are neighbors to a certain cell in a TDMA system. At present this has to be manually determined for each cell in a system. A concept is proposed where the neighbor cell lists are dynamically planned during system operation, with little or no manual assistance. The proposed class of algorithms uses information about the long term network behavior, and the neighbor cell lists are continuously updated. The proposed concept considerably reduces manual planning, and simulation results show that the scheme also improves the overall system quality by reducing the length of the neighbor cell lists.
{"title":"A concept for dynamic neighbor cell list planning in a cellular system","authors":"H. Olofsson, S. Magnusson, M. Almgren","doi":"10.1109/PIMRC.1996.567532","DOIUrl":"https://doi.org/10.1109/PIMRC.1996.567532","url":null,"abstract":"In the near future, capacity needs will lead to cellular systems with a complex mixture of cells with different sizes and unpredictable coverage areas. Such complex systems will increase the need for manual radio network planning dramatically, unless intelligent tools are developed to assist in the planning. This paper addresses the problem of determining which cells are neighbors to a certain cell in a TDMA system. At present this has to be manually determined for each cell in a system. A concept is proposed where the neighbor cell lists are dynamically planned during system operation, with little or no manual assistance. The proposed class of algorithms uses information about the long term network behavior, and the neighbor cell lists are continuously updated. The proposed concept considerably reduces manual planning, and simulation results show that the scheme also improves the overall system quality by reducing the length of the neighbor cell lists.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130203937","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
扫码关注我们
求助内容：
应助结果提醒方式：