An efficient algorithm for 9-7 discrete wavelet transform based on fragment look-up table

An efficient algorithm for 9/7 discrete wavelet transform based on fragment look-up table (LUT) is studied in the paper. The algorithm implements the wavelet transform by time-sharing LUT and operation with small memory, and it farthest eliminates the hardware resource necessary for multiplication operation while ensuring operation precision and speed The problem of combining segmented data to realize high precision multiplication operation is solved. Compared with multiplication operation, the fragment LUT operation is simpler and faster, and can be implemented easily by VLSI. The algorithm is verified on Altera's FLEX10K30 FPGA. And the result shows the performance of the algorithm: with only 256x8 bits on-chip RAM, and the calculation precision is up to 14-bit binary, the transform time can be up to 74ns. So using the fragment LUT to implement wavelet transform is faster than using algorithms implemented in general logic.