This paper proposes and evaluates the LFrWF, a novel lifting-based architecture to compute the discrete wavelet transform (DWT) of images using the fractional wavelet filter (FrWF). In order to reduce the memory requirement of the proposed architecture, only one image line is read into a buffer at a time. Aside from an LFrWF version with multipliers, i.e., the LFr WFm , we develop a multiplier-less LFrWF version, i.e., the LFr WFml , which reduces the critical path delay (CPD) to the delay Ta of an adder. The proposed LFr WFm and LFr WFml architectures are compared in terms of the required adders, multipliers, memory, and critical path delay with state-of-the-art DWT architectures. Moreover, the proposed LFr WFm and LFr WFml architectures, along with the state-of-the-art FrWF architectures (with multipliers (Fr WFm ) and without multipliers (Fr WFml )) are compared through implementation on the same FPGA board. The LFr WFm requires 22% less look-up tables (LUT), 34% less flip-flops (FF), and 50% less compute cycles (CC) and consumes 65% less energy than the Fr WFm . Also, the proposed LFr WFml architecture requires 50% less CC and consumes 43% less energy than the Fr WFml . Thus, the proposed LFr WFm and LFr WFml architectures appear suitable for computing the DWT of images on wearable sensors.
See how this article has been cited at scite.ai
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.