Sequential estimation of multipath MIMO-OFDM channels

Wireless “MIMO” systems, employing multiple transmit and receive antennas, promise a significant increase of channel capacity, while orthogonal frequency-division multiplexing (OFDM) is attracting a good deal of attention due to its robustness to multipath fading. Thus, the combination of both techniques is an attractive proposition for radio transmission. The goal of this paper is the description and analysis of a new and novel pilot-aided estimator of multipath block-fading channels. Typical models leading to estimation algorithms assume the number of multipath components and delays to be constant (and often known), while their amplitudes are allowed to vary with time. Our estimator is focused instead on the more realistic assumption that the number of channel taps is also unknown and varies with time following a known probabilistic model. The estimation problem arising from these assumptions is solved using Random-Set Theory (RST), whereby one regards the multipath-channel response as a single set-valued random entity.Within this framework, Bayesian recursive equations determine the evolution with time of the channel estimator. Due to the lack of a closed form for the solution of Bayesian equations, a (Rao–Blackwellized) particle filter (RBPF) implementation ofthe channel estimator is advocated. Since the resulting estimator exhibits a complexity which grows exponentially with the number of multipath components, a simplified version is also introduced. Simulation results describing the performance of our channel estimator demonstrate its effectiveness.

Mutual information of IID complex Gaussian signals on block Rayleigh-faded channels

We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.

Mutual Information of IID complex Gaussian signals on block Rayleigh-faded channels

We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.

Asymptotic capacity of static multiuser channels with an unknown number of users

We examine a multiple-access communication system in which multiuser detection is performed without knowledge of the number of active interferers. Using a statistical-physics approach, we compute the single-user channel capacity and spectral efficiency in the large-system limit.

Oral administration of the KATP channel opener diazoxide ameliorates disease progression in a murine model of multiple sclerosis

Background Multiple Sclerosis (MS) is an acquired inflammatory demyelinating disorder of the central nervous system (CNS) and is the leading cause of nontraumatic disability among young adults. Activated microglial cells are important effectors of demyelination and neurodegeneration, by secreting cytokines and others neurotoxic agents. Previous studies have demonstrated that microglia expresses ATP-sensitive potassium (KATP) channels and its pharmacological activation can provide neuroprotective and anti-inflammatory effects. In this study, we have examined the effect of oral administration of KATP channel opener diazoxide on induced experimental autoimmune encephalomyelitis (EAE), a mouse model of MS. Methods Anti-inflammatory effects of diazoxide were studied on lipopolysaccharide (LPS) and interferon gamma (IFNy)-activated microglial cells. EAE was induced in C57BL/6J mice by immunization with myelin oligodendrocyte glycoprotein peptide (MOG35-55). Mice were orally treated daily with diazoxide or vehicle for 15 days from the day of EAE symptom onset. Treatment starting at the same time as immunization was also assayed. Clinical signs of EAE were monitored and histological studies were performed to analyze tissue damage, demyelination, glial reactivity, axonal loss, neuronal preservation and lymphocyte infiltration. Results Diazoxide inhibited in vitro nitric oxide (NO), tumor necrosis factor alpha (TNF-¿) and interleukin-6 (IL-6) production and inducible nitric oxide synthase (iNOS) expression by activated microglia without affecting cyclooxygenase-2 (COX-2) expression and phagocytosis. Oral treatment of mice with diazoxide ameliorated EAE clinical signs but did not prevent disease. Histological analysis demonstrated that diazoxide elicited a significant reduction in myelin and axonal loss accompanied by a decrease in glial activation and neuronal damage. Diazoxide did not affect the number of infiltrating lymphocytes positive for CD3 and CD20 in the spinal cord. Conclusion Taken together, these results demonstrate novel actions of diazoxide as an anti-inflammatory agent, which might contribute to its beneficial effects on EAE through neuroprotection. Treatment with this widely used and well-tolerated drug may be a useful therapeutic intervention in ameliorating MS disease.

Capacity of MIMO Channels: asymptotic evaluation under correlated fading

This paper investigates the asymptotic uniform power allocation capacity of frequency nonselective multiple-inputmultiple-output channels with fading correlation at either thetransmitter or the receiver. We consider the asymptotic situation,where the number of inputs and outputs increase without boundat the same rate. A simple uniparametric model for the fadingcorrelation function is proposed and the asymptotic capacity perantenna is derived in closed form. Although the proposed correlationmodel is introduced only for mathematical convenience, itis shown that its shape is very close to an exponentially decayingcorrelation function. The asymptotic expression obtained providesa simple and yet useful way of relating the actual fadingcorrelation to the asymptotic capacity per antenna from a purelyanalytical point of view. For example, the asymptotic expressionsindicate that fading correlation is more harmful when arising atthe side with less antennas. Moreover, fading correlation does notinfluence the rate of growth of the asymptotic capacity per receiveantenna with high Eb /N0.

Enhanced MDIR receiver for space-time dispersive channels

A particular property of the matched desiredimpulse response receiver is introduced in this paper, namely,the fact that full exploitation of the diversity is obtained withmultiple beamformers when the channel is spatially and timelydispersive. This particularity makes the receiver specially suitablefor mobile and underwater communications. The new structureprovides better performance than conventional and weightedVRAKE receivers, and a diversity gain with no needs of additionalradio frequency equipment. The baseband hardware neededfor this new receiver may be obtained through reconfigurabilityof the RAKE architectures available at the base station. Theproposed receiver is tested through simulations assuming UTRAfrequency-division-duplexing mode.

