Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors

2016 ◽  
Vol 31 ◽  
pp. 362-380 ◽  
Author(s):  
Sirani M. Perera

This paper presents stable, radix-2, completely recursive discrete cosine transform algorithms DCT-I and DCT-III solely based on DCT-I, DCT-II, DCT-III, and DCT-IV having sparse and orthogonal factors. Error bounds for computing the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having sparse and orthogonal factors are addressed. Signal flow graphs are demonstrated based on the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having orthogonal factors. Finally image compression results are presented based on the recursive 2D DCT-II and DCT-IV algorithms for image size 512 by 512 pixels with transfer block sizes 8 by 8, 16 by 16, and 32 by 32 with 93.75% absence of coefficients in each transfer block.

2010 ◽  
Vol 47 (4) ◽  
pp. 393-403 ◽  
Author(s):  
V. C. Prasad

Mason's gain formula requires combining all paths and all loops judiciously. New techniques are presented in this paper to do this. All possible non-touching loop combinations can be generated systematically and represented compactly using a tree structure and/or factoring technique. Both numerator and denominator of the formula can be treated identically. The approach is simple enough to be used in teaching students Mason's gain formula as part of courses in control systems, digital signal processing, graph theory and applications, among others.


1957 ◽  
Vol 45 (1) ◽  
pp. 74-86 ◽  
Author(s):  
William Huggins

Sign in / Sign up

Export Citation Format

Share Document