Sökning: "random coding"

Visar resultat 1 - 5 av 33 avhandlingar innehållade orden random coding.

  1. 1. Towards Low-Complexity Vector Quantization

    Författare :T. Z. Shabestary; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Gaussian encoder; source coding; companding; Gaussian mixture; random coding; vector quantization; spectral coding;

    Sammanfattning : This thesis is about constructing low-complexity, yet high-performance, vector quantizers (VQs) for 'real-world' sources. Knowledge concerning the source is extracted from a finite training set. In contrast with conventional VQ design procedures, we use the training set to estimate a statistical model for the source. LÄS MER

  3. 2. Wireless Broadcasting with Network Coding

    Författare :Lu Lu; Lars Kildehöj Rasmussen; Giuseppe Durisi; KTH; []
    Nyckelord :wireless broadcasting; relay-aided system; systematic binary deterministic rateless codes; random network coding; instantaneously decodable network coding;

    Sammanfattning : Wireless digital broadcasting applications such as digital audio broadcast (DAB) and digital video broadcast (DVB) are becoming increasingly popular since the digital format allows for quality improvements as compared to traditional analogue broadcast. The broadcasting is commonly based on packet transmission. LÄS MER

  4. 3. Trellis Source Coding Methods for Low Rates and Short Blocks

    Författare :Tomas Eriksson; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Elektronik och elektroteknik; Electronics and Electrical technology; systemteori; Informatik; systems theory; Informatics; image coding; tailbiting source codes; BCJR algorithm; linear congruential recursions; trellis coding; low rate quantization; rate-distortion theory; Systems engineering; computer technology; Data- och systemvetenskap; Signal processing; Signalbehandling;

    Sammanfattning : Trellis quantization is a finite state machine based method for data compression. It is mainly applied to quantizing noise-like sources. In this thesis new trellis codes suitable for low rate quantization are derived. LÄS MER

  5. 4. Linear Coding, Applications and Supremus Typicality

    Författare :Sheng Huang; Mikael Skoglund; Giacomo Como; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Linear coding; Supremus typicality; Informations- och kommunikationsteknik; Information and Communication Technology; Matematik; Mathematics;

    Sammanfattning : Detta arbete börjar med att presentera en kodningssats gällande linjärkodning över ändliga ringar för kodning av korrelerade diskretaminneslösa källor. Denna sats inkluderar som specialfall motsvarandeuppnåbarhetssatser från Elias och Csiszár gällande linjär kodning överändliga kroppar. LÄS MER

  7. 5. Quantization of Random Processes and Related Statistical Problems

    Författare :Mykola Shykula; Oleg Seleznjev; Patrik Rydén; Igor Rychlik; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; scalar quantization; random process; rate; distortion; additive noise model; run-length encoding; compression; sample estimate; asymptotical normality; Mathematical statistics; Matematisk statistik;

    Sammanfattning : In this thesis we study a scalar uniform and non-uniform quantization of random processes (or signals) in average case setting. Quantization (or discretization) of a signal is a standard task in all nalog/digital devices (e.g., digital recorders, remote sensors etc. LÄS MER