Skip to main content
Log in

Joint Probabilistic Constrained Robust Beamforming and Antenna Selection

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

A novel method is proposed for joint probabilistic constrained robust beamforming and antenna selection used in cognitive radio networks. Assuming complex Gaussian distributed channel state information errors, the Bernstein-type inequalities are introduced to transform no closed-form probabilistic constrained forms into the deterministic forms. Moreover, the ℓ1-norm is used as the closest convex approximation of ℓ0-norm. Thus the original NP-hard optimal problem can be relaxed as a tractable convex optimization problem. A computationally efficient and near-optimal solution is obtained by an iteratively re-weighted algorithm. Simulations show that the proposed algorithm satisfies the predetermined service levels at relatively small excess transmission power in a number of transmitter reduction scenarios.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

References

  1. Mitola, J., & Maguire, J. (1999). Cognitive radio: Making software radios more personal. IEEE Personal Communication Magazine, 6(4), 13–18.

    Article  Google Scholar 

  2. Li, W.-C., Chang, T.-H., Lin, C., & Chi, C.-Y. (2013). Coordinated beamforming for multiuser MISO interference channel under rate outage constraints. IEEE Transactions on Signal Processing, 61(5), 1087–1103.

  3. Zakhour, R., & Hanly, S. V. (2013). Min–max power allocation in cellular network with coordinated beamforming. IEEE Jounal on Selected Areas in Communication, 31(2), 287–302.

    Article  Google Scholar 

  4. Gershman, A. B., Sidiropoulos, N. D., Shahbazpanahi, S., et al. (2010). Convex optimization-based beamforming: From receive to transmit and network designs. IEEE Signal Processing Magazine, 27(2), 62–75.

    Article  Google Scholar 

  5. Huang, Y. W., Palomar, D. P., & Zhang, S. Z. (2013). Lorentz-positive maps and quadratic matrix inequalities with applications to robust MISO transmit beamforming. IEEE Transactions on Signal Processing, 61(5), 1121–1130.

    Article  MathSciNet  Google Scholar 

  6. Huang, Y. W., & Palomar, D. P. (2014). Randomized algorithms for optimal solutions of double-sided QCQP with applications in signal processing. IEEE Transactions on Signal Processing, 62(5), 1093–1108.

    Article  MathSciNet  Google Scholar 

  7. Wang, J., & Palomar, D. P. (2009). Worst-case robust MIMO transmission with imperfect channel knowledge. IEEE Transactions on Signal Processing, 57(8), 3086–3100.

    Article  MathSciNet  Google Scholar 

  8. Ma, S., & Sun, D. C. (2013). Chance constrained robust beamforming in cognitive radio networks. IEEE Communications Letters, 17(1), 67–70.

    Article  Google Scholar 

  9. Wang, K. Y., Chang, T. H., & Ma, W. K. (2011). Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach. In IEEE International Conference, ICASSP (pp. 3080–3083)

  10. Mehanna, O., Sidiropoulos, N. D., & Giannakis, G. B. (2013). Joint beamforming and antenna selection. IEEE Transactions on Signal Processing, 61(10), 2660–2674.

    Article  MathSciNet  Google Scholar 

  11. Candes, E., Wakin, M., & Boyd, S. (2008). Enhancing sparsity by reweighted ℓ1 minimization. Journal of Fourier Analysis and Applications, 14(5), 877–905.

    Article  MATH  MathSciNet  Google Scholar 

  12. Luo, Z.-Q., Ma, W.-K., So, A. M.-C., & Ye, Y. (2010). Semidefinite relaxation of quadratic optimization problems. IEEE Signal Processing Magazine, 27(3), 20–34.

    Article  Google Scholar 

  13. Chung, P. J., Du, H. Q., & Gondzio, J. (2011). A probabilistic constraint approach for robust transmit beamforming with imperfect channel information. IEEE Transactions on Signal Processing, 59(6), 2773–2782.

    Article  MathSciNet  Google Scholar 

  14. Grant, M. C., & Boyd, S. P. (2014). CVX: Matlab software for disciplined convex programming, version 2.1. http://cvxr.com/cvx/

Download references

Acknowledgments

This work is supported by the National Nature Science Foundation of China (Nos. U1204611, 61300214 and 61374134), Nature Science Foundation of Henan Province of China (132300410148) and Science and Technology Innovation Team Support Program of Henan Province, China (13IRTSTHN021).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Jin.

Appendix

Appendix

Using Table 3, subject to the each of SU receive-SINR and co-existing PU IT probabilistic constraints, we propose a minimizing transmit-power beamforming algorithm which uses \( L \le N \) antennas. Our algorithm is summarized Table 4.

Table 3 Iteratively re-weighted 1-norm penalty algorithm
Table 4 Algorithm of joint probabilistic constrains beamforming and antenna selection

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jin, Y., Hu, Z., Yue, J. et al. Joint Probabilistic Constrained Robust Beamforming and Antenna Selection. Wireless Pers Commun 84, 2385–2396 (2015). https://doi.org/10.1007/s11277-015-2710-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2710-x

Keywords

Navigation