この論文をさがす
抄録
Transmitted-power allocation (TPA) is vital for minimizing power consumption and managing interference in interleave-division multiple access (IDMA) systems. Conventionally, optimization problems arising from TPA assume that the transmitted powers can take any values in a pre-defined interval. Hence, a practical limitation is not taken into consideration: The transmitted powers of most mobile devices are discrete nowadays. In this paper, we consider an optimization problem in which transmitted powers can only take a finite number of levels. This problem is non-convex, but we show that it can be converted into a linear zero-one programming (LZOP) problem. Numerical examples demonstrate that the problem in the LZOP form can be solved efficiently using an existing solver.
identifier:110007124408
収録刊行物
-
- 甲南大学紀要. 理工学編 = Memoirs of Konan University. Science and engineering series
-
甲南大学紀要. 理工学編 = Memoirs of Konan University. Science and engineering series 54 (1), 1-17, 2007-07-31
甲南大学
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390009224773010560
-
- NII論文ID
- 110007124408
-
- NII書誌ID
- AA11561231
-
- ISSN
- 13480383
-
- NDL書誌ID
- 8911754
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- IRDB
- NDL
- CiNii Articles