CN117938177A - Parallel decoding verification method and device, electronic equipment and storage medium - Google Patents

Abstract

The application provides a parallel decoding verification method, a device, electronic equipment and a storage medium, wherein the method comprises the steps of receiving a plurality of initial character strings and first hash values corresponding to each initial character string; extracting characters with the same bit in the initial character strings in sequence according to the bit sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings; performing iterative decoding on characters in each target character string to obtain a decoding value of each character; calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings; in response to determining that the first hash value corresponding to each initial character string is the same as the second hash value corresponding to the initial character string, determining that all initial character strings pass the decoding verification, the technical problem of low decoding verification efficiency for a plurality of character strings in the prior art is solved, and complexity of decoding verification for the plurality of character strings is reduced.

Description

Parallel decoding verification method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a parallel decoding verification method, a parallel decoding verification device, an electronic device, and a storage medium.

Background

The final purpose of communication is to transmit the data of the transmitting end to the receiving end as it is, and the data needs to be transmitted in the form of electric signals, so the transmitting end needs to encode the data to obtain the character string corresponding to the data. However, in the process of transmitting the character string from the transmitting end to the receiving end, the loss and noise are caused, so that the characters in the character string are lost, and an eavesdropper possibly exists, so that the character string is tampered, and the transmitting end needs to decode and verify the received character string to ensure that the data obtained by decoding of the receiving end is consistent with the data transmitted by the transmitting end.

In the prior art, when decoding and verifying a character string, in the iterative decoding process, a syndrome is calculated once for each iteration of characters in the character string, and whether the decoding is successful is determined. However, the syndrome represents a probability value, and even if verification of the syndrome is passed, it is judged that the verification is successful, and the character string is finally required to be verified again. In each iteration process, a certain time is required for calculating the syndrome and judging according to the syndrome, so that the decoding verification efficiency of the character string is low.

Disclosure of Invention

In view of the above, the present application is directed to a parallel decoding verification method, a device, an electronic apparatus and a storage medium, so as to overcome all or part of the defects in the prior art.

Based on the above object, the present application provides a parallel decoding verification method, comprising: receiving a plurality of initial character strings and first hash values corresponding to the initial character strings; extracting characters with the same bit in the initial character strings in sequence according to the bit sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings; performing iterative decoding on characters in each target character string to obtain a decoding value of each character; calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings; in response to determining that the first hash value and the second hash value corresponding to each initial string are the same, determining that all initial strings pass the decoding verification.

Optionally, the performing iterative decoding on the characters in each target string to obtain a decoded value of each character includes: iteratively decoding the character by the following formula: wherein/> For the decoding value of the check node j transmitted to the predetermined check matrix by the character i after l iterations,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 1,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 0,/>For the character i which is not iterated, transmitting the initial decoding value of the check node j in the preset check matrix,/>In order to pass the external probability of character i to check node j in the predetermined check matrix after l iterations, pi represents the continuous multiplication operation.

Optionally, the method further comprises: the external probability is determined by the following formula: wherein/> For the external probability that check nodes j in a preset check matrix are transmitted to a character i after l iterations,/>For the decoded value of the previous iteration, pi represents a continuous multiplication operation.

Optionally, the calculating the second hash value corresponding to each initial string based on the decoded values corresponding to all the target strings includes: determining a target character corresponding to each character in the initial character string in a target character string; hard judgment is carried out on a plurality of decoding values associated with all target characters corresponding to the initial character string, so that a judgment value of each decoding value is obtained; and calculating a second hash value corresponding to the initial character string based on the plurality of decision values.

Optionally, the calculating, based on the plurality of decision values, a second hash value corresponding to the initial string includes: the second hash value is calculated by the following formula: Wherein a ₁ to a _k+n-1 are parameter elements in the toeplitz matrix, x ₁ to x _n are the plurality of decision values, t ₁ to t _k are the second hash values, n is the total number of the plurality of decision values, and k is the total number of rows of parameter elements in the toeplitz matrix.

Optionally, the method further comprises: and in response to determining that the first hash value corresponding to the initial character string is different from the second hash value corresponding to the initial character string, determining that the initial character string fails the decoding verification, and sending information for prompting that the initial character string fails the decoding verification.

Optionally, before iteratively decoding the characters in each target string, the method includes: initializing characters in each target character string.

