Parallel-recusive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications

The performance of the parallel vector implementation of the one- and two-dimensional orthogonal transforms is evaluated. The orthogonal transforms are computed using actual or modified fast Fourier transform (FFT) kernels. The factors considered in comparing the speed-up of these vectorized digital signal processing algorithms are discussed and it is shown that the traditional way of comparing th execution speed of digital signal processing algorithms by the ratios of the number of multiplications and additions is no longer effective for vector implementation; the structure of the algorithm must also be considered as a factor when comparing the execution speed of vectorized digital signal processing algorithms. Simulation results on the Cray X/MP with the following orthogonal transforms are presented: discrete Fourier transform (DFT), discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), discrete Walsh transform (DWHT), and discrete Hadamard transform (DHDT). A comparison between the DHT and the fast Hartley transform is also included.(34 refs)

Devising: Pioneering Uncharted Territory in Theater

Throughout theatre history, styles of theatre have come in and out of favor in response to the zeitgeist of the period. Neoclassical, Melodrama, Naturalism, all have their place in history offering enlightenment, passion and truth each in tune with the values of the culture in which it was created. As society transforms, so too does the stage, offering new ways to reflect, interpret and challenge our assumptions about the changing world. Our current society wrestles with a ‘shrinking world’, a world consumed with technological advances that fan the fire of the growing interconnectedness of human beings all over the earth. This ‘shrinking world’ phenomenon has the effect of an‘expanded world awareness’. That is to say, now more than ever we question all assumption regarding singular perspectives and cultural convictions. What our new society values is diversification of insight and a myriad of experiences from which to draw our conclusions about the world in which we live. The kind of theatre that fills this need is Devised Theatre. Theatre is a collaborative art form by nature. Theatre cannot be practiced alone. One must partner other artists as well as an audience in order to create a theatre performance. Theatre is a dialogue which can take many shapes. Devised Theatre is a process of making theatre that enables a group of performers to be physically and practically creative in the sharing and shaping of an original product that directly emanates from assembling, editing and reshaping individual’s contradictory experiences of the world. A devised theatre product is a work that has emerged from and been generated by a group of people working in collaboration. There is an emphasis on a way of working that values an accumulation of ideas. (Oddey)

Equivariant inverse spectral theory and toric orbifolds

Let O-2n be a symplectic toric orbifold with a fixed T-n-action and with a tonic Kahler metric g. In [10] we explored whether, when O is a manifold, the equivariant spectrum of the Laplace Delta(g) operator on C-infinity(O) determines O up to symplectomorphism. In the setting of tonic orbifolds we shmilicantly improve upon our previous results and show that a generic tone orbifold is determined by its equivariant spectrum, up to two possibilities. This involves developing the asymptotic expansion of the heat trace on an orbifold in the presence of an isometry. We also show that the equivariant spectrum determines whether the toric Kahler metric has constant scalar curvature. (C) 2012 Elsevier Inc. All rights reserved.

The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in

Hearing Delzant Polytopes From the Equivariant Spectrum

Let M^{2n} be a symplectic toric manifold with a fixed T^n-action and with a toric K\"ahler metric g. Abreu asked whether the spectrum of the Laplace operator $\Delta_g$ on $\mathcal{C}^\infty(M)$ determines the moment polytope of M, and hence by Delzant's theorem determines M up to symplectomorphism. We report on some progress made on an equivariant version of this conjecture. If the moment polygon of M^4 is generic and does not have too many pairs of parallel sides, the so-called equivariant spectrum of M and the spectrum of its associated real manifold M_R determine its polygon, up to translation and a small number of choices. For M of arbitrary even dimension and with integer cohomology class, the equivariant spectrum of the Laplacian acting on sections of a naturally associated line bundle determines the moment polytope of M.

Isospectrality and Heat Content

We present examples of isospectral operators that do not have the same heat content. Several of these examples are planar polygons that are isospectral for the Laplace operator with Dirichlet boundary conditions. These include examples with infinitely many components. Other planar examples have mixed Dirichlet and Neumann boundary conditions. We also consider Schrodinger operators acting in L-2[0,1] with Dirichlet boundary conditions, and show that an abundance of isospectral deformations do not preserve the heat content.