Pub Date : 2000-12-17DOI: 10.1109/ICPWC.2000.905812
R. Warsi, A. Chaturvedi
We have derived the PDF of the decision variable for an adaptive serial search PN code acquisition scheme in Nakagami-m fading environment which is better suited for modeling the urban multipath mobile radio communication channel. The detection and false alarm probabilities have also been derived. These can be used for the computation of mean and variance of acquisition time.
{"title":"A new adaptive serial search PN code acquisition scheme for DS-CDMA systems","authors":"R. Warsi, A. Chaturvedi","doi":"10.1109/ICPWC.2000.905812","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905812","url":null,"abstract":"We have derived the PDF of the decision variable for an adaptive serial search PN code acquisition scheme in Nakagami-m fading environment which is better suited for modeling the urban multipath mobile radio communication channel. The detection and false alarm probabilities have also been derived. These can be used for the computation of mean and variance of acquisition time.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535183","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905907
R. Ramani, A. Karandikar
Reliable transport protocols like the transmission control protocol (TCP) are tuned to perform well in traditional wireline networks where packet losses occur mostly because of congestion. However, networks with wireless and lossy links also suffer from significant packet losses due to random losses and handoffs. TCP responds to all the packet losses by invoking a congestion control algorithm and this results in degraded end-to-end performance in wireless and lossy links. In this paper, we suggest a strategy to determine the cause of packet drops in a wireless network running the TCP protocol. Our method is based on modification of explicit congestion notification (ECN) in TCP for wireless networks.
{"title":"Explicit congestion notification (ECN) in TCP over wireless network","authors":"R. Ramani, A. Karandikar","doi":"10.1109/ICPWC.2000.905907","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905907","url":null,"abstract":"Reliable transport protocols like the transmission control protocol (TCP) are tuned to perform well in traditional wireline networks where packet losses occur mostly because of congestion. However, networks with wireless and lossy links also suffer from significant packet losses due to random losses and handoffs. TCP responds to all the packet losses by invoking a congestion control algorithm and this results in degraded end-to-end performance in wireless and lossy links. In this paper, we suggest a strategy to determine the cause of packet drops in a wireless network running the TCP protocol. Our method is based on modification of explicit congestion notification (ECN) in TCP for wireless networks.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"375 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124692768","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905762
M. Hefnawi, G. Delisle
Adaptive antenna array systems have been shown to play a central role in removing narrowband multiple-access interference (MAI) in wireless communications. However, due to the actual need for increasing channel capacity, the required bandwidth is becoming wider and can bring significant deterioration to narrowband adaptive systems. These performance degradations are mainly caused by the fact that the inter-element phase shift becomes a function of the frequency while the adaptation weights are kept independent of frequency. This paper specifically deals with the effects of wideband CDMA signals on the narrowband adaptive system. The performance evaluation for different chip rates is carried out in terms of the adaptive array pattern. The basic adaptive algorithm used is the CMA (constant modulus algorithm), which has the major advantage of not requiring an estimate of the desired signal for its implementation.
{"title":"Impact of wideband CDMA signals on smart antenna systems","authors":"M. Hefnawi, G. Delisle","doi":"10.1109/ICPWC.2000.905762","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905762","url":null,"abstract":"Adaptive antenna array systems have been shown to play a central role in removing narrowband multiple-access interference (MAI) in wireless communications. However, due to the actual need for increasing channel capacity, the required bandwidth is becoming wider and can bring significant deterioration to narrowband adaptive systems. These performance degradations are mainly caused by the fact that the inter-element phase shift becomes a function of the frequency while the adaptation weights are kept independent of frequency. This paper specifically deals with the effects of wideband CDMA signals on the narrowband adaptive system. The performance evaluation for different chip rates is carried out in terms of the adaptive array pattern. The basic adaptive algorithm used is the CMA (constant modulus algorithm), which has the major advantage of not requiring an estimate of the desired signal for its implementation.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114628708","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905803
D. Baum, D. Gore, R. Nabar, S. Panchanathan, K. Hari, V. Erceg, A. Paulraj
We study the channel typical for cellular broadband fixed wireless applications. A measurement system for a two-element-transmit by two-element-receive antenna configuration was built, Measurements were conducted in a suburban environment with dual antenna polarization and transmit separation. We present results on K-factor, cross-polarization discrimination (XPD) and Doppler spectrum. Our results address the influence of distance and antenna height for K-factor and XPD. We also comment on the properties of a fixed wireless channel and describe its Doppler spectrum.
{"title":"Measurement and characterization of broadband MIMO fixed wireless channels at 2.5 GHz","authors":"D. Baum, D. Gore, R. Nabar, S. Panchanathan, K. Hari, V. Erceg, A. Paulraj","doi":"10.1109/ICPWC.2000.905803","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905803","url":null,"abstract":"We study the channel typical for cellular broadband fixed wireless applications. A measurement system for a two-element-transmit by two-element-receive antenna configuration was built, Measurements were conducted in a suburban environment with dual antenna polarization and transmit separation. We present results on K-factor, cross-polarization discrimination (XPD) and Doppler spectrum. Our results address the influence of distance and antenna height for K-factor and XPD. We also comment on the properties of a fixed wireless channel and describe its Doppler spectrum.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123550297","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905765
V. Sahula, C. Ravikumar
In this paper, we present a design planning paradigm for the design of a wireless mobile transceiver. We consider the digital part in a single chip implementation of a transceiver based on the CDMA spread spectrum technique. The complexity of such a chip implementation makes the design process complex and very expensive. The desired characteristics of a mobile transceiver are low cost, small size, and low power. Design cost forms a major portion of total system cost. In order to reduce design cost, design completion time should be reduced. We assume hardware-software design flow for design of the transceiver. We analyze the design flow using the hierarchical concurrent flow graph (HCFG) approach. We illustrate, using AND and OR concurrent constructs of the HCFG approach, how the design process completion time can be reduced by employing concurrent design efforts. We also present an approach for completion time improvement which considers the sensitivity of completion time with respect to task completion time and probabilities. HCFG analysis facilitates a pre-execution "what-if" analysis to determine the suitable design flow which provides lowest process completion time.
{"title":"Design planning for single chip implementation of digital wireless mobile transceiver","authors":"V. Sahula, C. Ravikumar","doi":"10.1109/ICPWC.2000.905765","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905765","url":null,"abstract":"In this paper, we present a design planning paradigm for the design of a wireless mobile transceiver. We consider the digital part in a single chip implementation of a transceiver based on the CDMA spread spectrum technique. The complexity of such a chip implementation makes the design process complex and very expensive. The desired characteristics of a mobile transceiver are low cost, small size, and low power. Design cost forms a major portion of total system cost. In order to reduce design cost, design completion time should be reduced. We assume hardware-software design flow for design of the transceiver. We analyze the design flow using the hierarchical concurrent flow graph (HCFG) approach. We illustrate, using AND and OR concurrent constructs of the HCFG approach, how the design process completion time can be reduced by employing concurrent design efforts. We also present an approach for completion time improvement which considers the sensitivity of completion time with respect to task completion time and probabilities. HCFG analysis facilitates a pre-execution \"what-if\" analysis to determine the suitable design flow which provides lowest process completion time.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125420042","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905824
K. Rambabu, R. Rajagopal
This paper presents a novel hybrid beam steering scheme for mobile cellular applications. In this scheme, a linear equispaced sensor array of N antenna elements at the base station is used to form a fixed beam pattern in a fixed number of directions covering the cell area. In addition an adaptive pilot beam also is formed by using the same set of antenna elements whose direction can be made to be variable depending upon the traffic requirements. The advantages of the proposed scheme are illustrated by computer simulation results.
{"title":"Smart base station antenna","authors":"K. Rambabu, R. Rajagopal","doi":"10.1109/ICPWC.2000.905824","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905824","url":null,"abstract":"This paper presents a novel hybrid beam steering scheme for mobile cellular applications. In this scheme, a linear equispaced sensor array of N antenna elements at the base station is used to form a fixed beam pattern in a fixed number of directions covering the cell area. In addition an adaptive pilot beam also is formed by using the same set of antenna elements whose direction can be made to be variable depending upon the traffic requirements. The advantages of the proposed scheme are illustrated by computer simulation results.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123492751","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905816
P. Bhattacharjee, Debashis Saha, A. Mukherjee
The work deals with the problem of balancing traffic (load) amongst mobile switching centers (MSC) when the cluster of cells to be connected to an MSC is decided during the design of a personal communication services network (PCSN). Our aim is to assign cells to MSC in such a manner that the traffic handling capacity of each of the MSC is utilized uniformly, thereby precluding the possibility of unfairness in loading of MSC. This, in turn, makes all the MSC equally scalable against the increase in either the mobile user density or per user traffic. A conventional cell to switch assignment (CSA) algorithm attempts to optimize only the total cost, comprising cable cost and handoff cost, without taking into account the utilization of the traffic handling capacity of MSC. To obviate this limitation, we propose a new CSA algorithm with load balancing (CALB) which emphasizes equally on the load balancing as well as on cost optimization. CALB performs extremely well in balancing the traffic amongst the MSC present in the network thereby helping in increasing the overall scalability. although it outperforms CSA in terms of load balancing, it does so obviously at increased total cost (i.e., the solution obtained is a sub-optimal one in terms of cost only). But the increase in cost is never overwhelming (5%-14%) vis-a-vis the improvement in the system scalability (0.5%-19%).
研究了在设计个人通信业务网络(PCSN)过程中，当移动交换中心(MSC)连接的蜂窝群确定时，在移动交换中心(MSC)之间平衡流量(负载)的问题。我们的目标是以这样一种方式将单元分配给MSC，即每个MSC的流量处理能力被统一利用，从而排除了MSC加载不公平的可能性。反过来，这使得所有的MSC都可以针对移动用户密度或每个用户流量的增加进行同等的扩展。传统的cell to switch allocation (CSA)算法试图只优化总成本，包括电缆成本和切换成本，而不考虑MSC的流量处理能力的利用率。为了克服这一限制，我们提出了一种新的负载平衡(CALB) CSA算法，该算法同时强调负载平衡和成本优化。CALB在平衡网络中存在的MSC之间的流量方面表现得非常好，从而有助于提高整体可扩展性。虽然它在负载平衡方面优于CSA，但它显然是以增加的总成本为代价的(即，仅就成本而言，获得的解决方案是次优的)。但是，相对于系统可伸缩性的提高(0.5%-19%)，成本的增加从来都不是压倒性的(5%-14%)。
{"title":"CALB: a new cell-to-switch assignment algorithm with load balancing in the design of a personal communication services network (PCSN)","authors":"P. Bhattacharjee, Debashis Saha, A. Mukherjee","doi":"10.1109/ICPWC.2000.905816","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905816","url":null,"abstract":"The work deals with the problem of balancing traffic (load) amongst mobile switching centers (MSC) when the cluster of cells to be connected to an MSC is decided during the design of a personal communication services network (PCSN). Our aim is to assign cells to MSC in such a manner that the traffic handling capacity of each of the MSC is utilized uniformly, thereby precluding the possibility of unfairness in loading of MSC. This, in turn, makes all the MSC equally scalable against the increase in either the mobile user density or per user traffic. A conventional cell to switch assignment (CSA) algorithm attempts to optimize only the total cost, comprising cable cost and handoff cost, without taking into account the utilization of the traffic handling capacity of MSC. To obviate this limitation, we propose a new CSA algorithm with load balancing (CALB) which emphasizes equally on the load balancing as well as on cost optimization. CALB performs extremely well in balancing the traffic amongst the MSC present in the network thereby helping in increasing the overall scalability. although it outperforms CSA in terms of load balancing, it does so obviously at increased total cost (i.e., the solution obtained is a sub-optimal one in terms of cost only). But the increase in cost is never overwhelming (5%-14%) vis-a-vis the improvement in the system scalability (0.5%-19%).","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128838333","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905836
C. Elliott, B. Heile
Self-organizing, self-healing networks, also called "ad hoc" networks, are perhaps the most exciting new trend in networking research and development. Every node in such a network has sufficient intelligence to continuously sense and discover other nearby nodes, dynamically determine the optimal path for forwarding data packets from itself hop by hop through the network to any other node in the network, and automatically heal any ruptures in the network fabric that are caused by ongoing movement of the nodes themselves, changes in RF propagation, destruction of nodes, etc. In essence; one need merely launch such radio nodes into some space and they will not only organize themselves into a network but also adapt continuously to changes in the network's connectivity. The field is currently evolving at "Internet speed" - the first large-scale systems are now being fielded into the USA military and yet many of the field's research fundamentals are at present only very poorly understood. This paper begins with an example that introduces some of the fundamental issues for ad hoc networks (hidden terminals, channel access, mobility, scalability, and power constraints). It then discusses the two dominant approaches in current ad hoc networking technologies, "proactive" and "on-demand" path discovery, and compares the strengths and weaknesses of each approach. The paper then presents two brief case studies with which the authors were intimately involved - of a 400-node, terrestrial, vehicle-based system and of a high-capacity voice and data network deployed among drone aircraft - and concludes with highlights of the current research topics in the field.
{"title":"Self-organizing, self-healing wireless networks","authors":"C. Elliott, B. Heile","doi":"10.1109/ICPWC.2000.905836","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905836","url":null,"abstract":"Self-organizing, self-healing networks, also called \"ad hoc\" networks, are perhaps the most exciting new trend in networking research and development. Every node in such a network has sufficient intelligence to continuously sense and discover other nearby nodes, dynamically determine the optimal path for forwarding data packets from itself hop by hop through the network to any other node in the network, and automatically heal any ruptures in the network fabric that are caused by ongoing movement of the nodes themselves, changes in RF propagation, destruction of nodes, etc. In essence; one need merely launch such radio nodes into some space and they will not only organize themselves into a network but also adapt continuously to changes in the network's connectivity. The field is currently evolving at \"Internet speed\" - the first large-scale systems are now being fielded into the USA military and yet many of the field's research fundamentals are at present only very poorly understood. This paper begins with an example that introduces some of the fundamental issues for ad hoc networks (hidden terminals, channel access, mobility, scalability, and power constraints). It then discusses the two dominant approaches in current ad hoc networking technologies, \"proactive\" and \"on-demand\" path discovery, and compares the strengths and weaknesses of each approach. The paper then presents two brief case studies with which the authors were intimately involved - of a 400-node, terrestrial, vehicle-based system and of a high-capacity voice and data network deployed among drone aircraft - and concludes with highlights of the current research topics in the field.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482956","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905766
C. Giardina, A. Rudrapatna
Systems of quasi-Walsh functions are developed which simultaneously enable multiple access as well as secure communication and jamming resistance. In this system, a pseudo random sequence of diagonal isometries post multiplies a Hadamard matrix, thereby generating the orthogonal direct spreading sequences. Minimal mutual interference is a consequence of the resulting orthogonal spreading. Utilizing bit-by-bit distinct orthogonal codes gives the added benefit of high signal hiding capability and jamming resistance. An encoding scheme is presented which uniquely determines the actual quasi-Walsh system in use.
{"title":"Quasi-Walsh PN sequences and their applications in robust CDMA communication systems","authors":"C. Giardina, A. Rudrapatna","doi":"10.1109/ICPWC.2000.905766","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905766","url":null,"abstract":"Systems of quasi-Walsh functions are developed which simultaneously enable multiple access as well as secure communication and jamming resistance. In this system, a pseudo random sequence of diagonal isometries post multiplies a Hadamard matrix, thereby generating the orthogonal direct spreading sequences. Minimal mutual interference is a consequence of the resulting orthogonal spreading. Utilizing bit-by-bit distinct orthogonal codes gives the added benefit of high signal hiding capability and jamming resistance. An encoding scheme is presented which uniquely determines the actual quasi-Walsh system in use.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127173447","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 : 2000-12-17DOI: 10.1109/ICPWC.2000.905919
Adrish Banerjee, D. Costello, T. Fuja
In this paper, two classes of retransmission strategies in time-varying mobile radio channels are studied for bandwidth efficient hybrid-ARQ (HARQ) schemes using turbo coded modulation. These schemes combine the power efficiency of turbo codes with the bandwidth efficiency of trellis-coded modulation (TCM) to create an effective hybrid FEC/ARQ system. Different retransmission schemes provide a trade-off in terms of throughput, delay, implementation complexity, and error performance.
{"title":"Comparison of different retransmission strategies for bandwidth efficient hybrid ARQ schemes using turbo codes","authors":"Adrish Banerjee, D. Costello, T. Fuja","doi":"10.1109/ICPWC.2000.905919","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905919","url":null,"abstract":"In this paper, two classes of retransmission strategies in time-varying mobile radio channels are studied for bandwidth efficient hybrid-ARQ (HARQ) schemes using turbo coded modulation. These schemes combine the power efficiency of turbo codes with the bandwidth efficiency of trellis-coded modulation (TCM) to create an effective hybrid FEC/ARQ system. Different retransmission schemes provide a trade-off in terms of throughput, delay, implementation complexity, and error performance.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115367529","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
扫码关注我们
求助内容：
应助结果提醒方式：