CN116708842A - Ladder code modulation method, device and medium for high-speed video transmission - Google Patents

Ladder code modulation method, device and medium for high-speed video transmission Download PDF

Info

Publication number
CN116708842A
CN116708842A CN202310958658.2A CN202310958658A CN116708842A CN 116708842 A CN116708842 A CN 116708842A CN 202310958658 A CN202310958658 A CN 202310958658A CN 116708842 A CN116708842 A CN 116708842A
Authority
CN
China
Prior art keywords
decoding
error
code
matrix
bits
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202310958658.2A
Other languages
Chinese (zh)
Other versions
CN116708842B (en
Inventor
章丹
左松林
吕妍
孙巍巍
吴海艳
施雯
王远
胡茂亮
廖羽晗
邱曼曼
霍骋
陈迎
罗长
万礼嵩
赵晓山
王法治
郭可贵
韩玉
孟磊
马欢
沈风
罗俊骁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Super High Voltage Branch Of State Grid Anhui Electric Power Co ltd
State Grid Anhui Electric Power Co Ltd
Original Assignee
Super High Voltage Branch Of State Grid Anhui Electric Power Co ltd
State Grid Anhui Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Super High Voltage Branch Of State Grid Anhui Electric Power Co ltd, State Grid Anhui Electric Power Co Ltd filed Critical Super High Voltage Branch Of State Grid Anhui Electric Power Co ltd
Priority to CN202310958658.2A priority Critical patent/CN116708842B/en
Publication of CN116708842A publication Critical patent/CN116708842A/en
Application granted granted Critical
Publication of CN116708842B publication Critical patent/CN116708842B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/65—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience
    • H04N19/66—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience involving data partitioning, i.e. separation of data into packets or partitions according to importance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/172—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a picture, frame or field

Abstract

The invention discloses a ladder code coding modulation method, equipment and medium for high-speed video transmission, which are characterized in that a front-end image sensor is used for collecting image data, an improved ladder code encoder is used for dividing important image blocks and non-important image blocks of the image data, the ladder code is used for coding, after PAM high-order modulation, the image data is transmitted to a receiving end through a channel containing noise for hard judgment, an improved ladder code decoder is used for correcting errors by using continuous multi-frame non-important image blocks, then a decoding sliding window containing decoding error detection is used for correcting errors, and finally images are recovered. The invention fully utilizes the non-uniform protection characteristic of high-order modulation and the characteristics of the change and non-change areas of continuous multi-frame image data, and designs the high-efficiency coding modulation method based on the step code, thereby being capable of relieving the problems of image data errors, packet loss and the like caused by channel noise, effectively improving the anti-interference capability of the system and further guaranteeing the high-quality and reliable transmission of the monitoring image.

Description

Ladder code modulation method, device and medium for high-speed video transmission
Technical Field
The invention belongs to the technical field of video coding and transmission, and particularly relates to a ladder code coding modulation method for high-speed video transmission, electronic equipment and a readable storage medium.
Background
In the field of internet education, the background technology of large-scale real-time training and monitoring mainly works to conduct real-time classroom monitoring, data analysis, feedback and other works on a large number of students. The system is mainly used for tracking the performance and behavior of students in the network learning process and providing real-time monitoring, analysis and feedback so as to help teachers to better master the learning state of the students, adjust teaching strategies in time and improve teaching effects. Because the requirement of the multi-user online video on the network is higher, under the current video coding standard, the coded video data can have the problems of packet loss and the like under an unstable network, and the video quality of a receiving end is seriously influenced.
At present, various video fault-tolerant coding techniques are layered in order to ensure reliable transmission of video signals, and forward error correction is a key technology of the video fault-tolerant coding techniques. The fec technique can implement self-correction to a certain extent by adding redundancy from the viewpoint of digital signal processing, but its codec algorithm is relatively complex, and requires more calculation and processing resources, especially in high-speed transmission and large-scale data application, which may significantly increase complexity and cost of the system. The step code is a novel hard decision forward error correction scheme proposed by Benjamin P.Smith et al of Toronto university, canada, and is applied to various scenes due to the advantages of higher gain, lower decoding complexity (hard decision decoding) and the like, and the effect of being applied to large-scale scenes is poor due to the fact that the traditional hard decision decoding scheme is low in complexity; the gain of soft-decision decoding is somewhat improved compared to hard-decision decoding, and the complexity is also increased therewith, which is difficult to realize for large-scale applications and requires more resources.
Disclosure of Invention
The invention aims to solve the defects of the prior art, and provides a step code coding modulation method, equipment and medium for high-speed video transmission, so that the characteristics of non-uniform protection of high-order modulation and the characteristics of a continuous multi-frame image data change and non-change area can be fully utilized, and the problems of image data errors, packet loss and the like caused by channel noise are relieved through a high-efficiency coding modulation strategy designed by the step code and a new scheme for decoding with balanced complexity and performance, thereby effectively improving the anti-interference capability of a system and guaranteeing the high-quality and reliable transmission of a monitoring image.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
the invention relates to a ladder code modulation method for high-speed video transmission, which is characterized by being applied to a transmission scene consisting of a transmitting end, a channel and a receiving end, wherein the transmitting end comprises: front-end image sensor, improved ladder code encoder and PAM high-order modulator; the channel contains noise; the receiving end comprises: the PAM high-order demodulator, the improved ladder code decoder and the image recovery module, wherein the ladder code coding modulation method comprises the following steps:
step 1, the front-end image sensor collects each frame of image data of the monitoring video and sends the image data to the front-end image sensorSThe frame image data are sequentially sent to the improved ladder code encoder according to the time sequence;
step 2, definitionw ×wFor each of the improved step code encodersThe dimensions of the matrix are such that,pfor each ofw×wThe number of check bits of each row in the matrix; the improved ladder code encoder receives a received signalSFrame image data is encoded:
step 2.1, comparisonSFrame image data, in turn, discriminating arbitrary firstiFrame image data and the firstjThe region of the frame image data where the phase is changed is denoted as C ij The method comprises the steps of carrying out a first treatment on the surface of the And C ij Is onem i ×m j A matrix of dimensions, wherein,i = 1, 2, 3, …,S，j =i -1; when (when)iWhen=1, let C ij Is an initialized empty matrix, i.em i =m j = 0；
Selecting a region set { C 10 ,C 21 , …,C ij , …,C S S(-1) Maximum number of rows in }imax and column maximum numberjmax and constitutes the region C of maximum dimension i j(max)(max) ；
Region C in each frame of image data i j(max)(max) The corresponding image blocks are divided into important image blocks, and the rest data are divided into non-important image blocks;
step 2.2, initializingi=1; initializing an all-zerow×wDimension matrix B 0 And as the firsti-1 step code matrix B i-1 ；
Step 2.3, the first stepiImportant image blocks in the frame image data are sequentially filled to the dimension ofw×(w -p) Matrix B of (2) i,F Front of (2)XA row, wherein,X= (imax×jmax) / (w-p) Will be at the firstiNon-important image blocks in frame image data are padded to B i,F Is the remaining rows of (2);
matrix [ B ] using BCH code as component code pair i-1 T B i,F ]Is encoded to obtain check bits of each row and formw×pCheck data matrix B of dimension i,P The method comprises the steps of carrying out a first treatment on the surface of the Thereby formingw×wDimension 1iStep code matrix B i =[B i,F B i,P ]The method comprises the steps of carrying out a first treatment on the surface of the Wherein, Trepresenting a transpose operation;
step 2.4, williAssigning +1 toiAfter that, ifi>SThen it indicates that the result is obtainedSA step code matrix B formed by the step code matrixes; otherwise, returning to the step 2.3 for sequential execution;
step 3, the PAM high order modulator comprisesMSeed symbols, each symbol comprisingmIndividual bits {b 0 ,b 1 ,b 2 , …,b k , …,b m-1 And } wherein,b k representing the first of each PAM symbolkA number of bits of a bit,k = 0, 1, 2,…,m-1,m= log 2 M；
according to the unequal protection characteristic of high-order modulation, the PAM high-order modulator modulates the image data and the check data in the step code matrix B to generate the image data and the check dataw ×w×S) /mPAM symbols, 0 th bit of each PAM symbolb 0 Consists of important image blocks and check data, bit 1 to bit 1m-1 bit {b 1 ,b 2 , …,b m-1 -consists of non-important image blocks and check data; in the PAM symbolb 0 The probability of an error occurring is the lowest,b m-1 the probability of error is the largest, that is, the order of the bits at different positions in the PAM symbol arranged according to the reliability is:b 0 >b 1 >...>b k >...>b m-1 ；
step 4, when the PAM symbol is transmitted through the channel, obtaining a noisy PAM symbol and transmitting the PAM symbol to a receiving end;
step 5, the PAM high-order demodulator makes hard decision on the noisy PAM symbol to obtain a step code matrix with a certain error and record the step code matrix as Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, The method comprises the steps of carrying out a first treatment on the surface of the Wherein Y is i0, Representation B i The corresponding step code matrix with a certain error;
step 6, the improved ladder code decoder pair has a certain error ladder code matrix Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, Decoding:
step 6.1, for Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, Non-important image blocks in (if there is a succession)T 1 The values at the same position in the ladder code matrix with certain errors are allfThen Y is taken 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, The values of the same positions in the table are all updated tofThe method comprises the steps of carrying out a first treatment on the surface of the Wherein the threshold valueT 1 Is in the range of 1 toSAny integer of (2);
defining the current iteration number asqThe method comprises the steps of carrying out a first treatment on the surface of the The maximum iteration number isQThe window size of the decoding sliding window isLThe method comprises the steps of carrying out a first treatment on the surface of the Defining the current sliding times of the decoding sliding window asnAnd initializen=0; define and initialize Y 0,0 Is thatw×wA full zero matrix of dimensions;
step 6.2, utilizing the ladder code matrix { Y } with certain errors n0, ,Y n0,+1 , ..., Y n+L0,-1 Form the first of the improved ladder decodernA secondary sliding decoding sliding window;
step 6.3, initializingq=1; y is set to q n, ,Y q n,+1 , ..., Y q n+L,-1 As the firstqDecoding the iteration number to output a result;
step 6.4, the BCH code decoder is utilized to sequentially correspond to the first stepnMatrix [ Y ] in a sliding decoding window of sub-sliding q n+L-1,- 2 T Y q n+L-1,-1 ],…, [Y q a-1,-1 T Y q a-1, ],…, [Y q n-1,+1 T Y q- n+1,2 ], [Y q n-1, T Y q- n+1,1 ]Decoding of each row of (a), comprising:
couple [ Y ] q a-1,-1 T Y q a-1, ]Is the first of (2)lDecoding error detection is performed on the decoding output result of the BCH code decoder of the row,l=1, 2, ...,wthe method comprises the steps of carrying out a first treatment on the surface of the If the decoding output result of the BCH code decoder passes the decoding error detection, the [ Y ] detected by the BCH code decoder is turned over q a-1,-1 T Y q a-1, ]Is the first of (2)lError location of row; otherwise, keep [ Y ] q a-1,-1 T Y q a-1, ]Is the first of (2)lThe data of the row is unchanged; thereby obtaining the firstnThe second sliding decoding sliding window is at the firstqDecoding output result Y of multiple iterations q n, , Y q n,+1 , ...,Y q n L,+-1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein, a=n+1，n+2,…,n+L-1；
step 6.5, willq+1 assignmentqIf (if)q >QThen represent the firstnDecoding the sliding window of the second sliding to obtain the first sliding windownSecond sliding decoding sliding windownIndividual matrix Y Q n, And Y is taken Q n,+1 , ..., Y Q n+L,-1 Assignment to Y n0,+1 , ..., Y n+L0,-1 The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, returning to the step 6.4 for sequential execution;
step 6.6, connectingn+1 assignmentnIf (if)n >S-L+1, the decoding stop of the improved ladder decoder is indicated to obtain all ladder matrixes { Y } Q,1 ,Y Q, 2 , ..., Y Q S, If not, returning to the step 6.2 for sequential execution;
step 7, the image restoration module will be according to { Y } Q, 1 ,Y Q, 2 ,Y Q, 3 , …,Y Q S, Recovery of transmittedSFrame image data.
The step code modulation method for high-speed video transmission of the present invention is also characterized in that the decoding error detection in step 6.4 includes:
step 6.4.1, definitionr a, l Representing the position in the decoding sliding window [ Y ] q a-1,-1 T Y q a-1, ]Middle (f)lA received sequence of rows, wherein,n +1≤a≤n+L-1, 1≤l≤w，terror correction capability for the BCH code decoder; defining and initializing a flag=0;
step 6.4.2 if the BCH code decoder detects a received sequencer a,l Presence ofvError is 1-1v≤tThe corresponding error positions are respectively recorded asx1,x2, …,xd, …,xvAnd is less than or equal to 1x1<x2<…<xd<…<xv ≤2wThe method comprises the steps of carrying out a first treatment on the surface of the Wherein, xdrepresent the firstdError positions;
step 6.4.3, initializingd=1；
Step 6.4.4 ifxd≤ wAnd is also provided witha>n+1，Step 6.4.5 and step 6.4.7 are performed; if it isxd>wAnd is also provided witha<n +L-1, then step 6.4.6 and step 6.4.7 are performed;
step 6.4.5 user a , xd-1 Indicating that the decoding sliding window is located at [ Y ] q a-1,-2 T Y q a--1,1 ]The first of (3)xdA received sequence of rows;
if it isr a xd-1, Is more reliable thanr a,l Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag;
step 6.4.6, user a , xd-w+1 Indicating that the decoding sliding window is located at [ Y ] q a-1, T Y q a+-1,1 ]The first of (3)xd-wA received sequence of rows; if it isr a xd w+1,- Is more reliable thanr a,l Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag;
step 6.4.7, willdAssigning +1 todThen, judged >vWhether or not it is true, if so, then it meansvEach error location has been confirmed as trusted, step 6.4.8 is performed; otherwise, returning to the step 6.4.4 to execute sequentially;
step 6.4.8 defining a thresholdT 2 ，T 2 Is a positive integer;
if Flag is found<T 2 Then consider to be directed tor a,l Error position error of the output of the BCH code decoder, holdr a,l Is unchanged; otherwise, the error position output by the BCH code decoder is considered to be correct, and all bits at the detected error position are flipped.
The reliability comparison in step 6.4.5 includes:
step a1, initializingk=0；
Step b1, ifr a , xd-1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is more reliable thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is less than the total number ofr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is less thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is equal to the total number ofr a, l Middle (f)kBits ofb k C1 is executed if the total number of the step (c) is equal to the total number of the step (b);
step c1, willkAssigning +1 tokAfter that, ifk >m-1, then indicating that the reliability comparison is complete, otherwise, returning to step b1.
The reliability comparison in step 6.4.6 includes:
step a2, initializingk=0；
Step b2, ifr a , xd-w+1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is more reliable thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is less than the total number ofr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is less thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is equal to the total number ofr a, l Middle (f)kBits ofb k C2 is executed if the total number of the step (a);
step c2, willkAssigning +1 tokAfter that, ifk >m-1, then indicating that the reliability comparison is complete, otherwise, returning to step b2.
The electronic device of the invention comprises a memory and a processor, wherein the memory is used for storing a program for supporting the processor to execute the step code modulation method, and the processor is configured to execute the program stored in the memory.
The invention relates to a computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being run by a processor, performs the steps of the step code modulation method.
Compared with the prior art, the invention has the beneficial effects that:
1. according to the invention, the changed area in the continuous multi-frame image data is divided into important image blocks, the unchanged area is divided into non-important image blocks, and the image data in the important image blocks are modulated to the most reliable bit position of each high-order PAM symbol, so that the bit error rate of the important image blocks is effectively reduced.
2. The invention uses non-important image blocks in continuous multi-frame image data as unchanged areas, and can pre-correct the image data; meanwhile, decoding error detection is carried out on the output result of the BCH code decoder by utilizing the unequal protection characteristic of high-order modulation, and the reliability of the output result of the BCH code decoder is judged, so that the occurrence of decoding error of the BCH code can be effectively reduced, the error rate is reduced, the anti-interference capability of a system is improved, and the high-quality and reliable transmission of the monitoring image is ensured.
3. The improved ladder code decoding method adopted by the invention is completely based on hard decision decoding, has the advantage of low complexity, and is convenient for low-cost large-scale commercial use.
Drawings
FIG. 1 is a flow chart of a step code encoding and decoding modulation method for high-speed video transmission according to the present invention;
FIG. 2 is a schematic diagram of the BCH component code parameter relationship according to the present invention;
FIG. 3 is a diagram illustrating the encoding of the step code according to the present invention;
FIG. 4 is a schematic diagram of the step code decoding according to the present invention;
FIG. 5 shows the first embodiment of the present inventioniDecoding error detection within each decoding window is illustrated.
Detailed Description
In this embodiment, a schematic diagram of a system to which a ladder code modulation method for high-speed video transmission is applied is shown in fig. 1, and the system is applied to a transmission scene composed of a transmitting end, a channel and a receiving end, where the transmitting end includes: front-end image sensor, improved ladder code encoder and PAM high-order modulator; the channel contains noise; the receiving end comprises: PAM high-order demodulator, improved ladder code decoder and image recovery module;
the front-end image sensor sends a section of collected image data to an improved ladder code encoder, the encoded image data and check data are modulated by a PAM modulator containing 8 symbols and then transmitted to a video receiving end through a network, firstly, the noisy image data and check data are recovered by the PAM demodulator containing 8 symbols, and then the modified PAM modulator is usedAn in-step code decoder decodes noisy image data and verification data, wherein the sliding window lengthLIteratively decoding each sliding window until the maximum number of iterations is reached =9QAnd (7) after decoding all the data, sending the decoded data to an image display to display the image.
In specific implementation, the resolution of the monitoring camera is set to 720P, each frame of picture has 1280×720 pixels, and if each image adopts RGB format, the compression ratio is 10: after the h.264 video compression technique of 1, each ladder code matrix contains 2 211 840 information bits. The component codes are BCH codes, as shown in figure 2,n c is the code length of the BCH code,k c is the information bit length of the BCH code,tis the error correction capability of the BCH code,sanderepresenting the number of shortened information bits and the number of extended check bits of the component code respectively,his any integer. Code rate by formulaw = n c /2，p = n c - k c ,n c = 2 h -1+e- sAndk c = n c -ht-edetermining parametersh=12、e=0、s=511、t=8、w=1536、p=96。
The method can adjust parameters according to different scenes to achieve the best effect, so that the method has high adaptability. Specifically, the step code modulation method comprises the following steps:
step 1, a front-end image sensor collects each frame of image data of a monitoring video, and the front-end image sensor acquires the image data of each frame of the monitoring videoSThe image data of 6000 frames are sequentially transmitted to the modified step code encoder in time sequence.
Step 2, definitionw ×w=1536×1536 is the dimension of each matrix in the modified step code encoder,p=96 for eachw×wThe number of check bits of each row in the matrix; improved ladder code encoder for receivingSThe image data of 6000 frames is encoded as shown in fig. 3.
Step 2.1, comparisonS6000 frames of image data, and sequentially distinguishing any of the first framesiNumber of frame imagesAccording to the firstjThe region of the frame image data where the phase is changed is denoted as C ij The method comprises the steps of carrying out a first treatment on the surface of the And C ij Is onem i ×m j A matrix of dimensions, wherein,i = 1, 2, 3, …,S，j =i -1; when (when)iWhen=1, let C ij Is an initialized empty matrix, i.em i =m j = 0；
Selecting a region set { C 10 ,C 21 , …,C ij , …,C S S(-1) Maximum number of rows in }imax=720 and column maximum numberjmax=1024 and constitutes a region C having a maximum dimension of 720×1024 i j(max)(max) The method comprises the steps of carrying out a first treatment on the surface of the In this embodiment, C S S(-1) =C 6000(5999) ；
Region C in each frame of image data i j(max)(max) The corresponding image blocks are divided into important image blocks, and the rest of data are divided into non-important image blocks.
Step 2.2, initializingi=1; initializing an all-zerow×wDimension matrix B 0 And as the firsti-1 step code matrix B i-1 The method comprises the steps of carrying out a first treatment on the surface of the In the present embodiment of the present invention,w=1536。
will be the firstiImportant image blocks in the frame image data are sequentially filled to the dimension ofw×(w -p) Matrix b=1536×1440 i,F Front of (2)XA row, wherein,X= (imax×jmax) / (w-p) Will be at the firstiNon-important image blocks in frame image data are padded to B i,F Is the remaining rows of (2); in the present embodiment of the present invention,X=512；
matrix [ B ] using BCH code as component code pair i-1 T B i,F ]Is encoded to obtain check bits of each row and formw×pCheck data matrix b=1536×96 dimensions i P, The method comprises the steps of carrying out a first treatment on the surface of the Thereby formingw×wLet =1536×1536 th dimensioniStep code matrix B i =[B i,F B i P, ]The method comprises the steps of carrying out a first treatment on the surface of the Wherein, Trepresenting a transpose operation;
step 2.4, williAssigning +1 toiAfter that, ifi>SThen it indicates that the result is obtainedSA step code matrix B consisting of 6000 step code matrices; otherwise, returning to the step 2.3 for sequential execution.
Step 3, PAM high order modulator comprisingM8 symbols, each symbol comprisingmIndividual bits {b 0 ,b 1 ,b 2 , …,b k , …,b m-1 And } wherein,b k representing the first of each PAM symbolkA number of bits of a bit,k = 0, 1, 2,…,m-1,m= log 2 M；
according to the unequal protection characteristic of the high-order modulation, the PAM high-order modulator modulates the image data and the check data in the step code matrix B to generate the image data and the check dataw×w×S) /m4 718 592 000 PAM symbols, 0 th bit of each PAM symbolb 0 Consists of important image blocks and check data, bit 1 to bit 1m-1 bit {b 1 ,b 2 , …,b m-1 -consists of non-important image blocks and check data; in PAM symbolsb 0 The probability of an error occurring is the lowest,b m-1 the probability of error is the largest, that is, the order of the bits at different positions in the PAM symbol arranged according to the reliability is:b 0 >b 1 >...>b k >...>b m-1 ；
in the present embodiment of the present invention,m=3, i.e. each symbol contains 3 bits {b 0 ,b 1 ,b 2 -and reliability ordering:b 0 >b 1 >b 2 。
step 4, when PAM symbols are transmitted through a channel, obtaining noisy PAM symbols and transmitting the noisy PAM symbols to a receiving end;
step 5, performing hard decision on the noisy PAM symbol by the PAM high-order demodulator to obtain a step code matrix with a certain error and marking the step code matrix as Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, ，S=6000; wherein Y is i0, Representation B i The corresponding step code matrix with certain error exists.
Step 6, the improved ladder code decoder pair has a certain error ladder code matrix Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, The decoding is performed such that,S=6000：
step 6.1, for Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, Non-important image blocks in (if there is a succession)T 1 The values at the same position in the ladder code matrix with certain errors are allf=0/1, Y 0,1 ,Y 0,2 , ..., Y i0, , ..., Y S0, The values of the same positions in the table are all updated tofThe method comprises the steps of carrying out a first treatment on the surface of the Wherein the threshold valueT 1 The value of 4000 ranges from 1 toSAny integer of (2);
defining the current iteration number asqThe method comprises the steps of carrying out a first treatment on the surface of the The maximum iteration number isQ=7, the decoding sliding window has a window size ofL=9; defining the current sliding times of the decoding sliding window asnAnd initializen=0; define and initialize Y 0,0 Is thatw×wAn all-zero matrix of dimensions 1536×1536; the sliding window decoding process is shown in fig. 4.
Step 6.2, utilizing the ladder code matrix { Y } with certain errors n0, ,Y n0,+1 , ..., Y n+L0,-1 First step of improved ladder decodernA secondary sliding decoding sliding window;
step 6.3, initializingq=1; y is set to q n, ,Y q n,+1 , ..., Y q n+L,-1 As the firstqDecoding the iteration number to output a result;
step 6.4, the BCH code decoder is utilized to sequentially correspond to the first stepnMatrix [ Y ] in a sliding decoding window of sub-sliding q n+L-1,- 2 T Y q n+L-1,-1 ],…, [Y q a-1,-1 T Y q a-1, ],…, [Y q n-1,+1 T Y q- n+1,2 ], [Y q n-1, T Y q- n+1,1 ]Decoding of each row of (a) as shown in fig. 5;
couple [ Y ] q a-1,-1 T Y q a-1, ]First, thelDecoding error detection is performed on the decoding output result of the BCH code decoder of the row,l=1, 2, ...,w=1536; if the decoding output result of the BCH code decoder passes the decoding error detection, the [ Y ] detected by the BCH code decoder is turned over q a-1,-1 T Y q a-1, ]First, thelError location of row; otherwise, keep [ Y ] q a-1,-1 T Y q a-1, ]First, thelThe data of the row is unchanged; thereby obtaining the firstnThe second sliding decoding sliding window is at the firstqDecoding output result Y of multiple iterations q n, , Y q n,+1 , ...,Y q n L,+-1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein, a=n+1，n+2,…,n+L-1。
step 6.4.1, definitionr a, l Representing the position in the decoding sliding window [ Y ] q a-1,-1 T Y q a-1, ]Middle (f)lA received sequence of rows, wherein,n +1≤a≤n+L-1, 1≤l≤w，w=1536，t=8 is the error correction capability of the BCH code decoder; defining and initializing a flag=0;
step 6.4.2 if the BCH code decoder detects a received sequencer a,l Presence ofvError is 1-1v≤tThe corresponding error positions are respectively recorded asx1,x2, …,xd, …,xvAnd is less than or equal to 1x1<x2<…<xd<…<xv ≤2wThe method comprises the steps of carrying out a first treatment on the surface of the Wherein, xdrepresent the firstdError positions;
step 6.4.3, initializingd=1；
Step 6.4.4 ifxd≤ wAnd is also provided witha>n+1，Then executeStep 6.4.5; if it isxd>wAnd is also provided witha<n +L-1, then step 6.4.6 is performed;
step 6.4.5 user a , xd-1 Indicating that the decoding sliding window is located at [ Y ] q a-1,-2 T Y q a--1,1 ]The first of (3)xdA received sequence of rows;
if it isr a xd-1, Is more reliable thanr a,l Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag; step 6.4.7 is performed.
The reliability comparison comprises the following steps:
step a1, initializingk=0；
Step b1, ifr a , xd-1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is more reliable thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is less than the total number ofr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is less thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is equal to the total number ofr a, l Middle (f)kBits ofb k C1 is executed if the total number of the step (c) is equal to the total number of the step (b);
step c1, willkAssigning +1 tokAfter that, ifk >m-1=2, then indicating that the reliability comparison is complete, otherwise, return to step b1.
Step 6.4.6, user a , xd-w+1 Indicating that the decoding sliding window is located at [ Y ] q a-1, T Y q a+-1,1 ]The first of (3)xd-wA received sequence of rows; if it isr a xd w+1,- Is more reliable thanr a,l Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag; step 6.4.7 is performed;
the reliability comparison comprises the following steps:
step a2, initializingk=0；
Step b2, ifr a , xd-w+1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is more reliable thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is less than the total number ofr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is less thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is equal to the total number ofr a, l Middle (f)kBits ofb k C2 is executed if the total number of the step (a);
step c2, willkAssigning +1 tokAfter that, ifk >m-1=2, then indicating that the reliability comparison is complete, otherwise, return to step b2.
Step 6.4.7, willdAssigning +1 todThen, judged >vWhether or not it is true, if so, then it meansvEach error location has been confirmed as trusted, step 6.4.8 is performed; otherwise, returning to the step 6.4.4 to execute sequentially;
step 6.4.8 defining a thresholdT 2 =1，T 2 Is a positive integer;
if Flag is found<T 2 Then consider to be directed tor a,l Is output by BCH code decoderError location error, holdr a,l Is unchanged; otherwise, the error position output by the BCH code decoder is considered to be correct, and all bits at the detected error position are flipped.
In specific implementation, use%u,l) To specify the position of the codeword in each window, whereu= {1, 2, …, 4} represents the position relative to the current window,l= {1, 2, …, 1536} represents the corresponding row or column index in two adjacent sub-block matrices; using%u,l,g) Representing code words [ ]u,l) Is the first of (2)gThe bit is used to indicate the position of the bit,g= {1, 2, …, 3072}. When decoding the code word (2, 512), the BCH code decoder detects that the error position is (2, 512, 513), the reliability of the code word (2, 512) is larger than (1, 513) according to the reliability rule, the error is reliable, flag=1, flag is larger than or equal to 1, the error position output by the BCH code decoder is correct, and all bits at the detected error position are turned over; when decoding a codeword (2, 1024), the BCH code decoder detects that the error position is (2, 1024, 1), and obtains that the reliability of the codeword (2, 1024) is less than (1, 1) according to the reliability rule, the error is unreliable and flag=0, the Flag is less than 1, the error position output by the BCH code decoder is wrong, the codeword data is kept unchanged, and the next codeword is decoded and tried; when decoding the code word (4, 1), the BCH code decoder detects that the error positions are (4, 1, 1) and (4, 1, 513), the reliability of the code word (4, 1) is equal to (3, 1) according to the reliability rule, the error reliability of the code word (4, 1, 1) is (flag=1), the reliability of the code word (4, 1) is greater than (3, 513), the error reliability of the code word (4, 1, 513) is (flag=2, flag is greater than 1, the error position output by the BCH code decoder is correct, and the bits on all the detected error positions are turned over; and so on.
Step 6.5, willq+1 assignmentqIf (if)q >Q=7, then represent the firstnDecoding the sliding window of the second sliding to obtain the first sliding windownSecond sliding decoding sliding windownIndividual matrix Y n7, And Y is taken n7,+1 , ..., Y n+L7,-1 Assignment of Y n0,+1 , ..., Y n+L0,-1 The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, returning to the step 6.4 for sequential execution;
step 6.6, connectingn+1 assignmentnIf (if)n >S-L+1=5992, then indicates that the decoding of the improved ladder decoder is stopped, resulting in all ladder matrices { Y } Q,1 ,Y Q, 2 , ..., Y Q S, }, i.e. { Y 7,1 ,Y 7, 2 ,Y 7, 3 , …,Y 7, 6000 -a }; otherwise, returning to the step 6.2 for sequential execution;
step 7, the image restoration module will be according to { Y } 7,1 ,Y 7, 2 ,Y 7, 3 , …,Y 7, 6000 Recovery of transmittedS6000 frames of image data.

