Method for optimizing code data-block size under performance constraint condition

A technology for encoding data and optimization, applied in the direction of encoding, encoding components, electrical components, etc., can solve problems such as consumption and performance without deteriorating

Inactive Publication Date: 2002-10-23
MITSUBISHI ELECTRIC CORP
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0017] The problem to be solved by the present invention is to determine the block size N that allows lower resource consumption than the prior art level without deteriorating performance.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for optimizing code data-block size under performance constraint condition
  • Method for optimizing code data-block size under performance constraint condition
  • Method for optimizing code data-block size under performance constraint condition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] The general concept based on the invention exploits the fact that in an iterative decoder, for a predetermined number of iterations n iterations , which will be referred to as the set number, the data block can be decoded in its entirety before the final iteration of the plan. For example, if the iteration halting criterion is complete (zero BET, that is, there are no errors at all in the block), then the average number of iterations n iterations Often less than the set number, as in the Figure 4 Seen on This figure shows that for different n iterations , n iterations According to the change of signal-to-noise ratio. It can be seen that for a given number n iterations , the average number of iterations does not reach this value, which is especially the case when the signal-to-noise ratio is high. Naturally, in practice, there is no perfect stopping criterion: such as passing the CRC test to the absence of errors, and stopping the iteration once the CRC no longer ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A method of optimizing the size of blocks of coded data intended to be subjected to an iterative decoding process, a maximum error rate of the iterative decoding process being fixed in advance, in which there are sought, among 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 that can be effected by the said iterative decoding on a block, (1) a submultiple size, and (2) a maximum number of iterations such that they are compatible with the maximum error rate, and such that the mean number of iterations that will be applied by the iterative decoding process on a block of submultiple size is minimized.

Description

field of invention [0001] The invention relates to a method of optimizing the size of a coded data block to be iteratively decoded, such as a method implemented in a turbodecoder or a turboequaliser. The method is particularly applicable to so-called third generation telecommunication systems. background of the invention [0002] The concept of a fast code (turbocode) was developed by C.Berrou, A.Glavieux and P.Thitimajshima in their paper "Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-codes (close to Shannon's limit error correction coding and decoding: Quick Code)", ICC-1993, Conference Proceedings, pp. 1064-1070, which has received many developments as is known. [0003] We recall that quick codes result from the concatenation of elementary codes separated by an interleaving step. These elementary codes can be of different types: recursive systematic codes (denoted RSC) for convolutional fast codes or block codes (RS, BCH) for...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F11/10H03M13/29H03M13/39H04L1/00
CPCH03M13/2975H03M13/39H03M13/6508
Inventor A·古伊古恩
Owner MITSUBISHI ELECTRIC CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap