In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a parallel way, using bit operations readily available in processors. In this paper, we generalize the technique, and characterize a class of au-tomata for which there exists equivalent parallel, or vector, algorithms. As an application...

A dynamic element matching algorithm, data weighted averaging, is introduced for use in multi-bit data converters. Using this algorithm, distortion spectra from DAC linearity errors are shaped by rst-order noise shaping, resulting in a dynamic range improvement of 9 dB/octave when DAC errors dominate. Combining this technique with random dithering eliminates the aliasing of the DAC errors into ...

An efficient algorithm derived from AAN algorithm (proposed by Arai, Agui, and Nakajima in 1988) for computing the Inverse Discrete Cosine Transform (IDCT) is presented. We replace the multiplications in conventional AAN algorithm with additions and shifts to realize the fixed-point and multiplier-free computation of IDCT and adopt coefficient and compensation matrices to improve the precision ...

In this paper, we propose a new scheduling algorithm, called the Dynamic Weighted Round Robin (DWRR) scheduling discipline, which is suitable for real-time variable bit rate (rtVBR) service as well as other services such as constant bit rate (CBR), non real-time VBR (nrtVBR), available bit rate (ABR) services in a high-speed network. We employ dynamic weight to serve a queue associated with act...

In many applications, video sequences must be transmitted constant bit rate channels (CBR). Therefore, rate control has to be used to regulate the variable bit rate of coded stream. In this paper, we propose an effective bit-rate control algorithm in H.264/AVC for CBR transmission. Our algorithm jointly decides mode and quantization using rate distortion optimization (RDO) technique. And to red...

1 Seong Hwan Jang is currently working at KT. 2 This work was done in collaboration with Echostar, as part of the Yamacraw research program of the State of Georgia AbstractIn this paper, we describe an adaptive non-linear motion vector resampling algorithm for video transcoding where spatial resolution down-scaling is involved. The incoming MPEG-2 video is spatially down-scaled by a factor of t...

The most popular algorithms for generation of minimal spanning tree are Kruskal’s[2] and Prim’s[2] algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix (DWCM); it is little bit modification o...

NK fitness landscapes are stochastically generated fitness functions on bit strings, parameterized (with genes and interactions between genes) so as to make them tunably ‘rugged’. Under the ‘natural’ genetic operators of bit-flipping mutation or recombination, NK landscapes produce multiple domains of attraction for the evolutionary dynamics. NK landscapes have been used in models of epistatic ...

Complex networks have attracted growing attention in many fields. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. Some algorithms for MFA of unweighted complex networks have been proposed in the past a few years, including the sandbox (SB) algorithm re...