TPC high-speed decoding method

A decoding and high-speed technology, applied in the field of digital communication, can solve the problem that TPC code has not been widely used, and achieve the effect of improving TPC decoding rate and minimizing computing and storage resources

Active Publication Date: 2018-02-09
CHENGDU FOURIER ELECTRONICS TECH +1
View PDF4 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] The TPC code was proposed by Elias in 1954. At first, due to limited hardware resources, the TPC code was not widely used.

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
  • TPC high-speed decoding method
  • TPC high-speed decoding method
  • TPC high-speed decoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] See attached figure 1 , figure 2 , image 3 , Figure 4 , Figure 5 and Image 6 Shown is a further description of the invention.

[0033] The present invention relates to a TPC high-speed decoding method, which avoids processing unnecessary bits by adding fixed judgments, and is characterized in that the steps are as follows:

[0034] Step 1): Define R0 as a codeword array,

[0035] Initialize R=R0, W=0,

[0036] Iterate by row / column

[0037] R=R+W / 2

[0038] For the kth row / column

[0039] Perform symbol judgment on R(k) to obtain C(k);

[0040] Step 2): Update W(k) to the BPSK form of C(k),

[0041] Find p least reliable bits, and generate 2^p test patterns, corresponding to 2^p test branches,

[0042] For test branch i, follow the steps below:

[0043] Step ① Calculate the corresponding test sequence, the syndrome S(i) and the check value P(i), if S(i) is not 0, the position of the error bit is obtained by looking up the table and the error is corrected, and P(i) ), if P(i) is ...

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 TPC high-speed decoding method. The number of operations and intermediate variables can be minimized by only processing the active bits are processed between twice iteration, thereby minimizing the computation and storage resources, and greatly improving the TPC decoding rate.

Description

Technical field [0001] The present invention relates to the field of digital communication technology, in particular to a TPC high-speed decoding method. Background technique [0002] The TPC code was proposed by Elias in 1954. At the beginning, limited by hardware resources, the TPC code was not widely used. Until Pyndiah improved the SISO decoding algorithm of TPC codes based on the Chase algorithm, the research and application of TPC codes had relatively great progress. Although SISO is not the optimal decoding algorithm, it can still achieve near-optimal performance under low error rate. Currently, TPC codes are widely used in various communication standards, such as IEEE 802.16. [0003] The minimum Hamming distance of the TPC code is equal to the product of the minimum Hamming distance of the component code, and has nothing to do with the block size. Assuming that the complexity of the component code is fixed, the more the number of component codes, the better the performa...

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/29H04L1/00
CPCH03M13/2915H04L1/005
Inventor 史伟仁
Owner CHENGDU FOURIER ELECTRONICS TECH
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