CN109474390B - Data retransmission method, transmission device, computer readable medium and system - Google Patents
Data retransmission method, transmission device, computer readable medium and system Download PDFInfo
- Publication number
- CN109474390B CN109474390B CN201710810950.4A CN201710810950A CN109474390B CN 109474390 B CN109474390 B CN 109474390B CN 201710810950 A CN201710810950 A CN 201710810950A CN 109474390 B CN109474390 B CN 109474390B
- Authority
- CN
- China
- Prior art keywords
- base matrix
- submodule
- column block
- vector
- preset
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A method, a transmitting device, a computer readable medium and a system for data retransmission are provided. The data retransmission method comprises the following steps: dividing all coded bits into coding column blocks by using a base matrix, wherein each coding column block corresponds to one column of the base matrix, and the base matrix is a base matrix corresponding to QC-LDPC coding; and selecting the coding column block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm. By applying the scheme, the decoding performance can be improved.
Description
Technical Field
Embodiments of the present invention relate to the field of communications, and in particular, to a data retransmission method, a transmission device, a computer-readable medium, and a system.
Background
With the development of wireless communication technology, New Radio (NR) technology is introduced by 3 GPP. The NR system supports Quasi-Cyclic Low-Density Parity-Check code (QC-LDPC) encoding, LDPC encoding performance approaches to Shannon limit, decoding is simple, parallel operation can be carried out, and the method is suitable for hardware implementation.
For QC-LDPC coding, when Hybrid Automatic Repeat Request (HARQ) needs to be performed, the current method is implemented based on a virtual circular buffer (virtual circular buffer), that is, the coded bits obtained by QC-LDPC coding are stored in one virtual circular buffer, and when HARQ retransmission is needed, only the coded bits need to be read from the circular buffer in sequence for transmission.
The method has the advantages of simple hardware implementation and limited optimization space, only considers the initial position of retransmission and has certain performance loss.
Disclosure of Invention
The technical problem solved by the embodiment of the invention is how to select the coding bit for retransmission so as to improve the decoding performance.
To solve the foregoing technical problem, an embodiment of the present invention provides a method for data retransmission, where the method includes: dividing all coded bits into coding column blocks by using a base matrix, wherein each coding column block corresponds to one column of the base matrix, and the base matrix is a base matrix corresponding to QC-LDPC coding; and selecting the coding column block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm.
Optionally, the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scenario.
Optionally, the selecting, by using a preset differential evolution algorithm, a coding block with a lowest decoding threshold for retransmission includes: setting a decoding threshold as a target function; inputting the base matrix or the equivalent ground base map corresponding to the base matrix and the number of the coding column blocks needing to be retransmitted to the preset differential evolution algorithm; and retransmitting the coded column block based on the coded column block output by the preset differential evolution algorithm.
Optionally, the retransmitting based on the encoded column block output by the preset differential evolution algorithm includes: outputting the number vector of the retransmitted coded column block by using the preset differential evolution algorithm; and selecting the corresponding coding column block for retransmission based on the number vector of the coding column block.
Optionally, the preset differential evolution algorithm includes: initializing operation; mutation operation and selection operation; and an iteration termination operation.
Optionally, the initializing operation includes: setting the population size NP to 10D, and randomly generating NP D-dimensional real-valued parameter vectors as follows:
xi，G＝[x1，i，G，x2，i，G，xj，i，G，…，xD，i，G]，i＝1，2，…，NP
where D is the number of coded column blocks that need to be retransmitted, xj，i，GTaking a value in [0,1), wherein G is an index of a population algebra and is initialized to be 0;
according to the following formula, from xi，GCalculating the number vector c of the corresponding coded column blocki，G＝[c1，i，G，c2，i，G，…，cD，i，G]：
ci，G＝floor(xi，GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down;
according to the number vector c of the coded column blocki，GAnd the base matrix or the equivalent ground base map corresponding to the base matrix to obtain the corresponding modified base map BGi，GAnd calculating a corresponding decoding threshold ti，G＝h(BGi，G) Where h (-) is a calculation function of the decoding threshold.
Optionally, the mutation operation comprises: randomly selecting four different indexes r1, r2, r3 and r4 to generate a variation vector vi，G+1As follows:
vi，G+1＝xbest，G+0.5×(xr1，G-xr2，G+xr3，G-xr4，G)
wherein xbest，GAnd the parameter vector corresponding to the optimal decoding threshold.
Optionally, the selecting operation includes: calculating each variation vector vi，G+1Corresponding decoding threshold and summing it with xi，GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
optionally, the iterative operation comprises: judging whether a preset iteration number is reached; if the preset iteration times are reached, the iteration is stopped, and the optimal parameter vector x is outputbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1(ii) a If the preset iteration times are not reached, continuing to iteratively execute the mutation operation and the selection operation until the preset iteration times are reached, and terminating the iteration.
Optionally, the preset differential evolution algorithm further includes: and setting a crossover operation between the initialization operation and the iteration termination operation.
An embodiment of the present invention provides a transmission device, where the transmission device includes: a dividing unit, adapted to divide all encoded bits into encoded column blocks by using a base matrix, each encoded column block corresponding to a column of the base matrix, wherein the base matrix is a base matrix corresponding to QC-LDPC encoding; and the selection unit is suitable for selecting the coding column block with the lowest decoding threshold for retransmission by utilizing a preset differential evolution algorithm.
Optionally, the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scenario.
Optionally, the selecting unit includes: the setting subunit is suitable for setting the decoding threshold as a target function; the input subunit is suitable for inputting the base matrix or the equivalent ground base map corresponding to the base matrix and the number of the coding column blocks needing to be retransmitted to the preset differential evolution algorithm; and the retransmission subunit is suitable for retransmitting the coded column block output by the preset differential evolution algorithm.
Optionally, the retransmission subunit includes: the output module is suitable for outputting the number vector of the retransmitted coded column block by using the preset differential evolution algorithm; and the selection module is suitable for selecting the corresponding coding column block for retransmission based on the number vector of the coding column block.
Optionally, the output module includes: an initialization submodule adapted to initialize an operation; a mutation submodule adapted for mutation operations; a selection submodule adapted to select an operation; an iteration termination submodule adapted to iteratively terminate operations; and the output sub-module is suitable for outputting the number vector of the retransmitted coded column block.
Optionally, the initialization submodule includes: and the setting sub-module is suitable for setting the population size NP to be 10D and randomly generating NP D-dimensional real-value parameter vectors as follows:
xi，G＝[x1，i，G，x2，i，G，xj，i，G，…，xD，i，G]，i＝1，2，…，NP
where D is the number of coded column blocks that need to be retransmitted, xj,i,GTaking a value in [0,1), wherein G is an index of a population algebra and is initialized to be 0;
a first calculation submodule, adapted to calculate from xi,GCalculating the number vector c of the corresponding coded column blocki,G＝[c1,i,G,c2,i,G,…,cD,i,G]：
ci,G＝floor(xi，GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down;
a second calculation submodule adapted to calculate a vector c from the number of the coded column blocksi,GAnd the base matrix or the equivalent ground base map corresponding to the base matrix to obtain the corresponding modified base map BGi,GAnd calculating a corresponding decoding threshold ti,G＝h(BGi,G) Where h (-) is a calculation function of the decoding threshold.
Optionally, the variant submodule comprises: a generation submodule adapted to randomly select four different indices r1, r2, r3, r4, generate a variation vector vi,G+1As follows:
vi，G+1＝Xbest，G+0.5×(Xr1，G-Xr2，G+Xr3，G-Xr4，G)
wherein xbest,GAnd the parameter vector corresponding to the optimal decoding threshold.
Optionally, the selection submodule includes: a third calculation submodule adapted to calculate each of the variation vectors vi,G+1Corresponding decoding threshold and summing it with xi,GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
optionally, the iteration sub-module comprises: judgment submoduleIs suitable for judging whether the preset iteration times are reached or not; a first processing submodule adapted to terminate the iteration and output an optimal parameter vector x if a preset number of iterations is reachedbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1(ii) a And the second processing submodule is suitable for continuing to iteratively execute the variation submodule and the selection submodule if the preset iteration times are not reached, and terminating the iteration until the preset iteration times are reached.
Optionally, the output module further includes: and the cross submodule is suitable for carrying out cross operation.
The embodiment of the invention provides a computer readable medium, which stores computer instructions, and when the computer instructions are executed, the computer instructions execute the steps corresponding to any one of the methods.
The embodiment of the invention provides a sending system, which comprises a memory and a processor, wherein a computer instruction capable of running on the processor is stored in the memory, and the processor executes the steps corresponding to any one of the methods when running the computer instruction.
Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:
in the embodiment of the invention, all coded bits are divided into the coding column blocks by using the base matrix, each coding column block corresponds to one column of the base matrix, and then the coding column block with the lowest decoding threshold is selected for retransmission by using a preset differential evolution algorithm, namely the coding column block with the best decoding performance is selected for retransmission, so that the decoding performance can be improved.
Drawings
Fig. 1 is a flowchart of a method for retransmitting data according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a base matrix provided by an embodiment of the invention;
fig. 3 is a schematic structural diagram of a sending device according to an embodiment of the present invention.
Detailed Description
In the existing QC-LDPC coding system, HARQ retransmission is implemented based on a virtual circular buffer (virtual circular buffer), that is, coded bits obtained by QC-LDPC coding are stored in one virtual circular buffer, and when HARQ retransmission is required, only the coded bits need to be read from the circular buffer in sequence for transmission. The method has the advantages of simple hardware implementation and limited optimization space, only considers the initial position of retransmission and has certain performance loss.
According to the embodiment of the invention, all coded bits are divided into the coding column blocks by using the base matrix, each coding column block corresponds to one column of the base matrix, and then the coding column block with the lowest decoding threshold is selected for retransmission by using a preset differential evolution algorithm, so that the decoding performance can be improved.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, a specific embodiment thereof is described in detail with reference to the accompanying drawings, as shown in fig. 1.
Referring to fig. 1, a method for retransmitting data according to an embodiment of the present invention may include the following steps:
s101, dividing all coded bits into coding column blocks by using a base matrix, wherein each coding column block corresponds to one column of the base matrix, and the base matrix is a base matrix corresponding to QC-LDPC coding.
In a specific implementation, the bits after the QC-LDPC encoding may be divided into encoding column blocks based on a base matrix corresponding to the QC-LDPC encoding, where each encoding column block corresponds to a column of the base matrix. During retransmission, the coded column block is used as a unit for retransmission, that is, a certain coded column block is retransmitted in the whole block, or any bit of the whole block is not retransmitted. Under the premise, when data is retransmitted, only which coding column block needs to be selected for retransmission needs to be considered, which is a combination optimization problem.
In an embodiment of the present invention, the base matrix may be a base matrix corresponding to a second base map in a 5G eMBB scenario, and corresponds to 42 rows and 52 columns.
And S102, selecting the coding column block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm.
In specific implementation, the coding column block with the lowest decoding threshold may be selected for retransmission based on a preset differential evolution algorithm, so as to improve decoding performance.
In an embodiment of the present invention, a preset differential evolution algorithm is used, a decoding threshold is set as a target function, then the base matrix or an equivalent base map corresponding to the base matrix and the number of the encoded column blocks that need to be retransmitted are input to the preset differential evolution algorithm, and finally retransmission is performed according to the encoded column blocks output based on the preset differential evolution algorithm.
In specific implementation, since the differential evolution algorithm is an effective evolution algorithm for solving the global optimization problem in the continuous real-valued space, different coding column blocks are indicated by using the number vectors, and the number vector corresponding to the optimal coding column block is selected by using a preset differential evolution algorithm.
In an embodiment of the present invention, the number vector of the retransmitted encoded column block may be output by using the preset differential evolution algorithm; and selecting the corresponding coding column block for retransmission based on the number vector of the coding column block.
In a specific implementation, the preset differential evolution algorithm may be a biological genetic algorithm, and the genetic algorithm is an evolution algorithm for simulating a biological evolution process and searching for an optimal solution. The method comprises the following steps: universal genetic algorithm, improved genetic algorithm, immune genetic algorithm and other various sub-algorithms.
In a specific implementation, the preset differential evolution algorithm may include: initializing operation; mutation operation and selection operation; and an iteration termination operation. In order to improve the search effect, a crossover operation can be added between the initialization operation and the iteration termination operation. There are many implementation methods for mutation operation and crossover operation, and in specific implementation, an appropriate mutation operation method and crossover operation method can be selected according to the computational complexity and performance requirements.
In an embodiment of the present invention, the initializing may include the following steps:
setting the population size NP to 10D, and randomly generating NP D-dimensional real-valued parameter vectors as follows:
xi，G＝[x1，i，G，x2，i，G，xj，i，G，…，xD，i，G]，i＝1，2，…，NP
where D is the number of coded column blocks that need to be retransmitted, xj，i，GThe value is taken in [0,1), G is an index of a population algebra, and G is initialized to 0.
According to the following formula, from xi，GCalculating the number vector c of the corresponding coded column blocki，G＝[c1，i，G，c2，i，G，…，cD，i，G]：
ci，G＝floor(xi，GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down.
According to the number vector c of the coded column blocki，GAnd the base matrix or the equivalent ground base map corresponding to the base matrix to obtain the corresponding modified base map BGi，GAnd calculating a corresponding decoding threshold ti，G＝h(BGi，G) Where h (-) is a calculation function of the decoding threshold, from BGi，GCalculating ti，GThe existing technologies may be adopted, and the embodiments of the present invention are not limited.
By applying the initialization operation and using the number vectors of the coded column blocks to identify the corresponding coded column blocks, the combinatorial optimization problem can be converted into a global optimization problem on a continuous real-valued space, so that the differential evolution algorithm can be adopted for processing.
In an embodiment of the present invention, the mutation operation may include:
randomly selecting four different indexes r1, r2, r3 and r4 to generate a variation vector vi，G+1As follows:
vi，G+1＝xbest，G+0.5×(xr1，G-xr2，G+xr3，G-xr4，G)
wherein xbest，GAnd the parameter vector corresponding to the optimal decoding threshold.
In an embodiment of the present invention, the selecting operation may include the following steps:
calculating each variation vector vi，G+1Corresponding decoding threshold and summing it with xi，GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
in an embodiment of the present invention, the iterative operation may include the following steps:
judging whether a preset iteration number is reached;
if the preset iteration times are reached, the iteration is stopped, and the optimal parameter vector x is outputbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1；
If the preset iteration times are not reached, continuing to iteratively execute the mutation operation and the selection operation until the preset iteration times are reached, and terminating the iteration.
It is to be understood that, in a specific implementation, the preset differential evolution algorithm may also adopt other implementation manners, and the above specific embodiment does not limit the scope of the present invention.
In order to make the present invention better understood and implemented by those skilled in the art, the embodiment of the present invention further provides a schematic diagram of a base matrix, as shown in fig. 2.
Referring to fig. 2, the base matrix is a base matrix corresponding to a second base map in a 5G Enhanced Mobile Broadband (eMBB) scenario and has a size of 42 × 52, that is, 42 rows and 52 columns. Where the first 10 columns correspond to information packets, i.e., Kb is 10, the highest supported code rate is 2/3.
In the specific implementation, the number of bits for each retransmission is set to be the same, the maximum number of transmission times is set to be 4, when data transmission is performed at the highest code rate 2/3, the first 2 columns are not transmitted, and the number of the first-sent coded column block may be 2-16, which is 15 columns in total. If the first transmission fails, the next 15 columns can be transmitted in the same direction, i.e. compiled15 coded column blocks numbered 17 to 31. The 3 rd transmission may transmit the 15 blocks of encoded columns numbered 32 through 46. When transmitting 4, the remaining block of coded columns is only 5. Therefore, in addition to the 5 encoded column blocks, 10 encoded column blocks must be selected from the existing 50 encoded column blocks (from the 50 encoded column blocks numbered 2 to 51) for retransmission. If the current technique (i.e. sequential retransmission) is used to select the retransmission of the coded column block, 10 coded column blocks numbered 2 to 11 are transmitted, and the corresponding decoding threshold is
If the method shown in fig. 1 is adopted, based on the preset evolutionary algorithm, the coded column blocks numbered 9, 14, 15, 20, 22, 23, 24, 25, 29 and 37 are selected for retransmission, and the corresponding decoding thresholds are
There is a gain of 0.207dB compared to sequential transmission.
In order to make those skilled in the art better understand and implement the present invention, the embodiment of the present invention further provides a transmitting device capable of implementing the above-mentioned data retransmission method, as shown in fig. 3.
Referring to fig. 3, the transmitting apparatus 30 includes: a segmentation unit 31 and a selection unit 32, wherein:
the dividing unit 31 is adapted to divide all the coded bits into coded column blocks by using a base matrix, each coded column block corresponds to one column of the base matrix, and the base matrix is a base matrix corresponding to the QC-LDPC code.
The selecting unit 32 is adapted to select the coding column block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm.
In an embodiment of the present invention, the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scenario.
In a specific implementation, the selecting unit 32 may include: a setup subunit 321, an input subunit 322, and a retransmission subunit 323, wherein:
the setting subunit 321 is adapted to set the decoding threshold as an objective function.
The input subunit 322 is adapted to input the base matrix or the equivalent ground graph corresponding to the base matrix, and the number of the coded column blocks that need to be retransmitted to the preset differential evolution algorithm.
The retransmission subunit 323 is adapted to perform retransmission based on the encoded column block output by the preset differential evolution algorithm.
In an embodiment of the present invention, the retransmission subunit 323 includes: an output module (not shown) and a selection module (not shown), wherein:
and the output module is suitable for outputting the number vector of the retransmitted coding column block by utilizing the preset differential evolution algorithm.
And the selection module is suitable for selecting the corresponding coding column block for retransmission based on the number vector of the coding column block.
In a specific implementation, the output module may include: an initialization sub-module (not shown), a mutation sub-module (not shown), a selection sub-module (not shown), an iteration termination sub-module (not shown), and an output sub-module (not shown), wherein:
the initialization submodule is suitable for initialization operation.
And the mutation submodule is suitable for mutation operation.
The selection submodule is suitable for selection operation.
The iteration termination submodule is suitable for iteration termination operation.
And the output sub-module is suitable for outputting the number vector of the retransmitted coded column block.
In an embodiment of the present invention, the initialization sub-module includes: a setting sub-module (not shown), a first calculation sub-module (not shown), and a second calculation sub-module (not shown), wherein:
the setting submodule is suitable for setting the population size NP to 10D and randomly generating NP D-dimensional real-value parameter vectors, and the method is as follows:
xi，G＝[x1，i，G，x2，i，G，xj，i，G，…，xD，i，G]，i＝1，2，…，NP
where D is the number of coded column blocks that need to be retransmitted, xj，i，GThe value is taken in [0,1), G is an index of a population algebra, and G is initialized to 0.
The first calculation submodule is adapted to calculate x from the following formulai，GCalculating the number vector c of the corresponding coded column blocki，G＝[c1，i，G，c2，i，G，…，cD，i，G]：
ci，G＝floor(xi，GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down.
The second calculation submodule is suitable for calculating the number vector c according to the coded column blocki，GAnd the base matrix or the equivalent ground base map corresponding to the base matrix to obtain the corresponding modified base map BGi，GAnd calculating a corresponding decoding threshold ti，G＝h(BGi，G) Where h (-) is a calculation function of the decoding threshold.
In an embodiment of the present invention, the variant submodule includes: a generation submodule (not shown) adapted to randomly select four different indices r1, r2, r3, r4, generate a variation vector vi，G+1As follows:
vi，G+1＝xbest，G+0.5×(xr1，G-xr2，G+xr3，G-xr4，G)
wherein xbest，GAnd the parameter vector corresponding to the optimal decoding threshold.
In an embodiment of the present invention, the selection sub-module includes: a third calculation submodule (not shown) adapted to calculate each of the variation vectors vi，G+1Corresponding decoding threshold and summing it with xi，GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
in an embodiment of the present invention, the iteration sub-module includes: a judgment sub-module (not shown), a first processing sub-module (not shown), and a second processing sub-module (not shown), wherein:
and the judgment submodule is suitable for judging whether the preset iteration times are reached.
The first processing submodule is suitable for terminating iteration and outputting an optimal parameter vector x if a preset iteration number is reachedbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1。
And the second processing submodule is suitable for continuing to iteratively execute the variation submodule and the selection submodule if the preset iteration number is not reached, and terminating the iteration until the preset iteration number is reached.
In a specific implementation, the output module may further include: and the cross submodule is suitable for carrying out cross operation.
The embodiment of the present invention further provides a computer-readable medium, on which computer instructions are stored, and when the computer instructions are executed, steps corresponding to any of the methods described above are not described herein again.
In particular implementations, the computer-readable storage medium may include: ROM, RAM, magnetic or optical disks, and the like.
The embodiment of the present invention further provides a sending system, which includes a memory and a processor, where the memory stores a computer instruction capable of running on the processor, and the processor executes, when running the computer instruction, the step corresponding to any one of the methods described above, which is not described herein again.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (14)
1. A method of data retransmission, comprising:
dividing all coded bits into coding column blocks by using a base matrix, wherein each coding column block corresponds to one column of the base matrix, and the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scene;
selecting the coding column block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm;
the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scene;
the selecting the coding block with the lowest decoding threshold for retransmission by using a preset differential evolution algorithm comprises the following steps: setting a decoding threshold as a target function; inputting the base matrix or an equivalent base graph corresponding to the base matrix and the number of the coding column blocks needing to be retransmitted to the preset differential evolution algorithm; retransmitting the coded column block output by the preset differential evolution algorithm;
the retransmitting of the coded column block output based on the preset differential evolution algorithm comprises: outputting the number vector of the retransmitted coded column block by using the preset differential evolution algorithm; selecting a corresponding coding column block for retransmission based on the number vector of the coding column block;
the preset differential evolution algorithm comprises the following steps: an initialization operation, a mutation operation, a selection operation, and an iteration termination operation.
2. The method of data retransmission according to claim 1, wherein the initialization operation comprises:
setting the population size NP to 10D, and randomly generating NP D-dimensional real-valued parameter vectors as follows:
xi,G＝[x1,i,G,x2,i,G,xj,i,G,…,xD,i,G],i＝1,2,…,NP
where D is the number of coded column blocks that need to be retransmitted, xj,i,GTaking a value in [0,1), wherein G is an index of a population algebra and is initialized to be 0;
according to the following formula, from xi,GCalculating a number vector for a corresponding block of encoded columnsci,G＝[c1,i,G,c2,i,G,…,cD,i,G]：
ci,G＝floor(xi,GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down;
according to the number vector c of the coded column blocki,GAnd the base matrix or the equivalent base map corresponding to the base matrix to obtain the corresponding modified base map BGi,GAnd calculating a corresponding decoding threshold ti,G＝h(BGi,G) Where h (-) is a calculation function of the decoding threshold.
3. The method of claim 2, wherein the mutation operation comprises: randomly selecting four different indexes r1, r2, r3 and r4 to generate a variation vector vi,G+1As follows:
vi,G+1＝xbest,G+0.5×(xr1,G-xr2,G+xr3,G-xr4,G)
wherein xbest,GAnd the parameter vector corresponding to the optimal decoding threshold.
4. The method of claim 3, wherein the selecting operation comprises: calculating each variation vector vi,G+1Corresponding decoding threshold and summing it with xi,GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
5. the method of data retransmission according to claim 4, wherein the iterative operation comprises: judging whether a preset iteration number is reached;
if the preset iteration times are reached, the iteration is stopped, and the optimal parameters are outputVector xbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1；
If the preset iteration times are not reached, continuing to iteratively execute the mutation operation and the selection operation until the preset iteration times are reached, and terminating the iteration.
6. The method for retransmitting data according to claim 1, wherein the predetermined differential evolution algorithm further comprises: and setting a crossover operation between the initialization operation and the iteration termination operation.
7. A transmitting device, comprising:
a partitioning unit adapted to partition all encoded bits into encoded column blocks using a base matrix, each encoded column block corresponding to a column of the base matrix, wherein the base matrix is a base matrix corresponding to a second base map in a 5G eMBB scene;
the selection unit is suitable for selecting the coding column block with the lowest decoding threshold for retransmission by utilizing a preset differential evolution algorithm;
the selection unit includes: the setting subunit is suitable for setting the decoding threshold as a target function; the input subunit is suitable for inputting the base matrix or the equivalent base graph corresponding to the base matrix and the number of the coding column blocks needing to be retransmitted to the preset differential evolution algorithm; the retransmission subunit is suitable for retransmitting the coded column blocks output by the preset differential evolution algorithm;
the retransmission subunit includes: the output module is suitable for outputting the number vector of the retransmitted coded column block by using the preset differential evolution algorithm; the selection module is suitable for selecting the corresponding coding column block for retransmission based on the number vector of the coding column block;
the output module includes: an initialization submodule adapted to initialize an operation; a mutation submodule adapted for mutation operations; a selection submodule adapted to select an operation; an iteration termination submodule adapted to iteratively terminate operations; and the output sub-module is suitable for outputting the number vector of the retransmitted coded column block.
8. The transmitting device of claim 7, wherein the initialization submodule comprises: and the setting sub-module is suitable for setting the population size NP to be 10D and randomly generating NP D-dimensional real-value parameter vectors as follows:
xi,G＝[x1,i,G,x2,i,G,xj,i,G,…,xD,i,G],i＝1,2,…,NP
where D is the number of coded column blocks that need to be retransmitted, xj,i,GTaking a value in [0,1), wherein G is an index of a population algebra and is initialized to be 0;
a first calculation submodule, adapted to calculate from xi,GCalculating the number vector c of the corresponding coded column blocki,G＝[c1,i,G,c2,i,G,…,cD,i,G]：
ci,G＝floor(xi,GM)
Where M represents the number of columns in the base matrix and floor (·) represents rounding down;
a second calculation submodule adapted to calculate a vector c from the number of the coded column blocksi,GAnd the base matrix or the equivalent base map corresponding to the base matrix to obtain the corresponding modified base map BGi,GAnd calculating a corresponding decoding threshold ti,G＝h(BGi,G) Where h (-) is a calculation function of the decoding threshold.
9. The transmitting device of claim 8, wherein the mutation submodule comprises:
a generation submodule adapted to randomly select four different indices r1, r2, r3, r4, generate a variation vector vi,G+1As follows:
vi,G+1＝xbest,G+0.5×(xr1,G-xr2,G+xr3,G-xr4,G)
wherein xbest,GAnd the parameter vector corresponding to the optimal decoding threshold.
10. The transmitting device of claim 9, wherein the selection submodule comprises:
a third calculation submodule adapted to calculate each of the variation vectors vi,G+1Corresponding decoding threshold and summing it with xi,GComparing the corresponding decoding thresholds, and selecting the smaller decoding threshold as the ith parameter vector in the next generation as follows:
11. the transmitting device of claim 10, wherein the iteration sub-module comprises:
the judgment submodule is suitable for judging whether the preset iteration times are reached or not;
a first processing submodule adapted to terminate the iteration and output an optimal parameter vector x if a preset number of iterations is reachedbest,G+1Number vector c of corresponding coded column blockbest,G+1And tbest,G+1；
And the second processing submodule is suitable for continuing to iteratively execute the variation submodule and the selection submodule if the preset iteration times are not reached, and terminating the iteration until the preset iteration times are reached.
12. The transmitting device of claim 7, wherein the output module further comprises: and the cross submodule is suitable for carrying out cross operation.
13. A computer readable medium having stored thereon computer instructions, wherein said computer instructions when executed perform the steps corresponding to the method of any one of claims 1 to 6.
14. A transmission system comprising a memory and a processor, the memory having stored thereon computer instructions executable on the processor, the processor executing the computer instructions to perform steps corresponding to the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710810950.4A CN109474390B (en) | 2017-09-08 | 2017-09-08 | Data retransmission method, transmission device, computer readable medium and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710810950.4A CN109474390B (en) | 2017-09-08 | 2017-09-08 | Data retransmission method, transmission device, computer readable medium and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109474390A CN109474390A (en) | 2019-03-15 |
| CN109474390B true CN109474390B (en) | 2021-02-19 |
Family
ID=65657986
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710810950.4A Active CN109474390B (en) | 2017-09-08 | 2017-09-08 | Data retransmission method, transmission device, computer readable medium and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109474390B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110061813B (en) * | 2019-04-09 | 2022-10-04 | 惠州市仲恺Tcl智融科技小额贷款股份有限公司 | Data encoding method, data decoding method and related devices |
| CN118353477B (en) * | 2024-06-17 | 2024-09-10 | 华侨大学 | Method, device, equipment and medium for constructing lossy original pattern LDPC source codes |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104253617A (en) * | 2013-06-27 | 2014-12-31 | 山东量子科学技术研究院有限公司 | Quick optimizing method for degree distribution of long LDPC (low density parity check) codes |
| CN104393877A (en) * | 2014-12-03 | 2015-03-04 | 西安电子科技大学 | Irregular LDPC code linear programming decoding method based on weighting |
| CN105577194A (en) * | 2015-12-22 | 2016-05-11 | 西安电子科技大学 | Construction method for multi-code low density verification LDPC code with fixed code length |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8359522B2 (en) * | 2007-05-01 | 2013-01-22 | Texas A&M University System | Low density parity check decoder for regular LDPC codes |
-
2017
- 2017-09-08 CN CN201710810950.4A patent/CN109474390B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104253617A (en) * | 2013-06-27 | 2014-12-31 | 山东量子科学技术研究院有限公司 | Quick optimizing method for degree distribution of long LDPC (low density parity check) codes |
| CN104393877A (en) * | 2014-12-03 | 2015-03-04 | 西安电子科技大学 | Irregular LDPC code linear programming decoding method based on weighting |
| CN105577194A (en) * | 2015-12-22 | 2016-05-11 | 西安电子科技大学 | Construction method for multi-code low density verification LDPC code with fixed code length |
Non-Patent Citations (2)
| Title |
|---|
| Encoding entanglement-assisted quantum stabilizer codes;Wang Yun Jiang等;《Chinese Physics B》;20120215;第21卷(第2期);全文 * |
| LDPC码构造方法和编码算法研究;房明;《中国优秀硕士学位论文全文数据库》;20140306(第4期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109474390A (en) | 2019-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105340183B (en) | A kind of interpretation method and device of polar code | |
| CN105680879B (en) | The ldpc decoder design method of compatible with DVB-S2X standard | |
| US10033407B2 (en) | Optimization of low density parity-check code encoder based on a search for an independent set of nodes | |
| CN1783729A (en) | Method and apparatus for decoding low density parity check code using united node processing | |
| CN108282259B (en) | Coding method and device | |
| WO2020077596A1 (en) | Decoding method and apparatus for ldpc codes | |
| US10135466B2 (en) | Data sending method and apparatus | |
| CN109474390B (en) | Data retransmission method, transmission device, computer readable medium and system | |
| CN104124980B (en) | It is adapted to the high speed secret negotiation method of continuous variable quantum key distribution | |
| CN109818626B (en) | Method for decoding low density parity check code, decoder and memory system | |
| EP3879709A1 (en) | Coding method and apparatus, decoding method and apparatus | |
| US10892783B2 (en) | Apparatus and method for decoding polar codes | |
| CN111541517A (en) | List polarization code propagation decoding method | |
| EP3884584B1 (en) | Learning in communication systems | |
| CN114448446A (en) | Underwater optical communication LDPC coding processing method and device and computer readable storage medium | |
| KR20080072392A (en) | Apparatus and method for receiving signal in a communication system | |
| CN109974716B (en) | Geographic position matching method and device, storage medium and server | |
| Bartan et al. | Straggler resilient serverless computing based on polar codes | |
| EP2991231A1 (en) | Multilevel encoding and multistage decoding | |
| US11171673B2 (en) | Decoding method and apparatus | |
| KR102184858B1 (en) | Data transmission method, transmission device, and reception device | |
| CN117097350A (en) | LDPC code decoding realization method, device, equipment and medium | |
| CN111490798B (en) | Decoding method and decoding device | |
| US10341056B2 (en) | Decoding apparatus and method in mobile communication system using non-binary low-density parity-check code | |
| US20220271776A1 (en) | Method and apparatus for performing encoding on basis of parity check matrix of low density parity check code generated from protograph in wireless communication system |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100089 18 / F, block B, Zhizhen building, No.7, Zhichun Road, Haidian District, Beijing Applicant after: Beijing Ziguang zhanrui Communication Technology Co.,Ltd. Address before: 100084, Room 516, building A, Tsinghua Science Park, Beijing, Haidian District Applicant before: BEIJING SPREADTRUM HI-TECH COMMUNICATIONS TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |