5,061 research outputs found
A vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which the first stage code can be regarded as a vector quantizer that “quantizes” the input data of length n to one of a fixed collection of block codes. We apply the generalized Lloyd algorithm to the first-stage quantizer, using induced measures of rate and distortion, to design locally optimal two-stage codes. On a source of medical images, two-stage variable-rate vector quantizers designed in this way outperform standard (one-stage) fixed-rate vector quantizers by over 9 dB. The tail of the operational distortion-rate function of the first-stage quantizer determines the optimal rate of convergence of the redundancy of a universal sequence of two-stage codes. We show that there exist two-stage universal noiseless codes, fixed-rate quantizers, and variable-rate quantizers whose per-letter rate and distortion redundancies converge to zero as (k/2)n -1 log n, when the universe of sources has finite dimension k. This extends the achievability part of Rissanen's theorem from universal noiseless codes to universal quantizers. Further, we show that the redundancies converge as O(n-1) when the universe of sources is countable, and as O(n-1+ϵ) when the universe of sources is infinite-dimensional, under appropriate conditions
Efficient Universal Noiseless Source Codes
Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achieved with a relatively short block length. A constructive proof of the existence of universal noiseless codes for discrete stationary sources is first presented. The proof is shown to provide a method for obtaining efficient universal noiseless variable-rate codes for various classes of sources. For memoryless sources, upper and lower bounds are obtained for the minimax redundancy as a function of the block length of the code. Several techniques for constructing universal noiseless source codes for memoryless sources are presented and their redundancies are compared with the bounds. Consideration is given to possible applications to data compression for certain nonstationary sources
Performance Analysis of a 5G Transceiver Implementation for Remote Areas Scenarios
The fifth generation of mobile communication networks will support a large
set of new services and applications. One important use case is the remote area
coverage for broadband Internet access. This use case ha significant social and
economic impact, since a considerable percentage of the global population
living in low populated area does not have Internet access and the
communication infrastructure in rural areas can be used to improve agribusiness
productivity. The aim of this paper is to analyze the performance of a 5G for
Remote Areas transceiver, implemented on field programmable gate array based
hardware for real-time processing. This transceiver employs the latest digital
communication techniques, such as generalized frequency division multiplexing
waveform combined with 2 by 2 multiple-input multiple-output diversity scheme
and polar channel coding. The performance of the prototype is evaluated
regarding its out-of-band emissions and bit error rate under AWGN channel.Comment: Presented in 2018 European Conference on Networks and Communications
(EuCNC),18-21 June, 2018, Ljubljana, Sloveni
On Distributed Computation in Noisy Random Planar Networks
We consider distributed computation of functions of distributed data in
random planar networks with noisy wireless links. We present a new algorithm
for computation of the maximum value which is order optimal in the number of
transmissions and computation time.We also adapt the histogram computation
algorithm of Ying et al to make the histogram computation time optimal.Comment: 5 pages, 2 figure
- …