Pass of SPIHT

We have list S of significant values and a stack Z of

zero trees from the previous pass or the initialization.

Sorting step.

while Z is not empty do

T := pop(Z);

if T has an index that becomes significant in bit plane k then

output 1;

decompose(T);

else

output 0;

push T on Z’

Z := Z’; {At this point all indices in zero trees in Z are insignificant}

Refinement step.

for each (i,j) in S output the k-th significant bit, B[i,j,k].