Results 1 - 10
of
16
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
- IEEE TRANS. ON INFORM. THEORY
, 2003
"... We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-po ..."
Abstract
-
Cited by 323 (2 self)
- Add to MetaCart
We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple access channel (where the role of transmitters and receivers are reversed), and the corresponding point-to-point channel (where the transmitters can cooperate).
Sum Capacity of the Multiple Antenna Gaussian Broadcast Channel And Uplink-Downlink Duality
- IEEE Transactions on Information Theory
, 2002
"... We characterize the sum capacity of the multiple antenna Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the multiple antenna broadcast channel, the corre ..."
Abstract
-
Cited by 48 (4 self)
- Add to MetaCart
(Show Context)
We characterize the sum capacity of the multiple antenna Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the multiple antenna broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple access channel (where the role of transmitters and receivers are reversed), and the corresponding point-to-point channel (where the transmitters can cooperate).
On the Capacity of the Multiple Antenna Broadcast Channel
- DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
"... The capacity region of the multiple antenna (transmit and receive) broadcast channel is considered. We propose an outer bound to the capacity region by converting this nondegraded broadcast channel into a degraded one with users privy to the signals of users ordered below them. We extend our proof ..."
Abstract
-
Cited by 37 (3 self)
- Add to MetaCart
The capacity region of the multiple antenna (transmit and receive) broadcast channel is considered. We propose an outer bound to the capacity region by converting this nondegraded broadcast channel into a degraded one with users privy to the signals of users ordered below them. We extend our proof techniques in the characterization of the sum capacity of the multiple antenna broadcast channel to evaluate this outer bound with Gaussian inputs. Our main result is the observation that if Gaussian inputs are optimal to the constructed degraded channel, then the capacity region of the multiple antenna broadcast channel is characterized.
The Impact of Space Division Multiplexing on Resource Allocation: A Unified Approach
, 2003
"... Recent advances in the area of wireless communications have revealed the emerging need for efficient wireless access in personal, local and wide area networks. Space division multiple access (SDMA) with smart antennas at the base station is recognized as a promising means of increasing system capaci ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
(Show Context)
Recent advances in the area of wireless communications have revealed the emerging need for efficient wireless access in personal, local and wide area networks. Space division multiple access (SDMA) with smart antennas at the base station is recognized as a promising means of increasing system capacity and supporting rate-demanding services. However, the existence of SDMA at the physical layer raises significant issues at higher layers. In this paper, we attempt to capture the impact of SDMA on channel allocation at the media access control (MAC) layer. This impact obtains different forms in TDMA, CDMA and OFDMA access schemes, due to the different cochannel and inter-channel interference instances, as well as the different effect of corresponding channels (time slots, codes or subcarrier frequencies) on user channel characteristics. We follow a unified approach for these multiple access schemes and propose heuristic algorithms to allocate channels to users and adjust down-link beamforming vectors and transmission powers, with the objective to increase achievable system rate and provide QoS to users in the form of minimum rate guarantees. We consider the class of greedy algorithms, based on criteria such as minimum induced or received interference and minimum signal-to-interference ratio (SIR), as well as the class of SIR balancing algorithms. Our results indicate that this cross-layer approach yields significant performance benefits and that SIR balancing algorithms achieves the best performance.
Joint Base Station Association and Power Allocation for Uplink Sum-Rate Maximization
"... Abstract—In this paper, the problem of sum-rate max-imization with Quality of Service (QoS) for a multi-cell multi-user uplink is addressed. The problem is formulated as a Mixed Integer Nonlinear Programming (MINLP) problem with non-convex feasible region and hence is diffi-cult to solve. A primal-d ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, the problem of sum-rate max-imization with Quality of Service (QoS) for a multi-cell multi-user uplink is addressed. The problem is formulated as a Mixed Integer Nonlinear Programming (MINLP) problem with non-convex feasible region and hence is diffi-cult to solve. A primal-dual infeasible-interior-point method (IIPM) is applied to jointly optimize resources. With this method, simultaneously optimizing the Base Station Association (BSA) and Power Allocation (PA) is possible. Further to reduce the size, the problem is decomposed into two subproblems. The NP-hard Integer Programming (IP) BSA subproblem from the decomposition is solved by two different methods. One method uses the IIPM and other uses a Semidefinite Programming formulation. The PA subproblem is solved iteratively by IIPM. Simulation results converge to the optimum obtained by an existing exhaustive search. Apart from the sum-rate objective, the IIPM is applicable to broad class of utility functions and objectives and it also eliminates the requirement of an initial primal feasible point to begin the algorithm. Index Terms—Base station association, power allocation, mixed integer nonlinear program, primal-dual infeasible-interior-point method. I.
A subspace multiuser beamforming algorithm for downlink of mobile communications
- in Proc. IEEE Int. Symp. Circuits Syst., May 2004
"... Abstract—A new algorithm for downlink multiuser beam-forming in mobile communications is described. The optimization problem is reformulated by modifying the constraints so that weight vectors of different mobile stations are optimized in a reduced feasible region which is a subset of that of the mu ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—A new algorithm for downlink multiuser beam-forming in mobile communications is described. The optimization problem is reformulated by modifying the constraints so that weight vectors of different mobile stations are optimized in a reduced feasible region which is a subset of that of the multiuser beamforming problem. The downlink beamforming weight vec-tors of different mobile stations are then jointly optimized in a subspace instead of searching in the entire parameter space. Simulation results show that the modified optimization problem leads to solutions that satisfy the signal-to-noise-plus-interference ratio specification at each mobile station and that the total power transmitted from the base station is very close to the optimal one. The solution of the modified optimization problem requires signif-icantly less computation than the optimal multiuser beamforming algorithms. Index Terms—Antenna arrays, beamforming, downlink. I.
1Inflated Lattice Precoding, Bias Compensation, and the Uplink/Downlink Duality: The Connection
"... Abstract — We review the uplink/downlink duality between decision-feedback equalization (DFE) and (nonlinear) precoding at the transmitter side. Thereby the effect of bias compensation in DFE is addressed, and its connection to the concept of “inflated lattice precoding ” (ILP)—a tool which has been ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — We review the uplink/downlink duality between decision-feedback equalization (DFE) and (nonlinear) precoding at the transmitter side. Thereby the effect of bias compensation in DFE is addressed, and its connection to the concept of “inflated lattice precoding ” (ILP)—a tool which has been proven to be the key to achieve the capacity of channels with interference known at the transmitter—is elucidated. Concentrating on signal-to-interference plus noise ratios and hence error rates, pairs of schemes dual to each other are identified. It is shown that bias compensation in DFE and the scaling in ILP are dual operations and cancel each other. I.
On the Impact of Information Theory on Today’s Communication Technology
"... Dedicated to our esteemed colleague Prof. Dr. Heinz Gerhäuser on occasion of his 60 th birthday The impact of results from Information Theory on todays information technology is illustrated by means of derivations from capacity formula and chain rule. By this, the huge possible increase in power and ..."
Abstract
- Add to MetaCart
(Show Context)
Dedicated to our esteemed colleague Prof. Dr. Heinz Gerhäuser on occasion of his 60 th birthday The impact of results from Information Theory on todays information technology is illustrated by means of derivations from capacity formula and chain rule. By this, the huge possible increase in power and bandwidth efficiency for transmission of analog source signals via modern digital communication techniques is enlightened. The foundations of modern approaches like OFDM, CDMA, coded modulation, precoding for equalization, signaling over MIMO channels, etc. in theorems of Information Theory, especially the chain rule is pointed out. 1.
Joint Optimal Power Control and Transmit-Receive Beamforming in a Multi-User MIMO Environment
, 2005
"... This master thesis considers joint optimal power control and transmit-receive beamforming for a downlink system in a multi-user MIMO (Multiple Input Multiple Output) environment. The goal of the transmit strategy presented here is to minimize the total transmitted power subject to some desired Quali ..."
Abstract
- Add to MetaCart
This master thesis considers joint optimal power control and transmit-receive beamforming for a downlink system in a multi-user MIMO (Multiple Input Multiple Output) environment. The goal of the transmit strategy presented here is to minimize the total transmitted power subject to some desired Quality of Service criteria, which are based on the operator’s perspective. This results in a multi-variable joint optimization problem with three sets of variables: the transmitter powers, the transmit beamforming vectors and the receive beamforming vectors. Two iterative algorithms will be proposed. The first one is based on the virtual uplink concept, and the solution to this multi-variable optimization problem will be determined by optimizing with respect to one set of variables while having the other two fixed. The second algorithm is based on the uplink-downlink duality for MIMO systems and is solved by minimizing the maximal eigenvalue of an extended coupling matrix. Both algorithms will require global system knowledge and are therefore mainly intended as benchmarks in system simulations. Simulation results will show that both algorithms are producing solutions that might be globally optimal. This is motivated by the fact that the resulting sets of variables are not affected by the initialization process. i
