Engineering Papers⌕ Search

Engineering topics

Fino, B. J.

Publications and source records attributed to Fino, B. J..

Computation of transform domain covariance matrices

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Fino, B. J.↗

Parallel and pipeline computation of fast unitary transforms

The letter discusses the parallel and pipeline organization of fast-unitary-transform algorithms such as the fast Fourier transform, and points out the efficiency of a combined parallel-pipeline processor of a transform such as the Haar transform, in which (2 to the n-th power) -1 hardware 'butterflies' generate a transform of order 2 to the n-th power every computation cycle.

Fino, B. J.↗

A note on parallel and pipeline computation of fast unitary transforms

The parallel and pipeline organization of fast unitary transform algorithms such as the Fast Fourier Transform are discussed. The efficiency is pointed out of a combined parallel-pipeline processor of a transform such as the Haar transform in which 2 to the n minus 1 power hardware butterflies generate a transform of order 2 to the n power every computation cycle.

Fino, B. J.↗

Relations between Haar and Walsh/Hadamard transforms.

Relations between the Haar and Walsh/Hadamard (W/H) transforms, which are proved, show that for some applications the Haar transform performs as well as, and faster than, the W/H transform. These relations yield a family of orthogonal transforms including the Haar and W/H transforms with a common fast algorithm.

Fino, B. J.↗