Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655647
Ravikumar Balakrishnan, B. Canberk, I. Akyildiz
Smallcell technology is gaining significance as part of the next-generation cellular systems due to their performance benefits in terms of increased network capacity and improved indoor and local coverage. Hybrid access smallcells, which provide service to both indoor as well as neighboring users, adopt adhoc policies to guarantee performance benefits to indoor home users in the presence of external neighboring users. Such policies must be able to stabilize user queues as well as to provision performance benefits in terms of delay and throughput, especially for the indoor users. As a result, classification of user data in terms of traffic type and user type is required to effectively achieve the differentiated QoS performance. In this paper, a traffic-aware utility function is proposed, which takes into account for the user's priority index and traffic characteristics to efficiently provide differentiated QoS benefits to users served under an OFDMA hybrid smallcell. The problem of the traffic-aware utility based scheduling under power constraints is posed as an optimization objective and an optimal algorithm for the scheduling problem is presented. The results show that the proposed scheme achieves QoS performance benefits in terms of throughput and delay.
{"title":"Traffic-aware utility based QoS provisioning in OFDMA hybrid smallcells","authors":"Ravikumar Balakrishnan, B. Canberk, I. Akyildiz","doi":"10.1109/ICC.2013.6655647","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655647","url":null,"abstract":"Smallcell technology is gaining significance as part of the next-generation cellular systems due to their performance benefits in terms of increased network capacity and improved indoor and local coverage. Hybrid access smallcells, which provide service to both indoor as well as neighboring users, adopt adhoc policies to guarantee performance benefits to indoor home users in the presence of external neighboring users. Such policies must be able to stabilize user queues as well as to provision performance benefits in terms of delay and throughput, especially for the indoor users. As a result, classification of user data in terms of traffic type and user type is required to effectively achieve the differentiated QoS performance. In this paper, a traffic-aware utility function is proposed, which takes into account for the user's priority index and traffic characteristics to efficiently provide differentiated QoS benefits to users served under an OFDMA hybrid smallcell. The problem of the traffic-aware utility based scheduling under power constraints is posed as an optimization objective and an optimal algorithm for the scheduling problem is presented. The results show that the proposed scheme achieves QoS performance benefits in terms of throughput and delay.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"33 1","pages":"6464-6468"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82568763","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655247
U. U. Fayyaz, J. Barry
We describe an error-correcting system that combines polar codes with turbo equalization for partial response channels. The successive cancellation decoder, originally proposed by Arikan for polar codes, does not produce the soft outputs needed for turbo processing. The belief propagation decoder, on the other hand, requires many iterations and has high computational complexity. In this paper, we propose a soft-input soft-output variant of the successive cancellation decoder that produces the soft information required for turbo architectures, while keeping the computational complexity low. Numerical results show that the proposed decoder performs better than the hard-output successive cancellation decoder and the belief propagation decoder in the context of turbo equalization. The proposed decoder achieves this performance gain with lower complexity compared to belief propagation and maximum-likelihood decoders. Additionally, we prove that Arikan's successive cancellation decoder is a fast-polarizing instance of our soft-input soft-output successive cancellation decoder.
{"title":"Polar codes for partial response channels","authors":"U. U. Fayyaz, J. Barry","doi":"10.1109/ICC.2013.6655247","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655247","url":null,"abstract":"We describe an error-correcting system that combines polar codes with turbo equalization for partial response channels. The successive cancellation decoder, originally proposed by Arikan for polar codes, does not produce the soft outputs needed for turbo processing. The belief propagation decoder, on the other hand, requires many iterations and has high computational complexity. In this paper, we propose a soft-input soft-output variant of the successive cancellation decoder that produces the soft information required for turbo architectures, while keeping the computational complexity low. Numerical results show that the proposed decoder performs better than the hard-output successive cancellation decoder and the belief propagation decoder in the context of turbo equalization. The proposed decoder achieves this performance gain with lower complexity compared to belief propagation and maximum-likelihood decoders. Additionally, we prove that Arikan's successive cancellation decoder is a fast-polarizing instance of our soft-input soft-output successive cancellation decoder.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"58 1","pages":"4337-4341"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82306466","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655177
Zeyu Liu, G. Rouskas
We present a scalable formulation for the traffic grooming problem in WDM ring networks. Specifically, we modify the ILP formulation to replace the constraints related to routing and wavelength assignment (RWA), typically based on a link approach, with a new set of constraints based on the maximal independent set decomposition (MISD) that we recently developed to solve optimally the RWA problem in ring networks. Our experimental study indicates that the new formulation results in an improvement of up to two orders of magnitude in running time. Consequently, it is now possible to solve the traffic grooming problem to optimality for 16-node rings in a few seconds using commodity hardware.
{"title":"Scalable optimal traffic grooming in WDM rings incorporating fast RWA formulation","authors":"Zeyu Liu, G. Rouskas","doi":"10.1109/ICC.2013.6655177","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655177","url":null,"abstract":"We present a scalable formulation for the traffic grooming problem in WDM ring networks. Specifically, we modify the ILP formulation to replace the constraints related to routing and wavelength assignment (RWA), typically based on a link approach, with a new set of constraints based on the maximal independent set decomposition (MISD) that we recently developed to solve optimally the RWA problem in ring networks. Our experimental study indicates that the new formulation results in an improvement of up to two orders of magnitude in running time. Consequently, it is now possible to solve the traffic grooming problem to optimality for 16-node rings in a few seconds using commodity hardware.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"51 1","pages":"3958-3962"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78787446","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}
We construct an experiment testbed using commercial routers and demonstrate QoS-aware multi-path SVC video streaming with it. The testbed consists of six integrated services routers (Cisco 2900 Series) that are configured using a mesh topology. To realize QoS-aware multi-path routing efficiently, we develop a centralized automatic NC&M system that monitors link status proactively, calculates the multi-path routing scheme for each streaming session, and communicates with the routers' control plane to adjust their routing policies. For each streaming session, when the NC&M finds a better multi-path routing scheme, it reconfigures the routers to invoke a path-switching. The experimental results indicate that the multi-path SVC video streaming scheme reduces the packet loss rate (PLR) from 3.33% to 0.62% for the base layer (BL) packets, and to 1.71% for the enhancement layer (EL) packets. Additional experiments on video playback quality, video playback peak signal-to-noise ratio (PSNR), and delay jitter also verify that the multi-path scheme outperforms the single-path one significantly and utilizes the network resources more efficiently.
{"title":"Experimental demonstration of SVC video streaming using QoS-aware multi-path routing over integrated services routers","authors":"Zilong Bai, Suoheng Li, Yanan Wu, Wenshuang Zhou, Zuqing Zhu","doi":"10.1109/ICC.2013.6655126","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655126","url":null,"abstract":"We construct an experiment testbed using commercial routers and demonstrate QoS-aware multi-path SVC video streaming with it. The testbed consists of six integrated services routers (Cisco 2900 Series) that are configured using a mesh topology. To realize QoS-aware multi-path routing efficiently, we develop a centralized automatic NC&M system that monitors link status proactively, calculates the multi-path routing scheme for each streaming session, and communicates with the routers' control plane to adjust their routing policies. For each streaming session, when the NC&M finds a better multi-path routing scheme, it reconfigures the routers to invoke a path-switching. The experimental results indicate that the multi-path SVC video streaming scheme reduces the packet loss rate (PLR) from 3.33% to 0.62% for the base layer (BL) packets, and to 1.71% for the enhancement layer (EL) packets. Additional experiments on video playback quality, video playback peak signal-to-noise ratio (PSNR), and delay jitter also verify that the multi-path scheme outperforms the single-path one significantly and utilizes the network resources more efficiently.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"28 1","pages":"3683-3687"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78852290","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 : 2013-06-09DOI: 10.1109/ICC.2013.6654856
Suzhi Bi, Xiaojun Yuan, Y. Zhang
We present a novel physical layer encryption (PLE) scheme that randomizes the radio signals using a discrete Fourier transform (DFT) based encryption algorithm. For any baseband signaling method, we show that perfect secrecy is asymptotically achievable with the proposed DFT-based encryption method when the signal block length (N) approaches infinity. For practical systems with finite N, we also show that the proposed encryption method can transmit at a secrecy rate close to the main channel's achievable data rate. In this sense, transmission privacy is achieved without compromising the capability of the communication channel. Besides, the proposed encryption method can hide the transmission data rate and is immune to all existing upper-layer attacks. The performance advantages of the proposed DFT-based encryption method is verified through comparisons against other existing PLE methods.
{"title":"DFT-based physical layer encryption for achieving perfect secrecy","authors":"Suzhi Bi, Xiaojun Yuan, Y. Zhang","doi":"10.1109/ICC.2013.6654856","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654856","url":null,"abstract":"We present a novel physical layer encryption (PLE) scheme that randomizes the radio signals using a discrete Fourier transform (DFT) based encryption algorithm. For any baseband signaling method, we show that perfect secrecy is asymptotically achievable with the proposed DFT-based encryption method when the signal block length (N) approaches infinity. For practical systems with finite N, we also show that the proposed encryption method can transmit at a secrecy rate close to the main channel's achievable data rate. In this sense, transmission privacy is achieved without compromising the capability of the communication channel. Besides, the proposed encryption method can hide the transmission data rate and is immune to all existing upper-layer attacks. The performance advantages of the proposed DFT-based encryption method is verified through comparisons against other existing PLE methods.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"35 1","pages":"2211-2216"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78886329","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655185
Paschalis Tsiaflakis, M. Moonen
Vectoring is recognized as a very efficient technique to tackle crosstalk interference in multi-user DSL systems. In this paper we focus on sparse linear zero-forcing based vectoring schemes with a shared resource pool, which are known to obtain a good trade-off between online computational complexity and near-optimal performance. We propose a new system setup with a controller that dynamically (in time) optimizes and allocates computational complexity resources taking into account variable data rate demands with real-time constraints. The controller is designed to minimize the online computational complexity over time and allows for flexible fixed and variable data rate allocations. Simulation results with variable real-time constrained video streams for a realistic downstream VDSL scenario demonstrate that this novel controller-based approach allows to significantly reduce the average as well as peak online computational complexity.
{"title":"A flexible and real-time constrained controller for sparse linear zero-forcing based DSL vectoring","authors":"Paschalis Tsiaflakis, M. Moonen","doi":"10.1109/ICC.2013.6655185","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655185","url":null,"abstract":"Vectoring is recognized as a very efficient technique to tackle crosstalk interference in multi-user DSL systems. In this paper we focus on sparse linear zero-forcing based vectoring schemes with a shared resource pool, which are known to obtain a good trade-off between online computational complexity and near-optimal performance. We propose a new system setup with a controller that dynamically (in time) optimizes and allocates computational complexity resources taking into account variable data rate demands with real-time constraints. The controller is designed to minimize the online computational complexity over time and allows for flexible fixed and variable data rate allocations. Simulation results with variable real-time constrained video streams for a realistic downstream VDSL scenario demonstrate that this novel controller-based approach allows to significantly reduce the average as well as peak online computational complexity.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"43 1","pages":"4002-4007"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78981344","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655414
Yong Zeng, C. M. Yetis, E. Gunawan, Y. Guan, Rui Zhang
This paper studies the transmit optimization for the K-user Gaussian single-input single-output interference channel (SISO-IC), with the interference treated as Gaussian noise and by applying improper or circularly asymmetric complex Gaussian signaling. The transmit optimization with improper Gaussian signaling involves not only the signal covariance as in the conventional proper or circularly symmetric complex Gaussian signaling, but also the signal pseudo-covariance, which is conventionally set to zero in proper Gaussian signaling. By utilizing the rate-profile method, the achievable rate region of the K-user SISO-IC is characterized by solving a sequence of minimum-weighted-rate maximization (MinWR-Max) problems, which are non-convex and thus difficult to be solved globally optimally. By applying the semidefinite relaxation (SDR) technique, we propose an efficient approximate solution, which jointly optimizes the covariance and pseudo-covariance of the transmitted signals. Simulation results demonstrate the effectiveness of the proposed algorithm for the K-user SISO-IC with improper Gaussian signaling.
{"title":"Improper Gaussian signaling for the K-user SISO interference channel","authors":"Yong Zeng, C. M. Yetis, E. Gunawan, Y. Guan, Rui Zhang","doi":"10.1109/ICC.2013.6655414","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655414","url":null,"abstract":"This paper studies the transmit optimization for the K-user Gaussian single-input single-output interference channel (SISO-IC), with the interference treated as Gaussian noise and by applying improper or circularly asymmetric complex Gaussian signaling. The transmit optimization with improper Gaussian signaling involves not only the signal covariance as in the conventional proper or circularly symmetric complex Gaussian signaling, but also the signal pseudo-covariance, which is conventionally set to zero in proper Gaussian signaling. By utilizing the rate-profile method, the achievable rate region of the K-user SISO-IC is characterized by solving a sequence of minimum-weighted-rate maximization (MinWR-Max) problems, which are non-convex and thus difficult to be solved globally optimally. By applying the semidefinite relaxation (SDR) technique, we propose an efficient approximate solution, which jointly optimizes the covariance and pseudo-covariance of the transmitted signals. Simulation results demonstrate the effectiveness of the proposed algorithm for the K-user SISO-IC with improper Gaussian signaling.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"4 1","pages":"5219-5223"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87621194","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655188
Salvatore D’oro, L. Galluccio, G. Morabito, S. Palazzo
A covert channel is a communication channel that creates a capability to transfer information between entities that are not supposed to communicate. A relevant instance of covert channels is represented by timing channels, where information is encoded in timing between events. Timing channels may result very critical in tactical scenarios where even malicious nodes can communicate in an undisclosed way. Jamming is commonly used to disrupt this kind of threatening wireless covert communications. However jamming, to be effective, should guarantee limited energy consumption. In this paper, an analysis of energy-constrained jamming systems used to attack malicious timing channels is presented. Continuous and reactive jamming systems are discussed in terms of their effect on the achievable covert channel capacity and jammer energy consumption. Also, a simple experimental set up is illustrated and used to identify proper operating points where jamming against malicious timing channels is effective while achieving limited energy consumption.
{"title":"Efficiency analysis of jamming-based countermeasures against malicious timing channel in tactical communications","authors":"Salvatore D’oro, L. Galluccio, G. Morabito, S. Palazzo","doi":"10.1109/ICC.2013.6655188","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655188","url":null,"abstract":"A covert channel is a communication channel that creates a capability to transfer information between entities that are not supposed to communicate. A relevant instance of covert channels is represented by timing channels, where information is encoded in timing between events. Timing channels may result very critical in tactical scenarios where even malicious nodes can communicate in an undisclosed way. Jamming is commonly used to disrupt this kind of threatening wireless covert communications. However jamming, to be effective, should guarantee limited energy consumption. In this paper, an analysis of energy-constrained jamming systems used to attack malicious timing channels is presented. Continuous and reactive jamming systems are discussed in terms of their effect on the achievable covert channel capacity and jammer energy consumption. Also, a simple experimental set up is illustrated and used to identify proper operating points where jamming against malicious timing channels is effective while achieving limited energy consumption.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"4020-4024"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87931543","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 : 2013-06-09DOI: 10.1109/ICC.2013.6655335
Y. Okamoto, T. Ohtsuki
We propose a human activity classification and localization using a bistatic three frequency continuous wave (CW) radar. In the proposed algorithm each transmit antenna transmits signals with unique frequency. Thus, we can obtain Doppler signals for each transmit frequency, that is, each transmit antenna. Based on Doppler spectrums calculated from the received signals, we can estimate the number of human beings from the number of spectrum lines concerning translational motion, and motion interval from peaks of the spectrum. In addition, by using the relative velocity transformed from Doppler frequency and the estimated range information, we can classify human activities and track multiple human beings. Note that the conventional system using two frequency CW algorithm can estimate the position of a target by using phase information of the Doppler signal extracted from echo waves, however it can estimate only single target. Through computer simulation, we show that the proposed algorithm using a bistatic three frequency CW radar can classify various human activities and track multiple targets.
{"title":"Human activity classification and localization using bistatic three frequency CW radar","authors":"Y. Okamoto, T. Ohtsuki","doi":"10.1109/ICC.2013.6655335","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655335","url":null,"abstract":"We propose a human activity classification and localization using a bistatic three frequency continuous wave (CW) radar. In the proposed algorithm each transmit antenna transmits signals with unique frequency. Thus, we can obtain Doppler signals for each transmit frequency, that is, each transmit antenna. Based on Doppler spectrums calculated from the received signals, we can estimate the number of human beings from the number of spectrum lines concerning translational motion, and motion interval from peaks of the spectrum. In addition, by using the relative velocity transformed from Doppler frequency and the estimated range information, we can classify human activities and track multiple human beings. Note that the conventional system using two frequency CW algorithm can estimate the position of a target by using phase information of the Doppler signal extracted from echo waves, however it can estimate only single target. Through computer simulation, we show that the proposed algorithm using a bistatic three frequency CW radar can classify various human activities and track multiple targets.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"4808-4812"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87002206","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 : 2013-06-09DOI: 10.1109/ICC.2013.6654952
B. Kouassi, I. Ghauri, L. Deneire
Cognitive radio (CR) aims at enabling the coexistence between legacy systems called primary users (PU) and secondary users (SU), provided the SU do not (significantly) cause interference on PU links. Massive MIMO systems on the other hand yield significant performance and reliability enhancement. In this paper, we investigate the capacity of both PU and SU systems using multi-user (MU) massive MIMO and time division duplex (TDD). TDD indeed permits to estimate the channel state information (CSI) at the PU/SU transmitters to perform linear precoding, taking advantage of the channel reciprocity. The capacity is derived considering the CSI imperfections, the non-reciprocal radio frequency front-ends as well as antenna coupling effects. These impairments can be compensated using reciprocity calibration techniques we recently developed. Extending these techniques to MU massive MIMO, we evaluate interference cancellation precoders. Simulations reveal performance improvements using the massive MIMO reciprocity-based precoder in a CR approach.
{"title":"Reciprocity-based cognitive transmissions using a MU massive MIMO approach","authors":"B. Kouassi, I. Ghauri, L. Deneire","doi":"10.1109/ICC.2013.6654952","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654952","url":null,"abstract":"Cognitive radio (CR) aims at enabling the coexistence between legacy systems called primary users (PU) and secondary users (SU), provided the SU do not (significantly) cause interference on PU links. Massive MIMO systems on the other hand yield significant performance and reliability enhancement. In this paper, we investigate the capacity of both PU and SU systems using multi-user (MU) massive MIMO and time division duplex (TDD). TDD indeed permits to estimate the channel state information (CSI) at the PU/SU transmitters to perform linear precoding, taking advantage of the channel reciprocity. The capacity is derived considering the CSI imperfections, the non-reciprocal radio frequency front-ends as well as antenna coupling effects. These impairments can be compensated using reciprocity calibration techniques we recently developed. Extending these techniques to MU massive MIMO, we evaluate interference cancellation precoders. Simulations reveal performance improvements using the massive MIMO reciprocity-based precoder in a CR approach.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"50 1","pages":"2738-2742"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87597271","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
扫码关注我们
求助内容：
应助结果提醒方式：