J. Liang and T.D. Tran. Fast multiplierless approximations of the DCT with the lifting scheme. IEEE Transactions on Signal Processing, 49(12):3032--3044, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reconfigurable and Low Power 2D-DCT IP for Ubiquitous.. - Martina, Molino, Vacca (Correct)
.... used in many multimedia compression international standards due to its good decorrelation properties as well as its limited computational complexity [1] Since the DCT introduction [21 several research works have been proposed mainly focused on high performance low complexity implementation [3], 4] In this paper a 39 mW DCT FPGA implementation is proposed, specifically developed for H.263 [5] video streaming over a wireless channel. This work addresses reconfigurable related issues in a power conscious framework: starting from a very promising scheme for reduced complexity DCT ....
Jie Liang and Trac D. Tran, "Fast Multiplierless Approximations of the DCT With the Lifting Scheme," IEEE Trans. on Signal Processing, vol. 49, no. 12, pp. 3032-3044, December 2001.
Video-Assisted Global Positioning in Terrain Navigation.. - Le, Seetharaman (Correct)
.... vk 5 1 Vk 1 OZ k OZk 1 5 (16) X(ck) Xo hp ul vp (17) where 5 m sin5 is chosen as 5: 2 8, to perform the computation rapidly in hardware [7] The computa tional accuracy of this approach could be further enhanced by considering the three stage lifting procedure proposed in [14] and [15]. In this context, the vote accumulation and search take place in the XYZ space. The XYZ space is divided into a three dimensional grid; and each cell is assigned a vote accumulator. The unknown camera position is traced by a toroid to be determined by locating two known landmarks in the image. ....
J. Liang and T. D. Tran. Fast multiplierless ap- proximation of the DCT with the lifting scheme. IEEE Trans. on Signal Processing, 49:3032-3044, Dec 2001.
Multiplierless Approximation of Transforms with Adder .. - Chen, Oraintara.. (2002) (1 citation) Self-citation (Tran) (Correct)
No context found.
J. Liang and T. D. Tran, "Fast multiplierless approximations of the DCT with the lifting scheme," IEEE Trans. Signal Processing, Dec. 2001.
Context-Based Entropy Coding of Block Transform Coefficients for .. - Tu, Tran (2002) (1 citation) Self-citation (Tran) (Correct)
No context found.
J. Liang and T. D. Tran, "Fast multiplierless approximations of the DCT with the lifting scheme," IEEE Trans. Signal Processing, vol. 49, pp. 3032--3044, Dec. 2001.
Lapped Transform via Time-Domain Pre- And Post-Filtering - Tran, Liang, Tu (2003) Self-citation (Liang Tran) (Correct)
No context found.
J. Liang and T. D. Tran, "Fast multiplierless approximations of the DCT with the lifting scheme," IEEE Trans. Signal Processing, vol. 49, pp. 3032--3044, Dec. 2001.
Fast Multiplierless Approximations of the DCT with the Lifting.. - Liang, Tran (2001) (7 citations) Self-citation (Liang Tran) (Correct)
....4) The binDCT also inherits all lifting properties such as fast implementations, invertible integer to integer mapping, in place computation, and low dynamic range. This lifting scheme based fast multiplierless approximation of the DCT was first proposed in [36] and was generalized in [37]. Several preliminary results were also reported in [38] and [39] A similar method was later obtained in [40] in which the WHT based DCT factorization [2] 9] 10] is used, which is not as elegant as that of [12] 15] Besides, the result in [40] is not a scaled DCT. Hence, the performance of ....
J. Liang and T. D. Tran, "Fast multiplierless approximation of the DCT with the lifting scheme," presented at the Proc. SPIE Apps. Dig. Imagng Process. XXIII, Aug. 2000.
Regularity-Constrained Pre- and Post-Filtering for Block DCT.. - Dai, Tran (2001) Self-citation (Tran) (Correct)
....1, we can obtain the following proposition. by the type IV pre lter is 2 regular if and only if: 2i 1)S i M(1 U i 1 )P i 1 MU i = M 2 c 1 M(1 U 2 c 2 )P C. Integer Rational Implementation If the DCT is replaced by its integer approximations such as the binDCT [11], then V dictates the rational or integer property of the entire system since every other component already has integer coecients. If all lifting steps as well as the diagonal scaling factors in Fig. 3 are chosen to be rational, then we have a complete system (both analysis and synthesis) with ....
....synthesis 1 (t) Bottom row, from left to right: second analysis wavelet function 2 (t) third analysis wavelet function 3 (t) second synthesis wavelet function 2 (t) third synthesis 3 (t) Fig. 6 is another 4 band example with rational coecient pre post ltering and the binDCT [11] as the block transform. The parameters used in constructing V are tabulated in the second row of Table II. The coecients of the analysis lters h i [n] is listed in Table III. Because of the inversion of the diagonal scalars in the post lter, the coecients of the synthesis lters are rational ....
J.Liang and T. D. Tran, \Fast multiplierless approximations of the DCT with the lifting scheme," IEEE Trans. on Signal Processing, vol. 49, pp. 3032-3044, Dec. 2001.
Fast Multiplierless Approximations of the DCT with the Lifting.. - Liang, Tran (2001) (7 citations) Self-citation (Liang Tran) (Correct)
....(iv) The binDCT also inherits all lifting properties such as fast implementations, invertible integer to integer mapping, in place computation, and low dynamic range. This lifting scheme based fast multiplierless approximation of the DCT was rst proposed in [36] and was generalized in [37]. Several preliminary results were also reported in [38] and [39] A similar method was later obtained in [40] in which the WHTbased DCT factorization [2] 10] is used, which is not as elegant as that of [12] 15] Besides, the result in [40] is not a scaled DCT. Hence the performance of this ....
J. Liang and T. D. Tran, \Fast multiplierless approximation of the dct with the lifting scheme," Proc. SPIE Apps. of Dig. Img. Process. XXIII, Aug. 2000.
Custom-Optimized Multiplierless Implementations of DSP.. - Püschel, Zelinski, Hoe (2004) (Correct)
No context found.
J. Liang and T.D. Tran. Fast multiplierless approximations of the DCT with the lifting scheme. IEEE Transactions on Signal Processing, 49(12):3032--3044, 2001.
Automatic Cost Minimization for Multiplierless.. - Zelinski, Püschel.. (2004) (Correct)
No context found.
J. Liang and T.D. Tran, "Fast Multiplierless Approximations of the DCT with the Lifting Scheme," IEEE Trans. on Signal Processing, vol. 49, no. 12, pp. 3032--3044, 2001.
Automatic Cost Minimization for Multiplierless.. - Zelinski, uschel.. (2004) (Correct)
No context found.
J. Liang and T.D. Tran, "Fast Multiplierless Approximations of the DCT with the Lifting Scheme," IEEE Trans. on Signal Processing, vol. 49, no. 12, pp. 3032--3044, 2001.
Perfect Reconstruction Integer-Modulated Filter Banks - Mertins, Karp (2001) (Correct)
No context found.
J. Liang and T. D. Tran, "Fast multiplierless approximation of the DCT with the lifting scheme," in Proc. SPIE Applications of Digital Image Processing XXIII, San Diego, CA, Aug. 2000.
M-Channel Lifting-Based Design of Paraunitary and.. - Chen, Oraintara.. (Correct)
No context found.
J. Liang and T. D. Tran, Fast multiplierless approximations of the DCT with the lifting scheme, IEEE Trans. on Signal Processing, Dec. 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC