Unlock instant, AI-driven research and patent intelligence for your innovation.

General decoding method for conventional binary and double-binary Turbo code

A dual-binary and binary technology, applied in the field of decoding schemes, can solve the problem that recursive structure modules cannot be shared, and achieve the effect of reducing the delay of decoding and simplifying the decoding algorithm.

Inactive Publication Date: 2011-07-20
ZHEJIANG UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Depend on figure 1 and 2 It can be seen that the most basic recursive structure modules of traditional binary Turbo code and duobinary Turbo code cannot be shared

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
  • General decoding method for conventional binary and double-binary Turbo code
  • General decoding method for conventional binary and double-binary Turbo code
  • General decoding method for conventional binary and double-binary Turbo code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0094] The universal Turbo code decoding method proposed by the present invention adopts the enhanced Max-log-MAP algorithm, and the traditional Turbo code decoding adopts two-step forward and backward recursive calculations combined into a single-step forward and backward recursive calculation , which is to combine the two-step state transition in the trellis diagram of the traditional Turbo code into a one-step state transition, so that the traditional Turbo code and the duobinary Turbo code have the same trellis diagram structure, so that the duobinary and traditional binary Turbo codes can be decoded simultaneously . An 8-state traditional turbo code encoder trellis diagram as shown in image 3 As shown, the traditional Turbo code encoder trellis after trellis merging is shown as Figure 4 shown.

[0095] In the present invention, the structure of the general-purpose configurable Turbo code decoding device is as follows: Figure 5 As shown, it consists of input data buffe...

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 relates to a general decoding method applied to traditional binary Turbo codes and duobinary Turbo codes. At present, no Turbo code decoding device can decode traditional binary Turbo codes as well as duobinary Turbo codes. The general decoding method for Turbo codes provided by the invention adopts enhanced Max-Log-MAP algorithm, makes use of Max-Sum semiring property in the generalized distribution law and combines and simplifies measure and calculation of forward and backward status of traditional binary Turbo codes, which means combining grid graph of traditional binary Turbo codes in nature to ensure that the status measure and calculation of the traditional binary Turbo codes have the same calculation expression way with that of the duobinary Turbo codes so that a general decoding device can both decode the traditional binary Turbo codes and duobinary Turbo codes. The method of the invention gives full consideration to the four indexes, namely, good generality, decoding performance, decoding complexity and resource occupation.

Description

technical field [0001] The present invention relates to a decoding scheme used in the field of communication technology, in particular to a general decoding method applied to traditional binary Turbo codes and duo-binary Turbo codes. Background technique [0002] Shannon, the founder of modern digital communication, pointed out in the channel coding theorem as early as 1948 that as long as the code length of the random code is large enough, it is possible to carry out communication infinitely approaching the channel capacity C and make the error probability arbitrarily small. But Shannon only theoretically proved the existence of the coding limit, but did not construct a coding and decoding structure to approach this limit. Since Shannon, many codes with excellent performance have appeared one after another, such as BCH codes, RS codes and convolutional codes, etc., all of which can achieve good performance, but there are still many gaps with the performance limit proposed b...

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 Patents(China)
IPC IPC(8): H04L1/00H03M13/29
Inventor 谢磊高明陈惠芳刘亚朱益
Owner ZHEJIANG UNIV