Ben Gold

Parallelism in fast Fourier transform hardware

The fast Fourier transform algorithm is derived by means of successive fracturing of one-dimensional data strings into two-dimensional arrays. Using this formulation, a diagrammatic representation of mixed radix and highest radix FFT algorithms is derived. Using this representation, two broad classes of FFT hard-ware are explored, from the point of view of speed, parallelism, radix number, and type of memory.

Models of Pitch Perception

Abstract : Two pitch perception modeling algorithms are described. The first algorithm models periodicity pitch perception, and the second algorithm models place pitch perception. The two models are now applied to various psychoacoustic stimuli. Both periodicity and place models yield results that are in general agreement with psychoacoustic measurements for the missing fundamental and for inharmonic stimuli. The place algorithm proved to be a better approximation than periodicity for processing comb-filtered noise. Periodicity was more successful for periodic pulse train stimuli.