A Flexible Implementation of a Matrix Laurent Series-Based 16-Point Fast Fourier and Hartley Transforms

This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.Comment: 4 pages, 4 figures. IEEE VI Southern Programmable Logic Conference 201

FINITE SIZE SCALING FOR FIRST ORDER TRANSITIONS: POTTS MODEL

The finite-size scaling algorithm based on bulk and surface renormalization of de Oliveira (1992) is tested on q-state Potts models in dimensions D = 2 and 3. Our Monte Carlo data clearly distinguish between first- and second-order phase transitions. Continuous-q analytic calculations performed for small lattices show a clear tendency of the magnetic exponent Y = D - beta/nu to reach a plateau for increasing values of q, which is consistent with the first-order transition value Y = D. Monte Carlo data confirm this trend.Comment: 5 pages, plain tex, 5 EPS figures, in file POTTS.UU (uufiles