Pub Date : 2007-11-15DOI: 10.1109/SCVT.2007.4625212
V. Rodriguez, F. Jondral
The Dutch auction (the price progressively falls until a buyer "takes" the object) is proposed as a foundation for decentralised medium-access control. Common auction formats are well-understood, relatively simple mechanism which have long been used for allocating an indivisible good to the party that values it the most, for such reasons as speed of allocation, discovery of the true "value" of the object, and fraud prevention. Various auction schemes have been proposed for the allocation of telecommunication resources, including medium access control (MAC). But previously proposals require a controller, and, to receive the bids, an alternate protocol which could waste resources, or miss important bids. For MAC, the Dutch auction has several major virtues: (i) a bid-processing protocol that automatically and simply prioritises the highest bid(s); (ii) possibility of distributive (auctioneer-free) implementation for synchronised terminals; (iii) confirmation of transmitter-receiver pairs at auction time, with smooth continuation if the pair is infeasible; (iv) exceptional signalling economy (the only strictly necessary signal is the winning bid). Secure software inside each terminal may record transactions for eventual payment collection, or the auction can be used as a prioritised-access algorithm, without real money exchange. Below we evaluate qualitatively the MAC potential of this auction, emphasising the distributed version, which can arbitrate medium access among synchronised terminals in an infrastructureless network.
{"title":"Simple adaptively-prioritised spatially-reusable medium access control through the Dutch auction: Qualitative analysis, issues, challenges","authors":"V. Rodriguez, F. Jondral","doi":"10.1109/SCVT.2007.4625212","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4625212","url":null,"abstract":"The Dutch auction (the price progressively falls until a buyer \"takes\" the object) is proposed as a foundation for decentralised medium-access control. Common auction formats are well-understood, relatively simple mechanism which have long been used for allocating an indivisible good to the party that values it the most, for such reasons as speed of allocation, discovery of the true \"value\" of the object, and fraud prevention. Various auction schemes have been proposed for the allocation of telecommunication resources, including medium access control (MAC). But previously proposals require a controller, and, to receive the bids, an alternate protocol which could waste resources, or miss important bids. For MAC, the Dutch auction has several major virtues: (i) a bid-processing protocol that automatically and simply prioritises the highest bid(s); (ii) possibility of distributive (auctioneer-free) implementation for synchronised terminals; (iii) confirmation of transmitter-receiver pairs at auction time, with smooth continuation if the pair is infeasible; (iv) exceptional signalling economy (the only strictly necessary signal is the winning bid). Secure software inside each terminal may record transactions for eventual payment collection, or the auction can be used as a prioritised-access algorithm, without real money exchange. Below we evaluate qualitatively the MAC potential of this auction, emphasising the distributed version, which can arbitrate medium access among synchronised terminals in an infrastructureless network.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132852521","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 : 2007-11-15DOI: 10.1109/SCVT.2007.4436250
R. Meijerink, A. Meijerink, D. Marpaung, C. Roeloffzen, W. van Etten
A broadband, continuously tunable receiver system for phased array antennas is described. It uses a ring resonator-based optical beamforming network, filter-based optical SSB-SC modulation and balanced coherent detection. The system is modeled as an equivalent RF two-port system and its performance is analyzed, identifying and modeling dominant noise and distortion sources. Numerical theoretical performance results are reported for a satellite television case study, based on DVB-S.
{"title":"Performance Study of a Ring Resonator-Based Optical Beam Forming System for Phased Array Receive Antennas","authors":"R. Meijerink, A. Meijerink, D. Marpaung, C. Roeloffzen, W. van Etten","doi":"10.1109/SCVT.2007.4436250","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436250","url":null,"abstract":"A broadband, continuously tunable receiver system for phased array antennas is described. It uses a ring resonator-based optical beamforming network, filter-based optical SSB-SC modulation and balanced coherent detection. The system is modeled as an equivalent RF two-port system and its performance is analyzed, identifying and modeling dominant noise and distortion sources. Numerical theoretical performance results are reported for a satellite television case study, based on DVB-S.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121526816","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436257
V. Rodriguez, F. Jondral
The Dutch auction (the price progressively falls until a buyer "takes" the object) is proposed as a foundation for decentralised medium-access control. Common auction formats are well-understood, relatively simple mechanism which have long been used for allocating an indivisible good to the party that values it the most, for such reasons as speed of allocation, discovery of the true "value" of the object, and fraud prevention. Various auction schemes have been proposed for the allocation of telecommunication resources, including medium access control (MAC). But previously proposals require a controller, and, to receive the bids, an alternate protocol which could waste resources, or miss important bids. For MAC, the Dutch auction has several major virtues: (i) a bid-processing protocol that automatically and simply priorities the highest bid(s); (ii) possibility of distributive (auctioneer-free) implementation for synchronised terminals; (iii) confirmation of transmitter-receiver pairs at auction time, with smooth continuation if the pair is infeasible; (iv) exceptional signalling economy (the only strictly necessary signal is the winning bid). Secure software inside each terminal may record transactions for eventual payment collection, or the auction can be used as a prioritised-access algorithm, without real money exchange. Below we evaluate qualitatively the MAC potential of this auction, emphasising the distributed version, which can control access with spatial reuse in a wireless adhoc environment.
{"title":"Simple, adaptively-prioritised, spatially-reusable medium access control through the Dutch auction, with decentralised implementation for synchronised terminals","authors":"V. Rodriguez, F. Jondral","doi":"10.1109/SCVT.2007.4436257","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436257","url":null,"abstract":"The Dutch auction (the price progressively falls until a buyer \"takes\" the object) is proposed as a foundation for decentralised medium-access control. Common auction formats are well-understood, relatively simple mechanism which have long been used for allocating an indivisible good to the party that values it the most, for such reasons as speed of allocation, discovery of the true \"value\" of the object, and fraud prevention. Various auction schemes have been proposed for the allocation of telecommunication resources, including medium access control (MAC). But previously proposals require a controller, and, to receive the bids, an alternate protocol which could waste resources, or miss important bids. For MAC, the Dutch auction has several major virtues: (i) a bid-processing protocol that automatically and simply priorities the highest bid(s); (ii) possibility of distributive (auctioneer-free) implementation for synchronised terminals; (iii) confirmation of transmitter-receiver pairs at auction time, with smooth continuation if the pair is infeasible; (iv) exceptional signalling economy (the only strictly necessary signal is the winning bid). Secure software inside each terminal may record transactions for eventual payment collection, or the auction can be used as a prioritised-access algorithm, without real money exchange. Below we evaluate qualitatively the MAC potential of this auction, emphasising the distributed version, which can control access with spatial reuse in a wireless adhoc environment.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"21 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995582","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436240
F. Brah, L. Vandendorpe, J. Louveaux
Adaptive resource allocation has been shown to provide substantial performance gain in OFDMA based wireless systems when perfect channel state information (CSI) is available at the transmitter. However, perfect CSI at the transmitter (CSIT) is rarely possible due to channel estimation errors and channel feedback delay. In this paper, we consider practical resource allocation strategies for downlink multiuser OFDMA systems, where the base station has imperfect CSI. We address the problem of subchannel assignment and power allocation, to maximize the ergodic sum utility under QoS, fairness and total power constraints. This constrained optimization problem is formulated as a non-convex finite dimensional stochastic problem. We use Lagrange dual decomposition framework to derive an algorithm that efficiently finds the optimal allocation. Simulation results show the impact of the channel estimation error on the performance of the system and illustrate the trade-off between maximized utility and the constraints.
{"title":"OFDMA Constrained Resource Allocation with imperfect Channel Knowledge","authors":"F. Brah, L. Vandendorpe, J. Louveaux","doi":"10.1109/SCVT.2007.4436240","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436240","url":null,"abstract":"Adaptive resource allocation has been shown to provide substantial performance gain in OFDMA based wireless systems when perfect channel state information (CSI) is available at the transmitter. However, perfect CSI at the transmitter (CSIT) is rarely possible due to channel estimation errors and channel feedback delay. In this paper, we consider practical resource allocation strategies for downlink multiuser OFDMA systems, where the base station has imperfect CSI. We address the problem of subchannel assignment and power allocation, to maximize the ergodic sum utility under QoS, fairness and total power constraints. This constrained optimization problem is formulated as a non-convex finite dimensional stochastic problem. We use Lagrange dual decomposition framework to derive an algorithm that efficiently finds the optimal allocation. Simulation results show the impact of the channel estimation error on the performance of the system and illustrate the trade-off between maximized utility and the constraints.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526290","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436237
W. Yuan, Xiangyu Wang, J. Linnartz
IEEE 802.15.4 was developed to meet the needs for low-rate wireless communication. However, due to its low power, IEEE 802.15.4 is potentially vulnerable to interference by other wireless technologies having much higher power and working in the same industrial, scientific, and medical (ISM) band such as IEEE 802.11 b/g. The paper therefore focuses on the coexistence impact of IEEE 802.11 b/g on the IEEE 802.15.4. In this paper, we present a coexistence model of IEEE 802.15.4 and IEEE 802.11 b/g, which exposes the interactive behavior between these two standards and therefore accurately explains their coexistence performance. The model focuses on two aspects, namely power and timing. These two aspects jointly impose different impacts on the performance of IEEE 802.15.4 networks, depending on coexistence situations. To classify the coexistence situations, we introduce a concept of coexistence range, by extending the concept of sensing and interference ranges across different wireless standards. We characterize the coexistence behavior in each coexistence range and identify for each range the underlying coexistence mechanism and protocol interactions. Analytical models are proposed for the case of saturated traffic and simulation results are presented to validate the model.
{"title":"A Coexistence Model of IEEE 802.15.4 and IEEE 802.11b/g","authors":"W. Yuan, Xiangyu Wang, J. Linnartz","doi":"10.1109/SCVT.2007.4436237","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436237","url":null,"abstract":"IEEE 802.15.4 was developed to meet the needs for low-rate wireless communication. However, due to its low power, IEEE 802.15.4 is potentially vulnerable to interference by other wireless technologies having much higher power and working in the same industrial, scientific, and medical (ISM) band such as IEEE 802.11 b/g. The paper therefore focuses on the coexistence impact of IEEE 802.11 b/g on the IEEE 802.15.4. In this paper, we present a coexistence model of IEEE 802.15.4 and IEEE 802.11 b/g, which exposes the interactive behavior between these two standards and therefore accurately explains their coexistence performance. The model focuses on two aspects, namely power and timing. These two aspects jointly impose different impacts on the performance of IEEE 802.15.4 networks, depending on coexistence situations. To classify the coexistence situations, we introduce a concept of coexistence range, by extending the concept of sensing and interference ranges across different wireless standards. We characterize the coexistence behavior in each coexistence range and identify for each range the underlying coexistence mechanism and protocol interactions. Analytical models are proposed for the case of saturated traffic and simulation results are presented to validate the model.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129775900","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436252
S. Petridou, P. Sarigiannidis, G. Papadimitriou, A. Pomportsis
Message sequencing and channel assignment are two important issues that have to be addressed when designing MAC protocols for optical Wavelength division multiplexing (WDM) networks. Up to now, popular approaches deal with channel assignment without however addressing the order in which the messages are scheduled. This paper presents a new reservation-based message scheduling algorithm for WDM star networks which is based on clustering techniques. The proposed clustering oriented-earliest available time scheduling (CO-EATS) creates groups of nodes whose messages are destined to common destination nodes. The goal of CO-EATS is to prevent consecutive messages from being destined to the same node. The simulation results have shown that the proposed scheme improves channel utilization and as a result it leads to higher network throughput while it keeps mean packet delay at low levels in comparison with conventional scheduling algorithms.
{"title":"An Efficient Clustering Oriented Algorithm for Message Scheduling on WDM Star Networks","authors":"S. Petridou, P. Sarigiannidis, G. Papadimitriou, A. Pomportsis","doi":"10.1109/SCVT.2007.4436252","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436252","url":null,"abstract":"Message sequencing and channel assignment are two important issues that have to be addressed when designing MAC protocols for optical Wavelength division multiplexing (WDM) networks. Up to now, popular approaches deal with channel assignment without however addressing the order in which the messages are scheduled. This paper presents a new reservation-based message scheduling algorithm for WDM star networks which is based on clustering techniques. The proposed clustering oriented-earliest available time scheduling (CO-EATS) creates groups of nodes whose messages are destined to common destination nodes. The goal of CO-EATS is to prevent consecutive messages from being destined to the same node. The simulation results have shown that the proposed scheme improves channel utilization and as a result it leads to higher network throughput while it keeps mean packet delay at low levels in comparison with conventional scheduling algorithms.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131704007","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436234
C. Papazoglou, P. Sarigiannidis, G. Papadimitriou, A. Pomportsis
This paper presents a new scheduling protocol for WDM star networks. The new protocol (Priority Scheme Earliest Available Time Scheduling -PS-EATS) is based on the previously proposed EATS protocol which assigns the earliest available data channel to each node that has a message to transmit. PS-EATS modifies the order in which the nodes' requests are processed and allows long messages to be processed ahead of shorter ones. Simulation results show that PS-EATS improves network performance in terms of throughput and also marginally reduces the mean packet delay.
{"title":"A New Priority Scheme for WDM Star Networks","authors":"C. Papazoglou, P. Sarigiannidis, G. Papadimitriou, A. Pomportsis","doi":"10.1109/SCVT.2007.4436234","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436234","url":null,"abstract":"This paper presents a new scheduling protocol for WDM star networks. The new protocol (Priority Scheme Earliest Available Time Scheduling -PS-EATS) is based on the previously proposed EATS protocol which assigns the earliest available data channel to each node that has a message to transmit. PS-EATS modifies the order in which the nodes' requests are processed and allows long messages to be processed ahead of shorter ones. Simulation results show that PS-EATS improves network performance in terms of throughput and also marginally reduces the mean packet delay.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"57 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131672124","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436236
L. Vandendorpe, R. T. Duran, J. Louveaux, A. Zaidi
In this paper we consider an OFDM (orthogonal frequency division multiplexing) transmission scheme with a relay. Symbols sent by the source may or may not be retransmitted during a second time slot by the relay, which is assumed to be of the decode-and-forward (DF) type. For each carrier the destination implements maximum ratio combining. Assuming perfect CSI (channel state information) knowledge the paper investigates the power allocation problem for rate maximization of the scheme. Both cases of a sum power constraint, and of individual power constraints at the source and at the relay are tackled. The theoretical analysis is illustrated by numerical results for both types of constraints.
{"title":"Power allocation for OFDM transmisson with DF relaying","authors":"L. Vandendorpe, R. T. Duran, J. Louveaux, A. Zaidi","doi":"10.1109/SCVT.2007.4436236","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436236","url":null,"abstract":"In this paper we consider an OFDM (orthogonal frequency division multiplexing) transmission scheme with a relay. Symbols sent by the source may or may not be retransmitted during a second time slot by the relay, which is assumed to be of the decode-and-forward (DF) type. For each carrier the destination implements maximum ratio combining. Assuming perfect CSI (channel state information) knowledge the paper investigates the power allocation problem for rate maximization of the scheme. Both cases of a sum power constraint, and of individual power constraints at the source and at the relay are tackled. The theoretical analysis is illustrated by numerical results for both types of constraints.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987849","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436254
S. S. Dhillon, Y. Zhou
The topology of ad hoc networks is critical in determining the performance of routing algorithms, capacity and lifetime of ad hoc networks. In this paper, we study the impact of different signal propagation models on topology, routing and lifetime of ad hoc networks. Moreover, we also study shortest path routing based on metrics such as distance and hopcount. Our analysis shows that shortest path routing based on hopcount leads to a better load balancing than shortest path routing based on distance. However, the lifetime of network increases when distance is used as a metric for shortest path routing.
{"title":"Topology, shortest path routing and lifetime of ad hoc networks","authors":"S. S. Dhillon, Y. Zhou","doi":"10.1109/SCVT.2007.4436254","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436254","url":null,"abstract":"The topology of ad hoc networks is critical in determining the performance of routing algorithms, capacity and lifetime of ad hoc networks. In this paper, we study the impact of different signal propagation models on topology, routing and lifetime of ad hoc networks. Moreover, we also study shortest path routing based on metrics such as distance and hopcount. Our analysis shows that shortest path routing based on hopcount leads to a better load balancing than shortest path routing based on distance. However, the lifetime of network increases when distance is used as a metric for shortest path routing.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122936268","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 : 2007-11-01DOI: 10.1109/SCVT.2007.4436243
C. Dehos, T. Schenk
In order to enable efficient implementation of wireless systems with high signal dynamics, this paper proposes an approach to estimate and correct for the amplitude and phase distortion caused by nonlinear power amplifiers. The approach comprises a preamble design, an estimation method and a digital compensation algorithm. Correction for the nonlinearities is applied in the receiver, which requires no additional hardware. Performance evaluation of a 60 GHz OFDM-based system shows that the proposed approach can successfully be applied with minimal performance degradation compared to non-impaired systems.
{"title":"Digital Compensation of Amplifier Nonlinearities in the Receiver of a Wireless System","authors":"C. Dehos, T. Schenk","doi":"10.1109/SCVT.2007.4436243","DOIUrl":"https://doi.org/10.1109/SCVT.2007.4436243","url":null,"abstract":"In order to enable efficient implementation of wireless systems with high signal dynamics, this paper proposes an approach to estimate and correct for the amplitude and phase distortion caused by nonlinear power amplifiers. The approach comprises a preamble design, an estimation method and a digital compensation algorithm. Correction for the nonlinearities is applied in the receiver, which requires no additional hardware. Performance evaluation of a 60 GHz OFDM-based system shows that the proposed approach can successfully be applied with minimal performance degradation compared to non-impaired systems.","PeriodicalId":224906,"journal":{"name":"2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134600608","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
扫码关注我们
求助内容：
应助结果提醒方式：