By Topic

Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on

Date 7-12 July 2013

Filter Results

Displaying Results 1 - 25 of 643
  • [Copyright notice]

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Welcome

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (31 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program

    Publication Year: 2013, Page(s):1 - 49
    Request permission for commercial reuse | PDF file iconPDF (233 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2013, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Other reviewers

    Publication Year: 2013, Page(s):1 - 18
    Request permission for commercial reuse | PDF file iconPDF (95 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2013, Page(s):1 - 30
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • Paper by title

    Publication Year: 2013, Page(s):1 - 20
    Request permission for commercial reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (107 KB)
    Freely Available from IEEE
  • Systematic lossy source transmission over Gaussian time-varying channels

    Publication Year: 2013, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (213 KB) | HTML iconHTML

    Systematic lossy transmission of a Gaussian source over a time-varying Gaussian channel is considered. A noisy version of the source is transmitted in an uncoded fashion to the destination through a time-varying Gaussian “base channel”, constituting the systematic part of the transmission. A second time-varying Gaussian channel, called the “enhancement channel”, orthogo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On zero delay source-channel coding: Functional properties and linearity conditions

    Publication Year: 2013, Page(s):6 - 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (159 KB) | HTML iconHTML

    In this paper, we study the zero-delay source-channel coding problem, and specifically the problem of obtaining the vector transformations that optimally map between the m-dimensional source space and the k-dimensional channel space, under a given transmission power constraint and for the mean square error distortion. We first study the functional properties of this problem and show that the objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian HDA coding with bandwidth expansion and side information at the decoder

    Publication Year: 2013, Page(s):11 - 15
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Lossy transmission of a Gaussian source over an additive white Gaussian (AWGN) channel with side information at the decoder is tackled under the regime of bandwidth expansion. A previously known scheme, hybrid digital/analog Wyner-Ziv (HDA-WZ) coding is shown to remain optimal when extended from the bandwidth matched case to the bandwidth expansion case. The extended scheme also exhibits similar r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic joint source-Channel coding with feedback

    Publication Year: 2013, Page(s):16 - 20
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB) | HTML iconHTML

    This paper considers real time joint source-channel coding of a Markov source over a discrete memoryless channel with noiseless feedback. The encoder incurs a cost which is minimized along with a real-time end-to-end distortion. The problem is mapped to a partially observable Markov decision problem and the corresponding optimality equations, in the form of dynamic programming equations, are deriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bursty interference channel with feedback

    Publication Year: 2013, Page(s):21 - 25
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (566 KB) | HTML iconHTML

    We explore the benefit of feedback for physical layer interference management in wireless networks without centralized upper layer control mechanisms. Lack of coordination in the upper layer could make the interference experienced in the physical layer bursty. To understand how to harness such burstiness with feedback, we investigate a two-user bursty interference channel (IC), where the presence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference channel with intermittent feedback

    Publication Year: 2013, Page(s):26 - 30
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (137 KB) | HTML iconHTML

    We investigate how to exploit intermittent feedback for interference management. Focusing on the two-user linear deterministic interference channel, we completely characterize the capacity region. We find that the characterization only depends on the forward channel parameters and the marginal probability distribution of each feedback link. The scheme we propose makes use of block Markov encoding ... View full abstract»

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

    Publication Year: 2013, Page(s):31 - 35
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    We study interference channels (IFC) where interaction among sources and destinations is enabled, e.g., both sources and destinations can talk to each other. The interaction can come in two ways: 1) for half-duplex radios, destinations can talk back to sources using either simultaneous out-of-band (white spaces) transmission or in-band half-duplex transmission; 2) for full-duplex radios, both sour... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback can increase the degrees of freedom of the rank-deficient interference channel

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

    We characterize the total degrees of freedom (DoF) of the two-user rank-deficient interference channel with feedback, in which transmitter i and receiver j use Mi and Nj antennas, respectively, and the rank of the channel matrix between transmitter i and receiver j is given by Dji ≤ min(Mi, Nj) ∀i, j = 1,2. One consequence of thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convexity of error rates in digital communications under non-Gaussian noise

    Publication Year: 2013, Page(s):41 - 45
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (138 KB) | HTML iconHTML

    Convexity properties of error rates of a class of decoders, including the ML/min-distance one as a special case, are studied for arbitrary constellations. Earlier results obtained for the AWGN channel are extended to a wide class of (non-Gaussian) noise densities, including unimodal and spherically-invariant noise. Under these broad conditions, symbol error rates are shown to be convex functions o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalizing the sampling property of the Q-function for Error Rate analysis of cooperative communication in fading channels

    Publication Year: 2013, Page(s):46 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    This paper extends some approximation methods that are used to identify closed form Bit Error Rate (BER) expressions which are frequently utilized in investigation and comparison of performance for wireless communication systems in the literature. By using this group of approximation methods, some expectation integrals, whose exact analyses are intractable and whose Monte Carlo simulation computat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact symbol error probability of square M-QAM signaling over generalized fading channels subject to additive generalized Gaussian noise

    Publication Year: 2013, Page(s):51 - 55
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    This paper considers the average symbol error probability of square Quadrature Amplitude Modulation (QAM) coherent signaling over flat fading channels subject to additive generalized Gaussian noise. More specifically, a generic closed-form expression in terms of the Fox H function and the bivariate Fox H function is offered for the extended generalized-K fading case. Simplifications for some speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact capture probability analysis of GSC receivers over i.n.d. Rayleigh fading channels

    Publication Year: 2013, Page(s):56 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (183 KB) | HTML iconHTML

    A closed-form expression of the capture probability of generalized selection combining (GSC) RAKE receivers was introduced in [1]. The idea behind this new performance metric is to quantify how the remaining set of uncombined paths affects the overall performance both in terms of loss in power and increase in interference levels. In this previous work, the assumption was made that the fading is bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random threshold graphs with exponential fitness: The width of the phase transition for connectivity

    Publication Year: 2013, Page(s):61 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (178 KB) | HTML iconHTML

    We consider random threshold graphs where the fitness variables are exponentially distributed. Simulations show that the zero-one law for graph connectivity exhibits a sharp phase transition. We formalize this observation by providing exact asymptotics for the width of the phase transition in the many node regime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Age of information under random updates

    Publication Year: 2013, Page(s):66 - 70
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (633 KB) | HTML iconHTML

    We consider the system where a source randomly generates status update messages and transmits them via a network cloud to the intended destination. These update message can take different times to traverse the network, which we model as exponential service times, and may result in packets reaching the destination out of order, rendering some of the earlier transmissions obsolete. We analyze the st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptotics

    Publication Year: 2013, Page(s):71 - 75
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    As networked systems increasingly pervade every facet of life, it is quintessential for users to communicate without revealing their identities or the paths of data flow. Chaum Mixes are intermediate nodes or routers that are used to provide anonymity by using cryptographic and batching methods to hide source identities. The anonymity achievable by batching strategies, are however, severely impact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized relay-route assignment for anonymity in wireless networks

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

    Anonymous wireless networks use covert relays to prevent unauthorized entities from determining communicating parties through traffic timing analysis. In a multipath anonymous network, the choice of which relay nodes should be covert, as well as the route selection by the network nodes, affect both the anonymity and network performance. Although assigning relays as covert and selecting routes comp... View full abstract»

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