A Maximum Likelihood Decoding Algorithm for Tail-biting Codes

A technology of maximum likelihood decoding algorithm, applied in the field of maximum likelihood decoding algorithm of tail-biting code, which can solve the problems of high computational complexity, large memory consumption, and algorithm non-convergence, so as to achieve low complexity and simple decoding. effect achieved
CN103634015BInactive Publication Date: 2017-06-27SHANGHAI RES CENT FOR WIRELESS COMM
4 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
SHANGHAI RES CENT FOR WIRELESS COMM
Publication Date
2017-06-27
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The present invention provides a maximum likelihood decoding algorithm for tail-biting codes. The maximum likelihood decoding algorithm includes: first initializing the surviving state set, starting from the cumulative metric value of any surviving state in the surviving state set, and ending The lower bound value of the tail-biting path metric value of each surviving state and the optimal tail-biting path metric value; then perform i iterations to obtain the surviving state set of the i+1th iteration, and prepare for the i+1th iteration ; Finally, stop decoding and output the codewords associated with the optimal maximum likelihood tail-biting path. The maximum likelihood decoding algorithm of the tail-biting code described in the present invention is based on the Viterbi algorithm, which requires the least storage unit in the execution process of all known decoding algorithms, and the complexity of the decoding algorithm is low , which is simple to implement and enables the decoder to quickly converge to the global optimal result.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the channel decoding field of wireless communication, and relates to a decoding algorithm, in particular to a maximum likelihood decoding algorithm of a tail-biting code. Background technique

[0002] Convolutional codes can be divided into traditional convolutional codes and tail-biting convolutional codes (Tail-Biting Convolutional Codes, TBCC) according to the different initialization methods of their encoders. Some block codes can be represented by tail-biting trellis diagrams, so such block codes and tail-biting convolutional codes are called tail-biting codes. The encoder of the traditional convolutional code is initialized with known bits (usually all 0 bits) and ends in a known state at the end of encoding; the encoder of TBCC is initialized with the last v' bit of the information sequence , where v'≤v, v is the length of the register in the encoder. According to the relationship between v' and v, TBCC can be divided ...

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