Title :
Improved reversible integer transform
Author :
Pei, Soo-Chang ; Ding, Jian-Jiun
Author_Institution :
Dept. of Electr. Eng., National Taiwan Univ., Taipei
Abstract :
Integer transform are the discrete transforms whose entries are summations of 2-k. If for an integer transform, we can perfectly recover the input from the output, we call it the reversible integer transform. In 2001, Hao and Shi developed an algorithm that can convert any reversible non-integer transform into a reversible integer transform. In this paper, we improve their works. First, we simplify the way of derivation. Then, we analyze the approximation error and introduce the way to reduce it. We also discuss the problem of bit constraint and how to reduce the number of time cycle in implementation
Keywords :
computational complexity; discrete transforms; matrix decomposition; approximation error; bit constraint; discrete transforms; reversible integer transform; Approximation error; Costs; Discrete cosine transforms; Discrete transforms; Error analysis; Hardware; Iterative algorithms; Karhunen-Loeve transforms; Matrix converters; Matrix decomposition;
Conference_Titel :
Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on
Conference_Location :
Island of Kos
Print_ISBN :
0-7803-9389-9
DOI :
10.1109/ISCAS.2006.1692779
