In interference-limited wireless networks, interference management techniques are important in order to improve the performance of the systems. Given that spectrum and energy are scarce resources in these networks, techniques that exploit the resources efficiently are desired. We consider a set of base stations operating concurrently in the same spectral band. Each base station is equipped with multiple antennas and transmits data to a single-antenna mobile user. This setting corresponds to the multiple-input single-output (MISO) interference channel (IFC). The receivers are assumed to treat interference signals as noise. Moreover, each transmitter is assumed to know the channels between itself and all receivers perfectly. We study the conflict between the transmitter-receiver pairs (links) using models from game theory and microeconomic theory. These models provide solutions to resource allocation problems which in our case correspond to the joint beamforming design at the transmitters. Our interest lies in solutions that are Pareto optimal. Pareto optimality ensures that it is not further possible to improve the performance of any link without reducing the performance of another link. Strategic games in game theory determine the noncooperative choice of strategies of the players. The outcome of a strategic game is a Nash equilibrium. While the Nash equilibrium in the MISO IFC is generally not efficient, we characterize the necessary null-shaping constraints on the strategy space of each transmitter such that the Nash equilibrium outcome is Pareto optimal. An arbitrator is involved in this setting which dictates the constraints at each transmitter. In contrast to strategic games, coalitional games provide cooperative solutions between the players. We study cooperation between the links via coalitional games without transferable utility. Cooperative beamforming schemes considered are either zero forcing transmission or Wiener filter precoding. We characterize the necessary and sufficient conditions under which the core of the coalitional game with zero forcing transmission is not empty. The core solution concept specifies the strategies with which all players have the incentive to cooperate jointly in a grand coalition. While the core only considers the formation of the grand coalition, coalition formation games study coalition dynamics. We utilize a coalition formation algorithm, called merge-and-split, to determine stable link grouping. Numerical results show that while in the low signal-to-noise ratio (SNR) regime noncooperation between the links is efficient, at high SNR all links benefit in forming a grand coalition. Coalition formation shows its significance in the mid SNR regime where subset link cooperation provides joint performance gains. We use the models of exchange and competitive market from microeconomic theory to determine Pareto optimal equilibria in the two-user MISO IFC. In the exchange model, the links are represented as consumers that can trade goods within themselves. The goods in our setting correspond to the parameters of the beamforming vectors necessary to achieve all Pareto optimal points in the utility region. We utilize the conflict representation of the consumers in the Edgeworth box, a graphical tool that depicts the allocation of the goods for the two consumers, to provide closed-form solution to all Pareto optimal outcomes. The exchange equilibria are a subset of the points on the Pareto boundary at which both consumers achieve larger utility then at the Nash equilibrium. We propose a decentralized bargaining process between the consumers which starts at the Nash equilibrium and ends at an outcome arbitrarily close to an exchange equilibrium. The design of the bargaining process relies on a systematic study of the allocations in the Edgeworth box. In comparison to the exchange model, a competitive market additionally defines prices for the goods. The equilibrium in this economy is called Walrasian and corresponds to the prices that equate the demand to the supply of goods. We calculate the unique Walrasian equilibrium and propose a coordination process that is realized by the arbitrator which distributes the Walrasian prices to the consumers. The consumers then calculate in a decentralized manner their optimal demand corresponding to beamforming vectors that achieve the Walrasian equilibrium. This outcome is Pareto optimal and lies in the set of exchange equilibria. In this thesis, based on the game theoretic and microeconomic models, efficient beamforming strategies are proposed that jointly improve the performance of the systems. The gained results are applicable in interference-limited wireless networks requiring either coordination from the arbitrator or direct cooperation between the transmitters.

No description available.

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California / Although multiple-input multiple-output (MIMO) systems have become increasingly popular, the existence of real time results to compare with those predicted by theory is still surprisingly limited. In this work the hardware description of a MIMO wireless communication system using orthogonal space time block codes (OSTBC) is discussed for two antennas at both the transmitter and receiver. A numerical example for a frequency flat time correlated channel is given to show the impact of channel estimation.