Based on the same inventive concept, the application also provides a parallel decoding verification device, comprising: a receiving module configured to receive a plurality of initial character strings and a first hash value corresponding to each initial character string; the combination module is configured to sequentially extract characters with the same bit positions in the plurality of initial character strings according to the bit sequence, and combine the characters with the same bit positions into a target character string so as to obtain a plurality of target character strings; the decoding module is configured to perform iterative decoding on the characters in each target character string to obtain a decoding value of each character; the calculating module is configured to calculate a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings; and a determining module configured to determine that all initial strings pass the decoding verification in response to determining that the first hash value corresponding to each initial string and the second hash value corresponding to each initial string are the same.

Based on the same inventive concept, the application also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable by the processor, the processor implementing the method as described above when executing the computer program.

Based on the same inventive concept, the present application also provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method as described above.

As can be seen from the foregoing, the parallel decoding verification method, the device, the electronic equipment and the storage medium provided by the application comprise the steps of receiving a plurality of initial character strings and a first hash value corresponding to each initial character string. According to the bit sequence, extracting the characters with the same bit in the initial character strings in sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings, so that the access time to the characters corresponding to the bit is reduced, and the decoding verification efficiency of the target character strings is further improved. And carrying out iterative decoding on the characters in each target character string to obtain a decoding value of each character, thereby improving the efficiency of iterative decoding and reducing the complexity of decoding. And calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings, so as to achieve the aim of accurately verifying the initial character strings. And in response to determining that the first hash value corresponding to each initial character string is the same as the second hash value corresponding to the initial character string, determining that all initial character strings pass the decoding verification, so that the verification complexity is greatly reduced, and the decoding verification efficiency of all character strings is further improved.

Drawings

In order to more clearly illustrate the technical solutions of the present application or related art, the drawings that are required to be used in the description of the embodiments or related art will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort to those of ordinary skill in the art.

FIG. 1 is a flow chart of a parallel decoding verification method according to an embodiment of the application;

FIG. 2 is a schematic diagram of a parallel decoding verification device according to an embodiment of the present application;

fig. 3 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the application.

Detailed Description

The present application will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present application more apparent.

It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present application belongs. The terms "first," "second," and the like, as used in embodiments of the present application, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.

As described in the background section, the final purpose of communication is to transmit the data of the transmitting end to the receiving end as it is, and the data needs to be transmitted in the form of an electrical signal, so that the transmitting end needs to encode the data to obtain a character string corresponding to the data. However, in the process of transmitting the character string from the transmitting end to the receiving end, the loss and noise are caused, so that the characters in the character string are lost, and an eavesdropper possibly exists, so that the character string is tampered, and the transmitting end needs to decode and verify the received character string to ensure that the data obtained by decoding of the receiving end is consistent with the data transmitted by the transmitting end.

In the prior art, when decoding and verifying a character string, in the iterative decoding process, a syndrome is calculated once for each iteration of characters in the character string, and whether the decoding is successful is determined. However, the syndrome represents a probability value, and even if verification of the syndrome is passed, it is eventually necessary to re-verify the character string by using the hash value, resulting in low efficiency of decoding verification of the character string. And the calculation of the syndrome needs to ensure that the characters in the character string are in the initial sequence, but for the parallel decoding of multiple character strings, maintaining the initial sequence of the character string can make the time required for accessing the characters with different bits in the character string relatively long, thereby further resulting in low decoding verification efficiency of the character string.

In view of this, an embodiment of the present application provides a parallel decoding verification method, referring to fig. 1, including the following steps:

Step 101, receiving a plurality of initial character strings and a first hash value corresponding to each initial character string.

In the step, in the communication process, a transmitting end transmits a plurality of initial character strings to a receiving end, wherein the initial character strings are electric signals obtained by encoding data to be transmitted by the transmitting end. However, since the characters in the initial character string may be lost or tampered during the communication process, the receiving end needs to perform decoding verification on the initial character string. Meanwhile, in order to ensure the security of the initial character string, the initial character string is also required to be encrypted through a hash function, so as to obtain a first hash value corresponding to the initial character string. It should be noted that, the hash function converts a string of an arbitrary length into a string of a fixed length, and the string of a fixed length is a first hash value, where the first hash value is a unique and compact data representation of a segment of data. If only one character in the character string is changed, the first hash value of the character string is changed, so that the integrity of the initial character string can be checked by using the first hash value of the character string.

Step 102, extracting the characters with the same bit in the plurality of initial character strings in sequence according to the bit sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings.

