Results 1 - 10
of
330
Dual methods for nonconvex spectrum optimization of multicarrier systems
- IEEE Trans. Commun
, 2006
"... Abstract—The design and optimization of multicarrier communications systems often involve a maximization of the total throughput subject to system resource constraints. The optimization problem is numerically difficult to solve when the problem does not have a convexity structure. This paper makes p ..."
Abstract
-
Cited by 193 (7 self)
- Add to MetaCart
(Show Context)
Abstract—The design and optimization of multicarrier communications systems often involve a maximization of the total throughput subject to system resource constraints. The optimization problem is numerically difficult to solve when the problem does not have a convexity structure. This paper makes progress toward solving optimization problems of this type by showing that under a certain condition called the time-sharing condition, the duality gap of the optimization problem is always zero, regardless of the convexity of the objective function. Further, we show that the time-sharing condition is satisfied for practical multiuser spectrum optimization problems in multicarrier systems in the limit as the number of carriers goes to infinity. This result leads to efficient numerical algorithms that solve the nonconvex problem in the dual domain. We show that the recently proposed optimal spectrum balancing algorithm for digital subscriber lines can be interpreted as a dual algorithm. This new interpretation gives rise to more efficient dual update methods. It also suggests ways in which the dual objective may be evaluated approximately, further improving the numerical efficiency of the algorithm. We propose a low-complexity iterative spectrum balancing algorithm based on these ideas, and show that the new algorithm achieves near-optimal performance in many practical situations. Index Terms—Digital subscriber lines (DSLs), discrete multitone (DMT), duality theory, dynamic spectrum management (DSM), iterative spectrum balancing (ISB), nonconvex optimization, optimal spectrum balancing (OSB), orthogonal frequency-division multiplex (OFDM). I.
Cross-layer optimization for OFDM wireless network-- Part I: Theoretical framework
- IEEE TRANS. WIRELESS COMMUN
, 2005
"... In this paper, we provide a theoretical framework for cross-layer optimization for orthogonal frequency division multiplexing (OFDM) wireless networks. The utility is used in our study to build a bridge between the physical layer and the media ac-cess control (MAC) layer and to balance the efficien ..."
Abstract
-
Cited by 120 (3 self)
- Add to MetaCart
In this paper, we provide a theoretical framework for cross-layer optimization for orthogonal frequency division multiplexing (OFDM) wireless networks. The utility is used in our study to build a bridge between the physical layer and the media ac-cess control (MAC) layer and to balance the efficiency and fairness of wireless resource allocation. We formulate the cross-layer optimization problem as one that maximizes the average utility of all active users subject to certain conditions, which are determined by adaptive resource allocation schemes. We present necessary and sufficient conditions for utility-based optimal subcarrier assignment and power allocation and discuss the convergence properties of optimization. Numerical results demonstrate a significant performance gain for the cross-layer optimization and the gain increases with the number of active users in the networks.
QoS Aware Adaptive Resource Allocation Techniques for Fair Scheduling in OFDMA Based Broadband Wireless Access Systems
, 2003
"... A system based on orthogonal frequency division multiple access (OFDMA) has been developed to deliver mobile broadband data service at data rates comparable to those of wired services, such as DSL and cable modems. We consider the resource allocation problem of assigning a set of subcarriers and det ..."
Abstract
-
Cited by 61 (1 self)
- Add to MetaCart
A system based on orthogonal frequency division multiple access (OFDMA) has been developed to deliver mobile broadband data service at data rates comparable to those of wired services, such as DSL and cable modems. We consider the resource allocation problem of assigning a set of subcarriers and determining the number of bits to be transmitted for each subcarrier in OFDMA systems. We compare simplicity, fairness and efficiency of our algorithm with the optimal and proposed suboptimal algorithms for varying values of delay spread, number of users and total power constraint. The results show that performance of our approach is appealing and can be close to optimal.
Downlink scheduling and resource allocation for OFDM systems
- IN CISS
, 2006
"... Abstract—We consider scheduling and resource allocation for the downlink of a cellular OFDM system, with various practical considerations including integer carrier allocations, different subchannelization schemes, a maximum SNR constraint per tone, and “self-noise ” due to channel estimation errors ..."
Abstract
-
Cited by 59 (15 self)
- Add to MetaCart
Abstract—We consider scheduling and resource allocation for the downlink of a cellular OFDM system, with various practical considerations including integer carrier allocations, different subchannelization schemes, a maximum SNR constraint per tone, and “self-noise ” due to channel estimation errors and phase noise. During each time-slot a subset of users must be scheduled for transmission, and the available tones and transmission power must be allocated among the selected users. Employing a gradient-based scheduling scheme presented in earlier papers reduces this to an optimization problem to be solved in each time-slot. Using dual decomposition techniques, we give an optimal algorithm for this problem when multiple users can time-share each carrier. We then give several low complexity heuristics that enforce an integer constraint on the carrier allocation. Simulations show that the algorithms presented all achieve similar performance under a wide range of scenarios, and that the performance gap between the optimal and suboptimal algorithms widens when per user SNR constraints or channel estimation errors are considered. I.
Multiuser MIMO-OFDM for Next-Generation Wireless Systems
, 2007
"... This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highl ..."
Abstract
-
Cited by 44 (5 self)
- Add to MetaCart
This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also
FDMA-Capacity of Gaussian Multiple-Access Channels with ISI
- IEEE Trans. Commun
, 2000
"... This paper proposes a numerical method for characterizing the rate region achievable with frequency-division multiple access (FDMA) for a Gaussian multiple-access channel with intersymbol interference. The frequency spectrum is divided into discrete frequency bins and the discrete bin-assignment pro ..."
Abstract
-
Cited by 35 (3 self)
- Add to MetaCart
This paper proposes a numerical method for characterizing the rate region achievable with frequency-division multiple access (FDMA) for a Gaussian multiple-access channel with intersymbol interference. The frequency spectrum is divided into discrete frequency bins and the discrete bin-assignment problem is shown to have a convex relaxation, making it tractable to numerical optimization algorithms. A practical low-complexity algorithm for the two-user case is also proposed. The algorithm is based on the observation that the optimal frequency partition has a two-band structure when the two channels are identical or when the signal-to-noise ratio is high. Simulation result shows that the algorithm performs well in other cases as well. The FDMA-capacity algorithm is used to devise the optimal frequency-division duplex plan for very-high-speed digital subscriber lines.
Adaptation, Coordination and Distributed Resource Allocation in Interference-Limited Wireless Networks
"... A sensible design of wireless networks involves striking a good balance between an aggressive reuse of the spectral resource throughout the network and managing the resulting co-channel interference. Traditionally this problem has been tackled using a “divide and conquer” approach. The latter consis ..."
Abstract
-
Cited by 35 (3 self)
- Add to MetaCart
(Show Context)
A sensible design of wireless networks involves striking a good balance between an aggressive reuse of the spectral resource throughout the network and managing the resulting co-channel interference. Traditionally this problem has been tackled using a “divide and conquer” approach. The latter consists in deploying the network with a static or semi-dynamic pattern of resource reutilization. The chosen reuse factor, while sacrificing a substantial amount of efficiency, brings the interference to a tolerable level. The resource can then be managed in each cell so as to optimize the per cell capacity using an advanced air interface design. In this paper we focus our attention on the overall network capacity as a measure of system performance. We consider the problem of resource allocation and adaptive transmission in multicell scenarios. As a key instance, the problem of joint scheduling and power control simultaneously in multiple transmit-receive links, which employ capacity-achieving adaptive codes, is studied. In principle, the solution of such an optimization hinges on tough issues such as the computational complexity and the requirement for heavy receiver-to-transmitter feedback and, for cellular networks, cell-to-cell channel state information (CSI) signaling. We give asymptotic properties pertaining to rate-maximizing power control and scheduling in multicell networks. We then present some promising leads for substantial complexity and signaling reduction via the use of newly developed distributed and game theoretic techniques.
Enhancing cell-edge performance: A downlink dynamic interference avoidance scheme with inter-cell coordination
- IEEE Transactions on Wireless Communications
, 2010
"... Abstract—Interference management has been a key concept for designing future high data-rate wireless systems that are required to employ dense reuse of spectrum. Static or semistatic interference coordination based schemes provide enhanced cell-edge performance but with severe penalty to the overall ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
(Show Context)
Abstract—Interference management has been a key concept for designing future high data-rate wireless systems that are required to employ dense reuse of spectrum. Static or semistatic interference coordination based schemes provide enhanced cell-edge performance but with severe penalty to the overall cell throughput. Furthermore, static resource planning makes these schemes unsuitable for applications in which frequency planning is difficult, such as femtocell networks. In this paper, we present a novel dynamic interference avoidance scheme that makes use of inter-cell coordination in order to prevent excessive inter-cell interference, especially for cell or sector edge users that are most affected by inter-cell interference, with minimal or no impact on the network throughput. The proposed scheme is comprised of a two-level algorithm- one at the base station level and the other at a central controller to which a group of neighboring base stations are connected. Simulation results show that the proposed scheme outperforms the reference schemes, in which either coordination is not employed (reuse of 1) or employed in a static manner (reuse of 3 and fractional frequency reuse), in terms of cell edge throughput with a minimal impact on the network throughput and with some increase in complexity. Index Terms—OFDMA resource allocation, interference avoidance, resource optimization, inter-cell coordination.
Dynamic Frequency Allocation in Fractional Frequency Reused OFDMA Networks”, to appear at the 4
- th IEEE Workshop on Broadband Wireless Access
, 2008
"... Abstract—This paper proposes a dynamic fractional frequency reused cell architecture that simplifies the problem of subcarrier allocation with frequency reuse in multicell OFDMA networks. The architecture divides the cell surface into two overlapping geographical regions and orthogonally allocates s ..."
Abstract
-
Cited by 33 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper proposes a dynamic fractional frequency reused cell architecture that simplifies the problem of subcarrier allocation with frequency reuse in multicell OFDMA networks. The architecture divides the cell surface into two overlapping geographical regions and orthogonally allocates subcarriers, which are called super and regular group of subcarriers, to the regions. The proposed architecture allows a frequency reuse factor of 1 with reduced inter-cell interference and increased trunking gain, while satisfying minimum data rate requirements. We also propose an efficient hierarchical solution to realize the proposed architecture. The solution first allocates subcarriers to the groups so that long term performance is maximized and next opportunistically schedules subcarriers to the users. The opportunistic scheduling is performed at the base stations considering the fairness requirements of the users. Simulation results illustrate the performance improvements of the proposed solution in comparison to the traditional frequency allocation schemes. Index Terms—Wireless communication, mobile communication systems, cellular networks, 3G, cross-layer adaptation, opportunistic scheduling, data networks. I.
Rate-Maximizing Power Allocation in OFDM Based on Partial Channel Knowledge
, 2004
"... Power loading algorithms improve the data rates of OFDM systems. However, they require the transmitter to have perfect channel state information, which is impossible in most wireless systems. We investigate the effects of imperfect (and thus partial) channel feedback on the throughput of OFDM system ..."
Abstract
-
Cited by 32 (2 self)
- Add to MetaCart
(Show Context)
Power loading algorithms improve the data rates of OFDM systems. However, they require the transmitter to have perfect channel state information, which is impossible in most wireless systems. We investigate the effects of imperfect (and thus partial) channel feedback on the throughput of OFDM systems. Two channel uncertainty models are studied: i) the ergodic model, where average rate is the figure of merit; and ii) the quasi-static model, where outage rate is relevant. Rate-power allocation algorithms are developed. The throughput achieved by these algorithms and the effects of channel multipath are investigated analytically and with simulations.
