Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 50 for “"source coding"”.

  1. Locally decodable source coding

    Source coding is accomplished via the mapping of consecutive source symbols (blocks) into code blocks of fixed or variable length. The fundamental limits in source coding introduces a tradeoff between the rate of compression and the fidelity of the recovery. However, in practical communication …

    mit Repository record for Locally decodable source coding (opens in a new tab)

  2. Iterative algorithms for lossy source coding

    This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the …

    mit Repository record for Iterative algorithms for lossy source coding (opens in a new tab)

  3. Unified Structural View of Multiterminal Source Coding

    In fact, we set distributed source coding problems in a general framework and take a unified structural view of not only the above open problems but any two-terminal problem with noncooperative encoding. The distortion criteria, if applicable, are required to apply to single letters and be bounded. …

    uiuc Repository record for Unified Structural View of Multiterminal Source Coding (opens in a new tab)

  4. NEW PARADIGMS IN SOURCE CODING AND CHANNEL CODING

    … information theory, data compression and channel coding, are often considered as having reached maturity a long time ago. Our research brings fresh perspectives to both these areas by challenging long-standing assumptions and introducing new frameworks. The Shannon entropy and rate-distortion …

    cornell Repository record for NEW PARADIGMS IN SOURCE CODING AND CHANNEL CODING (opens in a new tab)

  5. Fast Parallel Algorithms for Universal Lossless Source Coding

    … parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may …

    uiuc Repository record for Fast Parallel Algorithms for Universal Lossless Source Coding (opens in a new tab)

  6. Bounds on the Redundancy of Noiseless Source Coding

    The Renyi redundancy, R(,s)(p,w), is the difference between the exponentially weighted average codeword length,

    uiuc Repository record for Bounds on the Redundancy of Noiseless Source Coding (opens in a new tab)

  7. Minimum-error, energy-constrained source coding by sensory neurons

    Neural coding, the process by which neurons represent, transmit, and manipulate physical signals, is critical to the function of the nervous system. Despite years of study, neural coding is still not fully understood. Efforts to model neural coding could improve both the understanding of the …

    uiuc Repository record for Minimum-error, energy-constrained source coding by sensory neurons (opens in a new tab)

  8. Universal and succinct source coding of deep neural networks

    … irrelevant uncertainty and then use arithmetic coding to nearly achieve the entropy bound in a universal manner. We also provide experimental results of our approach on several standard datasets.

    uiuc Repository record for Universal and succinct source coding of deep neural networks (opens in a new tab)

  9. Source coding for channels with finite-state letter costs

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.

    mit Repository record for Source coding for channels with finite-state letter costs (opens in a new tab)

  10. Some Techniques in Universal Source Coding and Coding for Composite Sources

    We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to …

    uiuc Repository record for Some Techniques in Universal Source Coding and Coding for Composite Sources (opens in a new tab)

  11. Variable-Rate, Weakly- and Strongly-Universal Source Coding Subject to a Fidelity Constraint

    Made available in DSpace on 2014-12-12T20:54:38Z (GMT). No. of bitstreams: 1 7726708.pdf: 1532486 bytes, checksum: 12efb26df16f3c0c5000530cfad88655 (MD5) Previous issue date: 1977

    uiuc Repository record for Variable-Rate, Weakly- and Strongly-Universal Source Coding Subject to a Fidelity Constraint (opens in a new tab)

  12. Successive structuring of source coding algorithms for data fusion, buffering, and distribution in networks

    … the distributed processing, the heterogeneous sources of information, and the uncertain operating conditions that typify many networks. We investigate the broad interactions between estimation and communication in the context of data fusion in tree-structured sensor networks. We show how to …

    mit Repository record for Successive structuring of source coding algorithms for data fusion, buffering, and distribution in networks (opens in a new tab)

  13. Systematic hybrid analog/digital signal coding

    … signal processing solutions for systematic source coding, or source coding with side information at the decoder. We consider an analog source signal transmitted through a hybrid channel that is the composition of two channels: a noisy analog channel through which the source is sent …

    mit Repository record for Systematic hybrid analog/digital signal coding (opens in a new tab)

  14. Dynamic information and constraints in source and channel coding

    This thesis explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under …

    mit Repository record for Dynamic information and constraints in source and channel coding (opens in a new tab)

  15. Source coded image data in the presence of channel errors

    … compression the tendency is towards trans-form source coding of the image data. This method of source coding has reached a stage where very high reductions in the number of bits representing the data can be made while still preserving image fidelity. The point has thus been reached where channel …

    aston Repository record for Source coded image data in the presence of channel errors (opens in a new tab)

  16. Adaptive data acquisition for communication networks

    … institutions, nodes communicate information sources (e.g., video, audio) over multiple hops. Moreover, nodes have, or can acquire, correlated information sources from the environment, e.g., from data bases or from measurements. Among the new design problems raised by the outlined scenarios, …

    njit Repository record for Adaptive data acquisition for communication networks (opens in a new tab)

  17. Source and Channel Coding for Wireless Networks

    … networks, we study the problem of distributed source coding. Distributed source coding refers to the compression of correlated sources by encoders that are physically separated. The pioneering result of Slepian and Wolf states that the rate region for the lossless distributed source coding

    uiuc Repository record for Source and Channel Coding for Wireless Networks (opens in a new tab)

  18. Models and analysis of a stochastic neural source coder

    … which are metabolically expensive. A neural coding approach was developed by Johnson et al. (2016) that is optimal, high-fidelity, energy-efficient and well matches the experimental spiking behavior of real neurons. This coder, called a neural source-coder, uses an adaptive threshold to …

    uiuc Repository record for Models and analysis of a stochastic neural source coder (opens in a new tab)

  19. Relating information-theoretic limits to the lyapunov exponent of a dynamical system

    … related data dissemination problems - channel coding with feedback and source coding with feedforward - and see that the Lyapunov exponent of a related dynamical system emerges as a fundamental quantity. For channel coding with feedback, we show that for a broad class of channels - both with …

    uiuc Repository record for Relating information-theoretic limits to the lyapunov exponent of a dynamical system (opens in a new tab)

  20. Joint design of multi-resolution codes and intra / inter- layer network coding

    … study the joint design of multi-resolution (MR) coding and network coding. The three step coding process consists of MR source coding, layer coding and multi-stream coding. The source coding considers the allocation of codeword length to the two layers and use base layer percentage as the …

    mit Repository record for Joint design of multi-resolution codes and intra / inter- layer network coding (opens in a new tab)

Page 1 of 3