In this step, the access rate of consecutive addresses is much lower than the access rate of non-consecutive data addresses for bits in the string. Therefore, in order to increase the access rate to the characters corresponding to the bits in the initial character string, the characters in the plurality of initial character strings are rearranged and combined, and then parallel decoding is performed simultaneously. In order to further improve the access rate of discontinuous data addresses, the application extracts characters with the same bit in a plurality of initial character strings, combines the characters with the same bit into a target character string, and is exemplified by assuming that the plurality of initial character strings comprise first initial character strings and second initial character strings. Extracting the character corresponding to the second bit in the first initial character string, extracting the character corresponding to the second bit in the second initial character string. When the characters in the initial character strings are recombined according to the bit sequence, only the characters corresponding to the bit in the initial character strings are sequentially accessed, and repeated access to the characters corresponding to the bit is not needed, so that the characters in the target character strings have certain regularity, the bit in the target character strings are not continuous, the access time to the characters corresponding to the bit is shortened, and the decoding verification efficiency to the target character strings is further improved.

And 103, performing iterative decoding on the characters in each target character string to obtain a decoding value of each character.

In the step, the potential information in the character can be fully excavated by performing repeated iteration on the character and then decoding, and the decoding value of the character is obtained after repeated iteration, so that the efficiency of iterative decoding is improved, and the complexity of decoding is reduced. In the iterative decoding process, after one iteration is completed, the next iterative operation is directly started until the maximum iteration times are reached, and a syndrome is not required to be calculated, so that the decoding value of the character is obtained after iterative decoding, the iterative decoding efficiency is improved, and the decoding complexity is reduced.

Step 104, calculating a second hash value corresponding to each initial character string based on the decoded values corresponding to all the target character strings.

In this step, since the receiving end also receives the first hash value sent by the sending end, the first hash value is obtained by converting the character string through a hash function. Assuming that the character in the initial character string is changed during transmission, the hash value obtained by converting the character string in which the character change has occurred by the hash function is necessarily different from the first hash value. Therefore, the second hash value of the initial character string received by the receiving end is calculated through all the decoding values, so that the purpose of accurately verifying the initial character string is achieved.

In response to determining that the first hash value and the second hash value corresponding to each initial string are the same, step 105, determining that all initial strings pass the decoding verification.

In this step, in the case that the first hash value corresponding to each initial character string and the second hash value corresponding to each initial character string are the same, it is explained that the characters in all initial character strings are not lost or tampered during transmission. Therefore, it can be determined that all the character strings pass the decoding verification. For the multi-codeword parallel decoding process, the calculation of the syndrome and the comparison by the syndrome are extremely high, but the application omits the syndrome calculation and the comparison process, greatly reduces the verification complexity, and further improves the decoding verification efficiency of all character strings.

Through the scheme, a plurality of initial character strings and first hash values corresponding to the initial character strings are received. According to the bit sequence, extracting the characters with the same bit in the initial character strings in sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings, so that the access time to the characters corresponding to the bit is reduced, and the decoding verification efficiency of the target character strings is further improved. And carrying out iterative decoding on the characters in each target character string to obtain a decoding value of each character, thereby improving the efficiency of iterative decoding and reducing the complexity of decoding. And calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings, so as to achieve the aim of accurately verifying the initial character strings. And in response to determining that the first hash value corresponding to each initial character string is the same as the second hash value corresponding to the initial character string, determining that all initial character strings pass the decoding verification, so that the verification complexity is greatly reduced, and the decoding verification efficiency of all character strings is further improved.

In some embodiments, the iteratively decoding the characters in each target string to obtain a decoded value of each character includes: iteratively decoding the character by the following formula: wherein/> For the decoding value of the check node j transmitted to the predetermined check matrix by the character i after l iterations,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 1,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 0,/>For the character i which is not iterated, transmitting the initial decoding value of the check node j in the preset check matrix,/>In order to pass the external probability of character i to check node j in the predetermined check matrix after l iterations, pi represents the continuous multiplication operation.

In this embodiment, the predetermined check matrix is a matrix determined according to historical experience, and has the function of accurately determining the decoding value. In each iteration, correcting the decoding value of the character obtained after each iteration through the check nodes in the preset check matrix, so that the decoding value in each iteration is more accurate. The initial decoding value is multiplied by an external probability after continuous multiplication, wherein the external probability is a probability satisfied by a check node under the condition that the predetermined bit and other information have independent distribution. The characters are subjected to data processing through a formula to obtain a decoding value, and the purpose of accurately determining the decoding value is achieved. It should be noted that, the total iteration number in this embodiment may be preset in advance as required, and the preset rule may be: the determined decoding value is accurate, and the iteration speed of the character is high.

