Search results for "Data_CODINGANDINFORMATIONTHEORY"
showing 10 items of 196 documents
Analysis of audio coding algorithms for networked embedded systems
2004
Masteroppgave i informasjons- og kommunikasjonsteknologi 2004 - Høgskolen i Agder, Grimstad Today there are many different audio coding algorithms, some of them standardized by the ITU, like G.711, G.726 and G.728, and several other codecs by other organizations like Fraunhofer (mp3) and Microsoft (WMA). All these algorithms differ in several important features, like speech quality, bit or compression rate, robustness, delay, sampling frequency, complexity and range of use. The past decade we have witnessed a great progress towards application of low-rate speech/music coders as well as computer related voice/music applications. Central to this progress has been the development of speech cod…
On the Statistical Analysis of Equal Gain Combining over Multiple Double Rice Fading Channels in Cooperative Networks
2010
This article analyzes the statistical properties of narrowband mobile-to-mobile (M2M) fading channels with equal gain combining (EGC) under line-of-sight (LOS) propagation conditions. Here, we study a dual-hop amplify-and-forward (AF)relay network. It is assumed that there can exist LOS components in the transmission links between the source mobile station and the destination mobile station via K mobile relays. In order to cater for asymmetric fading conditions in the relay links, the received signal envelope at the output of the equal gain (EG) combiner is thus modeled as a sum of K double Rice processes. These processes are considered to be independent but not necessarily identically dist…
Generalized Dimension Distortion under Mappings of Sub-Exponentially Integrable Distortion
2010
We prove a dimension distortion estimate for mappings of sub-exponentially integrable distortion in Euclidean spaces, which is essentially sharp in the plane.
Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol
2012
Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implem…
A Multi-Phase Decode-and-Forward Transmission Protocol in Cognitive Relay Networks: Outage Analysis and Relay Power Allocation
2015
Consider an underlay cognitive relay network with multiple source and destination pairs and that a decode-and-forward scheme is adopted at the relay. We propose a multi-phase transmission protocol in this paper which involves cooperation among source, relay and destination nodes. Given perfect interference elimination before decoding at the destination nodes, we derive closed-form expressions for outage probability calculation over Rayleigh fading channels. Furthermore, the optimal relay power allocation factor which leads to minimal outage probability is determined. Numerical results reveal the conditions under which satisfactory performance can be achieved based on the proposed scheme.
Lossless and near-lossless image compression based on multiresolution analysis
2013
There are applications in data compression, where quality control is of utmost importance. Certain features in the decoded signal must be exactly, or very accurately recovered, yet one would like to be as economical as possible with respect to storage and speed of computation. In this paper, we present a multi-scale data-compression algorithm within Harten's interpolatory framework for multiresolution that gives a specific estimate of the precise error between the original and the decoded signal, when measured in the L"~ and in the L"p (p=1,2) discrete norms. The proposed algorithm does not rely on a tensor-product strategy to compress two-dimensional signals, and it provides a priori bound…
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
2006
Data Compression is one of the most challenging arenas both for algorithm design and engineering. This is particularly true for Burrows and Wheeler Compression a technique that is important in itself and for the design of compressed indexes. There has been considerable debate on how to design and engineer compression algorithms based on the BWT paradigm. In particular, Move-to-Front Encoding is generally believed to be an "inefficient " part of the Burrows-Wheeler compression process. However, only recently two theoretically superior alternatives to Move-to-Front have been proposed, namely Compression Boosting and Wavelet Trees. The main contribution of this paper is to provide the first ex…
From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization
2007
AbstractWe introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198–207]), are special cases i…
Statistical Modeling of Huffman Tables Coding
2005
An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresponding images, we generated Huffman tables for three images classes: landscape, portrait and document. Comparisons between the new tables and the JPEG standard coding tables, using also different quality settings, have shown the effectiveness of the proposed strategy in terms of final bit size (e.g. compression ratio).
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
2003
The Burrows-Wheeler transform [1] is one of the mainstays of lossless data compression. In most cases, its output is fed to Move to Front or other variations of symbol ranking compression. One of the main open problems [2] is to establish whether Move to Front, or more in general symbol ranking compression, is an essential part of the compression process. We settle this question positively by providing a new class of Burrows-Wheeler algorithms that use optimal partitions of strings, rather than symbol ranking, for the additional step. Our technique is a quite surprising specialization to strings of partitioning techniques devised by Buchsbaum et al. [3] for two-dimensional table compression…