Globally optimal precoder design with finite-alphabet inputs for cognitive radio networks

Weiliang Zeng, Chengshan Xiao, Jianhua Lu, Khaled Letaief

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.

Original languageEnglish
Article number6331678
Pages (from-to)1861-1874
Number of pages14
JournalIEEE Journal on Selected Areas in Communications
Volume30
Issue number10
DOIs
Publication statusPublished - 2012
Externally publishedYes

Fingerprint

Cognitive radio
Global optimization
Bit error rate
Transmitters
Computational complexity
Tuning
Optimal design
Antennas

Keywords

  • Cognitive radio
  • finite-alphabet inputs
  • linear precoding
  • multiple-input multiple-output
  • mutual information maximization
  • spectrum sharing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Globally optimal precoder design with finite-alphabet inputs for cognitive radio networks. / Zeng, Weiliang; Xiao, Chengshan; Lu, Jianhua; Letaief, Khaled.

In: IEEE Journal on Selected Areas in Communications, Vol. 30, No. 10, 6331678, 2012, p. 1861-1874.

Research output: Contribution to journalArticle

@article{69e191cd6ac14fb98eb228e821b353c1,
title = "Globally optimal precoder design with finite-alphabet inputs for cognitive radio networks",
abstract = "This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.",
keywords = "Cognitive radio, finite-alphabet inputs, linear precoding, multiple-input multiple-output, mutual information maximization, spectrum sharing",
author = "Weiliang Zeng and Chengshan Xiao and Jianhua Lu and Khaled Letaief",
year = "2012",
doi = "10.1109/JSAC.2012.121103",
language = "English",
volume = "30",
pages = "1861--1874",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Globally optimal precoder design with finite-alphabet inputs for cognitive radio networks

AU - Zeng, Weiliang

AU - Xiao, Chengshan

AU - Lu, Jianhua

AU - Letaief, Khaled

PY - 2012

Y1 - 2012

N2 - This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.

AB - This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.

KW - Cognitive radio

KW - finite-alphabet inputs

KW - linear precoding

KW - multiple-input multiple-output

KW - mutual information maximization

KW - spectrum sharing

UR - http://www.scopus.com/inward/record.url?scp=84867796204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867796204&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2012.121103

DO - 10.1109/JSAC.2012.121103

M3 - Article

VL - 30

SP - 1861

EP - 1874

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 10

M1 - 6331678

ER -