Pub Date : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063607
Gilsoo Lee, Hongseok Kim
In this paper we study the energy efficiency maximization problem focused on finding a suitable set of turned-on small cell access points (APs). Since APs in small cells are randomly deployed and thus redundant in many cases, a mechanism of turning on/off APs is needed. We propose a device-assisted framework that exploits feedback messages from the user equipment (UE). To solve the problem, we apply the optimization method using belief propagation (BP) on a factor graph. Furthermore we propose an online algorithm inspired by BP, called DANCE that requires low computational complexity. Extensive simulations confirm that BP enhances energy efficiency significantly. Furthermore, simple but practical DANCE exhibits close performance to BP, and also better performance than other existing methods and the baseline.
{"title":"Green small cell operation using belief propagation in wireless networks","authors":"Gilsoo Lee, Hongseok Kim","doi":"10.1109/GLOCOMW.2014.7063607","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063607","url":null,"abstract":"In this paper we study the energy efficiency maximization problem focused on finding a suitable set of turned-on small cell access points (APs). Since APs in small cells are randomly deployed and thus redundant in many cases, a mechanism of turning on/off APs is needed. We propose a device-assisted framework that exploits feedback messages from the user equipment (UE). To solve the problem, we apply the optimization method using belief propagation (BP) on a factor graph. Furthermore we propose an online algorithm inspired by BP, called DANCE that requires low computational complexity. Extensive simulations confirm that BP enhances energy efficiency significantly. Furthermore, simple but practical DANCE exhibits close performance to BP, and also better performance than other existing methods and the baseline.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133772729","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063440
Daniel J. Robertson, Craig A. Shue, K. Venkatasubramanian, Curtis R. Taylor
Residential and small business customers often have need for high instantaneous download throughput for their Internet transactions which can exceed the throughput provided by the customer's Internet Service Provider (ISP). At the same time, these peak demand periods are relatively brief and may constitute only a few hours a day. During the non-peak periods, these customers have an unused Internet capacity that could be used by others. In this work, we propose and evaluate a bandwidth aggregation system for wireless routers. This system allows neighboring users to form bandwidth pools from the users' connections to their ISPs, allowing users to achieve aggregated instantaneous bandwidth. By transparently segmenting large Web requests, our approach avoids changes to the users' machines, ISPs, or remote servers. We implement and evaluate such a system and discuss related issues.
{"title":"Bandwidth aggregation in allied WiFi routers","authors":"Daniel J. Robertson, Craig A. Shue, K. Venkatasubramanian, Curtis R. Taylor","doi":"10.1109/GLOCOMW.2014.7063440","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063440","url":null,"abstract":"Residential and small business customers often have need for high instantaneous download throughput for their Internet transactions which can exceed the throughput provided by the customer's Internet Service Provider (ISP). At the same time, these peak demand periods are relatively brief and may constitute only a few hours a day. During the non-peak periods, these customers have an unused Internet capacity that could be used by others. In this work, we propose and evaluate a bandwidth aggregation system for wireless routers. This system allows neighboring users to form bandwidth pools from the users' connections to their ISPs, allowing users to achieve aggregated instantaneous bandwidth. By transparently segmenting large Web requests, our approach avoids changes to the users' machines, ISPs, or remote servers. We implement and evaluate such a system and discuss related issues.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133654971","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063520
K. Kerpez, G. Ginis, J. Cioffi, Stefano Galli
This paper introduces the over-arching concept of broadband virtualization. Standards in the arena of broadband virtualization are discussed, with an emphasis on new SDN and NFV projects in the IEEE and in the Broadband Forum. Tantalizing new prospects in this area are described in some detail: multi-tenant broadband control and management, utilizing multiple connections for broadband as a service (BaaS), traffic splitting, and the virtualized consumer environment.
{"title":"Virtualized broadband networking and standards in IEEE and broadband forum","authors":"K. Kerpez, G. Ginis, J. Cioffi, Stefano Galli","doi":"10.1109/GLOCOMW.2014.7063520","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063520","url":null,"abstract":"This paper introduces the over-arching concept of broadband virtualization. Standards in the arena of broadband virtualization are discussed, with an emphasis on new SDN and NFV projects in the IEEE and in the Broadband Forum. Tantalizing new prospects in this area are described in some detail: multi-tenant broadband control and management, utilizing multiple connections for broadband as a service (BaaS), traffic splitting, and the virtualized consumer environment.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132792152","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063384
A. Page, Övünç Kocabas, Scott Ames, Muthuramakrishnan Venkitasubramaniam, T. Soyata
There are many incentives for healthcare providers to shift their datacenters to the cloud. However, privacy of patient health information is a major concern when processing medical data off-site. One possible solution is the use of Fully Homomorphic Encryption (FHE), but this solution is too slow for most applications. We present a technique that increases efficiency and parallelism for certain algorithms under FHE. Through simulations, we demonstrate that our method yields about 20x speedup in a sample application. This is a significant step towards practical FHE-based medical remote monitoring.
{"title":"Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms","authors":"A. Page, Övünç Kocabas, Scott Ames, Muthuramakrishnan Venkitasubramaniam, T. Soyata","doi":"10.1109/GLOCOMW.2014.7063384","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063384","url":null,"abstract":"There are many incentives for healthcare providers to shift their datacenters to the cloud. However, privacy of patient health information is a major concern when processing medical data off-site. One possible solution is the use of Fully Homomorphic Encryption (FHE), but this solution is too slow for most applications. We present a technique that increases efficiency and parallelism for certain algorithms under FHE. Through simulations, we demonstrate that our method yields about 20x speedup in a sample application. This is a significant step towards practical FHE-based medical remote monitoring.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116781193","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063551
Tzu-Yueh Tseng, Chung-Pi Lee, Shih-Chun Lin, Hsuan-Jung Su
Relay-aided multiuser communications are crucial for future 5G systems. In this paper, we consider the two-user multiple access relay channel (MARC), in which two users transmit messages to a common destination with the assistance of a half-duplex relay. The decode-and-forward (DF) based lattice coding was shown to be effective for the MARC in our previous work [1]. However when the links from the users to the relay are weak, DF protocol may fail to decode all users at the relay. Aiming to solve this problem, we propose a new lattice coding where the relay only needs to decode an integer-weighted-sum of users' lattice codewords, re-maps it with a modulo-based mapper and then forwards the corresponding codeword. Although the decoding at the relay is akin to the orthogonal compute-and-forward protocol, we relax the restriction imposed by previous works that the users have to be silent when the relay is transmitting to avoid interference. The key ingredient is the joint multi-user lattice decoding performed at the destination. This jointly decoding strategy not only complicates the corresponding code design but also the error analysis. To find the proper integer-weighted-sum at the relay for the destination's joint decoder, we also solve a non-convex integer problem by carefully transforming and relaxing it to a convex one. Simulation results show that the proposed non-orthogonal lattice coding can outperform existing schemes in a variety of channel settings.
{"title":"Non-orthogonal compute-and-forward with joint lattice decoding for the multiple-access relay channel","authors":"Tzu-Yueh Tseng, Chung-Pi Lee, Shih-Chun Lin, Hsuan-Jung Su","doi":"10.1109/GLOCOMW.2014.7063551","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063551","url":null,"abstract":"Relay-aided multiuser communications are crucial for future 5G systems. In this paper, we consider the two-user multiple access relay channel (MARC), in which two users transmit messages to a common destination with the assistance of a half-duplex relay. The decode-and-forward (DF) based lattice coding was shown to be effective for the MARC in our previous work [1]. However when the links from the users to the relay are weak, DF protocol may fail to decode all users at the relay. Aiming to solve this problem, we propose a new lattice coding where the relay only needs to decode an integer-weighted-sum of users' lattice codewords, re-maps it with a modulo-based mapper and then forwards the corresponding codeword. Although the decoding at the relay is akin to the orthogonal compute-and-forward protocol, we relax the restriction imposed by previous works that the users have to be silent when the relay is transmitting to avoid interference. The key ingredient is the joint multi-user lattice decoding performed at the destination. This jointly decoding strategy not only complicates the corresponding code design but also the error analysis. To find the proper integer-weighted-sum at the relay for the destination's joint decoder, we also solve a non-convex integer problem by carefully transforming and relaxing it to a convex one. Simulation results show that the proposed non-orthogonal lattice coding can outperform existing schemes in a variety of channel settings.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121906640","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063600
Li Zhou, Rukhsana Ruby, Haitao Zhao, Xiaoting Ji, Jibo Wei, Victor C. M. Leung
We present a novel graph-based resource allocation and interference coordination framework to mitigate downlink interference in small cell networks. In our scheme, two types of clusters from the original network are generated, namely cell-cluster and user-cluster. We first divide small cells into cell-clusters according to their neighboring relationships in the network and examine the network morphology under different neighborhood bounds. Then we develop another graph clustering scheme to group the users in each cell-cluster into user-clusters with minimum intra-cluster interference. Finally, we employ a proportional fair scheduling scheme to assign subchannels among the user-clusters and allocate power using water-filling method. The simulation results show that our method achieves a significant improvement in spectral efficiency compared to previous works under both co-channel and orthogonal deployments.
{"title":"A graph-based resource allocation scheme with interference coordination in small cell networks","authors":"Li Zhou, Rukhsana Ruby, Haitao Zhao, Xiaoting Ji, Jibo Wei, Victor C. M. Leung","doi":"10.1109/GLOCOMW.2014.7063600","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063600","url":null,"abstract":"We present a novel graph-based resource allocation and interference coordination framework to mitigate downlink interference in small cell networks. In our scheme, two types of clusters from the original network are generated, namely cell-cluster and user-cluster. We first divide small cells into cell-clusters according to their neighboring relationships in the network and examine the network morphology under different neighborhood bounds. Then we develop another graph clustering scheme to group the users in each cell-cluster into user-clusters with minimum intra-cluster interference. Finally, we employ a proportional fair scheduling scheme to assign subchannels among the user-clusters and allocate power using water-filling method. The simulation results show that our method achieves a significant improvement in spectral efficiency compared to previous works under both co-channel and orthogonal deployments.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833070","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063563
Daixu Zheng, Yongyu Chang, Rongqian Qin, Haoman Xu, Dacheng Yang
Multi-user multiple-input and multiple-output (MU-MIMO) transmission scheme, which provides extra spectral efficiency, is one of the most potential technologies in Third Generation Partnership Project Long Term Evolution (3GPP LTE) system. Because of a low resolution precoder and the coarse knowledge of channel state information (CSI), interference among co-scheduled user equipments (UEs) is inescapable. In this paper, we propose an interference aware strategy to mitigate the interference. To achieve an intended result, we formulate functions corresponding to signal detection and gain insight into some interference cancelation schemes. The acknowledged optimal receiver applying Max-Log-Likelihood (ML) criterion is our original springboard. Considering that ML criterion is restricted by its unacceptable computational effort, we suggest to estimate the modulation type of interference before the detection. So a simplified method named table look-up scheme (TLS) is brought into. Then we discuss the necessity of TLS and provide relevant proofs to show its feasibility. Finally, simulation results show that our TLS assisted ML (TLS-ML) criterion outperforms those conventional ones.
{"title":"Advanced downlink MU-MIMO receiver based on modulation classification","authors":"Daixu Zheng, Yongyu Chang, Rongqian Qin, Haoman Xu, Dacheng Yang","doi":"10.1109/GLOCOMW.2014.7063563","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063563","url":null,"abstract":"Multi-user multiple-input and multiple-output (MU-MIMO) transmission scheme, which provides extra spectral efficiency, is one of the most potential technologies in Third Generation Partnership Project Long Term Evolution (3GPP LTE) system. Because of a low resolution precoder and the coarse knowledge of channel state information (CSI), interference among co-scheduled user equipments (UEs) is inescapable. In this paper, we propose an interference aware strategy to mitigate the interference. To achieve an intended result, we formulate functions corresponding to signal detection and gain insight into some interference cancelation schemes. The acknowledged optimal receiver applying Max-Log-Likelihood (ML) criterion is our original springboard. Considering that ML criterion is restricted by its unacceptable computational effort, we suggest to estimate the modulation type of interference before the detection. So a simplified method named table look-up scheme (TLS) is brought into. Then we discuss the necessity of TLS and provide relevant proofs to show its feasibility. Finally, simulation results show that our TLS assisted ML (TLS-ML) criterion outperforms those conventional ones.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122333619","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063608
S. Banani, A. Eckford, R. Adve, alireza. banani
Base station (BS) locations are usually modelled using one of two extremes: at one end is a deterministic, hexagonal, location model; while at the other is a random deployment following a Poisson point process (PPP). However, real-world networks follow neither extreme; as such, in this paper, we focus on a modified perturbed hexagonal lattice model that, in terms of regularity, lies in between the PPP and the perfect hexagonal lattice models. In our modified perturbed hexagonal lattice, the location of all interfering BSs, except for the serving BS under consideration, are perturbed. We provide a simple and tight upper bound on the average total interference in an interference-limited reuse-1 network. The bound is presented in the form of a polynomial in the distance from the serving BS and another polynomial in the normalized perturbation. The presented formulation is useful in obtaining simple analytical expressions for various network parameters such as SIR and/or coverage probability. As an added benefit, the formulations here quantify the loss in the coverage probability in moving from the perfect lattice model to a random BS deployment. We use simulations to illustrate the accuracy of the theory developed.
{"title":"The penalty for random deployment in hexagonal lattice networks with perturbed interferers","authors":"S. Banani, A. Eckford, R. Adve, alireza. banani","doi":"10.1109/GLOCOMW.2014.7063608","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063608","url":null,"abstract":"Base station (BS) locations are usually modelled using one of two extremes: at one end is a deterministic, hexagonal, location model; while at the other is a random deployment following a Poisson point process (PPP). However, real-world networks follow neither extreme; as such, in this paper, we focus on a modified perturbed hexagonal lattice model that, in terms of regularity, lies in between the PPP and the perfect hexagonal lattice models. In our modified perturbed hexagonal lattice, the location of all interfering BSs, except for the serving BS under consideration, are perturbed. We provide a simple and tight upper bound on the average total interference in an interference-limited reuse-1 network. The bound is presented in the form of a polynomial in the distance from the serving BS and another polynomial in the normalized perturbation. The presented formulation is useful in obtaining simple analytical expressions for various network parameters such as SIR and/or coverage probability. As an added benefit, the formulations here quantify the loss in the coverage probability in moving from the perfect lattice model to a random BS deployment. We use simulations to illustrate the accuracy of the theory developed.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738290","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063543
H. Sahlin, S. Parkvall, M. Frenne, P. Nauclér
The computational complexity of FFT (Fast Fourier Transform) processing in an OFDM (Orthogonal Frequency Division Multiplex) based receiver is large with a large amount of receiver antennas. In LTE (Long Term Evolution) release 8, FFTs of different size are used for user data and random-access preambles [1] requiring additional FFTs to be implemented for random-access reception. Within the current paper, a 5G random-access preamble format is proposed based on a short sequence of the same length as the length of the OFDM symbols that are used for other uplink physical channels, such as user data, control signaling, and reference signals. The preamble sequence is constructed by repeating the short sequence multiple times. A corresponding preamble detector in which FFTs of the same size as for other uplink channels and signals are used is also described. In this way, the amount of special random-access related processing and hardware support is significantly reduced for multi-antenna systems with frequency-domain beamforming. This preamble detector is also robust against inter-carrier interference from other uplink channels and signals. Furthermore, the proposed preamble detector scheme can be used in 5G scenarios with a high amount of phase noise and frequency errors. For time-domain beamforming, the beamforming weights can be changed during preamble reception such that the number of spatial directions is increased for which preamble detection is done. Simulation results are used to compare preamble formats for different lengths of the sequences.
{"title":"Random access preamble format for systems with many antennas","authors":"H. Sahlin, S. Parkvall, M. Frenne, P. Nauclér","doi":"10.1109/GLOCOMW.2014.7063543","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063543","url":null,"abstract":"The computational complexity of FFT (Fast Fourier Transform) processing in an OFDM (Orthogonal Frequency Division Multiplex) based receiver is large with a large amount of receiver antennas. In LTE (Long Term Evolution) release 8, FFTs of different size are used for user data and random-access preambles [1] requiring additional FFTs to be implemented for random-access reception. Within the current paper, a 5G random-access preamble format is proposed based on a short sequence of the same length as the length of the OFDM symbols that are used for other uplink physical channels, such as user data, control signaling, and reference signals. The preamble sequence is constructed by repeating the short sequence multiple times. A corresponding preamble detector in which FFTs of the same size as for other uplink channels and signals are used is also described. In this way, the amount of special random-access related processing and hardware support is significantly reduced for multi-antenna systems with frequency-domain beamforming. This preamble detector is also robust against inter-carrier interference from other uplink channels and signals. Furthermore, the proposed preamble detector scheme can be used in 5G scenarios with a high amount of phase noise and frequency errors. For time-domain beamforming, the beamforming weights can be changed during preamble reception such that the number of spatial directions is increased for which preamble detection is done. Simulation results are used to compare preamble formats for different lengths of the sequences.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923109","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063464
Linlin Fan, Yabo Li, Minjian Zhao
Due to the demands for high data rate and high energy efficiency, Millimeter-Wave (mmWave) communication systems have drawn a lot of attention recently. The mmWave transceivers are usually highly integrated but have severe RF impairments. Thus, to design pre-distortion schemes, it is difficult to pre-distort each RF component separately. In this paper, we consider joint IQ (In-phase and Quadrature) imbalance and PA (Power Amplifier) nonlinearity pre-distortion designs for mmWave transmitters. In the designs, we treat the transmitter as a whole and only process the baseband input and PA output. We propose two methods, one is the two-step design, where the IQ imbalance and PA nonlinearity are pre-distorted in two-steps with a unified training structure. The other is the one-step design, where we first derive the model that can jointly characterize IQ imbalance and PA nonlinearity, then one block is used to pre-distort the both. We also show that decreasing the number of coefficients properly can decrease the computational complexity without significant loss in performance.
{"title":"Joint IQ imbalance and PA nonlinearity pre-distortion for highly integrated millimeter-wave transmitters","authors":"Linlin Fan, Yabo Li, Minjian Zhao","doi":"10.1109/GLOCOMW.2014.7063464","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063464","url":null,"abstract":"Due to the demands for high data rate and high energy efficiency, Millimeter-Wave (mmWave) communication systems have drawn a lot of attention recently. The mmWave transceivers are usually highly integrated but have severe RF impairments. Thus, to design pre-distortion schemes, it is difficult to pre-distort each RF component separately. In this paper, we consider joint IQ (In-phase and Quadrature) imbalance and PA (Power Amplifier) nonlinearity pre-distortion designs for mmWave transmitters. In the designs, we treat the transmitter as a whole and only process the baseband input and PA output. We propose two methods, one is the two-step design, where the IQ imbalance and PA nonlinearity are pre-distorted in two-steps with a unified training structure. The other is the one-step design, where we first derive the model that can jointly characterize IQ imbalance and PA nonlinearity, then one block is used to pre-distort the both. We also show that decreasing the number of coefficients properly can decrease the computational complexity without significant loss in performance.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125157679","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
扫码关注我们
求助内容：
应助结果提醒方式：