The capacity of a wireless communication system based on the OFDM transmission technique is analysed. The considered system, which includes a TDMA approach, is designed for mobile access to different multimedia servic...
详细信息
The capacity of a wireless communication system based on the OFDM transmission technique is analysed. The considered system, which includes a TDMA approach, is designed for mobile access to different multimedia services, such as speech, video, e-mail and file transfer. In order to support a variety of services on the one hand and to take into account the behaviour of the frequency-selective radio channel on the other hand, an adaptive allocation of modulation and coding scheme is supplied. For this purpose, an optimal combination of modulation scheme and code rate is determined in a first step. Using these results, the capacity of such a system is analysed by calculating the number of supported users within a cell and comparing these numbers to a system with fixed modulation/coding.
In this paper we apply some of the Golomb-Rice coding techniques that emerged in JPEG-LS, a new standard for lossless image compression, and apply them towards coding DCT coefficients in the lossy JPEG baseline algori...
详细信息
In this paper we apply some of the Golomb-Rice coding techniques that emerged in JPEG-LS, a new standard for lossless image compression, and apply them towards coding DCT coefficients in the lossy JPEG baseline algorithm. We show that this results in significant improvements in performance with limited impact on computational complexity. In fact, one significant reduction in complexity provided by the proposed techniques is the complete elimination of the Huffman tables in JPEG baseline which can be a bottleneck in hardware implementations. We give simulation results, comparing the performance of the proposed technique to JPEG baseline, JPEG baseline with optimal Huffman coding (two pass) and JPEG arithmetic.
The development of adaptive trellis coded modulation schemes for communication systems operating over time-varying Rayleigh fading channels is considered. If the system employs a single outdated noiseless channel esti...
详细信息
The development of adaptive trellis coded modulation schemes for communication systems operating over time-varying Rayleigh fading channels is considered. If the system employs a single outdated noiseless channel estimate and is able to achieve perfect interleaving of the coded symbols, substantial throughput gains are observed over non-adaptive trellis coded modulation schemes for systems with low user mobility. Next, the effect of noise in the channel estimates is shown to be an important consideration, even at the relatively high signal-to-noise ratios considered here. Finally, a bound to the pairwise error probability between two paths in the trellis of the adaptive scheme is derived analytically for the case where the coded symbols are imperfectly interleaved; this result suggests that adaptive signaling may be a strong candidate for systems operating in an environment that has limited diversity available.
In earlier work, we presented the k-error protocol, a technique for protecting a dynamic dictionary lossless data compression method from error propagation as the result of errors on the communication channel or compr...
详细信息
In earlier work, we presented the k-error protocol, a technique for protecting a dynamic dictionary lossless data compression method from error propagation as the result of errors on the communication channel or compressed file. In the worst case, the protocol only protects against k errors total;however, it gives very high probability protection against a sustained error rate. Here, we further develop this protocol and present experiments showing that in practice this approach is both fast and highly effective against a noisy channel or faulty storage medium. We also address the issue of dynamically deleting strings. Although without modification most standard methods used in practice (e.g., LRU strategies) perform poorly with respect to error propagation, we propose and analyze some that are very robust, including a strategy based on leaf pruning.
The piecewise-constant image model (PWC) is a new technique for lossless compression of palette images. PWC is a blend of traditional scanline-oriented and newer object-based methods. Remarkably, PWC delivers the best...
详细信息
The piecewise-constant image model (PWC) is a new technique for lossless compression of palette images. PWC is a blend of traditional scanline-oriented and newer object-based methods. Remarkably, PWC delivers the best known compression across a wide variety palette of image types while delivering translation speeds comparable to highly tuned one-dimensional methods. This paper introduces the topic of palette image coding and traces the development of the piecewise-constant model from a completely object-oriented code requiring two image passes to a high-performance scanline-oriented code.
Typically, perceptual audio coders have followed a subband or transform coding scheme with forward-adaptive quantization,In this letter we present an alternative scheme which uses backward-adaptive quantization, We di...
详细信息
Typically, perceptual audio coders have followed a subband or transform coding scheme with forward-adaptive quantization,In this letter we present an alternative scheme which uses backward-adaptive quantization, We discuss the effects of this strategy on perceptual coding and show that it can be successfully applied.
In this paper, we survey some of the recent advances in lossless compression of continuous-tone images. The modeling paradigms underlying the state-of-the-art algorithms, and the principles guiding their design, are d...
详细信息
In this paper, we survey some of the recent advances in lossless compression of continuous-tone images. The modeling paradigms underlying the state-of-the-art algorithms, and the principles guiding their design, are discussed in a unified manner. The algorithms are described and experimentally compared.
Image coding is discussed in two phases;one is transformation of image signals using a coding model, and the other is entropy coding which assigns a code to a transformed sequence. A well-known example of the latter i...
详细信息
Image coding is discussed in two phases;one is transformation of image signals using a coding model, and the other is entropy coding which assigns a code to a transformed sequence. A well-known example of the latter is arithmetic coding. Because arithmetic coding makes dynamic adaptation rather easy, it is used in efficient entropy coding of signals, such as image signals, whose statistical characteristics vary locally. Though adaptation is an effective measure to achieve efficient coding, it requires longer processing time and larger hardware size. The authors have proposed multialphabet arithmetic coding with a 1/2(n) rate approximation, whose algorithm is simple. This arithmetic coding can be performed with an extremely small amount of multiplication, and it can be extended to adaptation simply by recalculation of cumulative approximate probability. In this article, we will propose a method that optimizes update timing in adaptation, and show that we obtained satisfactory results in efficiency and coding speed. (C) 2000 Scripta Technica.
The problem of predicting a sequence x/sub 1/,x/sub 2/, generated by a discrete source with unknown statistics is considered. Each letter x/sub t+1/ is predicted using information on the word x/sub 1/x/sub 2//spl midd...
详细信息
The problem of predicting a sequence x/sub 1/,x/sub 2/, generated by a discrete source with unknown statistics is considered. Each letter x/sub t+1/ is predicted using information on the word x/sub 1/x/sub 2//spl middot//spl middot//spl middot/x/sub t/ only. To estimate the efficiency of a method of prediction, three quantities are considered: the precision as given by the Kullback-Leibler divergence, the memory size of the program needed to implement the method on a computer and the average time required, measured by the number of binary operations for the prediction of a single letter. A method is presented for which the memory size and the average time is close to the minimum. The results can readily be translated to adaptive coding.
We present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) p...
详细信息
We present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An efficient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information available from coarser layers. Based on the chosen vertex rate and distortion definitions, a resulting enhancement layer topology is solved by executing a directed acyclic graph (DAG) shortest path algorithm. Finally, an iterative VLC optimization scheme is employed to find both the optimized scalable code and the most efficient set of parameter VLC tables.
暂无评论