ML approaches to channel estimation for pilot-aided multi-rate DS/CDMA systems

This paper analyzes the asymptotic performance of maximum likelihood (ML) channel estimation algorithms in wideband code division multiple access (WCDMA) scenarios. We concentrate on systems with periodic spreading sequences (period larger than or equal to the symbol span) where the transmitted signal contains a code division multiplexed pilot for channel estimation purposes. First, the asymptotic covariances of the training-only, semi-blind conditional maximum likelihood (CML) and semi-blind Gaussian maximum likelihood (GML) channelestimators are derived. Then, these formulas are further simplified assuming randomized spreading and training sequences under the approximation of high spreading factors and high number of codes. The results provide a useful tool to describe the performance of the channel estimators as a function of basicsystem parameters such as number of codes, spreading factors, or traffic to training power ratio.

Diseño de antenas UHF para aplicaciones RFID

Aquest projecte es basa en l'estudi, disseny i avaluació d'antenes per a aplicacions RFID a la banda UHF. Les etiquetes RFID estan compostes per un xip i una antena que han de presentar una bona adaptació per a aconseguir màxima transferència de potència. Els dos objectius principals en els diferents fases de disseny de cada antena han estat optimitzar les seves dimensions, i incrementar l'ample de banda.

Inclusió de les TIC en el portafoli de l'estudiant per a l'ensenyament dels mètodes numèrics

La finalitat d’aquest projecte ha estat la millora de la formació global dels estudiants. Concretament, mitjançant la creació d’un portafolis que contingui les diferents activitats que ha realitzat l’estudiant al llarg del curs es pretén potenciar tant les competències específiques com les competències transversals dels estudiants. Concretament, aquest objectiu s'ha assolit mitjançant el disseny i el desenvolupament de: 1. nou material docent corresponent a la presentació dels continguts de l’assignatura (apunts, presentacions, animacions,... ) amb el que s'ha pretès promoure el treball individual i la capacitat d’autoaprenentatge dels estudiants. 2. sesions dirigits que es realitzen en aules informàtiques amb el que s'ha volgut incrementar la motivació i desenvolupar un esperit crític dels estudiants 3. treballs tutelats que els estudiants realitzaran en grups, posteriorments pesentaran a la resta de companys i que finalment condueixen a la redacció d’un informe final. D'aquesta manera s'ha pretès desenvolupar les competències transversals dels estudiants

GATD : una eina simplificada per la gestió de les actuacions tècniques a domicili

Treball de fi de carrera de Enginyeria Tècnica de Sistemes d'en Jordi Tejero. Consisteix en el desenvolupament d'una eina, força simplificada, per a gestionar les actuacions a domicili d'una empresa de serveis tècnics, com pot ser una lampisteria.El producte és una aplicació web desenvolupada integrament amb els recursos que proporciona el servidor d'aplicacions GlassFish v3, de Sun. En particular, empra EJB 3, Java Server Faces 2 i JavaDb (Derby) com a SGBD.A més de l'executable, el producte inclou el codi font Java, el projecte Eclipse amb que s'ha desenvolupat, la documentació JavaDoc, una breu guia pels usuaris i el resultat de les proves realitzades.A banda, s'hi publica la memòria del treball i una presentació virtual en Power Point.

Característiques de l’habitatge actual

Presentació power-point

Relació amb la demanda d’habitatge

Presentació en power-point

Tight coupling in thermal Brownian motors

We study analytically a thermal Brownian motor model and calculate exactly the Onsager coefficients. We show how the reciprocity relation holds and that the determinant of the Onsager matrix vanishes. Such a condition implies that the device is built with tight coupling. This explains why Carnot¿s efficiency can be achieved in the limit of infinitely slow velocities. We also prove that the efficiency at maximum power has the maximum possible value, which corresponds to the Curzon-Alhborn bound. Finally, we discuss the model acting as a Brownian refrigerator.

Two algorithms to find a power integral basis

"Vegeu el resum a l'inici del fitxer adjunt."

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

On an asymptotic formula for the maximum voltage drop in a on-chip power distribution network

We present a new asymptotic formula for the maximum static voltage in a simplified model for on-chip power distribution networks of array bonded integrated circuits. In this model the voltage is the solution of a Poisson equation in an infinite planar domain whose boundary is an array of circular pads of radius ", and we deal with the singular limit Ɛ → 0 case. In comparison with approximations that appear in the electronic engineering literature, our formula is more complete since we have obtained terms up to order Ɛ15. A procedure will be presented to compute all the successive terms, which can be interpreted as using multipole solutions of equations involving spatial derivatives of functions. To deduce the formula we use the method of matched asymptotic expansions. Our results are completely analytical and we make an extensive use of special functions and of the Gauss constant G

Robust power allocation algorithms for MIMO OFDM systems with imperfect CSI

This paper presents a Bayesian approach to the design of transmit prefiltering matrices in closed-loop schemes robust to channel estimation errors. The algorithms are derived for a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Two different optimizationcriteria are analyzed: the minimization of the mean square error and the minimization of the bit error rate. In both cases, the transmitter design is based on the singular value decomposition (SVD) of the conditional mean of the channel response, given the channel estimate. The performance of the proposed algorithms is analyzed,and their relationship with existing algorithms is indicated. As withother previously proposed solutions, the minimum bit error rate algorithmconverges to the open-loop transmission scheme for very poor CSI estimates.

The maximum voltage drop in an on-chip power distribution network: analysis of square, triangular and hexagonal power pad arrangements

A mathematical model of the voltage drop which arises in on-chip power distribution networks is used to compare the maximum voltage drop in the case of different geometric arrangements of the pads supplying power to the chip. These include the square or Manhattan power pad arrangement, which currently predominates, as well as equilateral triangular and hexagonal arrangements. In agreement with the findings in the literature and with physical and SPICE models, the equilateral triangular power pad arrangement is found to minimize the maximum voltage drop. This headline finding is a consequence of relatively simple formulas for the voltage drop, with explicit error bounds, which are established using complex analysis techniques, and elliptic functions in particular.

The maximum voltage drop in an on-chip power distribution network: analysis of square, triangular and hexagonal power pad arrangements

A mathematical model of the voltage drop which arises in on-chip power distribution networks is used to compare the maximum voltage drop in the case of different geometric arrangements of the pads supplying power to the chip. These include the square or Manhattan power pad arrangement, which currently predominates, as well as equilateral triangular and hexagonal arrangements. In agreement with the findings in the literature and with physical and SPICE models, the equilateral triangular power pad arrangement is found to minimize the maximum voltage drop. This headline finding is a consequence of relatively simple formulas for the voltage drop, with explicit error bounds, which are established using complex analysis techniques, and elliptic functions in particular.

Encryption methods using formal power series rings

Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.

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.