Patent ID: 6370501
Filing Date: 2002-04-09
Classification: G10L

Abstract:
A method of degrouping a codeword having n bits and being grouped by:A=(2p+1)2z+(2p+1)y+x wherein A is the codeword; x, y and z are three consecutive samples to be obtained; and p is 1, 2 or 3, said method comprising the following steps:I) deciding values of n and k in an processor upon receipt of said p, wherein n=5 and k=4, when p=1; n=7, k=3, when p=2; and n=10, k=3, when p=3; II) feeding A to said processor; III) setting i=1; IV) obtaining qâ€²=q1âˆ’q2+q3 . . . +(âˆ’1)k+1Â·qk, and râ€²=r1âˆ’r2+r3 . . . +(âˆ’1)k+2Â·rk+1, â€ƒwherein qj=(anâˆ’1, anâˆ’2, anâˆ’3, . . . , ajp+1, ajp); rj=(ajpâˆ’1, ajpâˆ’2, ajpâˆ’3, . . . , a(jâˆ’1)p); rk+1=(akp) â€ƒwherein j is an integer of 1 to k; and (anâˆ’1, anâˆ’2, anâˆ’3, . . . , a1, a0) is 2-tuple representation of A; V) letting A=qâ€² and r=râ€², when 2p+1>râ€²&gE;0; A=qâ€²âˆ’1 and r=râ€²+(2p+1), when 0>râ€²; and A=qâ€²+1 and r=râ€²âˆ’(2p+1), when 2p+1&gE;râ€²VI) outputting x=r, when i=1; y=r, when i=2; and z=r, when i=3; VII) setting i=i+1; and VIII) returning to step I), when i=4; and returning to step IV), when i<4.