In some embodiments, further comprising: the external probability is determined by the following formula: wherein/> For the external probability that check nodes j in a preset check matrix are transmitted to a character i after l iterations,/>For the decoded value of the previous iteration, pi represents a continuous multiplication operation.

In this embodiment, in the present iteration, the external probability is determined by the decoding value of the previous iteration, and the decoding value corresponding to the previous iteration has a correction effect on the external probability, so that the external probability approaches to the accurate verification probability direction, and the probability satisfied by the verification node is obtained. The initial decoded value can be modified by the external probability so that the decoded value determined after the total number of iterations is closest to the true value.

In some embodiments, the calculating the second hash value corresponding to each initial string based on the decoded values corresponding to all the target strings includes: determining a target character corresponding to each character in the initial character string in a target character string; hard judgment is carried out on a plurality of decoding values associated with all target characters corresponding to the initial character string, so that a judgment value of each decoding value is obtained; and calculating a second hash value corresponding to the initial character string based on the plurality of decision values.

In this embodiment, each target character string includes characters with the same bit in each initial character string, so that a target character corresponding to each character in the initial character string in the target character string can be determined, and a decoding value corresponding to each character in the initial character string can be obtained. And performing hard decision on the decoding value in the initial character string, wherein the hard decision is performed by setting a threshold value, and the decoding value is converted into binary, wherein the decoding value is larger than 0 and is 1, and the decoding value is smaller than 0 and is 0. And calculating a second hash value corresponding to the initial character string through a plurality of judgment values, wherein the speed of determining the decoding value is improved, so that the efficiency of determining the judgment value and the second hash value is also improved.

In some embodiments, the calculating, based on the plurality of decision values, a second hash value corresponding to the initial string includes: the second hash value is calculated by the following formula: Wherein a ₁ to a _k+n-1 are parameter elements in the toeplitz matrix, x ₁ to x _n are the plurality of decision values, t ₁ to t _k are the second hash values, n is the total number of the plurality of decision values, and k is the total number of rows of parameter elements in the toeplitz matrix.

In this embodiment, all the decision values after hard decision are saved, a general hash function is randomly obtained, and the decision values are multiplied by parameter elements in the hash function to obtain a set of second hash values. The general hash function can adopt a toeplitz matrix, and is characterized in that other data except the first row and the first column are repeated, so that only the first row and the first column of data are needed to be determined, parameter elements in the matrix are rapidly determined, and the efficiency of determining the second hash value is improved.

In some embodiments, further comprising: and in response to determining that the first hash value corresponding to the initial character string is different from the second hash value corresponding to the initial character string, determining that the initial character string fails the decoding verification, and sending information for prompting that the initial character string fails the decoding verification.

In this embodiment, in the case where the first hash value corresponding to the initial character string and the second hash value corresponding to the initial character string are different, it is described that the characters in the initial character string are lost and/or tampered during transmission, so that the characters in the initial character string are changed. The second hash value calculated by the initial character string in which the character change occurs is different from the first hash value transmitted from the transmitting end. Thus, it is determined that the initial character string fails the decoding verification, and information for prompting that the initial character string fails the decoding verification is issued. And related personnel can acquire the character string again according to the message and perform decoding verification on the character string, so that the accuracy of data received by a transmitting end is ensured.

In some embodiments, prior to iteratively decoding the characters in each target string, the method includes: initializing characters in each target character string.

In this embodiment, according to a predetermined check matrix, the characters in each target character string are initialized, so as to achieve the purpose of performing initial assignment on the characters. The character is initialized by the following formula: wherein/> Transmitting the character i which is not iterated to an initial decoding value of a check node j in a preset check matrix, namely the initialized character,/>For the probability that the decoded value of the non-iterated character i passed to the check node j in the predetermined check matrix is 1,For the probability that the decoding value of the check node j transmitted to the predetermined check matrix by the character i which is not iterated is 0,/>/>Is a predetermined value determined empirically from history.

It should be noted that, the method of the embodiment of the present application may be performed by a single device, for example, a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the method of an embodiment of the present application, the devices interacting with each other to accomplish the method.

It should be noted that the foregoing describes some embodiments of the present application. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

