Abstract

Abstract
The nesting (or placement) problem is an NP-hard combinatorial problem with important industrial applications, e.g. in apparel or footwear industry. This paper describes a hardware infrastructure to accelerate the processing of the underlying geometric information. The system consists of an FPGA-based reconfigurable platform enhanced by an ASIC for the processing of irregular polygons. The paper discusses the need for such a platform, establishes the main design guidelines and describes the architecture and modes of operation of both the reconfigurable infrastructure and the dedicated IC.

Abstract
This work presents RVC (Reconfigurable Vector Coprocessor), a FPGA based custom computing machine for vector processing applications. This system was built to serve as an implementation platform for a custom vector processor designed for a digital signal processing application. Although its architecture has been in part dictated by the immediate needs of that dedicated processor, it also serves for other custom machines exhibiting similar requirements of vector processing. © 1998 IEEE.

Abstract
The concept of Instantaneous Frequency is still not clearly defined. Current operational definitions give rise to physical paradoxes, difficulting proper interpretation of the obtained results. In this paper, we discuss why those paradoxes appear, and show how they can be avoided. We introduce a new definition of Instantaneous Frequency, which yields physically consistent results. This is confirmed with the help of several examples.

Abstract
It has often been reported and is now well established that the traditional definition of Instantaneous Frequency (IFt) fails in the presence of multicomponent signals. New definitions of IFt have recently been proposed, in an attempt to cope with the difficulties of the traditional one. In this paper, we will address the reasons for failure of the traditional definition, show that it can also fail with monocomponent signals, and show how its behaviour can be predicted for any type of signal, thus generalizaing previous results. We will also analyse the performance in noise of one of the recently proposed definitions of IFt.

Abstract
A subspace-based on-line identification algorithm based on one specific technique, based on Van Overschee and De Moor's results, but can be adapted to other similar methods since they all recover from the state sequence and the observability matrix is presented. These results relate an estimated Kalman filter sequence with an oblique projection. With further improvements, the algorithm can adapt to the identification of time-variant systems.