5,520 research outputs found

    Noisy Channel-Output Feedback Capacity of the Linear Deterministic Interference Channel

    Get PDF
    In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which imple- menting channel-output feedback in only one of the transmitter- receiver pairs is as beneficial as implementing it in both links, in terms of achievable individual rate and sum-rate improvements w.r.t. the case without feedback. In other scenarios, the use of channel-output feedback in any of the transmitter-receiver pairs benefits only one of the two pairs in terms of achievable individual rate improvements or simply, it turns out to be useless, i.e., the capacity regions with and without feedback turn out to be identical even in the full absence of noise in the feedback links.Comment: 5 pages, 9 figures, see proofs in V. Quintero, S. M. Perlaza, and J.-M. Gorce, "Noisy channel-output feedback capacity of the linear deterministic interference channel," INRIA, Tech. Rep. 456, Jan. 2015. This was submitted and accepted in IEEE ITW 201

    Consistent 3D Quantum Gravity on Lens Spaces

    Full text link
    We study non-perturbative quantization of 3d gravity with positive cosmological constant (de Sitter space being the prototype vacuum solution, whose Euclideanization of course gives the three sphere) on the background topology of lens space, which is a three spheres modulo a discrete group. Instead of the strategy followed by a recent work \cite{Castro:2011xb}, which compares results in the second and first order formulations of gravity, we concentrate on the later solely. We note, as a striking feature, that the quantization, that relies heavily on the axiomatics of topological quantum field theory (TQFT) can only be consistently carried by augmenting the conventional theory by an additional topological term coupled through a dimensionless parameter. More importantly the introduction of this additional parameter renders the theory finite.Comment: New section and references added. Accepted in Phys. Rev. D for publicatio

    Quality-Of-Service Provisioning in Decentralized Networks: A Satisfaction Equilibrium Approach

    Full text link
    This paper introduces a particular game formulation and its corresponding notion of equilibrium, namely the satisfaction form (SF) and the satisfaction equilibrium (SE). A game in SF models the case where players are uniquely interested in the satisfaction of some individual performance constraints, instead of individual performance optimization. Under this formulation, the notion of equilibrium corresponds to the situation where all players can simultaneously satisfy their individual constraints. The notion of SE, models the problem of QoS provisioning in decentralized self-configuring networks. Here, radio devices are satisfied if they are able to provide the requested QoS. Within this framework, the concept of SE is formalized for both pure and mixed strategies considering finite sets of players and actions. In both cases, sufficient conditions for the existence and uniqueness of the SE are presented. When multiple SE exist, we introduce the idea of effort or cost of satisfaction and we propose a refinement of the SE, namely the efficient SE (ESE). At the ESE, all players adopt the action which requires the lowest effort for satisfaction. A learning method that allows radio devices to achieve a SE in pure strategies in finite time and requiring only one-bit feedback is also presented. Finally, a power control game in the interference channel is used to highlight the advantages of modeling QoS problems following the notion of SE rather than other equilibrium concepts, e.g., generalized Nash equilibrium.Comment: Article accepted for publication in IEEE Journal on Selected Topics in Signal Processing, special issue in Game Theory in Signal Processing. 16 pages, 6 figure

    2D Face Recognition System Based on Selected Gabor Filters and Linear Discriminant Analysis LDA

    Full text link
    We present a new approach for face recognition system. The method is based on 2D face image features using subset of non-correlated and Orthogonal Gabor Filters instead of using the whole Gabor Filter Bank, then compressing the output feature vector using Linear Discriminant Analysis (LDA). The face image has been enhanced using multi stage image processing technique to normalize it and compensate for illumination variation. Experimental results show that the proposed system is effective for both dimension reduction and good recognition performance when compared to the complete Gabor filter bank. The system has been tested using CASIA, ORL and Cropped YaleB 2D face images Databases and achieved average recognition rate of 98.9 %

    Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks

    Full text link
    This paper is concerned with the concept of equilibrium and quality of service (QoS) provisioning in self-configuring wireless networks with non-cooperative radio devices (RD). In contrast with the Nash equilibrium (NE), where RDs are interested in selfishly maximizing its QoS, we present a concept of equilibrium, named satisfaction equilibrium (SE), where RDs are interested only in guaranteing a minimum QoS. We provide the conditions for the existence and the uniqueness of the SE. Later, in order to provide an equilibrium selection framework for the SE, we introduce the concept of effort or cost of satisfaction, for instance, in terms of transmit power levels, constellation sizes, etc. Using the idea of effort, the set of efficient SE (ESE) is defined. At the ESE, transmitters satisfy their minimum QoS incurring in the lowest effort. We prove that contrary to the (generalized) NE, at least one ESE always exists whenever the network is able to simultaneously support the individual QoS requests. Finally, we provide a fully decentralized algorithm to allow self-configuring networks to converge to one of the SE relying only on local information.Comment: Accepted for publication in Globecom 201

    Sgr A* ``Visual Binaries'': A Direct Measurement of the Galactocentric Distance

    Get PDF
    We present a new geometrical method for measuring the distance to the Galactic center (R_0) by solving for the Keplerian orbit of individual stars bound to the black hole associated with the Sgr A* from radial velocity and proper motion measurements. We identify three stars to which the method may be applied, and show that 1-5 % accuracy of R_0 can be expected after 15 years of observing, and 0.5-2 % after 30 years of observing, depending on what the orbital parameters of these three stars turn out to be. Combining the measurements of the three stars with favorable orbital parameters leads to even more precise values. In the example that we present, such combined solution yields 4 % accuracy already by the year 2002. All these estimates assume that annual position measurements will continue to be made with the 2 mas precision recently reported by Ghez et al. The precision of the distance measurement is relatively insensitive to the radial velocity errors, provided that the latter are less than 50 km/s. Besides potentially giving an estimate of R_0 that is better than any currently in use, the greatest advantage of this method is that it is free from systematic errors.Comment: Submitted to ApJ, 14 pages, 8 figure
    • …
    corecore