Skip to Main content Skip to Navigation
New interface

A fast algorithm for the 4x4 discrete Krawtchouk transform

Abstract : A fast algorithm for computing the 4x4 discrete Krawtchouk transform (DKT) is proposed. By exploiting the reduced number of different values of basis functions, the proposed algorithm decreases significantly the number of arithmetic operations. It requires only 8 multiplications, 80 additions and 32 shifts, which saves about 98%, 88% and 83% multiplications compared to the direct method, the method using the properties of the DKT and the method computed by cascaded digital filters, respectively. The - proposed - algorithm could be used to efficiently compute the building-blocks when the process of the large image size is performed. Experiments are provided to demonstrate the efficiency of the proposed algorithm.
Document type :
Complete list of metadata
Contributor : Laurent Jonchère Connect in order to contact the contributor
Submitted on : Wednesday, October 12, 2016 - 2:58:12 PM
Last modification on : Wednesday, September 14, 2022 - 10:20:04 AM


  • HAL Id : hal-01380116, version 1


J. S. Wu, C. F. Yang, H. Z. Shu, L. Wang, L. Senhadji. A fast algorithm for the 4x4 discrete Krawtchouk transform. Wan, Y and Shao, L and Wang, L and Sun, J and Nan, J and Zhang, Q. CRC PRESS-TAYLOR & FRANCIS GROUP, pp.23--28, 2015, 978-1-315-68858-9; 978-1-138-02785-5. ⟨hal-01380116⟩



Record views