Due to the rapid development of wireless communications together with the inflexibility of the current spectrum allocation policy, radio spectrum becomes more and more exhausted. One of the critical challenges of wireless communication systems is to efficiently utilize the limited frequency resources to be able to support the growing demand of high data rate wireless services. As a promising solution, cognitive radios have been suggested to deal with the scarcity and under-utilization of radio spectrum. The basic idea behind cognitive radios is to allow unlicensed users, also called secondary users (SUs), to access the licensed spectrum of primary users (PUs) which improves spectrum utilization. In order to not degrade the performance of the primary networks, SUs have to deploy interference control, interference mitigating, or interference avoidance techniques to minimize the interference incurred at the PUs. Cognitive radio networks (CRNs) have stimulated a variety of studies on improving spectrum utilization. In this context, this thesis has two main objectives. Firstly, it investigates the performance of single hop CRNs with spectrum sharing and opportunistic spectrum access. Secondly, the thesis analyzes the performance improvements of two hop cognitive radio networks when incorporating advanced radio transmission techniques. The thesis is divided into three parts consisting of an introduction part and two research parts based on peer-reviewed publications. Fundamental background on radio propagation channels, cognitive radios, and advanced radio transmission techniques are discussed in the introduction. In the first research part, the performance of single hop CRNs is analyzed. Specifically, underlay spectrum access using M/G/1/K queueing approaches is presented in Part I-A while dynamic spectrum access with prioritized traffics is studied in Part I-B. In the second research part, the performance benefits of integrating advanced radio transmission techniques into cognitive cooperative radio networks (CCRNs) are investigated. In particular, opportunistic spectrum access for amplify-and-forward CCRNs is presented in Part II-A where collaborative spectrum sensing is deployed among the SUs to enhance the accuracy of spectrum sensing. In Part II-B, the effect of channel estimation error and feedback delay on the outage probability and symbol error rate (SER) of multiple-input multiple-output CCRNs is investigated. In Part II-C, adaptive modulation and coding is employed for decode-and-forward CCRNs to improve the spectrum efficiency and to avoid buffer overflow at the relay. Finally, a hybrid interweave-underlay spectrum access scheme for a CCRN is proposed in Part II-D. In this work, the dynamic spectrum access of the PUs and SUs is modeled as a Markov chain which then is utilized to evaluate the outage probability, SER, and outage capacity of the CCRN.

In this study an attempt has been made to explore the role of technology transfer in the economic growth of Iraq, through the change in the technology itself for the period 1960-1978. For this purpose the economy was disaggregated into seven sectors. The experience of developed countries has shown that technical change is one of the most important factors of economic growth alongside, or even overshadowing, such factors as labour and capital. In the light of technology transfer, developing countries have the advantage of introducing high levels of advancement of knowledge which can be used to induce domestic technical change at later stages. Technical change is normally defined as a shift in the production function, and for this reason two forms of production function were estimated and tested, i. e. the constant elasticity of substitution and the Cobb-Douglas function. Also two specifications (constant and variable) were assigned to technical change. To validate the use of these, statistical tests were conducted to establish the optimum fit. Then the selected form was used to simulate output levels for comparison with actual figures. The techniques used for estimation are both linear and non-linear. Data used are time series in real terms of capital stock and output, as well as number of persons employed. Furthermore in order to judge the importance of technical change to the growth of output on aggregate and sectoral levels, as regards economic growth, comparisons were drawn with existing data from other developed and developing countries, including centrally planned economies.

A method to obtain the exact control-to-output and input-to-output transfer functions for switched DC-to-DC pulse-width modulated power converters is applied to different combinations of operating conditions such as continuous conduction mode (CCM), discontinuous conduction mode (DCM), and discontinuous voltage mode (DVM) and methods of control such as normal voltage mode (NVM), current programming mode (CPM), and V-squared control. The majority of these combinations have not previously had their transfer functions of interest derived to the accuracy provided by the method. The derivation of the method is covered, and the results from its application are verified by simulation. The simulation method is also justied and proposed as an improvement to the methods used by simulation engines for switched mode power supply design such as SIMPLIS.

