CN115765760A - Coding parameter identification method, device, equipment and storage medium - Google Patents
Coding parameter identification method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115765760A CN115765760A CN202211368777.4A CN202211368777A CN115765760A CN 115765760 A CN115765760 A CN 115765760A CN 202211368777 A CN202211368777 A CN 202211368777A CN 115765760 A CN115765760 A CN 115765760A
- Authority
- CN
- China
- Prior art keywords
- coding
- sequence
- codeword sequence
- self
- parameters
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 75
- 230000006854 communication Effects 0.000 claims abstract description 25
- 238000004891 communication Methods 0.000 claims abstract description 24
- 238000004590 computer program Methods 0.000 claims description 19
- 239000011159 matrix material Substances 0.000 claims description 16
- 230000008569 process Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 2
- 230000009977 dual effect Effects 0.000 description 2
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a coding parameter identification method, a coding parameter identification device, coding parameter identification equipment and a storage medium. Wherein, the method comprises the following steps: taking a group of coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by a number of sets of encoding parameters corresponding to the encoding type of the received codeword sequence; decoding the receiving code word sequence based on the target coding parameter to obtain a decoding result; coding the decoding result to obtain a self-coding codeword sequence; if the self-coding code word sequence is matched with the receiving code word sequence, the target coding parameter is used as the coding parameter of the receiving code word sequence; and if the two are not matched, taking out the next group of coding parameters from the closed set as target coding parameters, and returning to the operation of decoding the received code word sequence based on the target coding parameters. By implementing the technical scheme, the encoding parameter can be simply and quickly identified under the non-cooperative communication environment.
Description
Technical Field
The present invention relates to the field of blind identification technologies, and in particular, to a method, an apparatus, a device, and a storage medium for identifying coding parameters.
Background
A Low Density Parity Check Code (LDPC) is a packet error correction Code having a sparse Check matrix, and is applicable to almost all channels, and thus has been a hot research topic in recent years in the coding field. The performance of the method approaches to the Shannon limit, the description and the implementation are simple, the theoretical analysis and the research are easy to carry out, the decoding is simple, the parallel operation can be carried out, and the method is suitable for hardware implementation.
Under the cooperative communication environment, the receiving end knows the frame length N, the code rate R and the check matrix H of the received LDPC code word sequence, so that decoding can be easily carried out. However, in a non-cooperative communication environment, the receiving end lacks knowledge of LDPC coding parameters, and therefore decoding is difficult.
Disclosure of Invention
The invention provides a method, a device, equipment and a storage medium for identifying coding parameters, which can simply and quickly identify the coding parameters, can also realize blind identification in a severe communication environment and improve the working efficiency.
In a first aspect, an embodiment of the present application provides a method for identifying a coding parameter, where the method includes:
taking a group of coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by sets of encoding parameters corresponding to encoding types of the received codeword sequence;
decoding the receiving code word sequence based on the target coding parameter to obtain a decoding result;
coding the decoding result to obtain a self-coding codeword sequence;
if the self-coding code word sequence is matched with the receiving code word sequence, the target coding parameter is used as the coding parameter of the receiving code word sequence;
and if the self-coding code word sequence is not matched with the receiving code word sequence, taking out a next group of coding parameters from the closed set as target coding parameters, and returning to the operation of decoding the receiving code word sequence based on the target coding parameters.
In a second aspect, an embodiment of the present application provides an apparatus for identifying an encoding parameter, where the apparatus includes:
the selecting module is used for taking out a group of coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by sets of encoding parameters corresponding to encoding types of the received codeword sequence;
the decoding module is used for decoding the received code word sequence based on the target coding parameter to obtain a decoding result;
the self-coding module is used for coding the decoding result to obtain a self-coding codeword sequence;
a determining module, configured to use the target coding parameter as a coding parameter of the received codeword sequence if the self-coding codeword sequence matches the received codeword sequence;
and the return module is used for taking out the next group of coding parameters from the closed set to be used as target coding parameters if the self-coding code word sequence is not matched with the receiving code word sequence, and returning the operation of decoding the receiving code word sequence based on the target coding parameters.
In a third aspect, an embodiment of the present application provides an electronic device, where the electronic device includes:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the encoding parameter identification method of any of the embodiments of the present invention.
According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the encoding parameter identification method according to any one of the embodiments of the present invention when the computer instructions are executed.
The technical scheme of the embodiment of the invention provides a novel coding parameter identification method, which can decode and encode a received code word sequence on the basis of taking out coding parameters as target coding parameters in a preset closed set, and then determine whether the coding parameters of the received code word sequence are the target coding parameters according to the matching result of the self-coding code word sequence and the received code word sequence, thereby realizing the blind identification and blind decoding effect under the non-cooperative communication environment or the condition that a receiving end lacks the recognition of the coding parameters of the received code word sequence, and greatly reducing the difficulty of coding parameter identification.
It should be understood that the statements in this section are not intended to identify key or critical features of the embodiments of the present invention, nor are they intended to limit the scope of the invention. Other features of the present invention will become apparent from the following description.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a coding parameter identification method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a coding parameter identification method according to a second embodiment of the present invention;
FIG. 3A is a flowchart of a method for identifying encoding parameters according to a third embodiment of the present invention;
fig. 3B is a schematic diagram of a specific application scenario obtained by the method according to the third embodiment of the present invention;
fig. 3C is a schematic diagram of a specific application scenario obtained by the method according to the third embodiment of the present invention;
fig. 4 is a schematic structural diagram of an encoding parameter identification apparatus according to a fourth embodiment of the present invention;
FIG. 5 illustrates a block diagram of an electronic device 10 that may be used to implement an embodiment of the invention.
Detailed Description
In order to make those skilled in the art better understand the technical solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in other sequences than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example one
Fig. 1 is a flowchart of a coding parameter identification method according to an embodiment of the present invention; the embodiment can be applied to the condition of blind identification of the coding parameters under the non-cooperative communication environment; the method may be executed by the encoding parameter identification apparatus provided in this embodiment, and the encoding parameter identification apparatus may be implemented in the form of hardware and/or software, and may be configured in an electronic device that executes the method.
Referring to fig. 1, the method of the present embodiment includes, but is not limited to, the following steps:
s110, taking a group of coding parameters from a preset closed set as target coding parameters;
wherein the closed set is formed by sets of encoding parameters corresponding to the encoding type of the received codeword sequence.
Wherein, two or more groups of different coding parameters exist in the preset closed set;
wherein the coding type of the coding parameter is the same as the coding type of the received code word sequence;
in the embodiment of the present invention, before S110, a preset closed set may be constructed. Optionally, the coding type of the received codeword sequence may be LDPC coding, BCH coding, or other coding types. In the embodiment of the invention, the LDPC coding with the optional coding type has better boundary of the signal to noise ratio of the LDPC coding, and the method can be applied to the severe environment and can also be used for identification.
Specifically, all the possible encoding parameters corresponding to the encoding type of the received codeword sequence form a closed set, for example, if the received codeword sequence is LDPC encoding, the possible encoding parameters may include 20 groups.
In the embodiment of the present invention, optionally, after the closed set is formed, the encoding parameters may be sequentially selected from the closed set as target encoding parameters, so that decoding is performed based on the target encoding parameters, and then judgment is performed.
And S120, decoding the received code word sequence based on the target coding parameter to obtain a decoding result.
In the embodiment of the invention, different coding parameters correspond to different decoding modes, decoding is carried out based on different coding parameters, the obtained decoding results are different, and the coding parameters comprise N and K; wherein, N is the frame length of the received code word sequence, and K is the information length. Therefore, in this embodiment, the decoding and re-encoding based on the target encoding parameter is selected and compared with the received codeword sequence to determine whether the target encoding parameter is correct.
For example, if the received codeword sequence with length N is X, a set of encoding parameters of the closed set C is selected, and the received codeword sequence X is decoded based on the encoding parameters, so as to obtain the hypothetical sequence U with length K. Wherein, U is the decoding result.
And S130, coding the decoding result to obtain a self-coding codeword sequence.
In the embodiment of the invention, the decoding result is encoded through a fixed function to obtain the self-encoding codeword sequence, so that the self-encoding codeword sequence is matched with the receiving codeword sequence. The self-coding code word sequence and the receiving code word sequence may be different, and the process of decoding the receiving code word sequence and then coding is not a reversible process, so that the self-coding code word sequence obtained by adopting the method is matched with the receiving code word sequence, and whether the selected target coding parameter is the coding parameter of the receiving code word sequence is judged.
As described above, the decoding result U may be encoded to obtain a self-encoded codeword sequence X2 with a length N.
S140, judging whether the self-coding code word sequence is matched with the receiving code word sequence.
In the embodiment of the present invention, it is determined whether the self-encoded codeword sequence matches the received codeword sequence, which may specifically be determined whether the check bit portion of the self-encoded codeword sequence matches the received codeword. Specifically, it may be determined whether the ratio of the self-encoded codeword sequence to the parity bit portion of the received codeword is less than a decision threshold. For example, the parity bit portions of received codeword sequence X and self-encoded codeword sequence X2 may be compared for a match.
And S150, taking the target coding parameter as a coding parameter of the received code word sequence.
In the embodiment of the present invention, if the self-encoding codeword sequence matches the received codeword sequence, the encoding target encoding parameter is the encoding parameter of the received codeword sequence, and therefore the target encoding parameter is used as the encoding parameter of the received codeword sequence.
And S160, taking the next group of coding parameters from the closed set as target coding parameters.
In the embodiment of the present invention, if the self-encoded codeword sequence does not match the received codeword sequence, the next set of encoding parameters is taken out from the closed set as the target encoding parameters, and the process returns to S120 until the self-encoded codeword sequence matches the received codeword sequence. Wherein the next group of coding parameters is another group of coding parameters different from the parameters selected in the above step.
In the embodiment of the present invention, the technical solution provided in the embodiment of the present invention may further include: and if the coding parameters in the preset closed set are traversed and the self-coding code word sequence is not matched with the receiving code word sequence, judging that the identification fails. Optionally, after the identification fails, the traversal may be performed again for identification, or the identification may be performed in another manner.
The technical scheme provided by this embodiment provides a new coding parameter identification method, and the method can decode and re-encode a received codeword sequence on the basis of taking out coding parameters in a preset closed set as target coding parameters, and then determine whether the coding parameters of the received codeword sequence are the target coding parameters according to a matching result of a self-coding codeword sequence and the received codeword sequence, so that the blind identification blind decoding effect under a non-cooperative communication environment or a condition that a receiving end lacks recognition of the coding parameters of the received codeword sequence is realized, and the difficulty in coding parameter identification is greatly reduced.
Example two
Fig. 2 is a flowchart of a coding parameter identification method according to a second embodiment of the present invention, which specifically explains a matching situation between a self-coding codeword sequence and a receiving codeword sequence based on the first embodiment, wherein specific contents of steps S210 to S240 are substantially the same as those of steps S110 to S140 in the first embodiment, and thus the detailed description is omitted in this embodiment, as shown in fig. 2, the method includes: as shown in fig. 2, the technical solution provided by the embodiment of the present invention includes:
as shown in fig. 2, the technical solution provided by the embodiment of the present invention includes:
s210: taking a group of coding parameters from a preset closed set as target coding parameters;
wherein the closed set is formed by a number of sets of encoding parameters corresponding to the encoding type of the received codeword sequence;
s220: decoding the received code word sequence based on the target coding parameter to obtain a decoding result;
s230: coding the decoding result to obtain a self-coding codeword sequence;
s240: and judging whether the check bit part of the self-coding code word sequence is matched with the check bit part of the receiving code word sequence.
In the embodiment of the present invention, the parity bit part is (N-K) bits after the code word needs to be encoded and the received code word sequence.
If yes, go to step S250, otherwise, go to step S260.
S250: and taking the target coding parameter as a coding parameter of the received code word sequence.
In this embodiment of the present invention, optionally, if the self-encoded codeword sequence matches the parity bit part of the received codeword sequence, the taking the target coding parameter as the coding parameter of the received codeword sequence includes: if the different proportion of the self-coding codeword sequence to the rear M-bit codeword of the received codeword sequence is smaller than a decision threshold, taking the target coding parameter as the coding parameter of the received codeword sequence; and M = N-K, wherein N is the frame length of the received codeword sequence, K is the information length, and the last M bits of the received codeword sequence are the check part of the received codeword sequence.
In the embodiment of the present invention, the decision threshold may be set as needed, and optionally, if the self-coding sequence is the same as the last M-bit codeword of the received codeword sequence, the target coding parameter is used as the coding parameter of the received codeword sequence.
S260: and taking out the next group of coding parameters from the closed set as target coding parameters, and returning to S220.
In this embodiment of the present invention, optionally, if the parity bit part of the self-encoded codeword sequence does not match the parity bit part of the received codeword sequence, taking out the next set of encoding parameters from the closed set as target encoding parameters, includes: and if the different proportion of the self-coding codeword sequence to the rear M-bit codeword of the receiving codeword sequence is greater than a decision threshold, taking out a next group of coding parameters from the closed set as target coding parameters. If the different ratio of the self-coding codeword sequence to the rear M-bit codeword of the received codeword sequence is greater than the decision threshold, it indicates that the target coding parameters used in the coding process of the received codeword sequence are not accurate, which results in a large difference between the self-coding codeword sequence and the received codeword sequence, and therefore a next set of coding parameters needs to be taken out from the closed set as target coding parameters, and the step returns to S220 until the self-coding codeword sequence is matched with the received codeword sequence.
Therefore, the received code word sequence is matched with the rear M bits of the self-coding code word sequence, so that the correct target coding parameter is obtained, the coding parameter can be quickly identified, and the identification efficiency is improved.
In the embodiment of the present invention, optionally, the technical solution provided in the embodiment of the present invention may further include: and inquiring a check matrix based on the coding parameters of the received codeword sequence, and checking the decoding result based on the check matrix. After the coding parameters of the received codeword sequence are obtained, the check matrix corresponding to the coding parameters can be queried from the existing data in a query mode, so that the check on the decoding result is realized.
In the related art, in the prior art, a non-sparse check matrix is obtained by utilizing error-free code word Gaussian elimination, and then is thinned, so that the identification of LDPC coding is realized. The core idea of matrix sparsification is as follows: fixing a non-sparse check matrix H in a one-iteration process d And traversing all other rows, taking the fixed row and the traversed rowAfter the sum of the dies of the other row, replacing the fixed row with the group of results with the minimum Hamming weight; the process is repeated until no line exchange is performed in a certain iteration, and the iteration is exited. What is obtained at this time is the sparse check matrix H s . The computational complexity of the algorithm is lR 2 And N, wherein l is iteration times, R = N-K, N is the frame length, and K is the information length. The method has the advantages of large calculated amount, low real-time performance and complex flow, and requires that the received code words are completely error-free, so that the application range scene of the prior art is greatly reduced.
In the related technology, an effective check quantity is screened out for the LDPC codes by using an iterative screening algorithm, and the sparsification of LDPC code check matrixes is realized. The specific implementation mode is that the algorithm firstly constructs a matrix containing errors according to intercepted data, and obtains a dual vector of the matrix through the element elimination operation of the embodiment; and screening out the effective check vector of the LDPC code from the dual vector by using a check vector judgment criterion. And then identifying and eliminating error-containing code groups in the intercepted data, and continuously iterating the operations to improve the proportion of the error-free code groups of the result data until the original problem is degraded into a simple scene without error codes, and finally using a progressive row transformation algorithm to realize the sparseness of the LDPC code check matrix. The method allows the received code word to have error codes, but the error rate is about 10 -4 In order of magnitude, correct identification is not fully guaranteed and the method requires a large number of codewords to be received for blind identification.
The method provided by the embodiment is applied to the LDPC coding situation, can simply and quickly identify coding parameters, improves the identification efficiency, only needs one frame without receiving a large number of coding code words, and has higher accuracy and better practicability.
The technical scheme provided by this embodiment provides a new coding parameter identification method, and the method can decode and re-encode a received codeword sequence on the basis that a coding parameter is taken out from a preset closed set as a target coding parameter, and then determine whether the coding parameter is the target coding parameter according to whether the check part of the self-coding codeword sequence and the received codeword sequence is matched, so that the blind identification blind decoding effect under the condition that only a small number of or even one frame of codewords need to be received is realized, and the difficulty in coding parameter identification is greatly reduced.
EXAMPLE III
Fig. 3A is a flowchart of a method for identifying coding parameters according to an embodiment of the present invention, where optionally, the method is applied to LDPC coding of a DVB-S2 communication system, and optionally, the coding parameters are LDPC coding parameters, the received codeword sequence is a received LDPC coded codeword sequence, and the self-coded codeword sequence is a self-coded LDPC coded codeword sequence. Optionally, the received codeword sequence may be an LDPC coded codeword sequence transmitted in the DVB-S2 communication system.
The technical scheme provided by the embodiment of the invention comprises the following steps:
s310: taking a group of LDPC coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by sets of encoding parameters corresponding to encoding types of the received LDPC coded codeword sequence.
S320: and decoding the received LDPC coded word sequence based on the target coding parameter to obtain a decoding result.
S330: and coding the decoding result to obtain a self-coded LDPC code word sequence.
S340: and judging whether the check bit part of the self-coded LDPC code word sequence is matched with the check bit part of the received LDPC code word sequence.
If yes, go to S350, otherwise, go to S360.
The method for determining whether the self-coding codeword sequence matches with the received codeword sequence may use a comparison check method.
Wherein, the check part is (N-K) bits of the received code word sequence and the self-coding code word sequence; wherein, N is the length of the received codeword sequence and the self-encoded codeword sequence, and K is the length of the source sequence obtained in the above steps.
And further, comparing the check parts of the received code word sequence and the self-coding code word sequence, and if the check parts are all consistent, returning the coding and decoding parameters at the moment as a blind identification result.
S350: and taking the target coding parameter as the coding parameter of the received LDPC coded codeword sequence.
S360: the next set of encoding parameters is taken out of the closed set and returned to S320 as target encoding parameters.
Therefore, the method provided by the embodiment of the invention is applied to the LDPC coding codeword sequence of the DVB-S2 communication system, under the application scene, all coding parameters possibly existing in the receiving codeword sequence are discrete and limited, and a closed set is convenient to construct, so that the repetition times can be reduced in the subsequent identification process, the calculated amount is reduced, and the LDPC coding parameters can be simply and quickly identified by the method provided by the embodiment of the invention; a large number of code words do not need to be received, only one frame is needed, and blind identification can be achieved under a severe communication environment.
DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
To more clearly express the technical solutions provided by the embodiments of the present invention, fig. 3B and 3C are schematic diagrams of a specific application scenario to which a third embodiment of the present invention is applied.
As shown in fig. 3B, taking a closed set C = { (N, K) | (16200, 5400), (16200, 7200) } as an example, when an LDPC coded codeword sequence with a parameter of (16200, 7200) in a certain frame X1 is identified under a noise-free condition, parameters (16200, 5400) in the set are selected, and a received code X1 is decoded and then encoded by using the parameters, so that a source sequence U1 and a self-coded codeword sequence X2 can be obtained; since the encoding parameters of the actually received encoded codeword sequence are (16200, 7200), the different bit ratio of the received codeword sequence X1 and the self-encoded codeword sequence X2 is about 0.5 in the round of traversal comparison, i.e. the two sequences are not matched, so that it can be determined that the encoding parameters of the received codeword sequence are not (16200, 5400).
And continuously traversing the parameters in the closed set, as shown in fig. 3C, the next traversed parameter is (16200, 7200) to obtain the source sequence U2 and the self-encoded codeword sequence X3, because the encoding parameter X1 of the actually received codeword sequence is (16200, 7200), the current round of traversal compares the received codeword sequence X1 with the rear (N-K) bit of the self-encoded codeword sequence X3, the two sequences are completely the same, that is, the two sequences are matched, and the parameter of the LDPC encoded codeword sequence is correctly identified (16200, 7200).
Through the arrangement, the effect of simply and quickly identifying the LDPC coding parameters under the zero-noise non-cooperative communication environment can be realized.
The above embodiment is a matching result in an ideal noise-free environment, and sequences received in an actual communication process are all subjected to noise pollution.
Illustratively, taking BPSK (binary phase shift keying) as an example, the LDPC coding parameters given in Table 1 are (16200, 7200) at different points
Comparing 9000 bits of self-coding code word sequence and receiving code sequence in different proportions under the condition of signal-to-noise ratio:
as can be seen from the above table, when the channel condition is very poor, the different ratio is about 0.5; as the channel conditions improve, the different ratios gradually decrease and approach 0. When setting decision thresholds of different proportions, the recognition rate and accuracy rate need to be balanced: if the judgment threshold value is set to be higher (such as < 0.4), the coding parameters can be identified in a severe environment, but the accuracy is not high; if the decision threshold is set to be low (e.g., < 0.1), the present invention can recognize the encoding parameters under the ordinary environment, and the accuracy can reach 100%. Therefore, the decision threshold value can be flexibly selected according to the actual situation so as to meet the actual requirement.
Definition of the invention
The boundaries are as follows: when the modulation mode is BPSK, setting the threshold value of different judging ratios to be 0.1, if the threshold value is in
10000 frames can be continuously and correctly identified under the channel environment, but the ratio is not high
10000 frames can not be continuously and correctly identified in the worse environment, and then the frame is recorded
To identify the boundary.
Under the BPSK modulation mode, under the condition that the frame length N is 16200, several information lengths K are given
The boundaries are shown in table 2:
as can be seen from Table 2, with code rate
The number of the channels is increased, and the number of the channels is increased,
the boundary is first decreased and then increased. As a whole
The boundary is lower, which means that the invention can realize blind identification blind decoding under the severe communication environment, and has considerable practicability.
TABLE 2
Example four
Fig. 4 is a schematic structural diagram of an encoding parameter identification apparatus according to a fourth embodiment of the present invention. As shown in fig. 4, the apparatus includes:
a selecting module 410, configured to take out a group of encoding parameters from a preset closed set as target encoding parameters; wherein the closed set is formed by sets of encoding parameters corresponding to the encoding type of the received codeword sequence.
A decoding module 420, configured to decode the received codeword sequence based on the target encoding parameter to obtain a decoding result.
And a self-encoding module 430, configured to encode the decoding result to obtain a self-encoding codeword sequence.
A determining module 440, configured to, if the self-encoding codeword sequence matches the receiving codeword sequence, use the target encoding parameter as an encoding parameter of the receiving codeword sequence.
A returning module 450, configured to, if the self-encoding codeword sequence does not match the receiving codeword sequence, take out a next set of encoding parameters from the closed set, and return to an operation of decoding the receiving codeword sequence based on the target encoding parameters, as target encoding parameters.
Further, the selecting module 410 may be specifically configured to extract a group of encoding parameters from a preset closed set as target encoding parameters; the encoding parameters are LDPC encoding parameters, the receiving code word sequence is a received LDPC encoding code word sequence, and the self-encoding code word sequence is a self-encoding LDPC encoding code word sequence; the LDPC coded codeword sequence comprises an LDPC coded codeword sequence based on DVB-S2 communication system.
Further, the decoding module 420 is configured to decode the received codeword sequence based on the target coding parameter to obtain a decoding result; the coding parameters are LDPC coding parameters, and the receiving code word sequence is a received LDPC coding code word sequence which comprises an LDPC coding code word sequence based on a DVB-S2 communication system.
Further, the encoding module 430 may be specifically configured to encode the decoding result to obtain a self-encoded codeword sequence; wherein the self-encoding codeword sequence is a self-encoding LDPC encoding codeword sequence.
Further, the determining module 440 may be specifically configured to determine whether the self-encoded codeword sequence matches the received codeword sequence, and if the self-encoded codeword sequence matches the received codeword sequence, use the target encoding parameter as the encoding parameter of the received codeword sequence; if the self-encoded codeword sequence does not match the received codeword sequence, the code is presented to a return module 450 for further operation.
Further, the determining module 440 may be specifically configured to determine whether a parity portion of the self-encoded codeword sequence matches with a parity portion of the received codeword sequence, and if a different ratio of the self-encoded codeword sequence to a last M-bit codeword of the received codeword sequence is smaller than a decision threshold, use the target encoding parameter as an encoding parameter of the received codeword sequence; accordingly, if the self-encoded codeword sequence does not match the parity portion of the received codeword sequence, the encoding is presented to the return module 350 for further processing.
Optionally, the decoding module 420 further includes a checking module 421, which is specifically configured to query a check matrix based on the encoding parameters of the received codeword sequence, and check the decoding result based on the check matrix.
The coding parameter identification device provided by the embodiment of the invention can execute the coding parameter identification method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method.
EXAMPLE five
FIG. 5 shows a schematic block diagram of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 5, the electronic device 10 includes at least one processor 11, and a memory communicatively connected to the at least one processor 11, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, and the like, wherein the memory stores a computer program executable by the at least one processor, and the processor 11 can perform various suitable actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from a storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data necessary for the operation of the electronic apparatus 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.
A number of components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, or the like; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.
In some embodiments, the method encoding parameter identification may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the method encoding parameter identification method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the method encoding parameter identification method by any other suitable means (e.g., by means of firmware).
The memory 18 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of the electronic device controlled by the smart terminal, and the like. Further, the memory 18 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 520 may optionally include memory located remotely from the processor 11, which may be connected to the controlling electronics of the intelligent terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
A computer program for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be performed. A computer program can execute entirely on a machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. A computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the Internet.
The computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present invention may be executed in parallel, sequentially, or in different orders, and are not limited herein as long as the desired result of the technical solution of the present invention can be achieved.
The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method for identifying coding parameters, comprising:
taking a group of coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by sets of encoding parameters corresponding to encoding types of the received codeword sequence;
decoding the received code word sequence based on the target coding parameter to obtain a decoding result;
coding the decoding result to obtain a self-coding codeword sequence;
if the self-coding code word sequence is matched with the receiving code word sequence, the target coding parameter is used as the coding parameter of the receiving code word sequence;
and if the self-coding code word sequence is not matched with the receiving code word sequence, taking out a next group of coding parameters from the closed set as target coding parameters, and returning to the operation of decoding the receiving code word sequence based on the target coding parameters.
2. The method of claim 1,
if the self-coding codeword sequence matches the receiving codeword sequence, using the target coding parameter as a coding parameter of the receiving codeword sequence, including:
if the check bit part of the self-coding codeword sequence matches the check bit part of the received codeword sequence, using the target coding parameter as the coding parameter of the received codeword sequence;
correspondingly, if the self-coding codeword sequence does not match the receiving codeword sequence, taking out the next set of coding parameters from the closed set as target coding parameters, including:
and if the check bit part of the self-coding code word sequence is not matched with the check bit part of the receiving code word sequence, taking out the next group of coding parameters from the closed set as target coding parameters.
3. The method of claim 2,
if the self-encoded codeword sequence matches the parity bit portion of the received codeword sequence, using the target encoding parameter as the encoding parameter of the received codeword sequence, including:
if the different proportion of the self-coding codeword sequence to the rear M-bit codeword of the received codeword sequence is smaller than a decision threshold, taking the target coding parameter as the coding parameter of the received codeword sequence;
correspondingly, if the self-encoded codeword sequence does not match the parity bit portion of the received codeword sequence, taking out the next set of encoding parameters from the closed set as target encoding parameters, including:
if the different proportion of the self-coding codeword sequence to the rear M-bit codeword of the received codeword sequence is greater than a decision threshold, taking out a next group of coding parameters from the closed set as target coding parameters;
wherein, M = N-K, where N is the frame length of the received codeword sequence, and K is the information length.
4. The method of claim 1, wherein the encoding parameters are LDPC encoding parameters, wherein the received codeword sequence is a received LDPC encoded codeword sequence, and wherein the self-encoded codeword sequence is a self-encoded LDPC encoded codeword sequence.
5. The method of claim 4, wherein the sequence of LDPC coded codewords comprises a sequence of LDPC coded codewords based on a DVB-S2 communication standard.
6. The method of claim 5, further comprising:
and inquiring a check matrix based on the coding parameters of the received codeword sequence, and checking the decoding result based on the check matrix.
7. The method of claim 1, further comprising:
and if the coding parameters in the preset closed set are traversed and the self-coding code word sequence is not matched with the receiving code word sequence, judging that the identification fails.
8. An encoding parameter identification apparatus, comprising:
the selecting module is used for taking out a group of coding parameters from a preset closed set as target coding parameters; wherein the closed set is formed by a number of sets of encoding parameters corresponding to the encoding type of the received codeword sequence;
the decoding module is used for decoding the received code word sequence based on the target coding parameter to obtain a decoding result;
the self-coding module is used for coding the decoding result to obtain a self-coding codeword sequence;
a determining module, configured to take the target coding parameter as a coding parameter of the received codeword sequence if the self-coded codeword sequence matches the received codeword sequence;
and the return module is used for taking out the next group of coding parameters from the closed set to be used as target coding parameters if the self-coding code word sequence is not matched with the receiving code word sequence, and returning the operation of decoding the receiving code word sequence based on the target coding parameters.
9. An electronic device, characterized in that the electronic device comprises:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
10. A computer-readable storage medium storing computer instructions for causing a processor to perform the method of any one of claims 1-7 when executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211368777.4A CN115765760A (en) | 2022-11-03 | 2022-11-03 | Coding parameter identification method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211368777.4A CN115765760A (en) | 2022-11-03 | 2022-11-03 | Coding parameter identification method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115765760A true CN115765760A (en) | 2023-03-07 |
Family
ID=85357574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211368777.4A Pending CN115765760A (en) | 2022-11-03 | 2022-11-03 | Coding parameter identification method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115765760A (en) |
-
2022
- 2022-11-03 CN CN202211368777.4A patent/CN115765760A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108462558B (en) | Method and device for decoding polarization code SCL and electronic equipment | |
| CN100581064C (en) | Low density parity check code decoder and method thereof | |
| WO2015139160A1 (en) | Hard decision decoding method for ldpc code of dynamic threshold bit-flipping | |
| CN107612560B (en) | Polarization code early iteration stopping method based on partial information bit likelihood ratio | |
| CN101997553B (en) | Method and device for decoding convolution code | |
| CN110024297B (en) | System and method for log likelihood ratio based dynamic preprocessing selection scheme in low density parity check decoder | |
| CN107565984B (en) | Raptor code optimized coding method with precoding as irregular code | |
| US20220294471A1 (en) | Smart decoder | |
| CN109361403A (en) | LDPC interpretation method, ldpc decoder and its storage equipment | |
| CN104242957A (en) | Decoding processing method and decoder | |
| CN111030708B (en) | Iterative adjustable soft serial cancellation list decoding method and device for polarization codes | |
| CN111130567B (en) | Polarization code belief propagation list decoding method added with noise disturbance and bit inversion | |
| CN112332864A (en) | Polar code decoding method and system for self-adaptive ordered mobile pruning list | |
| CN106209312B (en) | A kind of cyclic code parameter blind identification using soft-decision | |
| KR102269322B1 (en) | A method and apparatus for fast decoding a linear code based on bit matching | |
| CN107181567B (en) | Low-complexity MPA algorithm based on threshold | |
| CN112702141B (en) | Adjustable serial offset list polar code decoding method and device | |
| CN115314121B (en) | Quantum communication method and device and electronic equipment | |
| CN115765760A (en) | Coding parameter identification method, device, equipment and storage medium | |
| CN107872231A (en) | LDPC interpretation methods and device | |
| Zhang et al. | Goal‐oriented design of optimal degree distribution for LT codes | |
| KR20120000040A (en) | Method for setting number of iterative decoding, apparatus and method for ldpc decoding | |
| CN109802690B (en) | Decoding method, device and computer readable storage medium | |
| CN118054797B (en) | Coding and decoding method, device and equipment | |
| Kuang et al. | FPGA implementation of a modified turbo product code decoder |
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 |