TY - JOUR
T1 - VLSI implementation for one-dimensional multilevel lifting-based wavelet transform
AU - Chen, Pei Yin
N1 - Funding Information:
The author would like to thank Chia-Hsien Cheng, Che-Yen Hu, and Yi-Heng Chang for their help in VLSI implementation of the proposed architecture. This research was supported by the National Science Council, Republic of China, under the Grant NSC-90-2215-E-218-001.
PY - 2004/4
Y1 - 2004/4
N2 - The lifting scheme has been developed as a flexible tool suitable for constructing biorthogonal wavelets recently. In this paper, we present an efficient VLSI architecture for the implementation of 1D lifting discrete wavelet transform. The architecture folds the computations of all resolution levels into the same low-pass and high-pass units to achieve higher hardware utilization. Because of its modular, regular, and flexible structure, the design is scalable for different resolution levels. In addition, its area is independent of the length of the 1D input sequence and its latency is independent of the number of resolution levels. Since the architecture has a similar topology to a scan chain, we can modify it easily to become a testable scan-based design by adding very few hardware resources. For the computations of N-sample 1D k-level analysis (5, 3) lifting wavelet transform, the design takes N+1 clock cycles, and requires two multipliers, four adders, and (3 + 2.25 × 2k) registers. In the simulation, it works with a clock period of 10 ns and achieves a processing rate of about 100 × 106 samples/sec for k-level lifting wavelet transform.
AB - The lifting scheme has been developed as a flexible tool suitable for constructing biorthogonal wavelets recently. In this paper, we present an efficient VLSI architecture for the implementation of 1D lifting discrete wavelet transform. The architecture folds the computations of all resolution levels into the same low-pass and high-pass units to achieve higher hardware utilization. Because of its modular, regular, and flexible structure, the design is scalable for different resolution levels. In addition, its area is independent of the length of the 1D input sequence and its latency is independent of the number of resolution levels. Since the architecture has a similar topology to a scan chain, we can modify it easily to become a testable scan-based design by adding very few hardware resources. For the computations of N-sample 1D k-level analysis (5, 3) lifting wavelet transform, the design takes N+1 clock cycles, and requires two multipliers, four adders, and (3 + 2.25 × 2k) registers. In the simulation, it works with a clock period of 10 ns and achieves a processing rate of about 100 × 106 samples/sec for k-level lifting wavelet transform.
UR - http://www.scopus.com/inward/record.url?scp=1942532281&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1942532281&partnerID=8YFLogxK
U2 - 10.1109/TC.2004.1268396
DO - 10.1109/TC.2004.1268396
M3 - Article
AN - SCOPUS:1942532281
SN - 0018-9340
VL - 53
SP - 386
EP - 398
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
IS - 4
ER -