Method and device for demodulating convolution code

A convolutional code and storage device technology, applied in the field of convolutional code demodulation, can solve the problem of low demodulation efficiency and achieve the effect of improving demodulation efficiency

Active Publication Date: 2009-12-09
HONOR DEVICE CO LTD
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The channel factors corresponding to each state are stored in a storage space in chronological order, and the surviving symbols corresponding to each state are also stored in another storage space in chronological order; the demodulation process is carried out in chronological order according to the states. After the calculation of a state is completed, the operation of the next state is continued, and the demodulation efficiency is not high

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 demodulating convolution code
  • Method and device for demodulating convolution code
  • Method and device for demodulating convolution code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0031] Embodiment one, see figure 1 Detailed description, figure 1 It is a schematic flow chart of the method in this embodiment.

[0032] Step 101: Determine at least two storage spaces that can be read in parallel in at least one storage device, group the state information parameters corresponding to each state at the current moment in units of states, and each group corresponds to at least one storage space.

[0033] The state information parameters include the state information parameters at the previous time (k-1 time) and the current time (k time), and the state information parameters include channel factors and survivor symbols. For example, the state information parameters of state 0 include the channel factor and survivor symbols at time k-1, and also include the channel factor and survivor symbols at time k.

[0034] In different modulation modes, the number of states is different. For example, in the Gaussian minimum frequency shift keying (GMSK, Gaussian-filtere...

Embodiment 2

[0044] Embodiment two, see figure 2 Detailed description, figure 2 It is a schematic flow chart of the method in this embodiment.

[0045] Step 201: Divide state information parameters into group A and group B by state.

[0046] The state information parameters of the 16 states at time k are divided into two groups, group A and group B respectively.

[0047] The 16 states are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f; then group A is the state 0, 1, 2, 3, State information parameters corresponding to 4, 5, 6, 7, and group B are state information parameters corresponding to states 8, 9, a, b, c, d, e, f. Each state corresponds to different state information parameters, that is, group A is the channel factor and surviving symbols corresponding to states 0, 1, 2, 3, 4, 5, 6, and 7, and group B is state 8, 9, a, Channel factors and survivor symbols corresponding to b, c, d, e, f.

[0048]The principle of grouping is that the state information parameters of group A and ...

Embodiment 3

[0071] Step 301: Group the state information parameters into state units.

[0072] Divide the state information parameters of the eight states at time k into two groups, group A and group B respectively.

[0073] The 8 states are 0, 1, 2, 3, 4, 5, 6, and 7 respectively; group A is the state information parameters corresponding to states 0, 1, 2, and 3 at time k, and group B is the state at time k State information parameters corresponding to 4, 5, 6, and 7.

[0074] The principle of grouping is that the state information parameters of group A and group B can be updated in parallel without causing read-write conflicts in the storage space.

[0075] Step 302: According to the state transition relationship, confirm the state corresponding to the state information parameters at the previous moment required to update Group A and Group B.

[0076] The state transition relationship from the previous moment to the current moment is as follows: Figure 7 as shown, Figure 7 It is a...

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 and a device for demodulating a convolution code. The method comprises the following steps of: at least two storage spaces capable of being read parallelly are confirmed in at least one storage device; state message parameters corresponding to each current state are grouped by taking the state as a unit, and each group corresponds to at least one storage space; the previous state message parameters needed by updating each group of the state message parameters are stored into at least two storage spaces according to a mapping relation between the previous state message parameters and the state message parameters corresponding to each current state; and each group of the current state message parameters are parallelly updated according to the previous state message parameters stored into different storage spaces respectively. The method and the device carry out grouping to the state message parameters corresponding to each state by taking the state as the unit, store the parameters needed by updating each group of the state messages into different storage spaces respectively, and then parallelly update each group of the state message parameters, thereby improving the demodulation efficiency.

Description

technical field [0001] The invention relates to a digital transmission system, in particular to a convolutional code demodulation method and a device thereof. Background technique [0002] The Viterbi (Viterbi) algorithm of convolutional codes is an algorithm for demodulating convolutional codes, which is widely used in wireless digital transmission systems. [0003] During the demodulation process, the state at each moment is obtained from the state at the previous moment after merging multiple states based on the memory depth, and the demodulator needs to store the state of all states at the current moment and the previous moment information parameter. The state information parameters include channel factors and survivor symbols: the channel factor is a set of channel state variables corresponding to each state; the survivor symbols are multiple symbols corresponding to each state, which are used for metric calculation in the Viterbi demodulation process. [0004] In the...

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/23
Inventor 余剑王发贵彭明明陈小龙
Owner HONOR DEVICE 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