convolve2D

logical; if <code>TRUE</code>, take the complex conjugate
 before back-transforming (default, and used for usual convolution).

conj

character; one of <code>circular</code>, <code>open</code>
 (beginning of word is ok). For <code>circular</code>, the two sequences
 are treated as circular, i.e., periodic.
For <code>open</code> and <code>filter</code>, the sequences are padded with
 zeros (from left and right) first; <code>filter</code> returns the middle 
 sub-vector of <code>open</code>, namely, the result of running a
 weighted mean of <code>x</code> with weights <code>y</code>.

type

Use the Fast Fourier Transform to perform convolutions between a
 sequence and each column of a matrix.

Basic wavelet routines for time series (1D), image (2D)
and array (3D) analysis.  The code provided here is based on
wavelet methodology developed in Percival and Walden (2000);
Gencay, Selcuk and Whitcher (2001); the dual-tree complex wavelet
transform (DTCWT) from Kingsbury (1999, 2001) as implemented by
Selesnick; and Hilbert wavelet pairs (Selesnick 2001, 2002).  All
figures in chapters 4-7 of GSW (2001) are reproducible using this
package and R code available at the book website(s) below.

convolve2D: Fast Column-wise Convolution of a Matrix

Description

Usage

Arguments

Details

See Also