Based on the same inventive concept, the application also provides a parallel decoding verification device corresponding to the method of any embodiment.

Referring to fig. 2, the parallel coding verification device includes:

the receiving module 10 is configured to receive a plurality of initial character strings and a first hash value corresponding to each initial character string.

The combination module 20 is configured to sequentially extract characters with the same bits in the plurality of initial strings according to the order of the bits, and combine the characters with the same bits into one target string to obtain a plurality of target strings.

The decoding module 30 is configured to perform iterative decoding on the characters in each target character string, so as to obtain a decoded value of each character.

The calculation module 40 is configured to calculate a second hash value corresponding to each initial string based on the decoded values corresponding to all the target strings.

The determining module 50 is configured to determine that all initial strings pass the decoding verification in response to determining that the first hash value and the second hash value corresponding to each initial string are the same.

By the device, a plurality of initial character strings and first hash values corresponding to the initial character strings are received. According to the bit sequence, extracting the characters with the same bit in the initial character strings in sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings, so that the access time to the characters corresponding to the bit is reduced, and the decoding verification efficiency of the target character strings is further improved. And carrying out iterative decoding on the characters in each target character string to obtain a decoding value of each character, thereby improving the efficiency of iterative decoding and reducing the complexity of decoding. And calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings, so as to achieve the aim of accurately verifying the initial character strings. And in response to determining that the first hash value corresponding to each initial character string is the same as the second hash value corresponding to the initial character string, determining that all initial character strings pass the decoding verification, so that the verification complexity is greatly reduced, and the decoding verification efficiency of all character strings is further improved.

In some embodiments, the decoding module 30 is further configured to iteratively decode the character by: wherein/> For the decoding value of the check node j transmitted to the predetermined check matrix by the character i after l iterations,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 1,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 0,/>For the character i which is not iterated, transmitting the initial decoding value of the check node j in the preset check matrix,/>In order to pass the external probability of character i to check node j in the predetermined check matrix after l iterations, pi represents the continuous multiplication operation.

In some embodiments, the coding module 30 is further configured to determine the external probability by: wherein/> For the external probability that check nodes j in a preset check matrix are transmitted to a character i after l iterations,/>For the decoded value of the previous iteration, pi represents a continuous multiplication operation.

In some embodiments, the computing module 40 is further configured to determine a target character corresponding to each character in the initial character string in a target character string; hard judgment is carried out on a plurality of decoding values associated with all target characters corresponding to the initial character string, so that a judgment value of each decoding value is obtained; and calculating a second hash value corresponding to the initial character string based on the plurality of decision values.

In some embodiments, the calculation module 40 is further configured to calculate the second hash value by: Wherein a ₁ to a _k+n-1 are parameter elements in the toeplitz matrix, x ₁ to x _n are the plurality of decision values, t ₁ to t _k are the second hash values, n is the total number of the plurality of decision values, and k is the total number of rows of parameter elements in the toeplitz matrix.

In some embodiments, the method further comprises a prompting module configured to issue information for prompting that the initial string fails the decoding verification in response to determining that there is a first hash value corresponding to the initial string that is different from a second hash value corresponding to the initial string.

In some embodiments, the method further comprises initializing the characters in each target string prior to iteratively decoding the characters in each target string.

For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of each module may be implemented in the same piece or pieces of software and/or hardware when implementing the present application.

The device of the foregoing embodiment is configured to implement the corresponding parallel decoding verification method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, the application also provides an electronic device corresponding to the method of any embodiment, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the parallel decoding verification method according to any embodiment when executing the program.

Fig. 3 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 implement communication connections therebetween within the device via a bus 1050.

The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit ), a microprocessor, an Application SPECIFIC INTEGRATED Circuit (ASIC), or one or more integrated circuits, etc. for executing related programs to implement the technical solutions provided in the embodiments of the present disclosure.

The Memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage, dynamic storage, etc. Memory 1020 may store an operating system and other application programs, and when the embodiments of the present specification are implemented in software or firmware, the associated program code is stored in memory 1020 and executed by processor 1010.

The input/output interface 1030 is used to connect with an input/output module for inputting and outputting information. The input/output module may be configured as a component in a device (not shown in the figure) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.

Communication interface 1040 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).

Bus 1050 includes a path for transferring information between components of the device (e.g., processor 1010, memory 1020, input/output interface 1030, and communication interface 1040).

