Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Dynamic iterative decoding method of Turbo codes and device thereof

An iterative decoding and dynamic technology, applied in the field of dynamic iterative decoding of Turbo codes, can solve problems such as increased power consumption and complex decoding methods, and achieve the effects of simple implementation, guaranteed decoding performance, and shortened decoding time

Inactive Publication Date: 2009-10-14
ST ERICSSON SEMICON BEIJING
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] Turbo coding is a channel coding method whose performance is close to the Shannon limit, but its decoding method is more complicated, and iterative decoding is used.
When performing iterative decoding, as the number of iterations increases, the time required for decoding processing also increases, and the power consumption for processing decoding also increases

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
  • Dynamic iterative decoding method of Turbo codes and device thereof
  • Dynamic iterative decoding method of Turbo codes and device thereof
  • Dynamic iterative decoding method of Turbo codes and device thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] Embodiment one is after each complete iterative decoding (two and a half iterations) of the Turbo decoder, a hard decision is made to the iterative decoding result to judge whether the current hard decision result is similar to the last hard decision result, and Recording the number of similarities; when the number of similarities reaches a preset threshold, stop the iterative decoding of the Turbo decoder.

[0047] refer to figure 1 The device for dynamic iterative decoding of Turbo codes according to Embodiment 1 of the present invention mainly includes a Turbo decoder 10 , a hard decision unit 11 , a similarity judgment unit 12 and an iteration control unit 13 .

[0048] The turbo decoder 10 is configured to iteratively decode the data to be decoded. The turbo decoder 10 includes two half-time iterative decoding units, and each half-time iterative decoding unit performs one half-time iterative decoding process. In this embodiment, the decoding result of the second ...

Embodiment 2

[0067] Embodiment 2 is to carry out hard judgment to the half-time iterative decoding result after each half-time iterative decoding of the Turbo decoder, judge whether the current hard judgment result is similar to the last hard judgment result, and record the number of similarities; When the number of similarities reaches a preset fourth threshold, the iterative decoding of the Turbo decoder is stopped.

[0068] refer to image 3 The turbo code dynamic iterative decoding device according to Embodiment 2 of the present invention mainly includes a Turbo decoder 30 , a first hard decision unit 31 , a second hard decision unit 32 , a similarity judgment unit 33 and an iteration control unit 34 .

[0069] The turbo decoder 30 is a turbo decoder for iteratively decoding the data to be decoded. Included in the Turbo decoder 30 are two half-time iterative decoding units (the first half-time iterative decoding unit and the second half-time iterative decoding unit), and each half-tim...

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

The invention provides a dynamic iterative decoding method of Turbo codes, comprising the following steps of: carrying out hard decision to iterative decoding results after a Trubo decoder carries out iterative decoding every time, judging whether the current hard decision result is similar to the previous judgment result and recording similar times; and stopping iterative decoding of the Trubo decoder when the similar times reach a preset first threshold. The dynamic iterative decoding method selects decoding iterative times in a self adaptive mode by carrying out hard decision to the decoding result of the Trubo decoder and carrying out similar judgment to the hard judgment result, thus achieving the purposes of reducing iterative times of Turbo decoding, shortening the decoding time and reducing decoding power consumption on the basis of guaranteeing decoding performance.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and in particular relates to a dynamic iterative decoding method and device of a Turbo code. Background technique [0002] Turbo coding is a channel coding method whose performance is close to Shannon's limit, but its decoding method is relatively complicated, and iterative decoding is used. When iterative decoding is performed, as the number of iterations increases, the time required for decoding processing also increases, and the power consumption for processing decoding also increases accordingly. [0003] In the prior art, a fixed number of iterative decoding is usually set for the Turbo decoder, and when the number of iterative decoding reaches the set value, the iteration is stopped to obtain the decoding result. [0004] The inventors of the present application have found in the process of implementing the present invention that after a certain number of iterative decodings...

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): H03M13/29
Inventor 郑艳利杨文学
Owner ST ERICSSON SEMICON BEIJING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products