Loading patent…
AssigneeMitsubishi Denki Kabushiki Kaisha
InventorArnaud Gueguen
Estimating the term…
Method and device for optimising, under performance constraint, the size of blocks of coded data Method of optimising the size of blocks of coded data intended to be subjected to iterative decoding, a maximum error rate at the output of the iterative decoding being fixed in advance, in which there are sought, amongst a plurality of block sizes (N/k) which are submultiples of the normal block size by an integer factor (k) greater than or equal to 1 and a plurality of integers giving the maximum number of iterations (niteration(k)) which can be effected by the said iterative decoding on a block, a submultiple size and a maximum number of iterations such that they are compatible with the said maximum error rate and such that a mean number of iterations ({overscore (n)}iteration(k)) which would be effected by the iterative decoding on a block of submultiple size is as low as possible.
Method of optimising the size of coded data blocks intended to be subjected to iterative decoding, characterised in that, a maximum error rate at the output of the iterative decoding being fixed in advance, the method seeks, amongst a plurality of block sizes (N/k) which are submultiples of the normal block size by an integer factor (k) greater than or equal to 1 and a plurality of integers giving the maximum number of iterations (niterations(k)) which can be effected by the said iterative decoding on a block, a submultiple size and a maximum number of iterations such that they are compatible with the said maximum error rate and such that a mean number of iterations ({overscore (n)}iterations(k)) which would be effected by the iterative decoding on a submultiple sized block is as low as possible.
Optimisation method according to one of the pre ceding claims, characterised in that the search is limited to the integers which have a value higher than a predetermined value (kmin).
Optimisation method according to one of the preceding claims , characterised in that, prior to the search, it determines the maximum number of iterations (niterations(l)) for a block of normal size, compatible with a predetermined maximum decoding time, and in that the search amongst said plurality of submultiple block sizes (N/k) and said plurality of integers is limited to the values such that the mean number of iterations ({overscore (n)}iterations(k)) which would be effected by the iterative decoding on a block of submultiple size is less than said maximum number of iterations (niterations(l)).
Method for the iterative decoding of coded data blocks, the blocks having an initial size, characterised in that an optimum block size and a maximum number of iterations associated with this size are determined by means of the optimisation method according to one of the preceding claims and in that, the data of a block of initial size having been coded as a sequence of sub-blocks of optimum size, the sub-blocks are decoded, one by one, by a succession of iterations of the iterative decoding, the iterations being stopped for a sub-block if a predetermined reliability criterion is satisfied or if the number of iterations attains the said maximum number of iterations associated with the said optimum size.
Method for the iterative decoding of coded data blocks, the blocks having an initial size, characterised in that an optimum block size and a maximum number of iterations associated with this size are determined by means of the optimisation method according to one of the preceding claims and in that, the data of a block of initial size having been coded as a sequence of sub-blocks of optimum size, the sub-blocks are decoded by successively effecting, on each sub-block, an iteration of the iterative decoding, an iteration not being effected for a sub-block if a predetermined reliability criterion is satisfied or if the number of iterations reaches the maximum number of iterations associated with the said optimum size.
Dependencies are inferred from the claim text.