METHOD FOR DETERMING A TRELLIS PATH USING A REFERENCE MATRIX

Abstract: The invention relates to a method of determining a current trellis describing a plurality of paths starting from an initial state, said paths having a predetermined length smaller than or equal to a maximum length. It consists of: storing a reference trellis comprising all the paths of the trellis of maximum length, extracting the paths of said current trellis from said reference trellis, taking into account said maximum length, the length of said current trellis, and the initial state of the paths. Application: Data encoding using variable length trellis, for example V90.

Description: 01/28178 METHOD FOR DETERMING A TRELLIS PATH USING A REFERENCE MATRIX The invention relates to a method for determining a trellis describing a plurality of paths starting from an initial state and having a predefined length, said trellis being used for a transmission between a transmitter and a receiver. The invention also relates to a modem using such a method, a communication system comprising such a modem, and a computer program comprising code means for executing the steps of said method. The invention is useful in all cases where the paths through the trellis are short and the number of states of the trellis is small. For example it may be applied to V90 spectral shaping. V90 is a recommendation of the IUT dealing with a digital modem and an analogue modem pair for use on the public switched telephone network. It is known from paragraph 5.4.5.5. of the V90 Recommendation to use a trellis in the digital modem to implement a coding algorithm called "spectral shaping" algorithm. According to this recommendation, the length of the trellis is an integer lying between 0 and 3, selected by the analogue modem during training procedures. The problem is that the length of this trellis may change at each connection. Thus at each connection the new trellis is to be determined, which involves a lot of calculations. One of the objects of the invention is to propose a simple method of determining the trellis for a transmission between a transmitter and a receiver. This is achieved with the method of claims 1 to 3. According to the invention, all possible paths through the trellis are described branch-by-branch for the maximum length of the trellis. Then all these paths are stored, for example in a matrix called Reference matrix. Paths to be used for a smaller length of the trellis are deducted from said reference matrix, from the length of the current trellis, from the maximum length, and from the initial state of the paths. The invention is advantageous, because it avoids the storage of all the possible configurations of paths, and thus it saves memory space. Figure 1 is a schematic representation of an example of a communication system according to the invention, Figure 2 is a representation of a trellis having two possible states and four possible paths,and Figure 3 is a block diagram showing the steps of a method according to the invention. The embodiment which will now be described relates to PCM modems in conformity with the N90 Recommendation of the IUT. This is not restrictive. The invention is applicable to any transmitter / receiver using a variable length trellis for encoding data. The only restriction for using the method of the invention is that the memory capacity has to be large enough to store the reference matrix. In other words, the maximum length of the trellis and the number of states of the trellis have too be small enough to allow the storage of the reference matrix in the available memory. A PCM modem enables a user Ul connected to a transmission network by an analogue link and a user U2 connected to the same network by a digital link to be interconnected. They may be, for example, a user terminal Ul communicating with a data server U2 of a service provider. In Figure 1 is represented an example of such a transmission system. The transmission system of Figure 1 comprises a digital communication network 1 with two switches SW1 and SW2. An APCM modem Ml is connected to the switch SW1 via a twisted pair LI for transmitting analogue signals. A DPCM modem M2 is connected to the switch SW2 via a digital link L2, for example an ISDN link (ISDN stands for Integrated Services Digital Network). This digital link L2 may be considered an extension of the digital transmission network: the switch SW2 then plays the role of repeater. The APCM modem Ml and the DPCM modem M2 both comprise a microprocessor circuit MP1 and MP2, respectively. The microprocessor circuit MP1 and MP2 comprise respectively a Read Only Memory ROM1 and ROM2, a random access memory RAM1 and RAM2, and a processor PI and P2. In this example, the method of the invention is used in the DPCM modem M2 when operating as a transmitter. According to the V90 Recommendation, the digital modem uses a trellis to implement a coding algorithm called "spectral shaping" algorithm. The length of the trellis is an integer lying between 0 and 3 selected by the analogue modem during training procedures. The "spectral shaping" algorithm is stored in the memory ROM2 of the DPCM modem M2. Figure 2 gives a representation of such a trellis. This trellis has two possible states, state SO and state SI, and four possible paths A, B, C and D. The length of the trellis is called Ld. States λ(j - 1), λ(j), ..., λ(j + Ld) are the (Ld +2) successive states in the trellis. State λ(j -\) is the initial state of the trellis. This trellis describes 2 Ld+x paths starting by initial state λ(j -\) and comprising Ld+l branches. Figure 2 corresponds to the case where the initial state of the trellis λ(j -I) is state SO. If Ld=0, the trellis has only two states λ(j - 1) and λ(j) . Starting from initial state λ(j - \) there are only two paths to reach λ(j) . If the initial state is SO, these two paths are branch A and branch B. Branch A is the branch between state SO and state SO. Branch B is the branch between state SO and state SI. If Ld=\, the trellis has three states. Four branches exist between the second and the third state: branch A is the branch between state SO and state SO, branch B is the branch between state SO and state SI, branch C is the branch between state SI and state SO, and branch D is the branch between state S 1 and state S 1. When Ld>\, this four branches configuration is repeated until the end of the trellis. This trellis diagram gives the coding rules for a frame j according to the current state λ(j -\) . The current state λ(f -\) relates to the preceding frame j-1. In order to select the trellis branch for a frame j, the "spectral shaping" coding algorithm computes a specific metric called "spectral metric" for all possible paths through the trellis startmg from initial state λ(j - \) . Then it selects the path that minimizes this spectral metric. The first branch of this path is the coding decision for frame j. This means that the coding algorithm has to go through all the trellis each time a frame is to be encoded. In the following, all the paths through the trellis are stored in a matrix, so that each path corresponds to one row of the matrix. Tables 1 and 2 below give the matrix Pref corresponding to the maximum length Ldmax of the trellis, for Ldmax=3 (which is the case in the N90 Recommendation). This matrix is called Reference matrix. Tables 1 and 2 also give the matrix P , £d to be used to go through a trellis of smaller length (Ld <Ldmax). These matrices are called current matrices. Pre/ TABLE 1 TABLE 2 According to the invention, the Reference matrix Pre/is stored in the memory ROM2 of the DPCM modem M2. And the paths of the current trellis to be used for the "spectral metric" calculations are deducted from the Reference matrix, from the length Ld of the trellis, and from the initial state of the path in the following way: P d (u,v) = P (2 Ld+l .λ(j -\) + u, Ldmax-Ld + v) where («,v) e This is represented in the block diagram of figure 3. The current frame for which a coding decision is to be taken is called j. A "spectral metric" calculation block Bl sends two parameters to a trellis definition block B2. These two parameters are the length Ld of the current trellis and the initial state λ(j - 1) . The trellis definition block B2 accesses the memory ROM2 of the modem. From the two parameters Ld and λ(j - 1) , it computes the paths P, ( = l ? ...2 ω+1 ) to be followed in the current trellis in order to calculate the spectral metrics associated to the current frame j. These paths P, are transmitted to a metric calculation block B3. The calculated metrics M, are then transmitted to a decision block B4. This decision block B4 selects the first branch bi,\ of the path, which has the minimum metric. This first branch gives the code C y which is associated to frame j. Then j is incremented, and the same process is repeated for the next frame. The ADPCM is operating as a receiver. In the V90 Recommendation the "de- shaping" algorithm is independent of the length of the trellis used by the DPCM transmitter. Thus the only information to be stored in the APCM modem is a four branches configuration as represented in figure 2. In other transmission systems, it is possible that the receiver also needs to know the complete current trellis in order to decode the received data. In this case, the Reference matrix Pre/has also to be stored in the memory of the receiver, and the above described method of determining the current trellis is also to be implemented in the receiver. In the above description, only the part of the N90 Recommendation that was necessary for the understanding of the invention was described. More details on the "spectral shaping" can be found in paragraph 5.4.5 of the V90 Recommendation.

