•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Generalized Water-Filling Algorithm with Linear Complexity and Finite Convergence Time

Author:
Khakurel, Suman
,
Leung, Clement
,
Tho Le-Ngoc
Publisher:
IEEE
Year
: 2014
DOI: 10.1109/WCL.2014.020314.130839
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/969166
Keyword(s): concave programming,convergence,telecommunication power management,WF problem,concave objective functions,finite convergence time,generalized water-filling problem,linear complexity,power constraints,quasiconcave objective functions,weighted-sum-power,weighted-sum-rate,Complexity theory,Linear programming,Minimization,Partitioning algorithms,Signal processing algorithms,Sorting,Wireless communication,Water-filling,algorithm,energy-efficiency,optimization,power adaptation
Collections :
  • Latin Articles
  • Show Full MetaData Hide Full MetaData
  • Statistics

    A Generalized Water-Filling Algorithm with Linear Complexity and Finite Convergence Time

Show full item record

contributor authorKhakurel, Suman
contributor authorLeung, Clement
contributor authorTho Le-Ngoc
date accessioned2020-03-12T18:45:30Z
date available2020-03-12T18:45:30Z
date issued2014
identifier issn2162-2337
identifier other6733535.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/969166
formatgeneral
languageEnglish
publisherIEEE
titleA Generalized Water-Filling Algorithm with Linear Complexity and Finite Convergence Time
typeJournal Paper
contenttypeMetadata Only
identifier padid8003416
subject keywordsconcave programming
subject keywordsconvergence
subject keywordstelecommunication power management
subject keywordsWF problem
subject keywordsconcave objective functions
subject keywordsfinite convergence time
subject keywordsgeneralized water-filling problem
subject keywordslinear complexity
subject keywordspower constraints
subject keywordsquasiconcave objective functions
subject keywordsweighted-sum-power
subject keywordsweighted-sum-rate
subject keywordsComplexity theory
subject keywordsLinear programming
subject keywordsMinimization
subject keywordsPartitioning algorithms
subject keywordsSignal processing algorithms
subject keywordsSorting
subject keywordsWireless communication
subject keywordsWater-filling
subject keywordsalgorithm
subject keywordsenergy-efficiency
subject keywordsoptimization
subject keywordspower adaptation
identifier doi10.1109/WCL.2014.020314.130839
journal titleWireless Communications Letters, IEEE
journal volume3
journal issue2
filesize121432
citations0
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace