The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kaedah berasaskan garis telah menjadi salah satu kaedah yang paling biasa digunakan bagi pelaksanaan perkakasan bagi transformasi wavelet diskret (DWT) dua dimensi (2D). Walau bagaimanapun, penimbal data diperlukan antara pemproses DWT baris dan pemproses DWT lajur untuk menyelesaikan ketidakpadanan aliran data, yang meningkatkan saiz memori pada cip dan kependaman output. Memandangkan aliran data yang tidak serasi diinduksi daripada sifat intrinsik algoritma berasaskan pengangkatan yang diterima pakai, algoritma pengangkatan terurai (DLA) dipersembahkan dengan menyusun semula laluan data langkah pengangkatan untuk memastikan data imej diproses dalam cara imbasan raster dalam pemproses baris dan pemproses lajur. Analisis teori menunjukkan bahawa isu ketepatan DLA mengatasi algoritma berasaskan pengangkatan lain dari segi hingar pusingan dan panjang perkataan dalaman. Seni bina berasaskan garisan yang cekap memori dan berprestasi tinggi dicadangkan berdasarkan DLA tanpa pelaksanaan penimbal data. Untuk N
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Peng CAO, Chao WANG, Longxing SHI, "Memory-Efficient and High-Performance Two-Dimensional Discrete Wavelet Transform Architecture Based on Decomposed Lifting Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 8, pp. 2000-2008, August 2009, doi: 10.1587/transfun.E92.A.2000.
Abstract: The line-based method has been one of the most commonly-used methods of hardware implementation of two-dimensional (2D) discrete wavelet transform (DWT). However, data buffer is required between the row DWT processor and the column DWT processor to solve the data flow mismatch, which increases the on-chip memory size and the output latency. Since the incompatible data flow is induced from the intrinsic property of adopted lifting-based algorithm, a decomposed lifting algorithm (DLA) is presented by rearranging the data path of lifting steps to ensure that image data is processed in raster scan manner in row processor and column processor. Theoretical analysis indicates that the precision issue of DLA outperforms other lifting-based algorithms in terms of round-off noise and internal word-length. A memory-efficient and high-performance line-based architecture is proposed based on DLA without the implementation of data buffer. For an N
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2000/_p
Salinan
@ARTICLE{e92-a_8_2000,
author={Peng CAO, Chao WANG, Longxing SHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Memory-Efficient and High-Performance Two-Dimensional Discrete Wavelet Transform Architecture Based on Decomposed Lifting Algorithm},
year={2009},
volume={E92-A},
number={8},
pages={2000-2008},
abstract={The line-based method has been one of the most commonly-used methods of hardware implementation of two-dimensional (2D) discrete wavelet transform (DWT). However, data buffer is required between the row DWT processor and the column DWT processor to solve the data flow mismatch, which increases the on-chip memory size and the output latency. Since the incompatible data flow is induced from the intrinsic property of adopted lifting-based algorithm, a decomposed lifting algorithm (DLA) is presented by rearranging the data path of lifting steps to ensure that image data is processed in raster scan manner in row processor and column processor. Theoretical analysis indicates that the precision issue of DLA outperforms other lifting-based algorithms in terms of round-off noise and internal word-length. A memory-efficient and high-performance line-based architecture is proposed based on DLA without the implementation of data buffer. For an N
keywords={},
doi={10.1587/transfun.E92.A.2000},
ISSN={1745-1337},
month={August},}
Salinan
TY - JOUR
TI - Memory-Efficient and High-Performance Two-Dimensional Discrete Wavelet Transform Architecture Based on Decomposed Lifting Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2000
EP - 2008
AU - Peng CAO
AU - Chao WANG
AU - Longxing SHI
PY - 2009
DO - 10.1587/transfun.E92.A.2000
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2009
AB - The line-based method has been one of the most commonly-used methods of hardware implementation of two-dimensional (2D) discrete wavelet transform (DWT). However, data buffer is required between the row DWT processor and the column DWT processor to solve the data flow mismatch, which increases the on-chip memory size and the output latency. Since the incompatible data flow is induced from the intrinsic property of adopted lifting-based algorithm, a decomposed lifting algorithm (DLA) is presented by rearranging the data path of lifting steps to ensure that image data is processed in raster scan manner in row processor and column processor. Theoretical analysis indicates that the precision issue of DLA outperforms other lifting-based algorithms in terms of round-off noise and internal word-length. A memory-efficient and high-performance line-based architecture is proposed based on DLA without the implementation of data buffer. For an N
ER -