The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...