Stanford University

About: Stanford University is a education organization based out in Stanford, California, United States. It is known for research contribution in the topics: Population & Transplantation. The organization has 125751 authors who have published 320347 publications receiving 21892059 citations. The organization is also known as: Leland Stanford Junior University & University of Stanford.

The Average Star Formation Histories of Galaxies in Dark Matter Halos from z = 0-8

Abstract: We present a robust method to constrain average galaxy star formation rates (SFRs), star formation histories (SFHs), and the intracluster light (ICL) as a function of halo mass. Our results are consistent with observed galaxy stellar mass functions, specific star formation rates (SSFRs), and cosmic star formation rates (CSFRs) from z = 0 to z = 8. We consider the effects of a wide range of uncertainties on our results, including those affecting stellar masses, SFRs, and the halo mass function at the heart of our analysis. As they are relevant to our method, we also present new calibrations of the dark matter halo mass function, halo mass accretion histories, and halo-subhalo merger rates out to z = 8. We also provide new compilations of CSFRs and SSFRs; more recent measurements are now consistent with the buildup of the cosmic stellar mass density at all redshifts. Implications of our work include: halos near 1012 M ☉ are the most efficient at forming stars at all redshifts, the baryon conversion efficiency of massive halos drops markedly after z ~ 2.5 (consistent with theories of cold-mode accretion), the ICL for massive galaxies is expected to be significant out to at least z ~ 1-1.5, and dwarf galaxies at low redshifts have higher stellar mass to halo mass ratios than previous expectations and form later than in most theoretical models. Finally, we provide new fitting formulae for SFHs that are more accurate than the standard declining tau model. Our approach places a wide variety of observations relating to the SFH of galaxies into a self-consistent framework based on the modern understanding of structure formation in ΛCDM. Constraints on the stellar mass-halo mass relationship and SFRs are available for download online.

Full duplex radios

Abstract: This paper presents the design and implementation of the first in-band full duplex WiFi radios that can simultaneously transmit and receive on the same channel using standard WiFi 802.11ac PHYs and achieves close to the theoretical doubling of throughput in all practical deployment scenarios. Our design uses a single antenna for simultaneous TX/RX (i.e., the same resources as a standard half duplex system). We also propose novel analog and digital cancellation techniques that cancel the self interference to the receiver noise floor, and therefore ensure that there is no degradation to the received signal. We prototype our design by building our own analog circuit boards and integrating them with a fully WiFi-PHY compatible software radio implementation. We show experimentally that our design works robustly in noisy indoor environments, and provides close to the expected theoretical doubling of throughput in practice.

An Introduction to Harmonic Analysis

Abstract: 1. Fourier series on T 2. The convergence of Fourier series 3. The conjugate function 4. Interpolation of linear operators 5. Lacunary series and quasi-analytic classes 6. Fourier transforms on the line 7. Fourier analysis on locally compact Abelian groups 8. Commutative Banach algebras A. Vector-valued functions B. Probabilistic methods.

The Gaussian wire-tap channel

Abstract: Wyner's results for discrete memoryless wire-tap channels are extended to the Gaussian wire-tap channel. It is shown that the secrecy capacity Cs is the difference between the capacities of the main and wire.tap channels. It is further shown that Rd= Cs is the upper boundary of the achievable rate-equivocation region.

On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

Abstract: Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance. Specifically, we show that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity. In proving this asymptotic result, we provide an algorithm for determining which users should be active under ZFBF. These users are semiorthogonal to one another and can be grouped for simultaneous transmission to enhance the throughput of scheduling algorithms. Based on the user grouping, we propose and compare two fair scheduling schemes in round-robin ZFBF and proportional-fair ZFBF. We provide numerical results to confirm the optimality of ZFBF and to compare the performance of ZFBF and proposed fair scheduling schemes with that of various MIMO BC strategies.