Pub Date : 2014-06-22DOI: 10.1109/SPAWC.2014.6941322
M. Mirahmadi, A. Al-Dweik, A. Shami, B. Sharif
In the literature, it has been demonstrated that applying a low complexity interleaving after the inverse fast Fourier transform (IFFT) in orthogonal frequency division multiplexing (OFDM) systems can significantly reduce the impact of impulsive noise [1]. The interleaving process introduces time diversity, which can be used to effectively combat impairments such as impulsive noise. However, the performance of the interleaving system is evaluated via Monte Carlo simulation. Therefore, this work considers the analytical performance evaluation of the post IFFT interleaving in impulsive noise channels, where a closed form formulae is derived for the system signal-to-interference and noise (SINR) and bit error rate (HER).
{"title":"Bit error rate performance of OFDM systems with post 1FFT interleaving in impulsive noise channels","authors":"M. Mirahmadi, A. Al-Dweik, A. Shami, B. Sharif","doi":"10.1109/SPAWC.2014.6941322","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941322","url":null,"abstract":"In the literature, it has been demonstrated that applying a low complexity interleaving after the inverse fast Fourier transform (IFFT) in orthogonal frequency division multiplexing (OFDM) systems can significantly reduce the impact of impulsive noise [1]. The interleaving process introduces time diversity, which can be used to effectively combat impairments such as impulsive noise. However, the performance of the interleaving system is evaluated via Monte Carlo simulation. Therefore, this work considers the analytical performance evaluation of the post IFFT interleaving in impulsive noise channels, where a closed form formulae is derived for the system signal-to-interference and noise (SINR) and bit error rate (HER).","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117248953","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-06-22DOI: 10.1109/SPAWC.2014.6941308
Yohan Lejosne, M. Bashar, D. Slock, Y. Yuan-Wu
The Interfering Broadcast Channel (IBC) applies to the downlink of cellular and heterogenous networks, which are limited by multi-user (MU) interference. The interference alignment (IA) concept has shown that interference does not need to be inevitable. In particular spatial IA in MIMO IBC allows for low latency. However, IA requires perfect and typically global Channel State Information at the Transmitter(s) (CSIT), whose acquisition does not scale with network size. Hence, designs that are optimal in terms of Degrees of Freedom (DoF) may not be so in terms of more relevant net DoF, accounting for CSI acquistion or at finite SNR. Also, the design of transmitters (Txs) and receivers (Rxs) is coupled and hence needs to be centralized or duplicated. Here we propose to take advantage of Massive MIMO simplifications, esp. for mmWave, by considering (multi-)path CSIT for crosslinks, which can be obtained without feedback. We consider a hierarchical cross/direct link beamformer design, maximizing Weighted Sum Rate (WSR) with partial CSIT at finite SNR, requiring on local CSIT. We also point out the use of receive antennas in genuine MU Massive MIMO.
{"title":"From MU massive MISO to pathwise MU massive MIMO","authors":"Yohan Lejosne, M. Bashar, D. Slock, Y. Yuan-Wu","doi":"10.1109/SPAWC.2014.6941308","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941308","url":null,"abstract":"The Interfering Broadcast Channel (IBC) applies to the downlink of cellular and heterogenous networks, which are limited by multi-user (MU) interference. The interference alignment (IA) concept has shown that interference does not need to be inevitable. In particular spatial IA in MIMO IBC allows for low latency. However, IA requires perfect and typically global Channel State Information at the Transmitter(s) (CSIT), whose acquisition does not scale with network size. Hence, designs that are optimal in terms of Degrees of Freedom (DoF) may not be so in terms of more relevant net DoF, accounting for CSI acquistion or at finite SNR. Also, the design of transmitters (Txs) and receivers (Rxs) is coupled and hence needs to be centralized or duplicated. Here we propose to take advantage of Massive MIMO simplifications, esp. for mmWave, by considering (multi-)path CSIT for crosslinks, which can be obtained without feedback. We consider a hierarchical cross/direct link beamformer design, maximizing Weighted Sum Rate (WSR) with partial CSIT at finite SNR, requiring on local CSIT. We also point out the use of receive antennas in genuine MU Massive MIMO.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130020075","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-06-22DOI: 10.1109/SPAWC.2014.6941309
Nikolaos Kolomvakis, M. Matthaiou, M. Coldrey
Massive multi-user multiple-input multiple-output (MU-MIMO) systems are cellular networks where the base stations (BSs) are equipped with hundreds of antennas, N, and communicate with tens of mobile stations (MSs), K, such that, N ≫ K ≫ 1. Contrary to most prior works, in this paper, we consider the uplink of a single-cell massive MIMO system operating in sparse channels with limited scattering. This case is of particular importance in most propagation scenarios, where the prevalent Rayleigh fading assumption becomes idealistic. We derive analytical approximations for the achievable rates of maximum-ratio combining (MRC) and zero-forcing (ZF) receivers. Furthermore, we study the asymptotic behavior of the achievable rates for both MRC and ZF receivers, when N and K go to infinity under the condition that N/K → c ≥ 1. Our results indicate that the achievable rate of MRC receivers reaches an asymptotic saturation limit, whereas the achievable rate of ZF receivers grows logarithmically with the number of MSs.
{"title":"Massive MIMO in sparse channels","authors":"Nikolaos Kolomvakis, M. Matthaiou, M. Coldrey","doi":"10.1109/SPAWC.2014.6941309","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941309","url":null,"abstract":"Massive multi-user multiple-input multiple-output (MU-MIMO) systems are cellular networks where the base stations (BSs) are equipped with hundreds of antennas, N, and communicate with tens of mobile stations (MSs), K, such that, N ≫ K ≫ 1. Contrary to most prior works, in this paper, we consider the uplink of a single-cell massive MIMO system operating in sparse channels with limited scattering. This case is of particular importance in most propagation scenarios, where the prevalent Rayleigh fading assumption becomes idealistic. We derive analytical approximations for the achievable rates of maximum-ratio combining (MRC) and zero-forcing (ZF) receivers. Furthermore, we study the asymptotic behavior of the achievable rates for both MRC and ZF receivers, when N and K go to infinity under the condition that N/K → c ≥ 1. Our results indicate that the achievable rate of MRC receivers reaches an asymptotic saturation limit, whereas the achievable rate of ZF receivers grows logarithmically with the number of MSs.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131694813","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-06-22DOI: 10.1109/SPAWC.2014.6941330
A. Alkhateeb, Omar El Ayach, G. Leus, R. Heath
Millimeter wave (mmWave) cellular systems will enable ultra high data rates by communicating over the large bandwidth available in mmWave frequencies. To overcome the channel propagation characteristics in this frequency band, large antenna arrays need to be deployed at both the base station and mobile users. While these large arrays provide sufficient beamforming gains to meet the required link margins, they make it challenging to estimate the mmWave channel. In this paper, we propose a mmWave channel estimation algorithm that exploits the sparse nature of the channel and leverages tools from adaptive compressed sensing to efficiently estimate the channel with a small training overhead. The proposed algorithm considers practical hardware constraints on the training beamforming design, and does not require the availability of a feedback channel between the base station and the mobile user. Simulation results indicate that comparable precoding gains can be achieved by the proposed channel estimation algorithm relative to the case when perfect channel knowledge exists.
{"title":"Single-sided adaptive estimation of multi-path millimeter wave channels","authors":"A. Alkhateeb, Omar El Ayach, G. Leus, R. Heath","doi":"10.1109/SPAWC.2014.6941330","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941330","url":null,"abstract":"Millimeter wave (mmWave) cellular systems will enable ultra high data rates by communicating over the large bandwidth available in mmWave frequencies. To overcome the channel propagation characteristics in this frequency band, large antenna arrays need to be deployed at both the base station and mobile users. While these large arrays provide sufficient beamforming gains to meet the required link margins, they make it challenging to estimate the mmWave channel. In this paper, we propose a mmWave channel estimation algorithm that exploits the sparse nature of the channel and leverages tools from adaptive compressed sensing to efficiently estimate the channel with a small training overhead. The proposed algorithm considers practical hardware constraints on the training beamforming design, and does not require the availability of a feedback channel between the base station and the mobile user. Simulation results indicate that comparable precoding gains can be achieved by the proposed channel estimation algorithm relative to the case when perfect channel knowledge exists.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443467","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-06-22DOI: 10.1109/SPAWC.2014.6941317
Gilwon Lee, Y. Sung
In this paper, a simple user-scheduling-and-beamforming method is proposed for massive multi-user multiple-input multiple-output (MU-MIMO) downlink adopting two-stage beamforming. The key ideas of the proposed scheduling-and-beamforming method are to divide users into several candidate subsets according to the level of alignment of user channels to the dominant directions of the channel covariance matrix and select the user in each candidate subset based on a certain channel quality indicator (CQI) and to apply post-selection zero-forcing beamforming (ZFBF) to the selected users based on their channel state information (CSI). It is proved that the proposed scheduling-and-beamforming method is asymptotically optimal as the number of users increases. Furthermore, the proposed method significantly reduces the feedback overhead and shows superior sum rate performance compared to existing scheduling methods for MU-MIMO downlink.
{"title":"Asymptotically optimal simple user scheduling for massive MIMO downlink with two-stage beamforming","authors":"Gilwon Lee, Y. Sung","doi":"10.1109/SPAWC.2014.6941317","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941317","url":null,"abstract":"In this paper, a simple user-scheduling-and-beamforming method is proposed for massive multi-user multiple-input multiple-output (MU-MIMO) downlink adopting two-stage beamforming. The key ideas of the proposed scheduling-and-beamforming method are to divide users into several candidate subsets according to the level of alignment of user channels to the dominant directions of the channel covariance matrix and select the user in each candidate subset based on a certain channel quality indicator (CQI) and to apply post-selection zero-forcing beamforming (ZFBF) to the selected users based on their channel state information (CSI). It is proved that the proposed scheduling-and-beamforming method is asymptotically optimal as the number of users increases. Furthermore, the proposed method significantly reduces the feedback overhead and shows superior sum rate performance compared to existing scheduling methods for MU-MIMO downlink.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125493282","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-06-22DOI: 10.1109/SPAWC.2014.6941312
Dan Fang, Anzhong Wong, Jian-Kang Zhang, K. M. Wong
The multiple-input and multiple-output (MIMO) channel model is very useful for the presentation of a wide range of wireless communication systems. This paper addresses the joint design of a precoder and a receiver for a point-to-point MIMO channel model in a scenario in which perfect channel state information (CSI) is available at both ends. We develop a novel framework for the dual transmission-reception process. Under the proposed framework, the receiver decomposes the channel matrix by using a block QR decomposition, where Q is a unitary matrix and R is a block upper triangular matrix. The optimal maximum likelihood (ML) detec- tion process is employed within each diagonal block of R. Then, the detected block of symbols is substituted and subtracted sequentially according to the block QR decomposition based successive cancellation. On the transmitting end, the expression of probability of error based on ML detection is chosen as the design criterion to formulate the precoder design problem. This paper presents a design of MIMO transceivers in the particular case of having 4 transmitting and 4 receiving antennas with full CSI knowledge on both sides. In addition, a closed-form expression for the optimal precoder matrix is obtained for channels satisfying certain conditions.
{"title":"Block-equal QRS decomposition of mimo channels with ML-based block successive cancellation detection","authors":"Dan Fang, Anzhong Wong, Jian-Kang Zhang, K. M. Wong","doi":"10.1109/SPAWC.2014.6941312","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941312","url":null,"abstract":"The multiple-input and multiple-output (MIMO) channel model is very useful for the presentation of a wide range of wireless communication systems. This paper addresses the joint design of a precoder and a receiver for a point-to-point MIMO channel model in a scenario in which perfect channel state information (CSI) is available at both ends. We develop a novel framework for the dual transmission-reception process. Under the proposed framework, the receiver decomposes the channel matrix by using a block QR decomposition, where Q is a unitary matrix and R is a block upper triangular matrix. The optimal maximum likelihood (ML) detec- tion process is employed within each diagonal block of R. Then, the detected block of symbols is substituted and subtracted sequentially according to the block QR decomposition based successive cancellation. On the transmitting end, the expression of probability of error based on ML detection is chosen as the design criterion to formulate the precoder design problem. This paper presents a design of MIMO transceivers in the particular case of having 4 transmitting and 4 receiving antennas with full CSI knowledge on both sides. In addition, a closed-form expression for the optimal precoder matrix is obtained for channels satisfying certain conditions.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"161 30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126739496","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-06-22DOI: 10.1109/SPAWC.2014.6941795
Ahmed Medra, T. Davidson
In this paper, we propose a structured linear interference alignment scheme that can achieve 2 degrees of freedom in the 3-cell downlink network with arbitrary time-invariant channels using only local feedback. The scheme employs a finite number of channel extensions and results in an equivalent channel matrix that is 2-level decomposable. The linear precoders at the transmitters are constructed from the Kronecker products of 2 matrices of specific dimensions. This structured precoding scheme enables inter-cell interference cancellation and the achievement of the degrees of freedom of the network using only “in-cell” channel state information, without the need for any information exchange between base stations. Simulation results validate the proposed scheme.
{"title":"Kronecker structured linear precoding with local feedback for the 3-cell downlink","authors":"Ahmed Medra, T. Davidson","doi":"10.1109/SPAWC.2014.6941795","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941795","url":null,"abstract":"In this paper, we propose a structured linear interference alignment scheme that can achieve 2 degrees of freedom in the 3-cell downlink network with arbitrary time-invariant channels using only local feedback. The scheme employs a finite number of channel extensions and results in an equivalent channel matrix that is 2-level decomposable. The linear precoders at the transmitters are constructed from the Kronecker products of 2 matrices of specific dimensions. This structured precoding scheme enables inter-cell interference cancellation and the achievement of the degrees of freedom of the network using only “in-cell” channel state information, without the need for any information exchange between base stations. Simulation results validate the proposed scheme.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115286794","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-06-22DOI: 10.1109/SPAWC.2014.6941894
Wenbo He, B. Nazer, S. Shamai
Integer-forcing is a recently proposed framework for single-user encoding and decoding for MIMO channels. The key idea is that, by using appropriate nested lattice codebooks, we can ensure that every integer linear combination of codewords is itself a codeword. This permits the decoder is to first eliminate noise from the interfering data streams at the decoder, and only afterwards solve for the data streams. Here, we examine the integer-forcing framework from a signal-to-interference-and-noise ratio perspective and focus on the challenging problem of simultaneously optimizing the beamforming and projection matrices as well as the targeted integer matrix. Using recent results on uplink-downlink duality for integer-forcing, we propose an iterative algorithm for selecting these matrices and investigate its performance via simulations.
{"title":"Uplink-downlink duality for integer-forcing: Effective SINRs and iterative optimization","authors":"Wenbo He, B. Nazer, S. Shamai","doi":"10.1109/SPAWC.2014.6941894","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941894","url":null,"abstract":"Integer-forcing is a recently proposed framework for single-user encoding and decoding for MIMO channels. The key idea is that, by using appropriate nested lattice codebooks, we can ensure that every integer linear combination of codewords is itself a codeword. This permits the decoder is to first eliminate noise from the interfering data streams at the decoder, and only afterwards solve for the data streams. Here, we examine the integer-forcing framework from a signal-to-interference-and-noise ratio perspective and focus on the challenging problem of simultaneously optimizing the beamforming and projection matrices as well as the targeted integer matrix. Using recent results on uplink-downlink duality for integer-forcing, we propose an iterative algorithm for selecting these matrices and investigate its performance via simulations.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393806","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-06-22DOI: 10.1109/SPAWC.2014.6941855
A. Saleh, W. Chan, F. Alajaji
We study a low delay and low complexity sensor-communication system based on compressed sensing (CS) and scalar coding for transmission. The proposed scheme uses a 1 : r channel dimension expansion on the CS measurements for protection against channel noise. Simulation results show that optimizing the choice of r and the power allocation between the r transmissions significantly improve the system performance when compared to existing CS-communication schemes. Moreover, we consider the asymptotic behaviour of our CS system as the channel signal-to-noise ratio grows without bound and show that the proposed scheme achieves the optimal scaling exponent.
{"title":"Power-constrained low-complexity coding of compressed sensing measurements","authors":"A. Saleh, W. Chan, F. Alajaji","doi":"10.1109/SPAWC.2014.6941855","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941855","url":null,"abstract":"We study a low delay and low complexity sensor-communication system based on compressed sensing (CS) and scalar coding for transmission. The proposed scheme uses a 1 : r channel dimension expansion on the CS measurements for protection against channel noise. Simulation results show that optimizing the choice of r and the power allocation between the r transmissions significantly improve the system performance when compared to existing CS-communication schemes. Moreover, we consider the asymptotic behaviour of our CS system as the channel signal-to-noise ratio grows without bound and show that the proposed scheme achieves the optimal scaling exponent.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122858015","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-06-22DOI: 10.1109/SPAWC.2014.6941397
Hei Victor Cheng, Daniel Persson, E. Larsson
We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.
{"title":"MIMO capacity under power amplifiers consumed power and per-antenna radiated power constraints","authors":"Hei Victor Cheng, Daniel Persson, E. Larsson","doi":"10.1109/SPAWC.2014.6941397","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941397","url":null,"abstract":"We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"398 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131817673","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
扫码关注我们
求助内容：
应助结果提醒方式：