Inverse Problems for multiple invariant curves

Planar polynomial vector fields which admit invariant algebraic curves, Darboux integrating factors or Darboux first integrals are of special interest. In the present paper we solve the inverse problem for invariant algebraic curves with a given multiplicity and for integrating factors, under generic assumptions regarding the (multiple) invariant algebraic curves involved. In particular we prove, in this generic scenario, that the existence of a Darboux integrating factor implies Darboux integrability. Furthermore we construct examples where the genericity assumption does not hold and indicate that the situation is different for these.

Cooperative Transmission and Radio Resources Management for Wireless Networks

Report for the scientific sojourn at the Multimedia Communications Laboratory, University of Texas at Dallas, USA, from September to December 2005. The cooperative transmission has been analyzed taking a broadcast relay channel which assumes a scenario with one source and multiple destinations. Moreover, in order to improve the performance in terms of mutual information, it has been considered that for each destination there is another nearby terminal (called relay) which will help to improve the performance of the destination. This scheme combines different types of channels considered in the information theory, such as the relay channel, broadcast channel and interference channel (if the relays transmit information intended only to its associated destination). In this work, the author has studied the optimal way to encode the signals for the different users, known as capacity region (i.e. related to radio resources management ), of the broadcast relay channel.

Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

Price level convergence, purchasing power parity and multiple structural breaks: an application to US cities

This article provides a fresh methodological and empirical approach for assessing price level convergence and its relation to purchasing power parity (PPP) using annual price data for seventeen US cities. We suggest a new procedure that can handle a wide range of PPP concepts in the presence of multiple structural breaks using all possible pairs of real exchange rates. To deal with cross-sectional dependence, we use both cross-sectional demeaned data and a parametric bootstrap approach. In general, we find more evidence for stationarity when the parity restriction is not imposed, while imposing parity restriction provides leads toward the rejection of the panel stationar- ity. Our results can be embedded on the view of the Balassa-Samuelson approach, but where the slope of the time trend is allowed to change in the long-run. The median half-life point estimate are found to be lower than the consensus view regardless of the parity restriction.

Simulations of parasitic and intrinsic capacitances related to Multiple-Gate-Field-Effect Transistor architectures

Report for the scientific sojourn carried out at the Université Catholique de Louvain, Belgium, from March until June 2007. In the first part, the impact of important geometrical parameters such as source and drain thickness, fin spacing, spacer width, etc. on the parasitic fringing capacitance component of multiple-gate field-effect transistors (MuGFET) is deeply analyzed using finite element simulations. Several architectures such as single gate, FinFETs (double gate), triple-gate represented by Pi-gate MOSFETs are simulated and compared in terms of channel and fringing capacitances for the same occupied die area. Simulations highlight the great impact of diminishing the spacing between fins for MuGFETs and the trade-off between the reduction of parasitic source and drain resistances and the increase of fringing capacitances when Selective Epitaxial Growth (SEG) technology is introduced. The impact of these technological solutions on the transistor cut-off frequencies is also discussed. The second part deals with the study of the effect of the volume inversion (VI) on the capacitances of undoped Double-Gate (DG) MOSFETs. For that purpose, we present simulation results for the capacitances of undoped DG MOSFETs using an explicit and analytical compact model. It monstrates that the transition from volume inversion regime to dual gate behaviour is well simulated. The model shows an accurate dependence on the silicon layer thickness,consistent withtwo dimensional numerical simulations, for both thin and thick silicon films. Whereas the current drive and transconductance are enhanced in volume inversion regime, our results show thatintrinsic capacitances present higher values as well, which may limit the high speed (delay time) behaviour of DG MOSFETs under volume inversion regime.

Deadlock avoidance with virtual channels

High Performance Computing is a rapidly evolving area of computer science which attends to solve complicated computational problems with the combination of computational nodes connected through high speed networks. This work concentrates on the networks problems that appear in such networks and specially focuses on the Deadlock problem that can decrease the efficiency of the communication or even destroy the balance and paralyze the network. Goal of this work is the Deadlock avoidance with the use of virtual channels, in the switches of the network where the problem appears. The deadlock avoidance assures that will not be loss of data inside network, having as result the increased latency of the served packets, due to the extra calculation that the switches have to make to apply the policy.

The Global Diffusion of Regulatory Agencies: Channels of Transfer and Stages of Diffusion

The autonomous regulatory agency has recently become the ‘appropriate model’ of governance across countries and sectors. The dynamics of this process is captured in our data set, which covers the creation of agencies in 48 countries and 16 sectors since the 1920s. Adopting a diffusion approach to explain this broad process of institutional change, we explore the role of countries and sectors as sources of institutional transfer at different stages of the diffusion process. We demonstrate how the restructuring of national bureaucracies unfolds via four different channels of institutional transfer. Our results challenge theoretical approaches that overemphasize the national dimension in global diffusion and are insensitive to the stages of the diffusion process. Further advance in study of diffusion depends, we assert, on the ability to apply both cross-sectoral and cross-national analysis to the same research design and to incorporate channels of transfer with different causal mechanisms for different stages of the diffusion process.

The Multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.