Turbo parallel decoding method, device and system

A decoding device and decoding system technology, applied in the direction of error correction/error detection by combining multiple code structures, can solve the problems of large decoding delay and high equipment cost, save equipment cost and improve decoding performance Effect

Inactive Publication Date: 2010-02-17
HUAWEI TECH CO LTD
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The first aspect of the embodiment of the present invention provides a turbo parallel decoding method to solve the defects of large decoding delay and high equipment cost in the prior art
[0011] The second aspect of the embodiment of the present invention provides a turbo parallel decoding device to solve the defects of large decoding delay and high equipment cost in the prior art
[0012] The third aspect of the embodiment of the present invention provides a turbo parallel decoding system to solve the defects of large decoding delay and high equipment cost in the prior art

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
  • Turbo parallel decoding method, device and system
  • Turbo parallel decoding method, device and system
  • Turbo parallel decoding method, device and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] Such as figure 2 As shown, it is a flow chart of Embodiment 1 of the Turbo parallel decoding method provided by the embodiment of the present invention. This embodiment specifically includes:

[0052] Step 101, when the current number of iterations i≠0, use the preset value as the forward recursive initial coefficient of the first parallel processing window head symbol, and use the N-1th parallel processing window tail symbol at the i-1th The forward recursive coefficient after round iteration is used as the forward recursive initial coefficient of the first symbol of the Nth parallel processing window, and the forward recursive initial coefficient of each parallel processing window is recursively calculated according to the forward recursive initial coefficient of each first symbol of each parallel processing window. to the recursion coefficient;

[0053] The preset value is used as the reverse recursive initial coefficient of the Pth parallel processing window tail ...

Embodiment 2

[0056] Such as Figure 4 As shown, the flowchart of Embodiment 2 of the Turbo parallel decoding method provided by the embodiment of the present invention, this embodiment specifically includes:

[0057] Step 201, setting the current number of iterations i=0, the maximum number of iterations is i=I max , use the first group of P units to save the forward recursive initial coefficients of each parallel processing window head symbol, and use the second group of P units to save the reverse recursive initial coefficients of each parallel processing window tail symbol, the 2P units set the initial value;

[0058] The maximum number of iterations i=I of the present embodiment max , according to the empirical value of Turbo decoding, it is generally set to i=6-10 times;

[0059] Among them, the initial value set for 2P units can be set to a value based on experience; it can also be cleared uniformly for the convenience of calculation;

[0060] Step 203, when i=0, for the first ro...

Embodiment 3

[0079] Such as Figure 6 As shown, the flowchart of Embodiment 3 of the Turbo parallel decoding method provided by the embodiment of the present invention, this embodiment specifically includes:

[0080] Step 301, when the current number of iterations i≠0, use the preset value as the forward recursive initial coefficient of the first parallel processing window head symbol, and use the N-1th parallel processing window tail symbol at i=0 The forward recursive coefficient after one round of iteration is used as the forward recursive initial coefficient of the first symbol of the Nth parallel processing window, and each parallel processing window is recursively calculated according to the forward recursive initial coefficient of each first symbol of each parallel processing window. The forward recursive coefficient of each symbol; the preset value is used as the reverse recursive initial coefficient of the Pth parallel processing window tail symbol, and the reverse recursive coeff...

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 embodiment of the invention discloses a Turbo parallel decoding method, a device and a system. The method comprises the following steps that: when the current iterative number i is not equal to 0and forward recursion initial coefficients of initial symbols of No. 2 to No. N parallel processing windows are refreshed to iterative codes of the previous round, the forward recursion coefficients of the last symbols of backward neighbor windows of the windows calculate the forward recursion coefficients of each symbol of the windows according to the forward recursion initial coefficients; whenbackward recursion initial coefficients of the last symbols of No. 1 to No. P-1 parallel processing windows are refreshed to iteration of the previous round, the backward recursion coefficients of theinitial symbols of forward neighbor windows of the windows calculate the backward recursion coefficients of each symbol of the windows according to the backward recursion coefficients; and P paralleldecoders are adopted to carry out parallel decoding of the forward recursion coefficients and backward recursion coefficients of P parallel processing windows. The embodiment of the invention can reduce decoding delay and buffer units required by parallel decoding so as to improve decoding performance.

Description

technical field [0001] The invention relates to the field of mobile communication, in particular to a turbo parallel decoding method, device and system. Background technique [0002] With the rapid development of wireless communication technology, wireless communication systems, such as the third generation partnership project (3 rd The Long Term Evolution (LTE) system of the Generation Partnership Project (3GPP for short) requires a decoder to have higher and higher throughput and shorter and shorter delay. This means that the receiving peer needs to complete demodulation and decoding of more data in a short period of time. Due to the inevitable decoding delay in the decoding process, in order to solve the problem of long decoding delay, the LTE system uses a Quadratic Permutation Polynomial (QPP) interleaver as the inner interleaver of the Turbo code. . The QPP interleaver enables the decoder to divide a piece of data with a length of K bits (bit) into P segments, and ...

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 HUAWEI TECH CO LTD
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