Claims: CLAIMS: 1. A method of determining a trellis describing a plurality of paths starting from an initial state and having a predefined length smaller than or equal to a maximum length, said trellis, called current trellis, being used for a transmission between a transmitter and a receiver, characterized in that it comprises the steps of • storing a reference trellis comprising all the paths of the trellis of maximum length, • extracting the paths of said current trellis from said reference trellis taking into account said maximum length, the length of said current trellis, and the initial state of the paths. 2. A method as claimed in claim 1 wherein said reference trellis is stored in a matrix format. 3. A method as claimed in claim 2, wherein said extracting step consists of calculating elements of a matrix called trellis matrix, said elements being defined as follows: + u, Ldmax- Ld + v) Ld is the length of said trellis, Ldmαx is said maximum length, λ(J -\) is said initial state. 4. A transmitter / receiver intended for using a method as claimed in one of claims 1 or 3. 5. A modem intended for using a method as claimed in one of claims 1 or 3. 6. A communication system comprising a transmitter / receiver as claimed in claim 4. 7. A computer program comprising code means for executing the steps of the method claimed in one of claims 1 or 3.

Inventors: BRUN VERONIQUE, BRUN, VERONIQUE
Applicants: KONINKL PHILIPS ELECTRONICS NV, KONINKLIJKE PHILIPS ELECTRONICS N.V.
Application year: 2000
Main classification: H04L27
IPC codes: H04L25, H04L27