WA WP Best Tree VI
- Updated2024-07-30
- 3 minute(s) read
Searches for the optimal decomposition tree based on the minimum entropy criterion, which is the smallest value of the total entropy of all terminal nodes at a certain level in all the possible tree structures.

Inputs/Outputs
![]() WP session specifies a reference to an existing wavelet packet structure.
![]() error in describes error conditions that occur before this node runs. This input provides standard error in functionality. ![]() WP session out returns a reference to an existing wavelet packet structure, which this VI can modify.
![]() error out contains error information. This output provides standard error out functionality. |
WA WP Best Tree Details
The entropy associated with each node of the wavelet packet tree is computed at the decomposition stage. For certain levels of wavelet packet decomposition, this VI searches the best decomposition structure according to the minimum entropy criterion. The resulting decomposition tree structure is called the best tree. Refer to A Wavelet Tour of Signal Processing for more information about decomposition trees.
Examples
Refer to the Wavelet Packet - Entropy Selection VI in the labview\examples\Wavelet Analysis\WAGettingStarted directory for an example of using the WA WP Best Tree VI.