wavelet
Class Packet

java.lang.Object
  |
  +--wavelet.Packet

public class Packet

extends java.lang.Object

class that performs Wavelet packet analysis.

Constructor Summary

Packet(WaveletFilter wfi)

Method Summary

void	abt2dwpsp(int n, int maxlevel) abt2dwpsp() [A]rray [B]inary [T]ree to [D]iscrete [W]avelet [P]acket [S]ynthesis, [P]eriodic Calling sequence and basic algorithm: abt2dwpsp( DATA, N, MAXLEVEL, HQF, GQF ): Let L = MAXLEVEL While L>0 Let NCHILD = abtblength( N, L ) L -= 1 For B = 0 to (1<
static int	abtblength(int n, int l)
static int	abtblock(int n, int l, int b)
void	dwpap2abt(double[] in, int start, int n, int maxlevel) dwpap2abt() [D]iscrete [W]avelet [P]acket [A]nalysis, [P]eriodic to an [A]rray [B]inary [T]ree, with preparation.
dataStructures.Hedge	getBestBasis(double[] inData, int startAt, int length, int depthT) getBestBasis
static void	main(java.lang.String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Packet

public Packet(WaveletFilter wfi)

Method Detail

abtblock

public static int abtblock(int n,
                           int l,
                           int b)

abtblength

public static int abtblength(int n,
                             int l)

dwpap2abt

public void dwpap2abt(double[] in,
                      int start,
                      int n,
                      int maxlevel)

dwpap2abt() [D]iscrete [W]avelet [P]acket [A]nalysis, [P]eriodic to an [A]rray [B]inary [T]ree, with preparation. Calling sequence and basic algorithm: dwpap2abt( IN, N, MAXLEVEL, HQF, GQF ): Allocate an array of (MAXLEVEL+1)*N REALs at DATA For I = 0 to N-1 Let DATA[I] = IN[I] dwpap2abt0( DATA, N, MAXLEVEL, HQF, GQF ) Return DATA Inputs: double in This array contains only the `n' inputs. (int)n This is the positive row length of `data[]'. (int)maxlevel This is the depth of `data[]'. WaveletFilter qf Outputs: double[] dwpap2abt The function returns an array binary tree filled by reference with wavelet packet coefficients. Assumptions: 1. `n' is divisible by `1<

abt2dwpsp

public void abt2dwpsp(int n,
                      int maxlevel)

abt2dwpsp() [A]rray [B]inary [T]ree to [D]iscrete [W]avelet [P]acket [S]ynthesis, [P]eriodic Calling sequence and basic algorithm: abt2dwpsp( DATA, N, MAXLEVEL, HQF, GQF ): Let L = MAXLEVEL While L>0 Let NCHILD = abtblength( N, L ) L -= 1 For B = 0 to (1<

getBestBasis

public dataStructures.Hedge getBestBasis(double[] inData,
                                         int startAt,
                                         int length,
                                         int depthT)

getBestBasis

main

public static void main(java.lang.String[] args)