| 摘要 |
The method involves considering a matrix S having r rows and m columns, filled row by row by the successive numbers from 0 to r to m-1, Each column in the matrix S is divided into a predetermined number lambda of sub- columns, such that r/ lambda is not prime. The sub-columns of S equal in number to lambda .m are designated by S lambda 1 less than lambda 2 greater with 0 less than or equal to lambda 1 less than or equal to lambda -1 and 0 less than or equal to lambda 2 less than or equal to m-1 where lambda 2 refers to the column of S where S lambda 1 less than lambda 2 greater than appears and lambda 1 refers to the position of the sub-column S lambda 1 less than lambda 2 greater than in the column of index lambda 2. Each sub-column S lambda 1 less than lambda 2 greater than is then written in the form of a matrix with R rows and M columns (with r/ lambda = RM) and in this form it is interleaved by an interleaver of the so-called wheel type defined by a circular permutation of each column of said matrix with R rows and M columns, the interleaver not being identity. This matrix with R rows and M columns is reconverted, after the circular permutations on its columns, into a sub-column S asterisk lambda 1 which will occupy, in a matrix S asterisk , the same position as that occupied by S lambda 1 in the matrix S. The permutation table consists of pairs each formed by an element of the matrix S and the element with the same position in the matrix S asterisk . An Independent claim is included for a coding method, a decoding method, a turbodecoding method, coding device, a turbo decoding device, a turbodecoding device, a device for processing signals, a data transmission device, and a network station.
|