Claims (6)

1. The step code coded modulation method for high-speed video transmission is characterized by being applied to a transmission scene consisting of a transmitting end, a channel and a receiving end, wherein the transmitting end comprises: front-end image sensor, improved ladder code encoder and PAM high-order modulator; the channel contains noise; the receiving end comprises: the PAM high-order demodulator, the improved ladder code decoder and the image recovery module, wherein the ladder code coding modulation method for high-speed video transmission is carried out according to the following steps:
step 1, the front-end image sensor collects each frame of image data of the monitoring video and sends the image data to the front-end image sensorSThe frame image data are sequentially sent to the improved ladder code encoder according to the time sequence;
step 2, definitionw ×wFor the dimension of each matrix in the improved step code encoder,pfor each ofw×wThe number of check bits of each row in the matrix; the improved ladder code encoder receives a received signalSFrame image data is encoded:
step 2.1, comparisonSFrame image data, in turn, discriminating arbitrary firstiFrame image data and the firstjThe region of the frame image data where the phase is changed is denoted as C ij The method comprises the steps of carrying out a first treatment on the surface of the And C ij Is onem i ×m j A matrix of dimensions, wherein,i = 1, 2, 3, …, S，j = i -1; when (when)iWhen the number of the codes is =1,let C ij Is an initialized empty matrix, i.em i = m j = 0；
Selecting a region set { C 10 ,C 21 , …,C ij , …,C S S(-1) Maximum number of rows in }imax and column maximum numberjmax and constitutes the region C of maximum dimension i j(max)(max) ；
Region C in each frame of image data i j(max)(max) The corresponding image blocks are divided into important image blocks, and the rest data are divided into non-important image blocks;
step 2.2, initializingi=1; initializing an all-zerow×wDimension matrix B 0 And as the firsti-1 step code matrix B i-1 ；
Step 2.3, the first stepiImportant image blocks in the frame image data are sequentially filled to the dimension ofw×(w -p) Matrix B of (2) i,F Front of (2)XA row, wherein,X = (imax×jmax) / (w-p) Will be at the firstiNon-important image blocks in frame image data are padded to B i,F Is the remaining rows of (2);
matrix [ B ] using BCH code as component code pair i-1 T B i,F ]Is encoded to obtain check bits of each row and formw×pCheck data matrix B of dimension i,P The method comprises the steps of carrying out a first treatment on the surface of the Thereby formingw×wDimension 1iStep code matrix B i =[B i,F B i,P ]The method comprises the steps of carrying out a first treatment on the surface of the Wherein, Trepresenting a transpose operation;
step 2.4, williAssigning +1 toiAfter that, ifi>SThen it indicates that the result is obtainedSA step code matrix B formed by the step code matrixes; otherwise, returning to the step 2.3 for sequential execution;
step 3, the PAM high order modulator comprisesMSeed symbols, each symbol comprisingmIndividual bits {b 0 , b 1 , b 2 , …, b k , …, b m-1 And } wherein,b k representing the first of each PAM symbolkA number of bits of a bit,k = 0, 1, 2,…, m-1, m= log 2 M；
according to the unequal protection characteristic of high-order modulation, the PAM high-order modulator modulates the image data and the check data in the step code matrix B to generate the image data and the check dataw×w ×S) / mPAM symbols, 0 th bit of each PAM symbolb 0 Consists of important image blocks and check data, bit 1 to bit 1m-1 bit {b 1 , b 2 , …, b m-1 -consists of non-important image blocks and check data; in the PAM symbolb 0 The probability of an error occurring is the lowest,b m-1 the probability of error is the largest, that is, the order of the bits at different positions in the PAM symbol arranged according to the reliability is:b 0 >b 1 >... > b k >... >b m-1 ；
step 4, when the PAM symbol is transmitted through the channel, obtaining a noisy PAM symbol and transmitting the PAM symbol to a receiving end;
step 5, the PAM high-order demodulator makes hard decision on the noisy PAM symbol to obtain a step code matrix with a certain error and record the step code matrix as Y 0,1 , Y 0,2 , ..., Y i0, , ..., Y S0, The method comprises the steps of carrying out a first treatment on the surface of the Wherein Y is i0, Representation B i The corresponding step code matrix with a certain error;
step 6, the improved ladder code decoder pair has a certain error ladder code matrix Y 0,1 , Y 0,2 , ..., Y i0, , ..., Y S0, Decoding:
step 6.1, for Y 0,1 , Y 0,2 , ..., Y i0, , ..., Y S0, Non-important image blocks in (if there is a succession)T 1 The values at the same position in the ladder code matrix with certain errors are allfThen Y is taken 0,1 , Y 0,2 , ..., Y i0, , ..., Y S0, The values of the same positions in the table are all updated tofThe method comprises the steps of carrying out a first treatment on the surface of the Wherein the threshold valueT 1 Is in the range of 1 toSAny integer of (2);
defining the current iteration number asqThe method comprises the steps of carrying out a first treatment on the surface of the The maximum iteration number isQThe window size of the decoding sliding window isLThe method comprises the steps of carrying out a first treatment on the surface of the Defining the current sliding times of the decoding sliding window asnAnd initializen=0; define and initialize Y 0,0 Is thatw ×wA full zero matrix of dimensions;
step 6.2, utilizing the ladder code matrix { Y } with certain errors n0, , Y n0, +1 , ..., Y n+L0, -1 Form the first of the improved ladder decodernA secondary sliding decoding sliding window;
step 6.3, initializingq=1; y is set to q n, , Y q n, +1 , ..., Y q n+L, -1 As the firstqDecoding the iteration number to output a result;
step 6.4, the BCH code decoder is utilized to sequentially correspond to the first stepnMatrix [ Y ] in a sliding decoding window of sub-sliding q n+L-1, -2 T Y q n+L-1, -1 ],…, [Y q a-1, -1 T Y q a-1, ],…, [Y q n-1, +1 T Y q- n+1, 2 ], [Y q n-1, T Y q- n+1, 1 ]Decoding of each row of (a), comprising:
couple [ Y ] q a-1, -1 T Y q a-1, ]Is the first of (2)lDecoding error detection is performed on the decoding output result of the BCH code decoder of the row,l=1, 2, ..., wthe method comprises the steps of carrying out a first treatment on the surface of the If the decoding output result of the BCH code decoder passes the decoding error detection, the [ Y ] detected by the BCH code decoder is turned over q a-1, -1 T Y q a-1, ]Is the first of (2)lError location of row; otherwise, keep [ Y ] q a-1, -1 T Y q a-1, ]Is the first of (2)lThe data of the row is unchanged; thereby obtaining the firstnThe second sliding decoding sliding window is at the firstqDecoding output result Y of multiple iterations q n, , Y q n, +1 , ...,Y q n L, +-1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein, a = n+1，n+2,…, n+L-1；
step 6.5, willq+1 assignmentqIf (if)q >QThen represent the firstnDecoding the sliding window of the second sliding to obtain the first sliding windownSecond sliding decoding sliding windownIndividual matrix Y Q n, And Y is taken Q n, +1 , ..., Y Q n+L, -1 Assignment to Y n0, +1 , ..., Y n+L0, -1 The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, returning to the step 6.4 for sequential execution;
step 6.6, connectingn+1 assignmentnIf (if)n > S-L+1, the decoding stop of the improved ladder decoder is indicated to obtain all ladder matrixes { Y } Q,1 , Y Q, 2 , ..., Y Q S, And if not, returning to the step 6.2 for sequential execution.
2. The method according to claim 1, wherein the decoding error detection in step 6.4 comprises:
step 6.4.1, definitionr a l, Representing the position in the decoding sliding window [ Y ] q a-1, -1 T Y q a-1, ]Middle (f)lA received sequence of rows, wherein,n +1≤a≤n+L-1, 1≤l≤w，terror correction capability for the BCH code decoder; defining and initializing a flag=0;
step 6.4.2 if the BCH code decoder detects a received sequencer a,l Presence ofvError is 1-1v≤tThe corresponding error positions are respectively recorded asx1,x2, …, xd, …,xvAnd is less than or equal to 1x1<x2<…< xd <…<xv ≤2wThe method comprises the steps of carrying out a first treatment on the surface of the Wherein, xdrepresent the firstdError positions;
step 6.4.3, initializingd=1；
Step 6.4.4 ifxd≤ wAnd is also provided witha> n+1，Step 6.4.5 and step 6.4.7 are performed; if it isxd > wAnd is also provided witha< n +L-1, then step 6.4.6 and step 6.4.7 are performed;
step 6.4.5 user a , xd-1 Indicating that the decoding sliding window is located at [ Y ] q a-1, -2 T Y q a--1, 1 ]The first of (3)xdA received sequence of rows;
if it isr a xd-1, Is more reliable thanr a l, Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag;
step 6.4.6, user a xd-w+1, Indicating that the decoding sliding window is located at [ Y ] q a-1, T Y q a+-1, 1 ]The first of (3)xd-wA received sequence of rows; if it isr a xd w+1,- Is more reliable thanr a l, Then (1)dThe error is not trusted, the value of Flag remains unchanged; otherwise, represent the firstdThe error is trusted, and flag+1 is assigned to Flag;
step 6.4.7, willdAssigning +1 todThen, judged >vWhether or not it is true, if so, then it meansvEach error location has been confirmed as trusted, step 6.4.8 is performed; otherwise, returning to the step 6.4.4 to execute sequentially;
step 6.4.8 defining a thresholdT 2 ，T 2 Is a positive integer;
if Flag is found<T 2 Then consider to be directed tor a l, Error position error of the output of the BCH code decoder, holdr a l, Is unchanged; otherwise, then considerFor the correct error position output by the BCH code decoder, all bits at the detected error position are flipped.
3. The method according to claim 2, wherein the reliability comparison in step 6.4.5 comprises:
step a1, initializingk=0；
Step b1, ifr a , xd-1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is more reliable thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is less than the total number ofr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-1 Is less thanr j,a ；
If it isr a , xd-1 Middle (f)kBits ofb k Is equal to the total number ofr a, l Middle (f)kBits ofb k C1 is executed if the total number of the step (c) is equal to the total number of the step (b);
step c1, willkAssigning +1 tokAfter that, ifk >m-1, then indicating that the reliability comparison is complete, otherwise, returning to step b1.
4. The method of claim 2, wherein the reliability comparison in step 6.4.6 comprises:
step a2, initializingk=0；
Step b2, ifr a , xd-w+1 Middle (f)kBits ofb k The total number of (2) is greater thanr a, l Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is more reliable thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is less than the total number ofr a l, Middle (f)kBits ofb k The total number of (1)r a , xd-w+1 Is less thanr j,a ；
If it isr a , xd-w+1 Middle (f)kBits ofb k Is equal to the total number ofr a l, Middle (f)kBits ofb k C2 is executed if the total number of the step (a);
step c2, willkAssigning +1 tokAfter that, ifk >m-1, then indicating that the reliability comparison is complete, otherwise, returning to step b2.
5. An electronic device comprising a memory and a processor, wherein the memory is configured to store a program that supports the processor to perform the ladder code modulation method for high speed video transmission of any of claims 1-4, the processor being configured to execute the program stored in the memory.
6. A computer readable storage medium having stored thereon a computer program, characterized in that the computer program when executed by a processor performs the steps of the staircase code modulation method for high speed video transmission according to any of claims 1-4.
CN202310958658.2A 2023-08-01 2023-08-01 Ladder code modulation method, device and medium for high-speed video transmission Active CN116708842B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310958658.2A CN116708842B (en) 2023-08-01 2023-08-01 Ladder code modulation method, device and medium for high-speed video transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310958658.2A CN116708842B (en) 2023-08-01 2023-08-01 Ladder code modulation method, device and medium for high-speed video transmission

