Low memory parallel SPIHT algorithm for DSP
Chen Sheng-lai, Huang Lian-qing · Optical Technique · 2006
A low memory parallel SPIHT(set partitioning in hierarchical trees) algorithm for DSP(digital signal processors) is presented,because SPIHT algorithm has many repeat calculations and needs a large number of memories.The strategy of Ping-Pong buffer allows data transfer and code to perform simultaneously.Lifting scheme based line permits column transform in the case of a few line transform results,which improves wavelet transform speed.Based on parallel feature of DSP,SPIHT defects were by using methods improved maximum magnitude,error bit number,absolute zero value and absolute zero set,maximum value and zero value map,single zerotree code,which reduce significantly memory requirement and complexity of SPIHT.Experiment results show that the peek signal-to-noise ratio(PSNR) of SPIHT is slightly lower than LZC(listless zerotree coding) and the compression speed is by 2 times than LZC,which can meet generic real-time compression requirement.