This thesis concerns communication across channels with multiple inputs and multiple outputs. Specifically, we consider the closed-loop scenario in which knowledge of the state of the multiple-input multiple-output (MIMO) channel is available at the transmitter. We show how this knowledge can be exploited to optimize performance, as measured by the zero-outage capacity, which is the capacity corresponding to zero outage probability. On at-fading channels, a closed-loop transmitter allocates different powers and rates to the multiple channel inputs so as to maximize zero-outage capacity. Frequency-selective fading channels call for a combination of orthogonal-frequency-division multiplexing (OFDM) and MIMO known as MIMO-OFDM. This exacerbates the allocation problem because it multiplies the number of allocation dimensions by the number of OFDM tones. Fortunately, this thesis demonstrates that simple allocations are sufficient to approach the zero-outage capacity. These simple strategies exploit the tendency for random MIMO channels to behave deterministically as the number of inputs becomes large.

As medical care becomes an increasingly large share of Gross Domestic Product, understanding the mechanisms for how and why medical care spending is rising becomes increasingly important. Such an evaluation should consider the productivity relationship between medical care and health. An evaluation of medical productivity involves the measurement of medical care input prices, disease treatment output prices, and the productive relationship between medical care inputs and disease treatment health outcomes. Medical care price measurement is complicated by the heterogeneity of services, the role of insurance in negotiating prices, rapid technological advancements in medical care and limited availability of transaction price data. Health outcome prices are difficult to construct because of the difficulty in measuring health outcomes, the heterogeneity of health outcomes, and the messy relationship between consumption goods and health. Finally, in addition to accurate input and output price measurement, a productivity assessment requires a measurable causal relationship between medical care services and health outcomes. To date, all of these requirements have been insurmountable hurdles to assessing the productivity of medical care for the entire United States economy. This dissertation uses the Medical care Expenditure Panel Survey to address the necessary requirements for evaluating the productivity of medical care. The second chapter constructs regional medical care price indices using transaction prices that control for service type heterogeneity. The data employed in the analysis associates the observed medical care spending with the diseases the spending is used to treat. This association is exploited in the third chapter, which constructs medical care treatment prices for twelve of the major health conditions in the United States. The fourth chapter compares the productivity of medical care services used to produce disease treatment health outcomes across insurance types. / text

No description available.

A wireless relay network consists of multiple source nodes, multiple destination nodes, and possibly many relay nodes in between to facilitate its transmission. It is clear that the performance of such networks highly depends on information for- warding strategies adopted at the relay nodes. This dissertation studies a particular information forwarding strategy called compute-and-forward. Compute-and-forward is a novel paradigm that tries to incorporate the idea of network coding within the physical layer and hence is often referred to as physical layer network coding. The main idea is to exploit the superposition nature of the wireless medium to directly compute or decode functions of transmitted signals at intermediate relays in a net- work. Thus, the coding performed at the physical layer serves the purpose of error correction as well as permits recovery of functions of transmitted signals. For the bidirectional relaying problem with Gaussian channels, it has been shown by Wilson et al. and Nam et al. that the compute-and-forward paradigm is asymptotically optimal and achieves the capacity region to within 1 bit; however, similar results beyond the memoryless case are still lacking. This is mainly because channels with memory would destroy the lattice structure that is most crucial for the compute-and-forward paradigm. Hence, how to extend compute-and-forward to such channels has been a challenging issue. This motivates this study of the extension of compute-and-forward to channels with memory, such as inter-symbol interference. The bidirectional relaying problem with parallel Gaussian channels is also studied, which is a relevant model for the Gaussian bidirectional channel with inter-symbol interference and that with multiple-input multiple-output channels. Motivated by the recent success of linear finite-field deterministic model, we first investigate the corresponding deterministic parallel bidirectional relay channel and fully characterize its capacity region. Two compute-and-forward schemes are then proposed for the Gaussian model and the capacity region is approximately characterized to within a constant gap. The design of coding schemes for the compute-and-forward paradigm with low decoding complexity is then considered. Based on the separation-based framework proposed previously by Tunali et al., this study proposes a family of constellations that are suitable for the compute-and-forward paradigm. Moreover, by using Chinese remainder theorem, it is shown that the proposed constellations are isomorphic to product fields and therefore can be put into a multilevel coding framework. This study then proposes multilevel coding for the proposed constellations and uses multistage decoding to further reduce decoding complexity.