Check patentability & draft patents in minutes with Patsnap Eureka AI!

Turbo code decoding method and device

A decoding device and decoding technology are applied in the field of turbo code decoding methods and devices, which can solve the problems of prolonging the preparation time for decoding and occupying resources, etc.

Active Publication Date: 2014-07-09
HONOR DEVICE CO LTD
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Solve the problem of too long decoding preparation delay caused by calculating the forward metric value of the i-th window data after training the i-th window data, and separately store the branch metric value, forward metric value and backward metric value of the data in the three data windows The problem of occupying a large amount of resources caused by the value The embodiment of the present invention provides a Turbo code decoding method and device

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
  • Turbo code decoding method and device
  • Turbo code decoding method and device
  • Turbo code decoding method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0081] Please refer to figure 2 , which shows a method flowchart of the Turbo code decoding method provided in Embodiment 1 of the present invention, the Turbo code decoding method includes:

[0082] Step 202: Obtain the data block to be decoded, divide the data block into n sub-data blocks, and divide each sub-data block into j data windows;

[0083]Step 204: When decoding the i-th window data of sub-data block m, obtain the first backward metric value of the last bit in the i+1-th window data, according to the first backward metric value of the last bit in the i+1-th window data The backward metric value trains the i-th window data, obtains the second backward metric value of the last bit in the i-th window data, and obtains the first branch metric value of each bit in the i-th window data, and, the previous bit of the corresponding bit The forward metric value of the bit is calculated according to the first branch metric value of each bit in the obtained i-th window data,...

Embodiment 2

[0089] Please refer to image 3 , which shows the method flowchart of the Turbo code decoding method provided in Embodiment 2 of the present invention, the Turbo code decoding method includes:

[0090] Step 302: Obtain the data block to be decoded, divide the data block into n sub-data blocks, and divide each sub-data block into j data windows;

[0091] Please refer to Figure 4 , which shows a schematic flow chart of Turbo code decoding. The decoder divides the obtained data block into n sub-data blocks, so that n processors can simultaneously decode the n sub-data blocks in parallel, so as to improve decoding efficiency.

[0092] Further, the decoder uses a sliding window method to decode each sub-data block. Specifically, a window length L can be set in advance, then the first window data is [0, L-1] bit data of the sub-data block, and the second window data is [L, 2L-1] of the sub-data block bit data, and so on, window division is performed on the data of the sub-data ...

Embodiment 3

[0138] Please refer to Figure 5 , which shows a structural block diagram of a Turbo code decoding device provided in Embodiment 3 of the present invention, the Turbo code decoding device includes:

[0139] A division module 510, configured to obtain a data block to be decoded, and divide the data block into n sub-data blocks, and each sub-data block is divided into j data windows;

[0140] The forward calculation module 520 is configured to obtain the first backward metric value of the last bit in the i+1th window data when decoding the i-th window data of the sub-data block m, according to the i+1th window data The first backward metric value of the last bit trains the i-th window data, obtains the second backward metric value of the last bit in the i-th window data, and obtains the first branch metric value of each bit in the i-th window data, and, According to the forward metric value of the previous bit of the corresponding bit, according to the first branch metric value...

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 Turbo code decoding method and device, and belongs to the communication field. The method includes obtaining a data block to be decoded, dividing the data block into n sub data blocks, and dividing each sub data block into j data windows; when the i-th window data of the sub data block m are decoded, training the i-th window data according to a first backward metric value, obtaining a second backward metric value of a last bit, and according to a first branch metric value of each bit and a forward metric value of a preceding bit corresponding to the bit, conducting forward calculation of the forward metric value of the corresponding bit; conducting reverse calculation of a second backward metric value of a current bit according to a second branch metric value of the current bit and a second backward metric value of a next bit; and decoding the current bit according to the second branch metric value, the second backward metric value and the second forward metric value of the current bit, wherein m, j, n and i are natural numbers, m<n and i <j-1. According to the invention, the effects of reducing decoding preparation delay and saving resources are achieved.

Description

technical field [0001] The invention relates to the communication field, in particular to a turbo code decoding method and device. Background technique [0002] The Turbo code concatenates two component codes in parallel through a pseudo-random interleaver to construct a long code with pseudo-random characteristics, and performs a process between two SISO (Soft-Input Soft-Output, soft-input soft-output) decoders. Pseudo-random decoding is achieved through multiple iterations. The current mainstream decoding method adopts sub-block parallel decoding, and adopts the method of sliding window processing inside the sub-block to improve the decoding throughput. Specifically, the soft APP value of the Turbo code can be calculated, and hard decision and deinterleaving can be performed on the soft value to obtain the decoding output. When calculating the soft value, first calculate the branch metric value γ according to the demodulated LLR (Loglikelihood Ratio) and the preset exter...

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/27H03M13/29
Inventor 李璐刘聪
Owner HONOR DEVICE CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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