Reduced-memory multirate vector quantisation

A new method is proposed which reduces the size of the memory needed to implement multirate vector quantizers. Investigations have shown that the performance of the coders implemented using this approach is comparable to that obtained from standard systems. The proposed method can therefore be used to reduce the hardware required to implement real-time speech coders.

Systolic array system for vector quantization using transformed sub-band coding.

The use of bit-level systolic arrays in the design of a vector quantized transformed subband coding system for speech signals is described. It is shown how the major components of this system can be decomposed into a small number of highly regular building blocks that interface directly to one another. These include circuits for the computation of the discrete cosine transform, the inverse discrete cosine transform, and vector quantization codebook search.

VLSI architectures for vector quantization

The real time implementation of an efficient signal compression technique, Vector Quantization (VQ), is of great importance to many digital signal coding applications. In this paper, we describe a new family of bit level systolic VLSI architectures which offer an attractive solution to this problem. These architectures are based on a bit serial, word parallel approach and high performance and efficiency can be achieved for VQ applications of a wide range of bandwidths. Compared with their bit parallel counterparts, these bit serial circuits provide better alternatives for VQ implementations in terms of performance and cost. © 1995 Kluwer Academic Publishers.

Systolic VLSI compiler (SVC) for high performance vector quantisation chips

An overview is given of a systolic VLSI compiler (SVC) tool currently under development for the automated design of high performance digital signal processing (DSP) chips. Attention is focused on the design of systolic vector quantization chips for use in both speech and image coding systems. The software in question consists of a cell library, silicon assemblers, simulators, test pattern generators, and a specially designed graphics shell interface which makes it expandable and user friendly. It allows very high performance digital coding systems to be rapidly designed in VLSI.

Mean shift based gradient vector flow for image segmentation

In recent years, gradient vector flow (GVF) based algorithms have been successfully used to segment a variety of 2-D and 3-D imagery. However, due to the compromise of internal and external energy forces within the resulting partial differential equations, these methods may lead to biased segmentation results. In this paper, we propose MSGVF, a mean shift based GVF segmentation algorithm that can successfully locate the correct borders. MSGVF is developed so that when the contour reaches equilibrium, the various forces resulting from the different energy terms are balanced. In addition, the smoothness constraint of image pixels is kept so that over- or under-segmentation can be reduced. Experimental results on publicly accessible datasets of dermoscopic and optic disc images demonstrate that the proposed method effectively detects the borders of the objects of interest.

Measuring the Characteristic Function of the Work Distribution

We propose an interferometric setting for the ancilla-assisted measurement of the characteristic function of the work distribution following a time-dependent process experienced by a quantum system. We identify how the configuration of the effective interferometer is linked to the symmetries enjoyed by the Hamiltonian ruling the process and provide the explicit form of the operations to implement in order to accomplish our task. We finally discuss two physical settings, based on hybrid optomechanical-electromechanical devices, where the theoretical proposals discussed in our work could find an experimental demonstration.

Documents and Dependencies: an Exploration of Vector Space Models for Semantic Composition

In most previous research on distributional semantics, Vector Space Models (VSMs) of words are built either from topical information (e.g., documents in which a word is present), or from syntactic/semantic types of words (e.g., dependency parse links of a word in sentences), but not both. In this paper, we explore the utility of combining these two representations to build VSM for the task of semantic composition of adjective-noun phrases. Through extensive experiments on benchmark datasets, we find that even though a type-based VSM is effective for semantic composition, it is often outperformed by a VSM built using a combination of topic- and type-based statistics. We also introduce a new evaluation task wherein we predict the composed vector representation of a phrase from the brain activity of a human subject reading that phrase. We exploit a large syntactically parsed corpus of 16 billion tokens to build our VSMs, with vectors for both phrases and words, and make them publicly available.

A Vector Approach for the Analysis and Synthesis of Directional Modulation Transmitters

In order to formalize and extend on previous ad-hoc analysis and synthesis methods a theoretical treatment using vector representations of directional modulation (DM) systems is introduced and used to achieve DM transmitter characteristics. An orthogonal vector approach is proposed which allows the artificial orthogonal noise concept derived from information theory to be brought to bear on DM analysis and synthesis. The orthogonal vector method is validated and discussed via bit error rate (BER) simulations.

Vector representation of directional modulation transmitters

Directional Modulation (DM) is a recently proposed technique for securing wireless communication. In this paper we point out that modulation-directionality is a consequence of varying the beamforming network, either in baseband or in the RF stage, at the information rate In order to formalize and extend on previous analysis and synthesis methods a new theoretical treatment using vector representations of directional modulation (DM) systems is introduced and used to obtain the necessary and sufficient con

Vector bundles on the projective line and finite domination of chain complexes

We present an algebro-geometric approach to a theorem on finite domination of chain complexes over a Laurent polynomial ring. The approach uses extension of chain complexes to sheaves on the projective line, which is governed by a K-theoretical obstruction.