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 15 of 15 for “"Slepian-Wolf coding"”.

  1. Robust Slepian-Wolf coding Using Low-Density Graph Codes

    <p>In this thesis, Robust Slepian-Wolf coding problem is discussed. Two correlated source sequences Xⁿ and Yⁿ are encoded at separate encoders and decoded together. When the encoder of source Y is broken, another sequence Xⁿ still can be decoded to achieve a nontrivial distortion. Further, Xⁿ can …

    mcmaster Repository record for Robust Slepian-Wolf coding Using Low-Density Graph Codes (opens in a new tab)

  2. Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources

    … the optimal usage of channel resources. Slepian and Wolf first proposed and developed a scheme where multiple information sources can be jointly compressed at a rate greater than the sum of their respective rates if compressed separately. The major challenges in existing schemes are …

    plymouth Repository record for Binary Ldpc Design For Slepian-wolf Coding Of Correlated Information Sources (opens in a new tab)

  3. Layered Wyner-Ziv video coding for noisy channels

    … input and output streams. While standard video coding techniques fail to satisfy these requirements, distributed source coding is a promising technique for ??uplink?? applications. Wyner-Ziv coding refers to lossy source coding with side information at the decoder. Based on recent theoretical …

    tamu Repository record for Layered Wyner-Ziv video coding for noisy channels (opens in a new tab)

  4. Multiterminal source coding: sum-rate loss, code designs, and applications to video sensor networks

    … networks and wireless video), distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and various other forms of multiterminal source coding), has recently become a very active research area. This dissertation focuses on multiterminal (MT) source coding problem, and consists of …

    tamu Repository record for Multiterminal source coding: sum-rate loss, code designs, and applications to video sensor networks (opens in a new tab)

  5. Investigation on the Compress-and-Forward Relay Scheme

    … the maximum message rate can be obtained by Slepian-Wolf coding, which gives us an upper bound on the optimal relay-destination link rate. In this thesis, we show that under some channel conditions, this sufficient condition is also necessary, which implies that Slepian-Wolf coding is already …

    waterloo Repository record for Investigation on the Compress-and-Forward Relay Scheme (opens in a new tab)

  6. Wyner-Ziv coding based on TCQ and LDPC codes and extensions to multiterminal source coding

    … networks and wireless video), distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and various other forms of multiterminal source coding), has recently become a very active research area. In this thesis, we first design a practical coding scheme for the quadratic Gaussian …

    tamu Repository record for Wyner-Ziv coding based on TCQ and LDPC codes and extensions to multiterminal source coding (opens in a new tab)

  7. Layered Wyner-Ziv video coding: a new approach to video compression and delivery

    … recent theoretical works on successive Wyner-Ziv coding, we propose a practical layered Wyner-Ziv video coder using the DCT, nested scalar quantiza- tion, and irregular LDPC code based Slepian-Wolf coding (or lossless source coding with side information at the decoder). Our main novelty is to use …

    tamu Repository record for Layered Wyner-Ziv video coding: a new approach to video compression and delivery (opens in a new tab)

  8. Applications of Low Density Graph Codes in Two Source Coding Problems

    … graph codes in two different types of source coding problems. First, we consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC design in this scenario. A new …

    mcmaster Repository record for Applications of Low Density Graph Codes in Two Source Coding Problems (opens in a new tab)

  9. An Energy-Efficient Bit Allocation Scheme in Wireless Sensor Networks

    … investigates the interactions between source coding and channel coding to gain cooperation between them in terms of energy efficiency. For transmission through additive white Gaussian noise (AWGN) channel with path loss, this work shows that the overall energy consumption can be minimized if …

    waterloo Repository record for An Energy-Efficient Bit Allocation Scheme in Wireless Sensor Networks (opens in a new tab)

  10. Design techniques for graph-based error-correcting codes and their applications

    … is achievable by error-correcting (channel) coding. The main idea of error-correcting codes is to add redundancy to the information to be transmitted so that the receiver can explore the correlation between transmitted information and redundancy and correct or detect errors caused by channels …

    tamu Repository record for Design techniques for graph-based error-correcting codes and their applications (opens in a new tab)

  11. Coding with side information

    Source coding and channel coding are two important problems in communications. Although side information exists in everyday scenario, the effect of side information is not taken into account in the conventional setups. In this thesis, we focus on the practical designs of two interesting coding …

    tamu Repository record for Coding with side information (opens in a new tab)

  12. Low-Complexity Compression Techniques for High Frame Rate Video

    … of our developed codec is the application of Slepian-Wolf coding theorem in video compression. The light-duty encoder employs SW encoding, resulting in lower computational cost. The pixel values are transformed into bit sequences, and then we assemble the bits on same bit plane into 8 bit …

    mcmaster Repository record for Low-Complexity Compression Techniques for High Frame Rate Video (opens in a new tab)

  13. On Optimum Conventional Quantization for Source Coding with Side Information at the Decoder

    … case that worths particular attention is source coding with side information at the decoder (Wyner-Ziv coding) which requires different design strategies compared to the the conventional source coding problem. Due to the difficulty caused by the joint design of random variable and reconstruction …

    waterloo Repository record for On Optimum Conventional Quantization for Source Coding with Side Information at the Decoder (opens in a new tab)

  14. Coding for Cooperative Communications

    … one of them, we develop information theoretic coding schemes and derive their corresponding performance limits. We next develop and design practical coding strategies which perform very close to the information theoretic limits. The cooperative communication channels we consider are: (a) The …

    tamu Repository record for Coding for Cooperative Communications (opens in a new tab)

  15. On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes

    … were used to significantly improve the decoding performance of short to medium length irregular LDPC codes. Currently, the short to medium length LDPC codes with the lowest error floor are DE optimized irregular LDPC codes constructed using progressive edge growth (PEG) algorithm …

    plymouth Repository record for On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes (opens in a new tab)