Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Sequential decoding method for convolutional code with highly-constrained length

A technology of sequence decoding and length constraint, applied in the field of communication channel encoding and decoding, to achieve the effect of solving stack overflow

Inactive Publication Date: 2013-11-20
SHANDONG UNIV
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In order to overcome the defects and deficiencies in the prior art, the present invention provides a sequence decoding method for large constrained length convolutional codes, so as to achieve a simple and easy data storage method and effectively solve the problem of stack overflow

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0027] A sequence decoding method for large constrained-length convolutional codes, which is implemented by a linked list structure in C language. This linked list includes two parts: the main linked list and the path linked list. The main linked list is used to store the corresponding metrics and next steps of decoding In a state, the path decoded in this step is stored by the path linked list, and the head pointer of the path linked list is stored in each node of the main linked list as the data field part of the main linked list, so that each path is automatically associated with the corresponding measurement and state , when sorting each node of the main linked list according to the size of the metric value, the path will be followed automatically. The steps of the decoding method are as follows:

[0028] 1) Read in the first group of n-bit codewords of the sequence to be decoded, and decode the first group of codewords:

[0029] a. Compare the read-in first set of codewor...

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

A sequential decoding method for a convolutional code with highly-constrained length belongs to the technical field of communication channel encoding and decoding. According to invention, the specific realization process of the sequential decoding of the convolutional code (n, 1, m) is given and the problem of stack overflow which is liable to appear during the decoding process is solved. In fact, the sequential decoding of the convolutional code is a path search process along a code tree according to the norm of smallest measurement valve; path search is free to go forward or back out; paths in different lengths can be obtained; eventually, the path with the greatest measurement valve is taken as a decoding path. In the specific realization process, decoding paths, measurement valves and the next state needed to store in each decoding step are stored through a chain list structure in the C language, so that the programming operation is realized more easily; interval storage and deleting are performed on paths obtained by decoding, so that caches are prevented from increasing unlimitedly. Therefore, the problem of stack overflow is efficiently solved.

Description

technical field [0001] The invention relates to a sequence decoding method for a convolutional code with a large constraint length, and belongs to the technical field of communication channel coding and decoding. Background technique [0002] In the field of channel coding and decoding, convolutional codes are usually used for channel coding to improve the reliability of information transmission. The traditional decoding method is Viterbi decoding, although Viterbi decoding is an optimal decoding, but because the decoding overhead is limited, its decoding calculation will increase exponentially with the constraint length, so Only short constraint length codes can be used. [0003] The sequence decoding algorithm can just solve this problem, and its decoding workload is essentially independent of the constraint length, so a large constraint length can be used. We know that convolutional codes have three geometric representation methods, namely code tree diagram, state diagr...

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/23H04L1/00
Inventor 马丕明王彤彤杨勇
Owner SHANDONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com