wavMODWT(x, wavelet="s8", n.levels=ilogb(length(x), base=2),
position=list(from=1,by=1,units=character()), units=character(),
title.data=character(), documentation=character(), keep.series=FALSE)
data
. Default: character()
.TRUE
, the original series
is preserved in the output object. Default: FALSE
.as.integer(floor(logb(length(x),base=2)))
.list
containing the arguments
from, by
and to
which describe the position(s) of the input
data
. All position arguments need not be specified as missing members
will be filled in by their default valuesdata
. Default: character()
.character()
(no units).wavDaubechies
for details. Default: "s8"
.wavTransform
.wavDWT
function can handle arbitrary length
sequences, it does so by means of an ad hoc storage sytem for odd length
scaling coefficient crystals. The MODWT needs no such scheme and is
more robust in this respect). The cost of
the MODWT is in its redundancy. For an $N$
point input sequence, there are $N$ wavelet
coefficients per scale. However, the number of multiplication operations is
$O(N \log_2(N))$ which is the same as
the fast Fourier transform, and is acceptably fast for most situations.reconstruct
, wavDaubechies
, wavDWT
, wavMODWPT
, wavDictionary
, wavIndex
, wavTitle
, wavBoundary
.## calculate the MODWT of linear chirp
linchirp <- make.signal("linchirp", n=1024)
result <- wavMODWT(linchirp, wavelet="s8", n.levels=5, keep.series=TRUE)
## plot the transform shifted for approximate zero
## phase alignment
plot(wavShift(result))
## plot summary
eda.plot(result)
## summarize the transform
summary(result)
Run the code above in your browser using DataLab