It should be noted that although the above-described device only shows processor 1010, memory 1020, input/output interface 1030, communication interface 1040, and bus 1050, in an implementation, the device may include other components necessary to achieve proper operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.

The electronic device of the foregoing embodiment is configured to implement the corresponding parallel decoding verification method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, the present application also provides a non-transitory computer readable storage medium corresponding to the method of any of the above embodiments, where the non-transitory computer readable storage medium stores computer instructions for causing the computer to execute the parallel decoding verification method according to any of the above embodiments.

The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.

The storage medium of the foregoing embodiments stores computer instructions for causing the computer to execute the parallel decoding verification method according to any one of the foregoing embodiments, and has the advantages of the corresponding method embodiments, which are not described herein.

Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the application (including the claims) is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the application, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the application as described above, which are not provided in detail for the sake of brevity.

Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present application. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present application, and also in view of the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the embodiments of the present application are to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the application, it should be apparent to one skilled in the art that embodiments of the application can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.

While the application has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

The present embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, and the like, which are within the spirit and principles of the embodiments of the application, are intended to be included within the scope of the application.

Claims (10)

1. A parallel decoding verification method, comprising:

Receiving a plurality of initial character strings and first hash values corresponding to the initial character strings;

Extracting characters with the same bit in the initial character strings in sequence according to the bit sequence, and combining the characters with the same bit into a target character string to obtain a plurality of target character strings;

Performing iterative decoding on characters in each target character string to obtain a decoding value of each character;

Calculating a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings;

in response to determining that the first hash value and the second hash value corresponding to each initial string are the same, determining that all initial strings pass the decoding verification.

2. The method of claim 1, wherein iteratively decoding the characters in each target string to obtain a decoded value for each character comprises:

Iteratively decoding the character by the following formula:

wherein, For the decoding value of the check node j transmitted to the predetermined check matrix by the character i after l iterations,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 1,/>For the probability that the decoding value of the character i transmitted to the check node j in the preset check matrix after l iterations is 0,/>For the character i which is not iterated, transmitting the initial decoding value of the check node j in the preset check matrix,/>In order to pass the external probability of character i to check node j in the predetermined check matrix after l iterations, pi represents the continuous multiplication operation.

3. The method as recited in claim 2, further comprising:

the external probability is determined by the following formula:

wherein, For the external probability that check nodes j in a preset check matrix are transmitted to a character i after l iterations,/>For the decoded value of the previous iteration, pi represents a continuous multiplication operation.

4. The method of claim 1, wherein calculating a second hash value for each initial string based on the decoded values for all target strings comprises:

determining a target character corresponding to each character in the initial character string in a target character string;

Hard judgment is carried out on a plurality of decoding values associated with all target characters corresponding to the initial character string, so that a judgment value of each decoding value is obtained;

and calculating a second hash value corresponding to the initial character string based on the plurality of decision values.

5. The method of claim 4, wherein calculating a second hash value corresponding to the initial string based on the plurality of decision values comprises:

the second hash value is calculated by the following formula:

Wherein a ₁ to a _k+n-1 are parameter elements in the toeplitz matrix, x ₁ to x _n are the plurality of decision values, t ₁ to t _k are the second hash values, n is the total number of the plurality of decision values, and k is the total number of rows of parameter elements in the toeplitz matrix.

6. The method as recited in claim 1, further comprising:

And in response to determining that the first hash value corresponding to the initial character string is different from the second hash value corresponding to the initial character string, determining that the initial character string fails the decoding verification, and sending information for prompting that the initial character string fails the decoding verification.

7. The method of claim 1, wherein prior to iteratively decoding the characters in each target string, the method comprises:

Initializing characters in each target character string.

8. A parallel decoding verification device, comprising:

A receiving module configured to receive a plurality of initial character strings and a first hash value corresponding to each initial character string;

the combination module is configured to sequentially extract characters with the same bit positions in the plurality of initial character strings according to the bit sequence, and combine the characters with the same bit positions into a target character string so as to obtain a plurality of target character strings;

the decoding module is configured to perform iterative decoding on the characters in each target character string to obtain a decoding value of each character;

the calculating module is configured to calculate a second hash value corresponding to each initial character string based on the decoding values corresponding to all the target character strings;

and a determining module configured to determine that all initial strings pass the decoding verification in response to determining that the first hash value corresponding to each initial string and the second hash value corresponding to each initial string are the same.

9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 7 when the program is executed by the processor.

10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.