#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Siddhartha Brahma, Ayfer Özgür, Christina Fragouli
- 2012 IEEE International Symposium on Information…
- 2012

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoiding broadcast and multiple access communication can still achieve a significant constant fraction of… (More)

- Siddhartha Brahma, Christina Fragouli, Ayfer Özgür
- 2013 51st Annual Allerton Conference on…
- 2013

We consider the Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. The capacity of such networks, although not known exactly, can be approximated to within a constant gap that is independent of SNR of the channels. The approximation takes the form of a linear program where the optimization… (More)

- Anjan Sarkar, Anjan Banerjee, +4 authors Kantilal L. Majumder
- IEEE Transactions on Image Processing
- 2005

This work deals with multisensor data fusion to obtain landcover classification. The role of feature-level fusion using the Dempster-Shafer rule and that of data-level fusion in the MRF context is studied in this paper to obtain an optimally segmented image. Subsequently, segments are validated and classification accuracy for the test data is evaluated. Two… (More)

We present the design and experimental evaluation of a wireless system that exploits relaying in the context of WiFi. We opt for WiFi given its popularity and wide spread use for a number of applications, such as smart homes. Our testbed consists of three nodes, a source, a relay and a destination, that operate using the physical layer procedures of… (More)

- Siddhartha Brahma, Christina Fragouli
- IEEE Transactions on Information Theory
- 2012

We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prove that, with this formulation, although some instances of the problem become simple, in general, the… (More)

- Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli, Suhas N. Diggavi
- 2011 IEEE Information Theory Workshop
- 2011

We present a structured Quantize-Map-and-Forward (QMF) scheme for cooperative communication over wireless networks, that employs LDPC ensembles for the node operations and message-passing algorithms for decoding. We demonstrate through extensive simulation results over the full-duplex parallel relay network, that our scheme, with no transmit channel state… (More)

- Siddhartha Brahma, Melissa Duarte, Ayan Sengupta, I-Hsiang Wang, Christina Fragouli, Suhas N. Diggavi
- IEEE INFOCOM 2014 - IEEE Conference on Computer…
- 2014

Physical layer cooperation of a source with a relay can significantly boost the performance of a wireless connection. However, the best practical relaying scheme can vary depending on the relative strengths of the channels that connect the source, relay and destination. This paper proposes and evaluates QUILT, a system for physical-layer relaying that… (More)

- Siddhartha Brahma, Christina Fragouli
- 2014 IEEE International Symposium on Information…
- 2014

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SNRs) by solving a linear program that optimizes over the 2<sup>n</sup> relaying states. We recently… (More)

- Siddhartha Brahma, Christina Fragouli
- 2014 IEEE International Symposium on Information…
- 2014

We consider a Gaussian diamond network where a source communicates with the destination through n noninterfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays and two scheduling states can achieve at least half the capacity of the whole network, independent of… (More)