Publications (2)

Publication Number Publication Date
CN116708842A true CN116708842A (en) 2023-09-05
CN116708842B CN116708842B (en) 2023-12-12

Family

ID=87831415

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310958658.2A Active CN116708842B (en) 2023-08-01 2023-08-01 Ladder code modulation method, device and medium for high-speed video transmission

Country Status (1)

Country Link
CN (1) CN116708842B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170126360A1 (en) * 2015-11-04 2017-05-04 Mitsubishi Electric Research Laboratories, Inc. Fast Log-Likelihood Ratio (LLR) Computation for Decoding High-Order and High-Dimensional Modulation Schemes
WO2017178264A1 (en) * 2016-04-15 2017-10-19 Alcatel Lucent Method and apparatus for forward error correction encoding
US20180083653A1 (en) * 2016-09-16 2018-03-22 Micron Technology, Inc. Apparatuses and methods for staircase code encoding and decoding for storage devices
WO2020234185A1 (en) * 2019-05-17 2020-11-26 Technische Universiteit Eindhoven A method of marking bits, a method of decoding bits, a bit marking device, a decoder, a receiver and a chip
US20210234555A1 (en) * 2018-07-09 2021-07-29 Technische Universiteit Eindhoven Soft-aided decoding of staircase codes
CN115276796A (en) * 2022-06-23 2022-11-01 兰州理工大学 Ladder code based atmospheric optical transmission method with super-Nyquist rate
CN116366415A (en) * 2021-12-27 2023-06-30 华为技术有限公司 Modulation method, demodulation method and related device
WO2023124890A1 (en) * 2021-12-27 2023-07-06 华为技术有限公司 Modulation method, demodulation method and related apparatus

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170126360A1 (en) * 2015-11-04 2017-05-04 Mitsubishi Electric Research Laboratories, Inc. Fast Log-Likelihood Ratio (LLR) Computation for Decoding High-Order and High-Dimensional Modulation Schemes
WO2017178264A1 (en) * 2016-04-15 2017-10-19 Alcatel Lucent Method and apparatus for forward error correction encoding
US20180083653A1 (en) * 2016-09-16 2018-03-22 Micron Technology, Inc. Apparatuses and methods for staircase code encoding and decoding for storage devices
US20210234555A1 (en) * 2018-07-09 2021-07-29 Technische Universiteit Eindhoven Soft-aided decoding of staircase codes
WO2020234185A1 (en) * 2019-05-17 2020-11-26 Technische Universiteit Eindhoven A method of marking bits, a method of decoding bits, a bit marking device, a decoder, a receiver and a chip
CN116366415A (en) * 2021-12-27 2023-06-30 华为技术有限公司 Modulation method, demodulation method and related device
WO2023124890A1 (en) * 2021-12-27 2023-07-06 华为技术有限公司 Modulation method, demodulation method and related apparatus
CN115276796A (en) * 2022-06-23 2022-11-01 兰州理工大学 Ladder code based atmospheric optical transmission method with super-Nyquist rate

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
DAWEI LIU: "Entangled-photons compressive ghost imaging based on spatial correlation of sensing matrix", 《OPTICAL ENGINEERING》 *
胡星;马林华;孙康宁;黄天宇;刘士平;: "高阶量纠错码理论限及软判决编译码算法", 系统工程与电子技术, no. 10 *
董育宁;李贺;陈海波;: "实时H.264视频流的低密度生成矩阵不等差错保护", 南京邮电大学学报(自然科学版), no. 02 *
雷艺，陈斌，周红平，郭凯，郭忠义: "软信息辅助硬判决译码在自由空间光通信中的应用", 《电子学报》 *

