Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

CHAPTER 1

INTRODUCTION
Multi-Dimensional Multi Rate Systems have a lot of applications in the field of image and video processing. The key building blocks in these systems are the decimation matrix M and the expansion matrix L. These are D x D non-singular integer matrices, where D denotes the number of dimensions. Most of the one dimensional results can be applied directly (i.e. by performing operations in each dimension separately) to the multi-dimensional (MD) case, when these decimation and expansion matrices are diagonal. However, for the non-diagonal case the extensions are non-trivial and they need extra set of rules and notations to be specified. One such peculiar case wherein the one dimensional results cannot directly be extended into the MD form is the commutativity of the decimation and the expansion matrices. The concept of commutativity refers to the ability to interchange the positions between two entities; in the case at hand it is the ability to interchange the M and L matrices. In the 1D case M and L were mere integers and hence the commutativity could be established with a simple condition, wherein the two integers had to be relatively prime i.e. coprime. Figure 1 interprets the commutativity concept clearly.

Figure 1: Interchange of a 1D decimator and expander.

Theorem 1: An M-fold decimator and an L-fold expander commute if and only if

ML=LM and M and L are coprime. Generally speaking it is essential to show that the right coprimeness and left coprimeness are different for the matrix case, but it can be showed that these two are equivalent for the case at hand i.e. when ML=LM. One of the major applications of commutativity in such cases is the option availed to implement polyphase decomposition via the interchangability that is hence availed after the
Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

commutativity is exploited. Figure 2 shows a rational decimation system that allows us to vary the sampling rate of a signal by a factor of M/L. Such factors are of the rational nature as evident, hence the rational decimation systems. The implementation of this paper aims at the very same concept, polyphase implementation of rational decimation systems.

Figure 2: Rational decimation system.

The filter H(z) which operates at a rate L times the rate of the input signal, is used to suppress image components generated by the L-fold expander and to avoid aliasing due to the M-fold decimator. The major fault or the problem that arises in such an implementation is the load on the filter and also the redundancy that is created due to the fact there lies a decimator after the filter. The expander that is present prior to the filter increases the samples and hence feeds it to the filter, thus increasing the load on it. This results in the requirement of higher order filters. Also, the filtering process results in a redundancy after the complete implementation is observed, as the decimator reduces the number of samples. This indirectly mocks at the performance of the filter. In order to get a better implementation of such rational decimation systems the concept of polyphase implementation is used. The polyphase decomposition of the filter H(z) followed by a successive implementation of the same concept via the exploitation of the commutative nature of the decimator and expander results in a more efficient implementation. Such an implementation is referred here as the Rational Polyphase Implementation (RPI), wherein the filter operates at a rate 1/M times the input rate, so the efficiency is LM times that of the direct implementation. As mentioned earlier, the RPI technique can be applied only if the decimation and interpolation factors M and L are co-prime. The same concept can be applied to MD decimation systems with rational decimation ratio but under certain conditions as discussed. The RPI of the MD systems will be hence derived in the latter part of the report, such that it can be applied to any MD system wherein M, L commute and also ML=LM.

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

CHAPTER 2

Prerequisites
Capital and lowercase boldfaced letters denote matrices and vectors, respectively. The notations AT and A-1 denote the transpose and the inverse of A, respectively. The row and column indices typically begin from zero. With D denoting the number of dimensions, n=[ no nl nD-1 ]T is the time domain index of MD discrete signals. The symbol denotes the set of all D x 1 integers, so that n. The complex vector z=[zo z1 ... zD-1]T is the variable of the z-transform of MD signals. The z-transform of x(n), where it converges, is given by X(z) = n x(n)z-n. The notation zk is a scalar.

2.1 Decimation and Expansion

The M-fold decimated version of x(n) is defined as y(n) = x(Mn), where the decimation matrix M is a non-singular integer matrix. On the other hand, the L-fold expanded version of x(n) is defined as, y(n) = x(L-1n), 0 , nLAT(M); otherwise.

In the above equation, LAT(V) (the lattice generated by V) denotes the set of all vectors of the form Vm, m. The corresponding z-domain relation of expansion is Y(z)=X(zL). The notation zL is a Dx1 vector.

2.2 Polyphase decomposition

Polyphase decomposition is a technique that was initially employed for the purpose of getting a computationally efficient implementation which would result in the optimal usage of the elements used in a typical rational decimation system. The polyphase components of x(n) with respect to a given M are defined as ei(n)=x(Mn + ki), ri(n)=x(Mn ki), (Type 1) (Type 2)

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

where ki(M) and (M) is the set of all integer vectors of the form Mx, 0xi<1. Let J(M) denote |det M|, i.e., the absolute determinant of M. The vector ki can take on J(M) different values, which are ordered as k0, k1, . . ., kJ(M)-l. In the z-domain, the polyphase decompositions of X(z) can be expressed as ( ) ( )
( )

( ( )

(type 1) (type 2)

( )

2.3 Noble Identities

These are a composition of two identities that avail the flexibility with respect to the positioning of the down-sampler and up-sampler i.e. relative to the low pass filter. The problem with the decimator and the interpolator is with the positioning of the sampler. The decimator consists of a low pass filter followed by a down sampler and the interpolator consists of an up sampler followed by a low pass filter. This arrangement tends to increase the complexity. Hence, the necessity for the noble identities. These identities are subjected to two conditions, namely (i) (ii) The low pass filter G(z) should be a ratio of polynomials in z or z-1, If the powers of z are fractional, the identity cannot be applied.

Figure 3: MD noble identities.

2.3 Lcrm and Lclm

Definitions: i. R is a right multiple (rm) of M if R=MP for some integer matrix P, i.e., if M is a left divisor of R. ii. R is a common right multiple of M and L (denoted as crm (M, L)) if R=MP=LQ for some integer matrices P and Q. iii. R0 is a least common right multiple of M and L (denoted as lcrm (M, L)) if
4

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

a. R0 is a non-singular crm (M, L). b. If R is another non-singular crm (M, L), then R =R0S for some integer matrix S. The common left multiple (clm) and the least common left multiple (lclm) are defined on similar lines. Singular crm is of less importance because given any non-singular crm (M, L), we can always post multiply it by a singular matrix to get a singular crm (M, L). Also, if either M or L is singular, all crm (M, L)s are singular and it is meaningless to discuss the lcrm(M,L). For these various reasons, by definition we restrict the lcrm to be non-singular and to be defined only for non-singular M and L. Based on the above definitions the below two lemmas can be defined and proved.

Lemma1: Let R be a non-singular crm (M, L), i.e., R = MP = LQ. Then, R is an lcrm(M, L) if P and Q are right co-prime. Proof: 1. If P and Q are not right co-prime, then there exists an X which is not unimodular such that P = P'X and Q=Q'X. Therefore, we have R = MP'X = LQ'X

R'

R'

Clearly, R = R'X, and R' is a crm of M and L. Suppose R is an lcrm of M and L, then R' = RS according to the definition of lcrm. Then, R = R'X = RSX, which implies both X and S must be unimodular and thus leads to contradiction. Hence we conclude that if P and Q are not right co-prime, R is not an lcrm of M and L. 2. Next, suppose P and Q are right co-prime, we have to prove that R is an lcrm of M and L. Let R' be any other non-singular crm of M and L, i.e., R' = MP' = LQ'. Clearly, P' is non-singular, because P and Q are right co-prime, there exist integer matrices A and B such that AP + BQ = I (generalized Bezout theorem). Replacing Q with Q'P'-1P, we can rewrite this as AP'P'-1P + BQ'P'-1P = I Post-multiplying both sides by P-1P', we get AP' + BQ' = P-1P' S So, P'=PS and hence R'=RS. From the definition of lcrm, R is indeed an lcrm(M,L).
5

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

The left multiple (lm), common left multiple (clm), and least common left multiple (lclm) can be defined and also defined similarly. Lemma2: When ML = LM, any lcrm(M,L) and any gcrd(M,L) can be related as lcrm(M,L).U.gcrd(M, L) = ML for some unimodular U. Also, when ML = LM, the following four statements are equivalent: i. ii. iii. iv. ML is an lcrm(M, L). M and L are right co-prime. M and L are left co-prime. ML is an lclm(M, L). For the 1D case, this nicely reduces to lcm(M,L) = ML if and only if M and L are co-prime, which is a well-known fact.

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

CHAPTER 3

1D Rational decimation systems

A simple rational decimation system in the 1D frame can be easily explained and understood as well. The objective behind understanding this to get a clear picture about the successive redrawing of the polyphase implementations of a 1D rational decimation system yielding an efficient system eventually.

Figure 4: 1D Rational decimation system

Consider an up sampling factor of 2 and down sampling factor of 3 (so that the concept of commutativity can be exploited and explained simultaneously). The two types of polyphase implementations can be expressed as shown in figure 5, wherein (a) represents the type 1 implementation and (b) represents type 2.

Figure 5: Types of polyphase implementations of the 1D rational decimation system at hand.

Successive redrawing of the polyphase implementations results in an efficient system eventually. Figure 6 hierarchically explains the successive implementation that is being discussed as a remedy to overcome the efficiency problem.
7

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

Figure 6: Successive redrawing of polyphase implementations of a 1D rational decimation system.

In figure 6, the sub part (a) indicates at the type 1 polyphase implementation of the rational decimation system considered as an example; with the help of noble identities subpart (B) can be drawn; subpart (c) exploits the concept of commutativity, thus interchanging the positions of the up and down samplers (considering the fact that 2 and 3 are relatively prime i.e. co-prime); (d) indicates at the type 2 polyphase implementation of the rational decimation systems at this instant of execution. On similar lines, with due consideration of the properties and axioms related to commutativity of D dimensional rational decimation systems, the polyphase implementations can be applied on a continuous basis to obtain an efficient model.

Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

CHAPTER 4

MD Rational decimation systems

Starting from the basics of commutativity and the conditions related to the application of this concept to a rational decimation system, a series of implementations of the polyphase decomposition can be illustrated in a similar manner as shown in chapter 3. The only difference is the extension of the concepts to the MD case. The polyphase implementation of an MD decimation system without performing successive redrawing is shown in figure 8.

Figure 7: Polyphase implementation of an MD decimation system

Figure 8: Successive redrawing of polyphase implementations of a MD rational decimation system. Dept. of ECE, SIT, Tumkur

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

In figure 8, the equivalent subparts indicate the following, (a) Type 1 polyphase implementation of the MD decimation system. Suppose it is possible to replace every ki in (M) with Mki1 + Lki2, where kil and ki2 are some integer vectors. (b) With the help of noble identities and the flexibility availed in the positioning of the sampler relative to the summation, this subpart can be realised. (c) Exploiting the concept of commutativity, the up and down samplers can be interchanged under the specified conditions. Hence this subpart. (d) Employing the type 2 polyphase implementation, arrival at this sub part from the previous is justified.

In summary, Figure 8(d) is equivalent to Figure 7, but each arithmetic operation is now performed at its lowest rate, i.e., l/J(M) times the input rate. Thus we can see that the following two issues should be considered for the above technique to work: 1. The decimators and the expanders should commute. 2. Every k, in (M) should be expressible in the form of ki = Mki1+ Lki2, where ki1 and ki2 are some integer vectors. The conditions for commutativity have been given earlier. So, it only remains to consider the second issue. Using the generalized Bezout theorem, we know that when M and L are left coprime, there exist integer matrices P and Q such that I = MP + LQ where I is the identity matrix. Then, every integer vector k can be expressed as k = MPk + LQk = Mkl + Lk2. Using Lemma 2, we can conclude that the above mentioned MD RPI technique is feasible if and only if, (i) ML = LM, and (ii) M and L are co-prime.

Dept. of ECE, SIT, Tumkur

10

Commutativity of D-Dimensional decimation and expansion matrices, and application to Rational Decimation Systems

REFERENCES
1. Tsuhan Chen and P. P. Vaidyanathan, Commutativity of D-dimensional decimation and expansion matrices, and application to rational decimation systems, IEEE, 1992. 2. Tsuhan Chen and P. P. Vaidyanathan, The Role of Integer Matrices in Multidimensional Multirate Systems, IEEE transactions on signal processing, vol 41. no.3, march 1993. 3. Tsuhan Chen and P. P. Vaidyanathan, least common right/left multiples of integer matrices and applications to multidimensional multirate systems, IEEE, 1992.

Dept. of ECE, SIT, Tumkur

11