Method and device for decoding tail-biting convolutional codes

A technology of tail-biting convolutional code and decoding device, which is applied in the direction of using convolutional code error correction/error detection, data representation error detection/correction, etc., can solve problems such as high bit error rate and reduce decoding errors. rate effect

Active Publication Date: 2011-02-09
SANECHIPS TECH CO LTD
View PDF0 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a decoding method and device for a tail-biting convolutional code, w

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 and device for decoding tail-biting convolutional codes
  • Method and device for decoding tail-biting convolutional codes
  • Method and device for decoding tail-biting convolutional codes

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0034] figure 1 It is a flow chart of the decoding method of the tail-biting convolutional code according to the first embodiment of the present invention. Such as figure 1 As shown, the decoding method of the tail-biting convolutional code according to the first embodiment of the present invention includes:

[0035] Step S102, start retroactive decoding from the state point corresponding to the maximum value of the cumulative metric of the sequence to be decoded, obtain the first decoding result, and judge whether the initial state and the final state of the first decoding result are the same; from the maximum value of the cumulative metric The decoding result obtained from the corresponding state (maxSts) is the first decoding result, and the value corresponding to the last N-1 bits in the first decoding result is the final state;

[0036] Step S104, if they are not the same, start backtracking from the initial state point of the first decoding result to obtain the second ...

no. 2 example

[0053] figure 2 is a block diagram of a decoding apparatus for a tail-biting convolutional code according to a second embodiment of the present invention.

[0054] Such as figure 2 As shown, the decoding device of the tail-biting convolutional code according to the second embodiment of the present invention includes: a backtracking module 202, which is used to backtrack from the maximum cumulative metric state of the sequence to be decoded along the direction of the maximum metric to obtain the first decoding Code result, and be used for backtracking from the initial state of the sequence to be decoded along the direction with the largest metric, to obtain the second decoding result; judging module 204, used to judge whether the initial state and the final state of the first decoding result are the same; compare The module 206 is used to compare the number of inconsistent bits in the first decoding result and the second decoding result with a predetermined threshold; the de...

no. 3 example

[0064] In this embodiment, a decoding method of a tail-biting convolutional code according to the third embodiment of the present invention will be described in detail by taking the decoding process of an LTE tail-biting convolutional code as an example.

[0065] image 3 It is a flowchart of a decoding method of a tail-biting convolutional code according to the third embodiment of the present invention. Such as image 3 As shown, the decoding method of the tail-biting convolutional code according to the third embodiment of the present invention includes:

[0066] Step 302, calculate the surviving path; the principle of calculating the surviving path is as follows Figure 4 As shown, first calculate the 4 newly added cumulative metrics corresponding to the 4 paths of K=0 from T=0 (that is, from t0 to t1), and then calculate the 4 cumulative metrics, and then select two paths to the S2k state point The path with the larger cumulative metric in the S2k+1 state point is select...

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 discloses a method for decoding tail-biting convolutional codes, which comprises the following steps: carrying out backtracking decoding from a state point corresponding to the maximum cumulative metric of a code sequence to be decoded so as to obtain a first decoding result, and judging whether the initial state and final state of the first decoding result are same; if not, carrying out backtracking decoding from the initial state point of the first decoding result so as to obtain a second decoding result, and comparing the inconsistent bit quantity in the first decoding resultand the second decoding result with a preset threshold; and outputting a decoding result according to the comparison result. The method and the device of the invention solve the technical problem of large bit error rate caused by weak channel environment, thereby achieving the purpose of reducing the bit error rate of decoding.

Description

technical field [0001] The present invention relates to the communication field, in particular, to a decoding method and device for a tail-biting convolutional code. Background technique [0002] Convolutional code is a relatively common channel coding technology, which is widely used in digital video broadcasting, digital audio broadcasting, satellite communication, wireless local area network, ultra-wideband, GSM, 3G, Long Term Evolution (LTE) and other technical fields. [0003] Tail-biting convolutional codes set the initial state of the shift register in the encoder to the last few bits of the information bit stream to be encoded before performing convolutional encoding, that is, the initial state before the encoding starts and the final state after the end of the encoding is The same, among them, the size of "several" here is related to the constraint length of tail-biting convolutional encoding, for example, the constraint length is N, then the number of shift registe...

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/23
Inventor 王俊
Owner SANECHIPS 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

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