Also Published As

Publication number Publication date
CN116708842B (en) 2023-12-12

Similar Documents

Publication Publication Date Title
CN106937134B (en) Coding method, coding sending device and system for data transmission
CN106571831B (en) LDPC hard decision decoding method and decoder based on deep learning
US8239727B2 (en) Decoding of raptor codes
KR20080074886A (en) Error detection and correction in data transmission packets
WO2003088505A3 (en) A decoding method and apparatus
WO2006012349A1 (en) Discrete universal denoising with reliability information
CN1140965C (en) Vanish Correction method and vanish correction circuit
JP4844629B2 (en) Apparatus and method for error correction in mobile wireless applications incorporating erasure table data
WO2006054660A1 (en) Digital signal transmitting apparatus
US9419656B2 (en) Decoder and method for decoding an encoded sequence of bits
JP2009509390A (en) Apparatus and method for error correction in mobile wireless applications incorporating multi-level adaptive erasure data
CN116708842B (en) Ladder code modulation method, device and medium for high-speed video transmission
CN109787641B (en) Method, device and storage medium for decoding sta-irecase code
CN103974080B (en) Transmission error code correction method for image prediction compression coding
CN111183748B (en) Error code resisting method based on cyclic redundancy check and erasure correction coding
CN104468022A (en) Transport format combination decoding method and device
CN101459429B (en) Decoding method for low density generation matrix code
EP1766832A1 (en) Discrete universal denoising with error correction coding
CN111565291B (en) Multi-base-station image transmission method for unmanned aerial vehicle
WO2002052729A2 (en) Decoder, system and method for decoding turbo block codes
JP3269035B2 (en) Decryption device
CN109245850B (en) Self-adaptive system code FEC coding and decoding method based on media content
CN104284207A (en) Information transmission method based on video image
Maheswari et al. Error resilient wireless video transmission via parallel processing using puncturing rule enabled coding and decoding
Hsiao et al. An analysis modeling of frame-level forward error correction for H. 264/AVC over burst-loss channels

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant