A Listing of Current Books

Abstract—We investigate cooperative strategies for relay-aided multi-source multi-destination wireless networks with backhaul support. Each source multicasts information to all destinations using a shared relay. We study cooperative strategies based on different network coding (NC) schemes, namely, finite field NC (FNC), linear NC (LNC), and lattice coding. To further exploit the backhaul connection, we also propose NC-based beam-forming (NBF). We measure the performance in term of achievable rates over Gaussian channels and observe significant gains over a benchmark scheme. The benefit of using backhaul is also clearly demonstrated in most of scenarios. I

Engineering Biphoton Wave Packets with an Electromagnetically Induced Grating

We propose to shape biphoton wave packets with an electromagnetically induced grating in a four-level double-$\Lambda$ cold atomic system. We show that the induced hybrid grating plays an essential role in directing the new fields into different angular positions, especially to the zeroth-order diffraction. A number of interesting features appear in the shaped two-photon waveforms. For example, broadening or narrowing the spectrum would be possible in the proposed scheme even without the use of a cavity.Comment: Published in Physical Review A 82, 043814 (2010

Federal Estate Tax: Joint Wills and the Marital Deduction

The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper/lower　bounding models for the original noisy network. This paper presents scalable upper bounding models for wireless networks, by firstly extending the ``one-shot'' bounding models developed by Calmon et al. and then integrating them with network equivalence tools. A channel decoupling method is proposed to decompose wireless networks into decoupled multiple-access channels (MACs) and broadcast channels (BCs). The main advantages of the proposed method is its simplicity and the fact that it can be extended easily to large networks with a complexity that grows linearly with the number of nodes. It is demonstrated that the resulting upper bounds can approach the capacity in some setups.QC 20140619VR International Postdo