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

Encoding method, decoding method, encoding device and decoding device of structured LDPC codes

A technology of LDPC code and encoding method, applied in the field of digital communication system, can solve the problem of low efficiency of codec

Active Publication Date: 2015-08-26
ZTE CORP
View PDF3 Cites 59 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0044] The present invention provides a coding method, a decoding method, a coding device and a decoding device of a structured LDPC code, which solves the problem of low efficiency of existing codecs

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
  • Encoding method, decoding method, encoding device and decoding device of structured LDPC codes
  • Encoding method, decoding method, encoding device and decoding device of structured LDPC codes
  • Encoding method, decoding method, encoding device and decoding device of structured LDPC codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0121] An embodiment of the present invention provides a coding device for structured low-density parity-check code LDPC in digital communication, the structure of which is as follows figure 2 As shown, at least a processor 202 and a memory 201 are included.

[0122] The memory 201 is used to store at least K0 upper and lower adjacent pairs of basic matrices and parameters used in encoding.

[0123] For each fundamental matrix H b , if there are K0 different upper and lower adjacent pairs, then there are K1 first-type up-down adjacent pairs and K2 second-type uplink adjacent pairs, where K0=K1+K2, K0 is greater than or equal to 6*Mb A positive integer of , K2 is a positive integer greater than or equal to 0 and less than or equal to 2*Mb.

[0124] It should be pointed out that the memory may also store the case where there are no upper and lower adjacent pairs of basic matrices, and then use these matrices to encode, because it does not belong to the protection scope of the...

Embodiment 2

[0143] An embodiment of the present invention provides a decoding device for a structured low-density parity-check code LDPC in digital communication, the structure of which is as follows Figure 4 As shown, at least a processor 402 and a memory 401 are included.

[0144] The memory 401 is used to store at least K0 upper and lower adjacent pairs of fundamental matrices and parameters used in encoding. The basic parity check matrix includes the following features:

[0145] For each fundamental matrix H b , if there are K0 different upper and lower adjacent pairs, then there are K1 first-type up-down adjacent pairs and K2 second-type uplink adjacent pairs, where K0=K1+K2, K0 is greater than or equal to 6*Mb A positive integer of K2, a positive integer greater than or equal to 1 and less than or equal to 2*Mb.

[0146] Further, if K2 is greater than or equal to 3, there are at most three adjacent pairs of the second type for any two adjacent rows (x1 row and (x1+1) modMb row),...

Embodiment 3

[0175] The embodiment of the present invention provides a coding method of a structured LDPC code, and the process of using this method to complete LDPC coding is as follows: Figure 8 shown, including:

[0176] Step 801, determine the fundamental matrix used for encoding, including K0 upper and lower adjacent pairs;

[0177] In this step, the basic matrix includes a block A corresponding to Mb×(Nb-Mb) of systematic bits and a block B corresponding to Mb×Mb of parity bits. For the basic matrix, there are K1 first There are K2 upper and lower adjacent pairs of the second class, where K0=K1+K2, K0 is a positive integer greater than or equal to 6*Mb, and K2 is a positive integer greater than or equal to 0 and less than or equal to 2*Mb , the upper and lower adjacent pairs are the elements of two corresponding non-zero square matrices {hb ij , hb （(i+1)mod Mb）j}, that is, a set of two adjacent elements corresponding to non-zero square matrices in a certain column of the basic m...

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

An encoding method, decoding method, encoding device and decoding device for a structured LDPC. The method comprises: determining a basic matrix used for encoding and containing K0 pairs which are adjacent up and down; and according to the basic matrix and an expansion factor corresponding thereto, completing an LDPC encoding operation of obtaining Nb × z bits of code words from (Nb - Mb) × z bits of source data, where z is the expansion factor, and z is a positive integer which is greater than or equal to 1. The provided technical solution is suitable for the encoding and decoding of structured LDPC, thereby realizing the encoding and decoding of LDPC at high production line speed.

Description

technical field [0001] The invention relates to a digital communication system, in particular to a coding method, a decoding method, a coding device and a decoding device of a structured LDPC code. Background technique [0002] With the development of wireless digital communication and the emergence of various high-speed and bursty services, people have put forward higher and higher requirements for error correction coding technology. figure 1 It is a typical digital communication system. Low Density Parity Check Codes (Low Density Parity Check Codes, denoted as LDPC codes) are a type of linear block codes that can be defined by a very sparse parity check matrix or a bipartite graph. They were originally discovered by Gallager, so they are called Gallager codes. After decades of silence, with the development of computer hardware and related theories, MacKay and Neal rediscovered it and proved that it has performance close to the Shannon limit. The latest research shows tha...

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/11
CPCH03M13/036H03M13/1137H03M13/114H03M13/116H03M13/6502H03M13/6566H03M13/611H03M13/118H03M13/616
Inventor 徐俊李立广袁志锋许进田开波
Owner ZTE CORP
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