• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.784-793
• /
• 2012

This paper deals with subcarrier allocation strategies for soft hand-over in OFDMA-based cellular systems. Two possible subcarrier allocation methods are considered for soft hand-over. One method is to use an identical subcarrier set between the two cells participating in the hand-over. The other is to use different subcarrier sets between the two cells. As expected, the different subcarrier strategy is better in terms of diversity order and BER than the identical subcarrier strategy. It will be shown that the BER performance difference between the two strategies is more noticeable with contiguous subcarrier allocation. But the different subcarrier strategy consumes twice more frequency resources than the other, and there is a trade-off between the two strategies in terms of BER and frequency resources. By considering the trade-off, we also propose a subcarrier allocation strategy for soft hand-over.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.55-58
• /
• 2007

An adaptive subcarrier allocation scheme based on comparative superiority of opportunity cost between groups is proposed for the enhancement of system capacity and its simple implementation at the base station of a multiuser OFDM system. The proposed algorithm is similar to the blockwise or the decentralized subcarrier allocation algorithm proposed by Xiaowen et al and Alen et al, respectively. In the proposed algorithm, however, all subcarriers are grouped according to the coherence bandwidth and the comparative superiority concept, which swaps the groups between users if the system capacity is increased, is adopted for the enhancement of system capacity. In addition, the proposed algorithm provides a simple solution for the conflict problem among users by reallocating only the conflicted groups and unassigned groups instead of reallocating entire groups. Simulation results demonstrate that the proposed algorithm increases the system capacity effectively over a static, an adaptive blockwise, and a decentralized subcarrier allocation algorithms.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.257-266
• /
• 2012

A decode-and-forward two-way relay system benefits from orthogonal frequency division multiplexing (OFDM) and relay transmission. In this paper, we consider a decode-and-forward two-way relay system over OFDMwith two strategies: A joint subcarrier matching algorithm and a power allocation algorithm operating with a total power constraint for all subcarriers. The two strategies are studied based on average capacity using numerical analysis by uniformly allocating power constraints for each subcarrier matching group. An optimal subcarrier matching algorithm is proposed to match subcarriers in order of channel power gain for both transmission sides. Power allocation is defined based on equally distributing the capacity of each hop in each matching group. Afterward, a modified water-filling algorithm is also considered to allocate the power among all matching groups in order to increase the overall capacity of the network. Finally, Monte Carlo simulations are completed to confirm the numerical results and show the advantages of the joint subcarrier matching, power allocation and water filling algorithms, respectively.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3037-3054
• /
• 2013

Interference between primary user (PU) and secondary user (SU) transceivers should be mitigated in order to implement underlay spectrum sharing in cognitive radio networks (CRN). Considering this scenario, an improved joint subcarrier and bit allocation scheme for cognitive user with primary users' cooperation (PU Coop) in CRN is proposed. In this scheme, the optimization problem is formulated to minimize the average interference power level at the PU receiver via PU Coop, which guarantees a higher primary signal to interference plus noise ratio (SINR) while maintaining the secondary user total rate constraint. The joint optimal scheme is separated into subcarrier allocation and bit assignment in each subcarrier via arith-metric geo-metric (AM-GM) inequality with asymptotical optimization solution. Moreover, the joint subcarrier and bit optimization scheme, which is evaluated by the available SU subcarriers and the allocated bits, is analyzed in the proposed PU Coop model. The performance of cognitive spectral efficiency and the average interference power level are investigated. Numerical analysis indicates that the SU's spectral efficiency increases significantly compared with the PU non-cooperation scenario. Moreover, the interference power level decreases dramatically for the proposed scheme compared with the traditional Hughes-Hartogs bit allocation scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.387-396
• /
• 2016

Multiuser communication has been an important research area of underwater acoustic communications and networking. This paper studies the use of adaptive orthogonal frequency-division multiple access (OFDMA) in a downlink scenario, where a central node sends data to multiple distributed nodes simultaneously. In practical implementations, the instantaneous channel state information (CSI) cannot be perfectly known by the central node in time-varying underwater acoustic (UWA) channels, due to the long propagation delays resulting from the low sound speed. In this paper, we explore the CSI feedback for resource allocation. An adaptive power-bit loading algorithm is presented, which assigns subcarriers to different users and allocates power and bits to each subcarrier, aiming to minimize the bit error rate (BER) under power and throughput constraints. Simulation results show considerable performance gains due to adaptive subcarrier allocation and further improvement through power and bit loading, as compared to the non-adaptive interleave subcarrier allocation scheme. In a lake experiment, channel feedback reduction is implemented through subcarrier clustering and uniform quantization. Although the performance gains are not as large as expected, experiment results confirm that adaptive subcarrier allocation schemes based on delayed channel feedback or long term statistics outperform the interleave subcarrier allocation scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4738-4758
• /
• 2017

Resource allocation plays a crucial role in multiuser multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) systems to improve overall system performance. While previously proposed resource allocation algorithms are mainly designed from the point of view of the information-theoretic, we formulate the resource allocation problem as an average bit error rate (BER) minimization problem subject to a total power constraint when considering employing realistic MIMO detection techniques. Subsequently, we derive the optimal subcarrier and power allocation algorithms for three types of well-known MIMO detectors, including the maximum likelihood (ML) detector, linear detectors, and successive interference cancellation (SIC) detectors. To reduce the complexity, we also propose a two-step suboptimal algorithm that separates subcarrier and power allocation for each detector. We also analyze the diversity gain of the proposed suboptimal algorithms for various MIMO detectors. Simulation results confirm that the proposed suboptimal algorithm for each detector can achieve a comparable performance with the optimal allocation with a much lower complexity. Moreover, it is shown that the suboptimal algorithms perform better than the conventional algorithms that are known in the literature.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.580-591
• /
• 2013

The Orthogonal Frequency Division Multiple Access (OFDMA) is considered as a novel modulation and multiple access technique for 4th generation wireless systems. In this paper, we formulate a base station's power allocation algorithm for each user to maximize the user's sum rate, subject to constraints on total power, bit error rate, and rate proportionality among the users for a better proportional rate adaptive (RA) resource allocation method for OFDMA based system. We propose a novel power allocation method based on the proportion of subcarrier allocation and the user's normalized proportionality constant. We adapt a greedy algorithm and waterfilling technique for allocating the subcarriers among the users. In an end-to-end simulation, we validate that the proposed technique has higher system capacity and lower CPU execution times, while maintaining the acceptable rate proportionality among users.