Browsing by Author "Chiu, Tai-Hsiang"

Now showing 1 - 2 of 2

An iterative resource allocation algorithm for cooperative multimedia communications
(2007)
Lin, Yuan-Bin
;
Chiu, Tai-Hsiang
;
Su, Yu T.
;
Kao, M. S.
;
電信工程研究所
Transmit diversity through user cooperation is an attractive proposal for performance enhancement in a mobile communication network. Given the availability of multiple transmission channels from multiple users, we are concerned with the channel, power and rate assignment scheme that offers the maximum capacity while satisfying the multimedia multi-rate requirements. Earlier cooperative schemes often assume that a central processing device is available to find the optimal or suboptimal solution. The corresponding high computing complexity, however, makes the implementation of an energy-efficient cooperative transmission not very practical. In this paper, we present a simple resource allocation scheme that enables each participant user to easily and independently find a near-optimal channel assignment matrix and power allocation vector. under certain constraints. Our solution can be used for both mono-rate and multi-rate applications. It is optimal for the former case and gives near-optimal performance for the latter case.
Optimal and Near-Optimal Resource Allocation Algorithms for OFDMA Networks
(2009-08-01)
Lin, Yuan-Bin
;
Chiu, Tai-Hsiang
;
Su, Yu T.
;
電信工程研究所
;
Institute of Communications Engineering
Given the availability of multiple orthogonal channels and multimedia transmission rate requirements from multiple wireless OFDMA users, we are interested in a joint channel, power and rate assignment scheme that satisfies the given requirements with the minimum total transmit power. Algorithms for finding suboptimal and optimal solutions to sum power minimization resource allocation problems in OFDMA-based networks haven been proposed. But the complexity of finding the optimal solution is prohibitively high. We present two efficient algorithms with which each channel (sub-carrier) is assigned to at most one user. The first approach, which gives near-optimal solutions, employs a dynamic programming (DP) based tree search and adopts a fair initial condition that offers every user all available channels and removes a channel from all but one user at each stage. Each removal is based on the criterion of the least total power increase. Using the DP-based solution as the initial upper bound and the partial path cost used in the DP approach as the lower bound for each visited node, we develop an efficient branch-and-bound based algorithm that guaranteed to lead to the optimal solution. The average complexities of both algorithms are evaluated and effective schemes to further reduce the required complexity are proposed. We also provide performance and complexity comparisons with other suboptimal algorithms that are modified from the existing ones.