2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

6-9 Nov. 2011

Filter Results

Displaying Results 1 - 25 of 489
  • [Front cover]

    Publication Year: 2011, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2011, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • [Title page ii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - xxxvi
    Request permission for commercial reuse | PDF file iconPDF (363 KB)
    Freely Available from IEEE
  • Session MA1b: Energy efficient MIMO communication

    Publication Year: 2011, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Optimal transmission policies over vector Gaussian broadcast channels with energy harvesting transmitters

    Publication Year: 2011, Page(s):3 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    We consider an energy harvesting transmitter sending messages to two users over a vector broadcast channel. Energy required for communication arrives (is harvested) at the transmitter and a finite-capacity battery stores it before being consumed for transmission. Under off-line knowledge of energy arrivals, we obtain the trade-off between the performances of the users by characterizing the maximum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput of wireless networks powered by energy harvesting

    Publication Year: 2011, Page(s):8 - 12
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Designing mobile devices for harvesting ambient energy such as kinetic activities or electromagnetic radiation (EMR) will enable mobile networks to self sustain besides alleviate global warming. The throughput of a mobile ad hoc network powered by energy harvesting is analyzed in this paper using a stochastic-geometry approach. The transmitters powered by energy harvesting are modeled as a Poisson... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-efficient training for antenna selection in time-varying channels

    Publication Year: 2011, Page(s):13 - 17
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    Training for receive antenna selection (AS) differs from that for conventional multiple antenna systems because of the limited hardware usage inherent in AS. We analyze and optimize the performance of a novel energy-efficient training method tailored for receive AS. In it, the transmitter sends not only pilots that enable the selection process, but also an extra pilot that leads to accurate channe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session MA2b: Delay sensitive communication

    Publication Year: 2011, Page(s):18 - 20
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • An analysis of speeding multicast by acknowledgment reduction technique (SMART) with homogeneous and heterogeneous links - a method of types approach

    Publication Year: 2011, Page(s):21 - 27
    Cited by:  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    We present a novel feedback protocol for wireless broadcast networks that use linear network coding. We consider transmission of packets from a single source to many receivers over a single-hop broadcast erasure channel with heterogeneous links. We propose a predictive model to minimize feedback as well as extraneous data transmissions by the source. The predictive model will schedule feedbacks on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatially-aware adaptive error correcting codes for flash memory

    Publication Year: 2011, Page(s):28 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (129 KB) | HTML iconHTML

    Motivated by new storage technologies where the errors in data writing and retention tend to be of limited magnitude and localized, we present new code constructions capable of correcting limited-magnitude asymmetric errors that are within pairwise bounded distance of each other. To account for the dynamic nature of the errors across a Flash device's lifetime, another construction is given that co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correcting erasure bursts with minimum decoding delay

    Publication Year: 2011, Page(s):33 - 39
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    Erasure correcting codes are widely used in upper layers of packet-switched networks, where the packet erasures often exhibit bursty patterns. The conventional wisdom to deal with bursty erasures is to apply block interleaving to break down the bursty patterns prior to error correcting coding, or use long-block Reed-Solomon codes. We show that they unnecessarily lead to sub-optimal decoding delay.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session MA3b: Graphical models in signal processing I

    Publication Year: 2011, Page(s):40 - 42
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Robust max-product belief propagation

    Publication Year: 2011, Page(s):43 - 49
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    We study the problem of optimizing a graph-structured objective function under adversarial uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables (nodes in the graph), and tries to assign their values to maximize an objective function. Nature controls the complementary subset of variables and tries to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session MA4b: In-network computation

    Publication Year: 2011, Page(s):50 - 52
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Network optimization with heuristic rational agents

    Publication Year: 2011, Page(s):53 - 57
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    We study a distributed model for optimizing a sum of convex objective functions corresponding to agents in the network. At random times, agents execute actions based on heuristic rational rules considering only local information. Heuristic rational rules are probabilistic and their expectation yields the actual optimal action. Under heuristic rational rule iterations, it is shown that global netwo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coordination-free distributed algorithm for simple assignment problems using randomized actions

    Publication Year: 2011, Page(s):58 - 61
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB) | HTML iconHTML

    In this paper, we present a distributed algorithm for simple assignment problems in multi-agent systems without the presence of a central or a local coordinator. In a simple assignment problem, a unique task is to be assigned to each agent assuming that the cost of each assignment is identical. We assume that the communication among the agents is restricted over a sparse network, i.e., no agent ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed estimation of the maximum value over a Wireless Sensor Network

    Publication Year: 2011, Page(s):62 - 66
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    This paper focuses on estimating the maximum of the initial measures in a Wireless Sensor Network. Two different algorithms are studied: the RANDOM GOSSIP, relying on pairwise exchanges between the nodes, and the BROADCAST in which each sensor sends its value to all its neighbors; both are asynchronous and distributed. We prove the convergence of these algorithms and provide tight bounds for their... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative sequential-based detection in wireless sensor networks

    Publication Year: 2011, Page(s):67 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    Due to limited power resources, energy efficiency is an important aspect of detection in wireless sensor networks. We propose a collaborative detection scheme, based on sequential hypothesis testing, where a randomly chosen node may initiate a collaboration, collecting observations from neighboring nodes to test the hypotheses. Our simulation results show that for large networks and high SNR, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session MA5b: Medical imaging

    Publication Year: 2011, Page(s):72 - 74
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Calibrationless parallel MRI using CLEAR

    Publication Year: 2011, Page(s):75 - 79
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2920 KB) | HTML iconHTML

    “Auto-calibrated” parallel imaging (PI) strategies provide a robust mechanism for accelerating MRI acquisitions. However, most such strategies require the explicit formation of either coil sensitivity profiles or a cross-coil correlation operator, and as a result reconstruction corresponds to solving a challenging bilinear optimization problem. In this work, we present a novel image-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal modeling and the Cramér-Rao Bound for absolute Magnetic Resonance thermometry in fat tissue

    Publication Year: 2011, Page(s):80 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (189 KB) | HTML iconHTML

    Magnetic Resonance Imaging of tissues with both fat and water resonances allows for absolute temperature mapping through parametric modeling. The fat resonance is used as a reference to determine the absolute water resonance frequency which is linearly related to the temperature. The goal of this paper is to assess whether or not resonance frequency based absolute temperature mapping is feasible i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Level estimation for sparse reconstruction in discrete tomography

    Publication Year: 2011, Page(s):85 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (811 KB) | HTML iconHTML

    In discrete tomography (DT), the goal is to reconstruct from multiple linear projections an unknown image, which is known to have few distinct pixel level intensities. Such images arise in tomography problems where very high contrast is expected, e.g., in angiography medical imaging. A common assumption for DT is that the set of possible intensity levels is known in advance. However, determining t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.