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

Recursive block Markov superimposed encoding method

A superimposed coding, recursive technology, applied in the direction of error correction/detection using convolutional codes, data representation error detection/correction, etc., can solve the problem of high decoding complexity

Active Publication Date: 2017-07-21
SUN YAT SEN UNIV
View PDF4 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The block Markov superposition coding method mentioned above is non-recursive, which has many advantages. However, when the repetition code and the parity code are used as the basic code, a large coding memory length m is usually required to approximate the channel capacity.
The larger the memory length m is, the larger the required decoding delay d is, and the corresponding decoding complexity is also higher, which makes the non-recursive block Markov superposition coding method not suitable for certain delay and computational complexity. demanding systems

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
  • Recursive block Markov superimposed encoding method
  • Recursive block Markov superimposed encoding method
  • Recursive block Markov superimposed encoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] Reference figure 1 , A binary information sequence of length K=kBL=1×5000×988 u Divided into L=988 equal length groups u =( u (0) , u (1) ,..., u (987) ), the length of each packet is kB=5000. The basic code encoder C uses a repetitive code with code length n=2 and information bit length k=1. In this example, the code memory length is m=2, and two random interleavers are used. The symbol-by-symbol aliaser S uses a bit-by-bit binary domain sum operator. The ending length T is set to be the same as the decoding delay d, that is, T=d. Reference figure 1 , Its encoding method includes the following steps:

[0038] Step one, put the information sequence u Divided into 988 equal length groups u =( u (0) , u (1) ,..., u (987) ), the length of each packet is 5000; for t=-1, -2, the sequence of length nB=10000 c (t) The initial setting is a sequence of all zeros, that is c (t) = 0 ;

[0039] Step 2: At t=0,1,...987, change the sequence of length kB=5000 Send it to the basic cod...

Embodiment 2

[0050] Reference figure 1 , A binary information sequence of length K=kBL=1×5000×988 u Divided into L=988 equal length groups u =( u (0) , u (1) ,..., u (987) ), the length of each packet is kB=5000. The basic code encoder C uses a repetitive code with code length n=2 and information bit length k=1. In this example, the code memory length m=3, and three random interleavers are used. The symbol-by-symbol aliaser S uses a bit-by-bit binary domain sum operator. The ending length T is set to be the same as the decoding delay d, that is, T=d. Reference figure 1 , Its encoding method includes the following steps:

[0051] Step one, put the information sequence u Divided into 988 equal length groups u =( u (0) , u (1) ,..., u (987) ), the length of each packet is 5000; for t=-1, -2, -3, the sequence of length nB=10000 c (t) The initial setting is a sequence of all zeros, that is c (t) = 0 ;

[0052] Step 2: At t=0,1,...987, change the sequence of length kB=5000 Send it to the basic ...

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 belongs to the field of digital communication and digital storage, and especially relates to a recursive block Markov superimposed encoding method. The method is characterized by comprising the following steps: taking a short code of which the code length is n and the information bit length is k as a basic code, and encoding an information sequence FORMULA of which the length K is equal to kBL to a code word FORMULA of which the length N is equal to nB(L+T), wherein the encoding method includes the following steps: firstly, dividing the information sequence FORMULA of which the length K is equal to kBL into L equal-length blocks FORMULA, ensuring that the length of each block is kB, and aiming at t that is equal to -1, -2, ..., -(m-1), -m, initializing a sequence FORMULA of which the length is nB to an all-zero sequence; and then, at the time of t that is equal to 0, 1, ..., L-1, sending a sequence FORMULA of which the length is kB to a basic code encoder C for encoding to obtain an encoded sequence FORMULA of which the length is nB, and combining the fed-back FORMULA to calculate the t(th) sub-sequence FORMULA of the code word FORMULA. The recursive block Markov superimposed encoding method disclosed by the invention has the advantages of approaching the channel capacity, achieving simple encoding and flexible structure, and the like. Compared with a non-recursive block Markov superimposed encoding method, the method disclosed by the invention has lower decoding delay and decoding complexity, and has a very low error floor in decoding performance.

Description

Technical field [0001] The invention belongs to the field of digital communication and digital storage, and particularly relates to a recursive grouped Markov superposition coding method. Background technique [0002] Designing a channel coding that can approach the channel capacity and has an effective coding and decoding algorithm is of great significance for realizing efficient and reliable data transmission. Since Shannon proposed the famous channel coding theorem in 1948, people have been working on researching and designing good codes that can approximate the channel capacity. Berrou et al. proposed Turbo codes in 1993 and verified that Turbo codes using an iterative decoding algorithm can approximate the channel capacity. Generally, Turbo codes are concatenated with two or more convolutional codes as component codes, where the input of different component codes is the sequence of the information sequence interleaved by different interleavers. The proposal of Turbo codes ...

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/23
CPCH03M13/23
Inventor 马啸赵山程白宝明黄勤朱锦顺
Owner SUN YAT SEN UNIV
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