The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 연구는 다중 사용자 직교 주파수 분할 다중화 업링크 시스템에서 부반송파 할당 및 전력 할당의 전력 제약과 관련된 처리량 최대화 문제를 해결하기 위한 2단계 순서 최적화 이론 기반 접근 방식을 제시합니다. 첫 번째 단계에서는 조잡하지만 효율적인 모델을 사용하여 하위 캐리어 할당 패턴의 성능을 평가하고 유전 알고리즘을 사용하여 거대한 솔루션 공간을 검색합니다. 두 번째 단계에서는 평가를 위해 정확한 모델이 사용됩니다. s 1단계에서 얻은 최상의 서브캐리어 할당 패턴을 선택하여 선택 서브세트를 형성합니다. 마지막으로 선택된 하위 집합 중 가장 좋은 것은 우리가 추구하는 충분히 좋은 솔루션입니다. 수많은 테스트를 통해 이 작업은 제안된 알고리즘의 효율성을 입증하고 이를 다른 휴리스틱 방법의 알고리즘과 비교합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Jung-Shou HUANG, Shieh-Shing LIN, Shih-Cheng HORNG, "Ordinal Optimization Approach for Throughput Maximization Problems in MOFDM Uplink System" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 2, pp. 879-883, February 2011, doi: 10.1587/transfun.E94.A.879.
Abstract: This work presents a two-stage ordinal optimization theory-based approach for solving the throughput maximization problems with power constraints of sub-carrier assignment and power allocation in multi-user orthogonal frequency division multiplexing uplink systems. In the first stage, a crude but efficient model is employed to evaluate the performance of a sub-carrier assignment pattern and the genetic algorithm is used to search through the huge solution space. In the second stage, an exact model is employed to evaluate s best sub-carrier assignment patterns obtained in stage 1 and form the select subset. Finally, the best one of the select subset is the good enough solution that we seek. Via numerous tests, this work demonstrates the efficiency of the proposed algorithm and compares it with those of other heuristic methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.879/_p
부
@ARTICLE{e94-a_2_879,
author={Jung-Shou HUANG, Shieh-Shing LIN, Shih-Cheng HORNG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Ordinal Optimization Approach for Throughput Maximization Problems in MOFDM Uplink System},
year={2011},
volume={E94-A},
number={2},
pages={879-883},
abstract={This work presents a two-stage ordinal optimization theory-based approach for solving the throughput maximization problems with power constraints of sub-carrier assignment and power allocation in multi-user orthogonal frequency division multiplexing uplink systems. In the first stage, a crude but efficient model is employed to evaluate the performance of a sub-carrier assignment pattern and the genetic algorithm is used to search through the huge solution space. In the second stage, an exact model is employed to evaluate s best sub-carrier assignment patterns obtained in stage 1 and form the select subset. Finally, the best one of the select subset is the good enough solution that we seek. Via numerous tests, this work demonstrates the efficiency of the proposed algorithm and compares it with those of other heuristic methods.},
keywords={},
doi={10.1587/transfun.E94.A.879},
ISSN={1745-1337},
month={February},}
부
TY - JOUR
TI - Ordinal Optimization Approach for Throughput Maximization Problems in MOFDM Uplink System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 879
EP - 883
AU - Jung-Shou HUANG
AU - Shieh-Shing LIN
AU - Shih-Cheng HORNG
PY - 2011
DO - 10.1587/transfun.E94.A.879
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2011
AB - This work presents a two-stage ordinal optimization theory-based approach for solving the throughput maximization problems with power constraints of sub-carrier assignment and power allocation in multi-user orthogonal frequency division multiplexing uplink systems. In the first stage, a crude but efficient model is employed to evaluate the performance of a sub-carrier assignment pattern and the genetic algorithm is used to search through the huge solution space. In the second stage, an exact model is employed to evaluate s best sub-carrier assignment patterns obtained in stage 1 and form the select subset. Finally, the best one of the select subset is the good enough solution that we seek. Via numerous tests, this work demonstrates the efficiency of the proposed algorithm and compares it with those of other heuristic methods.
ER -