Factored-matrix representation of distributed fast transforms
Bainbridge, Richard Lee
Kirk, Donald E.
Therrien, Charles W.
MetadataShow full item record
Parallel implementations of Fast Fourier Transforms (FFTs) and other Fast transforms are represented using factored, partitioned matrices. the factored matrix description of a distributed FFT is introduced using a decimation-in-time (DIT) FFT algorithm suitable for implementation on a distributed parallel processor. The heart of the matrix representation of distributed fast transforms is the use of permutations of an NxN identity matrix to describe the required later-processor data transfers on the Butterfly Network. The properties of there "transfer matrices" and the resulting output ordering are discussed in detail. The factored-matrix representation is then used to show that the Fast Hartley Transform (FHT) and the Walsh-Hadamard Transform (WHT) are supported by the Butterfly Network.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Lawler, George M. (Monterey, California. Naval Postgraduate School, 2003-03);The Department of Defense (DoD) is both challenged by the quest for interoperability and capable of the bottom-up development of a solution. The predominant method for achieving interoperability is the development of an ...
Capps, Michael V. (Monterey, California. Naval Postgraduate School, 2000-06);In virtual environment systems, the ultimate goal is delivery of the highest-fidelity user experience possible. This dissertation shows that is possible to increase the scalability of distributed virtual environments (DVEs), ...
Ong, Chee Hwee (Monterey, California. Naval Postgraduate School, 2003-12);This thesis project modeled a microstrip ring-hybrid dipole that is capable of simultaneously producing a sum pattern and difference pattern using the method of moments (MoM) based on the Rao-Wilton-Glisson (RWG) edge ...