9647930
Cross-layer adaptive video coding to reduce energy on general-purpose processors
Traditionally, video encoders have been designed assuming that the more redundancy is removed, the better the encoder. However, on current laptops, reducing the compression efficiency of the video encoder by reducing the number of instructions used to perform compression can actually reduce the total energy used to encode and transmit a sequence. The correct balance between computation and compression efficiency may change dynamically, motivating adaptive encoders. At the same time, recent general-purpose processors also employ energy-driven adaptations. For best gains, the adaptations in the hardware and application layers must be coordinated. From a system design viewpoint, this coordination must happen through minimal, well-defined interfaces. This paper develops (1) an adaptive video encoder for general-purpose processors that trades computational complexity for compression efficiency to minimize total system energy, and (2) a method for determining the best configuration for such an encoder when running on a processor that is also adaptive. Our adaptive processor employs recent energy saving techniques of dynamic voltage and frequency scaling and architectural adaptation. Using a detailed simulator, we show that our cross-layer adaptive application algorithm reduces energy significantly, when employed on a fixed or adaptive processor.
2859083
A general joint source-channel matching method for wireless video transmission
With the rapid growth of multimedia content in wireless communication, there is an increasing demand for efficient image and video transmission systems. We present a joint source-channel matching scheme for wireless video transmission which jointly optimizes the source and channel coder to yield the optimal transmission quality while satisfying real-time delay and buffer constraints. We utilize a parametric model approach which avoids the necessity of having detailed a priori knowledge of the coders, thus making the scheme applicable to a wide variety of source and channel coder pairs. Simulations show that the scheme yields excellent results and works for several different types of source and channel coders.
27407130
Wavelet-based 2-D multichannel signal estimation
In this paper, we present a new wavelet-based estimator for 2-D multichannel signals. Estimation of a 2-D multichannel signal relies on the ability to decorrelate the signal in both space and channel. The new estimator we present uses a 2-D discrete wavelet transform to approximately decorrelate the signal in space, allowing for efficient estimation of both stationary and nonstationary signals. When channel correlation is unknown, but depends only on channel separation, the DFT may be utilized to decorrelate the channel efficiently. In contrast to the optimal estimation scheme, our new estimator does not require second-order signal statistics, making it well suited to many applications. In addition to providing vastly improved visual quality, the new estimator typically yields signal-to-noise ratio gains of over 12 dB.
17269099
Edge detection in ultrasound speckle noise
Presents a statistical approach to edge detection in ultrasound speckle, and uses actual noise statistics to derive an expression for an optimal detection rule. The authors compute the optimal detector for the special case of uncorrelated speckle, and an approximation to the optimal detector for the case when signal-to-noise ratio (SNR) is high. They also discuss a simple sub-optimal detection scheme, and show that its performance is close to that of the optimal uncorrelated speckle detection rule, and surpasses that of the high-SNR approximation except in the case of extremely high SNR, in which case they both perform equally well.<<ETX>>
6816511
Joint source channel matching for a wireless communications link
Summary form only given. With the rapid growth of wireless communications systems there is an increasing demand for efficient image and video transmission. Significant performance gains can be obtained from joint source channel matching where system resources are assigned based on the tradeoff between data and redundancy. We develop a more general approach for joint source channel matching based on a parametric distortion model that incorporates the flexibility and constraints of both the source and the channel. We use parametric models describing source and channel. We use parametric models describing source and channel characteristics that can be accurately applied to most classes of source and channel coders. To show the generality of our approach, we applied it to the familiar Said-Pearlman progressive image coder with two types of channel coders, a coder with orthogonal symbols of different power, and fixed-rate BPSK modulation overlaid with Reed Solomon codes.
12684339
Frequency-shift-invariant orthonormal wavelet packet representations
It is commonly known that wavelet expansions are very sensitive to translation of an input signal due to their dyadic structure. Without proper time alignment of the signal to the decomposition basis vectors, a compact expansion may be unattainable. Recently, work has been done to combat translation sensitivity by determining the best translation-invariant expansion of a signal with respect to a set of bases. However, the dyadic structure of wavelet expansions also results in frequency alignment sensitivity. In this work, we introduce a frequency-shifted wavelet packet library as well as an efficient best basis algorithm for determining the best signal representation among all frequency shifts of a signal.
12941967
Application of splay trees to data compression
The splay-prefix algorithm is one of the simplest and fastest adaptive data compression algorithms based on the use of a prefix code. The data structures used in the splay-prefix algorithm can also be applied to arithmetic data compression. Applications of these algorithms to encryption and image processing are suggested.
42995338
Assembly Language as Object Code
The set of meanings that may be encoded in most object languages is a subset of the meanings that may be encoded in most assembly languages. Careful exploitation of this fact in the design of the SMAL assembly and object language allows the SMAL assembler itself to be used as a linkage editor, thus eliminating the need for an expensive and often misunderstood system program. The SMAL assembler is no more complex than many assemblers in common use today, nor are the relevant aspects of the SMAL language particularly unique.
38666741
On Matchings in Graphs
14721450
Implementation of a block based neural branch predictor
This paper contributes to a dynamic branch predictor algorithm based on a perceptron in two directions: Firstly, a new block form of computation is introduced that reduces theoretically by half the combinational critical path for computing a prediction. Secondly, implementation in FPGA hardware is fully developed for quantitative comparison purposes. FPGA circuits for a one-cycle block predictor produces 1.7 faster clock rates than a direct implementation of the original perceptron predictor. This faster clock allows to realize predictions with longer history lengths for the same hardware budget.
5890482
FPGA organization for the fast path-based neural branch predictor
This paper develops cycle-level FPGA circuits of an organization for a fast path-based neural branch predictor. Our results suggest that practical sizes of prediction tables are limited to around 32KB to 64KB in current FPGA technology due mainly to FPGA area of logic resources to maintain the tables. However, the predictor scales well in terms of prediction speed. Table sizes alone should not be used as the only metric for hardware budget when comparing neural-based predictor to predictors of totally different organizations. This paper also gives early evidence to shift the attention on to the recovery from mis-prediction latency rather than on prediction latency as the most critical factor impacting accuracy of predictions for this class of branch predictors.