Documentation of 'math.jwave.transforms.WaveletPacketTransform' Java class
WaveletPacketTransform
math.jwave.transforms

Class WaveletPacketTransform



  • public class WaveletPacketTransform
    extends WaveletTransform
    Base class for the forward and reverse Wavelet Packet Transform (WPT) also called Wavelet Packet Decomposition (WPD) using a specified Wavelet by inheriting class.
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method and Description
      double[] forward(double[] arrTime)
      Implementation of the 1-D forward wavelet packet transform for arrays of dim N by filtering with the longest wavelet first and then always with both sub bands -- low and high (approximation and details) -- by the next smaller wavelet.
      double[] reverse(double[] arrHilb)
      Implementation of the 1-D reverse wavelet packet transform for arrays of dim N by filtering with the smallest wavelet for all sub bands -- low and high bands (approximation and details) -- and the by the next greater wavelet combining two smaller and all other sub bands.
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • WaveletPacketTransform

        public WaveletPacketTransform(Wavelet wavelet)
        Constructor receiving a Wavelet object.
        Parameters:
        wavelet - object of type Wavelet; Haar02, Daub02, Coif06, ...
        Throws:
        JWaveException
      • WaveletPacketTransform

        public WaveletPacketTransform(Wavelet wavelet,
                                      int steps)
        Constructor receiving a Wavelet object.
        Parameters:
        wavelet - object of type Wavelet; Haar02, Daub02, Coif06, ...
        steps - how many steps the algorithm should perform
        Throws:
        JWaveException
    • Method Detail

      • forward

        public double[] forward(double[] arrTime)
        Implementation of the 1-D forward wavelet packet transform for arrays of dim N by filtering with the longest wavelet first and then always with both sub bands -- low and high (approximation and details) -- by the next smaller wavelet.
        Specified by:
        forward in class BasicTransform
        Parameters:
        arrTime - coefficients of 1-D time domain
        Returns:
        coefficients of 1-D frequency or Hilbert domain
        See Also:
        BasicTransform.forward(double[])
      • reverse

        public double[] reverse(double[] arrHilb)
        Implementation of the 1-D reverse wavelet packet transform for arrays of dim N by filtering with the smallest wavelet for all sub bands -- low and high bands (approximation and details) -- and the by the next greater wavelet combining two smaller and all other sub bands.
        Specified by:
        reverse in class BasicTransform
        Parameters:
        arrHilb - coefficients of 1-D frequency or Hilbert domain
        Returns:
        coefficients of 1-D time domain
        See Also:
        BasicTransform.reverse(double[])

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.