| In applications using multiwavelets, there is a necessary step of associating a given discrete signal with a function in the scaling function space V 0. This association is equivalent to including a preelter and a posttlter for the lterbank determined by the underlying multiwavelets. We give a construction for orthogonal (paraunitary) FIR pre-lters that preserve the approximation order of a g...

An internally analog, externally digital architecture for parallel vector–matrix multiplication is presented. A threetransistor unit cell combines a single-bit dynamic random-access memory and a charge injection device binary multiplier and analog accumulator. Digital multiplication of variable resolution is obtained with bit-serial inputs and bit-parallel storage of matrix elements, by combini...

Abstract: In this paper we explore a matrix representation of binary fields F2n defined by an irreducible trinomial P = X + X + 1. We obtain a multiplier with time complexity of TA + (⌈log2(n)⌉)TX and space complexity of (2n − 1)n AND and (2n − 1)(n − 1) XOR . This multiplier reaches the lower bound on time complexity. Until now this was possible only for binary field defined by AOP (Silverman,...

By using affine-invariant shape descriptors, it is possible to recognize an unknown planar object from an image taken from an arbitrary view when standard view images of candidate objects exist in a database. In a previous study, an affine-invariant function calculated from the wavelet coefficients of the object boundary has been proposed. In this work, the invariant is constructed from the mul...

This paper presents a new, a highly compact implementation of a 32 32 parallel multiplier based on parallel counters. The new multiplier is designed using the recently proposed Self-Timed Threshold Logic (STTL). The design is based on a direct multiplication scheme using depth 2 (15,4) and (7,3) STTL parallel counters and (4:2) compressors. The proposed parallel multiplier reduces the partial p...

Matrix multiplication is a computationally-intensive and fundamental matrix operation in many algorithms used in scientific computations. It serves as the basic building block for signal, image processing, graphics and robotic applications. To improve the performance of these applications, a high performance matrix multiplier is required. Traditionally, matrix multiplication operation is either...

Boundary functions for wavelets on a finite interval are often constructed as linear combinations of boundary-crossing scaling functions. An alternative approach is based on linear algebra techniques for truncating the infinite matrix of the Discrete Wavelet Transform to a finite one. In this article we show how an algorithm of Madych for scalar wavelets can be generalized to multiwavelets, giv...