Sökning: "Huffman Coding"
Hittade 5 avhandlingar innehållade orden Huffman Coding.
1. Through the coding-lens : community detection and beyond
Sammanfattning : We live in a highly-connected world and find networks wherever we look: social networks, public transport networks, telecommunication networks, financial networks, and more. These networks can be immensely complex, comprising potentially millions or even billions of inter-connected objects. LÄS MER
2. Design Considerations of Value-aware Caches
Sammanfattning : On-chip cache memories are instrumental in tackling several performance and energy issues facing contemporary and future microprocessor chip architectures. First, they are key to bridge the growing speed-gap between memory and processors. LÄS MER
3. Statistical Compression Cache Designs
Sammanfattning : On-chip caches are essential as they bridge the growing speed-gap between off-chip memory and processors. To this end, processing cores are sacrificed for more cache space in the chip's real estate, possibly affecting the cache access time and power dissipation. LÄS MER
4. Alternating Coding and its Decoder Architectures for Unary-Prefixed Codes
Sammanfattning : The entropy coding of high peak, heavy-tailed probability distributions such as the Laplacian, Cauchy, and generalized Gaussian have been a topic of interest because they are able to provide good models for data in many coding systems, especially in image and video coding systems. This thesis studies the entropy coding of such high peak, heavy-tailed probability distributions. LÄS MER
5. Bounds on the maximum coding rate of multiple-access channels and feedback channels
Sammanfattning : We provide upper and lower bounds on the coding rate of multiple-access channels (MACs) and feedback channels.Traditional MACs have been extensively studied under the assumption of availability of perfect channel state information (CSI).In Paper A we relax this assumption for a Rayleigh block-fading MAC and provide bounds on the sum-rate capacity. LÄS MER