Return-to-zero Turbo code starting point and depth blind identification method

A blind recognition and starting point technology, applied in coding, code conversion, coding components, etc., can solve the problem of increasing the computational complexity of the recognition work, and achieve the effect of reducing the computational complexity and improving the computational efficiency.

Active Publication Date: 2016-03-09
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF2 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Uncertainty in these parameters is a common fact

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
  • Return-to-zero Turbo code starting point and depth blind identification method
  • Return-to-zero Turbo code starting point and depth blind identification method
  • Return-to-zero Turbo code starting point and depth blind identification method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0032] Embodiment 1,

[0033] The purpose of this embodiment is to simulate the success rate of parameter blind recognition under the conditions of different interleaving depths and different bit error rates. Take 1 / 3 code rate, PCCC structure, and two-component encoder parameters as [13,15] as an example. Adjust the bit error rate under the condition of interleaving depth 200, record the recognition success rate, and get figure 2 . It can be seen that with the increase of the bit error rate, the recognition success rate gradually decreases, but the method has quite good anti-error performance on the whole. Adjust the interleaving depth under the condition of bit error rate 2.5%, record the recognition success rate, and get image 3 . It can be seen that the interleaving depth has little effect on the recognition success rate, which is the theoretical basis for this method to be suitable for large interleaving depths.

Example Embodiment

[0034] Embodiment 2,

[0035] The purpose of this embodiment is to study the recognition performance of this method under different component encoder parameters. Also taking the PCCC structure with the same code rate of 1 / 3 and the same two-component encoder as an example, 682 generator polynomials between [101,103] and [177,175] were explored. Under the conditions of interleaving depth of 200 and bit error rate of 2.5%, the recognition success rate of each coding polynomial is classified and counted, and the results are as follows Figure 4 .

[0036] It can be seen that the recognition probability of most component encoders is above 85%. In fact, due to the rule that the recognition success rate varies with the bit error rate shown in Example 1, the recognition success rate of most component encoders can achieve very ideal results on the order of 0.1% that is common in practice. In order to highlight that the recognition performance of different component encoders will be...

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 belongs to the field of Turbo code interleaving parameter blind identification, and particularly relates to a method of carrying out interleaving starting point and interleaving depth estimation on a return-to-zero Turbo code in a condition of a large interleaving depth (hundreds to thousands). According to the interleaver depth and starting point identification method based on a return-to-zero structure, a convolutional coding self return-to-zero structure existing widely in actual applications is used. Under the structure, certain structure features exist whether return-to-zero bits or an all-zero state serves as a coding sequence for a starting state. Through counting on a code word sequence, a code word structure meeting a specific structure is searched, and thus the Turbo code interleaving depth and the interleaving starting point are determined. The operation amount for the Turbo code parameter blind identification algorithm is greatly reduced, a step in which multiple nesting operation is forced to be adopted on multiple unknown parameters in the case of all-blind identification can be avoided. the identification process is separated, one-by-one parameter identification is carried out, and while the operation efficiency is improved, practical operability in identification of a large interleaving depth is also realized.

Description

technical field [0001] The invention belongs to the field of blind recognition of turbo code interleaving parameters, and in particular relates to a method for performing interleaving seven points and interleaving depth estimation method for a return-to-zero turbo code in the case of a large interleaving depth (hundreds to several thousand). Background technique [0002] According to Shannon's theorem, as long as the signaling rate is lower than the channel capacity, as the code length approaches infinity, there must be a progressive number whose error rate approaches zero. The Turbo code encoding and decoding scheme proposed in 1993, by making full use of randomness, under the condition of 65536 random interleaver, makes the 1 / 2 code rate Turbo code realize the excellent performance of only 0.7dB away from the Shannon limit. Since then, Turbo codes have been widely used in the field of wireless communication. The significance of Turbo code is to provide a concatenated codi...

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
IPC IPC(8): H03M13/29
CPCH03M13/2957
Inventor 朱胜利东阳甘露廖红舒
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
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