A coding method of convolution code

A convolutional code and decoding technology, applied in the field of decoding, can solve problems such as SLVA occupation and large storage space

Active Publication Date: 2007-05-23
HUAWEI TECH CO LTD
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The technical problem to be solved by the present invention is to provide a convolutional code decoding method to solve the problem of excessive storage space occupied by SLVA 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
  • A coding method of convolution code
  • A coding method of convolution code
  • A coding method of convolution code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0096] The method flowchart of the present embodiment shown in Fig. 5, as shown in the figure, includes the following steps:

[0097] Step S501: Initialize path number l=1, time j=1, total number of paths to be searched L, code block length M.

[0098] Step S502: According to VA, obtain the global optimal path, obtain decoding data, and store the path metric BM of the global optimal path and the value of the path register.

[0099] Step S503: Error checking.

[0100] Error checking is performed on the acquired decoded data, and the error checking method adopted is different according to the error checking encoding method adopted during signal encoding.

[0101] Step S504: If the error check in step S503 is correct, then execute step S513; otherwise, further determine whether the current path number is less than the preset total number of paths L to be searched, if not less than L, then execute step S513, if less than L , execute step S505.

[0102] Step S505: l=l+1.

[010...

Embodiment 2

[0126] In embodiment 1, when searching for the global 1st optimal path, a pre-storage mechanism is adopted. Although the pre-storage can reduce the number of backtracking searches for the global (1+1) optimal path, it is convenient to search for the subsequent global optimal path, but Correspondingly, the amount of data calculation for finding the current lth optimal path is increased. In particular, if the decoding error check result corresponding to the currently searched global lth path is correct, it is no longer necessary to continue to search for the subsequent global optimal path , the data pre-storage mechanism not only fails to work, but increases the decoding time.

[0127]For this reason, this embodiment proposes another convolutional code decoding method. As shown in FIG. 6, it is a schematic flow diagram of the method of this embodiment. As shown in the figure, this method includes the following steps:

[0128] Step S601: Initialize path number l=1, time j=1, tota...

Embodiment 3

[0154] As shown in Figure 7, it is a schematic flow chart of the method of this embodiment. As shown in the figure, the method includes the following steps:

[0155] Step S701: Initialize path number l=1, time j=1, total number of paths to be searched L, code block length M.

[0156] Step S702: According to VA, obtain the global optimal path, obtain the decoded data, and store the accumulated metrics at each moment on the global optimal path, as well as the states of all each moment and each state point in the trellis graph.

[0157] Step S703: Error checking.

[0158] Step S704: If the verification result is correct or the path number is greater than L, execute step S713, otherwise execute step S705.

[0159] Step S705: l=l+1.

[0160] Step S706: Determine that the range of time j is greater than time ts and less than time te, where ts represents the minimum value at time, te represents the maximum value at time, and initialize time j.

[0161] Step S707: Update time j.

...

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 convolutional code decode method, which comprises: based on Viterbi algorithm, obtaining globe optimized path, obtaining decode data; checking the decode data; if the code is right, outing code, ending; or else, searching for other globe optimized paths and decode data, as based on known globe optimized paths, separating from selected path at each time of each globe optimized path, searching for local sub-optimized path, obtaining the difference between relative globe optimized path and optimized path, obtaining one globe optimized path, obtaining relative decode data; checking the decode data, if the check is wrong, searching for other globe optimized paths.

Description

technical field [0001] The invention relates to the field of decoding methods, in particular to a convolutional code decoding method in the communication field. Background technique [0002] Convolutional codes are widely used in communication systems because of their simple encoders, high coding gain, and strong ability to correct random errors. A maximum-likelihood Viterbi algorithm (Viterbi Algorithms, referred to as VA) based on a code-based trellis graph is the best-performing convolutional code decoding method in an additive Gaussian white noise channel. High, fast, simple decoding features, so it is widely used in various communication systems. [0003] Nambirajian Seshadri and Carl-Erik W. Sundberg in IEEE Communications Transactions, 1994, February, March, April, Vol. 42, pp. 313-323, entitled "List Viterbi Decoding Algorithms and Applications "Literature (Nambirajan Seshadri and Carl-Erik W. Sundberg, List Viterbi Decoding Algorithms with Applications, IEEE Trans...

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/23H03M13/41
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

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