Iterative large-number logical decoding method of complex rotary code
What is AI technical title?
AI technical title is built by PatSnap AI team. It summarizes the technical point description of the patent document.
A complex number rotation and large number logic technology, which is applied in the field of complex rotation code decoding, can solve problems such as insufficient performance
Inactive Publication Date: 2006-08-09
SOUTHWEST JIAOTONG UNIV
View PDF0 Cites 1 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
However, due to the coding uniformity of regular low-density parity-check codes, the message nodes of the information element and the message nodes of the supervisory element are set to the same large-number logic discrimination threshold, so that it can be used in high code rate and short-to-medium frame length. Insufficient performance in the application
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0059] Embodiment 1: (3,4) complex rotation codes using iterative large number logic decoding algorithm
[0060] This embodiment introduces a simple and complete encoding p=3, t=4 case (t=p+1) for complex rotational codes.
[0061] Before describing the decoding method of this embodiment, a brief introduction of how to use the existing encoding method to encode the complex rotation code of this example:
[0062] In this example, p=3, t=4, and the code rate is 0.4286. Then the information elements a, b, c, d, e, f, g, h, i are grouped according to 3×3=9 to form an M3 information element grouping, and then the 3× 4=12 supervising elements A, B, C, D, E, F, G, H, I, L, M, N are attached to the back, form the supervising element grouping of N34, constitute the coding of 21 symbols by being group. See formula (7) for the specific coding method
[0063] M 3 ...
Embodiment 2
[0099] Embodiment 2: (47,13) complex rotation codes using iterative large number logic decoding algorithm
[0100]In this embodiment, an application of an incompletely coded (47, 13) complex rotation code with a longer packet and a higher code rate is introduced.
[0101] Before describing the decoding method of this embodiment, a brief introduction of how to use the existing encoding method to encode the complex rotation code of this example:
[0102] The encoding method based on the complex rotation code, in this example, p=47, t=13, and the code rate is 0.7833. Then the information elements are grouped by 47×47=2209 to obtain a square matrix of information elements of M47, and then according to the encoding method of the complex rotation code, a supervisory element matrix N47 13 of 47×13=611 is compiled and attached to the back. An encoded packet of 2820 symbols is formed.
[0103] According to the encoding method of the complex rotation code, the supervisory element matr...
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
Login to View More
Abstract
At decoding end of communication, performance of complex rotation code can be raised greatly by following measures: using the disclosed method instead of primitive one-step great number logic decoding algorithm of complex rotation code; decoding is carried out by using information element and monitoring element in complex rotation code to setup different values of decision threshold of great number logic in iterative great number decoding. Advantages are: fast decoding convergence rate, small decoding time delay, and low complexity of hardware realization. Possessing excellent performance and low complexity of realization, the invention is applicable to application, where data transmission is in high code rate of short frame and middle frame.
Description
Technical field [0001] The invention relates to error control technology in digital communication, in particular to a complex rotation code decoding method for digital communication error control. Background technique [0002] The requirements of modern society for communication systems are extremely high speed, large bandwidth, high reliability and low complexity. In optical fiber communication and data exchange systems in computers, the binary data transmission rate is already GB / s (10 9 Bits per second) order of magnitude counting, the requirement for bit error rate has reached 10 -9 In turn, this requires robust hard-decision-based coding techniques that employ high code rates (greater than 0.7) and implement simple error-correcting coding techniques. [0003] 1963 R.G. Gallager's doctoral thesis "Low density parity check codes", Massachusetts Institute of Technology Press, 1963 ("Low density parity check codes", Cambridge, MA: MIT Press, 1963 ): A regular low-density...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.