Search results for "Data_CODINGANDINFORMATIONTHEORY"
showing 10 items of 196 documents
Combinatorial Transforms : Application in Lossless Image Compression
2011
International audience; Common image compression standards are usually based on frequency transform such as Discrete Cosine Transform. We present a different approach for lossless image compression, which is based on a combinatorial transform. The main transform is Burrows Wheeler Transform (BWT) which tends to reorder symbols according to their following context. It becomes one of promising compression approach based on context modeling. BWT was initially applied for text compression software such as BZIP2 nevertheless it has been recently applied to the image compression field. Compression schemes based on the Burrows Wheeler Transform have been usually lossless; therefore we implement th…
A Fast GPU-Based Motion Estimation Algorithm for H.264/AVC
2012
H.264/AVC is the most recent predictive video compression standard to outperform other existing video coding standards by means of higher computational complexity. In recent years, heterogeneous computing has emerged as a cost-efficient solution for high-performance computing. In the literature, several algorithms have been proposed to accelerate video compression, but so far there have not been many solutions that deal with video codecs using heterogeneous systems. This paper proposes an algorithm to perform H.264/AVC inter prediction. The proposed algorithm performs the motion estimation, both with full-pixel and sub-pixel accuracy, using CUDA to assist the CPU, obtaining remarkable time …
Model and optimal Call Admission Policy in Cellular Mobile Networks
2000
For current cellular networks, two important Quality of Service (QoS) measures are the fractions of new and handoff calls that are blocked due to unavailability of channels. Based on these QoS measures, we propose a queuing network model with impatient users for handoff and new calls in cellular mobile networks. The number of simultaneous calls, that can be supported, is modeled by C identical servers with exponentially distributed session duration for each one of them. Priority is given to handoffs over new calls. We use for that a Guard Channel policy that reserves a set of CH channels for handoff calls, new calls being served at their arrival if there are more than CH available channels.…
Channel capacity of fading channels for differentially encoded transmission
1999
The capacity of flat fading channels when applying differential encoding with noncoherent reception and no channel state information available at the receiver is considered. Numerical results indicate the gains achievable by multiple symbol detection in the case of slowly time-varying channels and provide a comparison between schemes with different potential bandwidth efficiencies.
Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels
2011
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN channels. The outputs of these channels have each a separated receiver, whereas a third receiver has both outputs available. At the transmitter side, a pair of bandwidth-reduction analog mappings are used for joint source-channel coding. The presented scheme has the inherent advantage over digital MD schemes based on separation, that coding and decoding can be performed by using a single-letter (or symbol), a strategy that is very suitable for applications where latency originated by the digital compression and th…
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
New super-orthogonal space-time trellis codes using differential M-PSK for noncoherent mobile communication systems with two transmit antennas
2010
Published version of an article in the journal: Annals of Telecommunications-Annales Des Telecommunications. Also available from the publisher at: http://dx.doi.org/10.1007/s12243-010-0191-1 In this paper, we develop super-orthogonal space-time trellis codes (SOSTTCs) using differential binary phase-shift keying, quadriphase-shift keying and eight-phase shift keying for noncoherent communication systems with two transmit antennas without channel state information at the receiver. Based on a differential encoding scheme proposed by Tarokh and Jafarkhani, we propose a new decoding algorithm with reduced decoding complexity. To evaluate the performance of the SOSTTCs by way of computer simulat…
Throughput and delay analysis of HARQ with code combining over double Rayleigh fading channels
2018
This paper proposes the use of hybrid automatic repeat request (HARQ) with code combining (HARQ-CC) to offer reliable communications over double Rayleigh channels. The double Rayleigh fading channel is of particular interest to vehicleto-vehicle communication systems as well as amplify-and-forward relaying and keyhole channels. This paper studies the performance of HARQ-CC over double Rayleigh channels from an information theoretic perspective. Analytical approximations are derived for the ϵ-outage capacity, the average number of transmissions, and the throughput of HARQ-CC. Moreover, we evaluate the delay experienced by Poisson-arriving packets for HARQ-CC. We provide analytical expression…
An Ergodic Sum-of-Cisoids Simulator for Multiple Uncorrelated Rayleigh Fading Channels Under Generalized Scattering Conditions
2012
In this paper, we present a new method for the design of ergodic sum-of-sinusoids (SOS) simulators for multiple uncorrelated narrowband Rayleigh fading channels. The method, which is intended for a special class of SOS models known as sum-of-cisoids (SOC) models, enables the generation of an unlimited number of mutually uncorrelated Rayleigh fading waveforms with specified autocorrelation properties. This is in contrast to all known methods proposed for SOS simulators, which are restricted to the simulation of multiple uncorrelated Rayleigh fading channels characterized by autocorrelation functions (ACFs) derived under the isotropic scattering assumption. The excellent performance of this n…
A GPU-Based DVC to H.264/AVC Transcoder
2010
Mobile to mobile video conferencing is one of the services that the newest mobile network operators can offer to users With the apparition of the distributed video coding paradigm which moves the majority of complexity from the encoder to the decoder, this offering can be achieved by introducing a transcoder This device has to convert from the distributed video coding paradigm to traditional video coding such as H.264/AVC which is formed by simpler decoders and more complex encoders, and allows to the users to execute only the low complex algorithms In order to deal with this high complex video transcoder, this paper introduces a graphics processing unit based transcoder as base station The…