2014
DOI: 10.1109/tvt.2013.2272804
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Gradient-Based Methods for Adaptive Power Allocation in OFDM-Based Cognitive Radio Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(15 citation statements)
references
References 43 publications
0
15
0
Order By: Relevance
“…Other classical optimisation tools used for solving well-defined linear or convex programming RA problems are mostly off-shots of either the simplex or the interior point methods. Some of the most common methods and the corresponding references where they have been employed in obtaining solutions to RA problems in CRN are as follows: branch-and-bound (BnB) [19,45], branchand-cut (BnC) [46], lift-and-shift (LnS) [47], iterative and double-loop iterative methods [21,23], dual decomposition [21,48], Lagrangian duality [48,49], barrier method [50,51], gradient decent approach [52], column generation [53,54] etc. In general, these methods, because of their advantage of obtaining optimal solutions, are highly significant.…”
Section: Solutions Using Classical Optimisationmentioning
confidence: 99%
“…Other classical optimisation tools used for solving well-defined linear or convex programming RA problems are mostly off-shots of either the simplex or the interior point methods. Some of the most common methods and the corresponding references where they have been employed in obtaining solutions to RA problems in CRN are as follows: branch-and-bound (BnB) [19,45], branchand-cut (BnC) [46], lift-and-shift (LnS) [47], iterative and double-loop iterative methods [21,23], dual decomposition [21,48], Lagrangian duality [48,49], barrier method [50,51], gradient decent approach [52], column generation [53,54] etc. In general, these methods, because of their advantage of obtaining optimal solutions, are highly significant.…”
Section: Solutions Using Classical Optimisationmentioning
confidence: 99%
“…For a given interference information, the PA problem is proved to be concave but not easy to tackle. Similar PA problems were studied before such as [9], [13], [14], [15], [16], and [17]. In finding the dual variables, the authors of these references used the subgradient method, which is very sensitive to step size selection and needs a large number of iterations for convergence.…”
Section: Introductionmentioning
confidence: 99%
“…The optimal resource allocation strategies have been well studied in CR with the spectrum sharing paradigm [9][10][11][12][13][14][15][16][17][18]. The designs of the optimal resource allocation strategies for CR networks combining different transmit power constraints and different interference power constraints were proposed in [9,10], and those designs were extended to CR with imperfect CSI in [12].…”
Section: Introductionmentioning
confidence: 99%
“…In [15], the OP of a SU in spectrum sharing CR was minimized based on an optimal transmit power allocation scheme. Recently, adaptive gradient-based methods for power allocation in OFDMbased spectrum sharing CR have been proposed in [16]. Under both peak/average transmit power (PTP/ATP) and PIP/AIP constraints, optimal power control strategies that maximize the rates of CR with arbitrary input distributions were studied in [17].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation