Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for quickly converting generation matrix

A matrix-generating, fast technology, applied in the direction of code conversion, error detection coding and coding using multiple parity bits, can solve problems such as trouble, and achieve the effect of reducing complexity

Inactive Publication Date: 2018-02-02
NANJING HEYANGTEK CO LTD
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The whole process includes complex calculations such as matrix inversion, which is very troublesome

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 for quickly converting generation matrix
  • Method for quickly converting generation matrix
  • Method for quickly converting generation matrix

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0020]

[0021] The number of non-zero numbers in the above formula represents the number of cyclic right shifts of the identity matrix. This matrix is ​​not a full-rank matrix. If you use the traditional method, you must first find out the redundant rows 14 and 21 of the matrix, delete these two rows, and obtain a full-rank matrix, then find the inverse matrix of the matrix, and then obtain the generator matrix.

[0022] If the method described in this paper is used, there is no need to obtain the generator matrix by inverting the matrix. The process of this method is as follows: assuming that the parity check matrix has M rows and N columns (N>M), the parity check matrix is ​​changed into the format of [IP], which is divided into two steps.

[0023] Such as figure 1 As shown, in the first step, the sub-matrix of the parity check matrix (M rows and M columns on the left) is transformed into an upper triangular matrix. Starting from the first element of the diagonal of th...

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 for quickly converting a generation matrix. The method comprises the following steps: constructing a check matrix having M rows and N columns, converting the check matrix into an [IP] format, and calculating to obtain the generation matrix. From the conversion efficiency of the matrix, no inverse matrix is found in the method, thereby greatly reducing the complexity of computation, and thus the conversion from the check matrix to the generation matrix can be achieved quickly.

Description

technical field [0001] The invention belongs to the field of integrated circuit design, and specifically relates to a method for quickly transforming and generating a matrix. Background technique [0002] In practical applications, the LDPC code first constructs a parity check matrix, and then calculates a generator matrix based on the parity check matrix for encoding. Most of the constructed parity check matrices are not rank-satisfactory matrices and contain redundant rows, so the inverse matrix cannot be directly calculated. The traditional method must first remove the redundant rows of the parity check matrix, then calculate the inverse matrix of the matrix, and finally transpose the inverse matrix to obtain the generator matrix. The whole process includes complex calculations such as matrix inversion, which is very troublesome. Contents of the invention [0003] The purpose of the present invention is to overcome above-mentioned deficiencies in the prior art, is to ...

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/11
CPCH03M13/116
Inventor 徐光明后嘉伟
Owner NANJING HEYANGTEK CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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