Krust established that all conjugate and associate surfaces of a minimal graph over a convex domain are also graphs. Using a convolution theorem from the theory of harmonic univalent mappings, we generalize Krust’s theorem to include the family of convolution surfaces which are generated by taking the Hadamard product or convolution of mappings. Since this convolution involves convex univalent ...

This paper presents an on the spot methodology of reducing convolution processing time using hardware computing and implementations of discrete linear convolution of two finite length sequences (NXN). This implementation method is realized by simplifying the convolution building blocks. The purpose of this analysis is to prove the feasibility of an FPGA that performs a convolution on an acquire...