Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235878] of Robert Calderbank

Papers Published

  1. Aggarwal, V; Bennatan, A; Calderbank, AR, On maximizing coverage in Gaussian relay networks, Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW (2007), pp. 37-41 [doi]
    (last updated on 2018/10/22)

    Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We consider an alternative approach, focusing on maximizing coverage for a given rate. This novel perspective enables treatment of the relay location as a design parameter, producing an extra degree of freedom that may be optimized. Focusing on coverage, we evaluate existing approaches, like decode and forward (DF), compress and forward (CF) and compare them with upper bounds. In the process, we obtain some surprising insights on the performance of these approaches. ©2007 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320