CN117938307A - Gray code-based power grid communication node disaster recovery self-repairing method, device and medium - Google Patents
Gray code-based power grid communication node disaster recovery self-repairing method, device and medium Download PDFInfo
- Publication number
- CN117938307A CN117938307A CN202311740220.3A CN202311740220A CN117938307A CN 117938307 A CN117938307 A CN 117938307A CN 202311740220 A CN202311740220 A CN 202311740220A CN 117938307 A CN117938307 A CN 117938307A
- Authority
- CN
- China
- Prior art keywords
- code
- data
- gray
- truncated
- self
- 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
- 238000011084 recovery Methods 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 title claims abstract description 34
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 26
- 238000013507 mapping Methods 0.000 claims abstract description 16
- 238000010276 construction Methods 0.000 claims description 10
- 238000001514 detection method Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000006870 function Effects 0.000 description 20
- 238000012545 processing Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000008439 repair process Effects 0.000 description 3
- 238000012937 correction Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 208000011580 syndromic disease Diseases 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention discloses a Gray code-based self-repairing method, device and medium for disaster recovery of a power grid communication node, which relate to the technical field of power grid information and comprise the following steps: selecting Gray code G with length m and code word number of 2 m; constructing a code C 0 with the code word number of m and the length of m x 2 m based on the Gray code G; performing cyclic shift operation on the code C 0 to form a code C consisting of m.times.2 m code words; encoding node data of the power distribution network according to the code C; when the loss of the jth row data of the code C corresponding to the encoded power distribution network node data is detected, calculating a truncated code corresponding to the jth row data of the ith row; mapping the truncated code by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function; and when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1, the node of the power distribution network completes self-repairing.
Description
Technical Field
The invention relates to the technical field of power grid information, in particular to a method, a device and a medium for self-repairing disaster recovery of a power grid communication node based on Gray codes.
Background
In power distribution systems, communication devices are mostly exposed to the external environment, which makes communication in the distribution network very vulnerable to interference from external conditions or artifacts. In severe natural disasters or artifacts, the distribution network often experiences node data loss as a result. The power restoration capacity of the distribution network is finally determined, namely the power restoration speed of the distribution network is determined. In order to solve the problem of node data restoration capability of the distribution network under disaster recovery conditions, the distribution network nodes are encoded by referring to the ideas of erasure codes in stored codes.
Along with the explosive growth of the power service, the node data of the distribution network also correspondingly increases, and when the data of the distribution network is affected by disasters, the data of the distribution network is difficult to recover quickly by using the traditional coding mode, so that the data recovery efficiency is affected. The distribution network data of the current electric power Internet of things has the following characteristics: large data volume, wide data source, various data types, uneven data quality and large data processing difficulty. In order to ensure the reliability of data storage and the instantaneity of power restoration under disaster recovery conditions, the conventional coding mode cannot meet the requirements.
Disclosure of Invention
The invention aims to provide a Gray code-based power grid communication node disaster recovery self-repairing method, device and medium, which solve the problem that the traditional coding mode cannot meet the requirement of distribution network data of an electric power Internet of things, so that the self-repairing capability of the distribution network node is slower, and the power supply recovery speed of a power distribution network is affected.
The technical aim of the invention is realized by the following technical scheme:
the first aspect of the invention provides a Gray code-based power grid communication node disaster recovery self-repair method, which comprises the following steps:
Selecting Gray code G with length of m and code number of 2 m, wherein m is a positive integer;
Constructing a code C 0 with the code word number of m and the length of m x2 m based on the Gray code G;
Performing cyclic shift operation on the code C 0 to form a code C consisting of m.times.2 m code words;
encoding node data of the power distribution network according to the code C;
When the loss of the jth row data of the code C corresponding to the encoded power distribution network node data is detected, calculating a truncated code corresponding to the jth row data of the ith row;
Mapping the truncated code by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function;
And when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1, the node of the power distribution network completes self-repairing.
In one implementation, the gray code G is expressed as:
wherein/> Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
In one implementation, a code C 0 with a number of codewords of m and a length of m×2 m is constructed based on a gray code G, specifically: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
In one implementation, the expression of code C 0 is:
Wherein h i represents the ith codeword in C 0, i is equal to or more than 1 and m, Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
In one implementation, the cyclic shift operation is performed on the code C 0 to form a code C consisting of m×2 m code words, specifically:
Setting shift operators According to shift operator/>The codeword a= (a 1,a2,…,an) is circularly shifted to obtain
According toForming code C.
In one implementation, the expression for code C is: Where i denotes the cyclic shift of the j-th codeword h j in C 0 by i bits, j denotes the j-th codeword in C 0, and h j denotes the j-th codeword h j,/>, in C 0 Representing that the j-th codeword h j in C 0 is subjected to cyclic shift i-bit operation to obtain a new codeword/>
In one implementation, the method further comprises:
correcting the ith row and jth column data to obtain new ith row and jth column data when the hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is not equal to 1;
And calculating a new truncated code of the new ith row and jth column data, mapping the new truncated code by using a function f (·) to obtain repaired new code data g, until the hamming distance between the truncated code where the new code data g corresponding to the new ith row and jth column data is located and the truncated code corresponding to the front codeword and the rear codeword is equal to 1, and completing self-repair of the power distribution network nodes.
In a second aspect of the present invention, there is provided a gray code-based disaster recovery self-repairing device for a power grid communication node, the device comprising:
The code selecting module is used for selecting Gray codes G with the length of m and the code word number of 2 m, wherein m is a positive integer;
A code construction module, configured to construct a code C 0 with a codeword number of m and a length of m×2 m based on a gray code G;
the code forming module is used for performing cyclic shift operation on the code C 0 to form a code C consisting of m x2 m code words;
The coding module is used for coding the node data of the power distribution network according to the code C;
the detection calculation module is used for calculating a truncated code corresponding to the jth column data of the ith row when the ith row and jth column data of the code C corresponding to the encoded power distribution network node data are detected to be lost;
the mapping module is used for mapping the truncated codes by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function;
And the node self-repairing module is used for completing self-repairing of the power distribution network nodes when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1.
In one implementation, the code construction module is specifically configured to: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
In a third aspect of the present invention, there is provided a storage medium having instructions stored therein; when the instructions are run on the processor, the processor executes the Gray code-based power grid communication node disaster recovery method provided by the first aspect of the invention.
Compared with the prior art, the invention has the following beneficial effects:
According to the Gray code-based power grid communication node disaster recovery self-repairing method, the code C is obtained by interweaving the Gray codes, so that error detection and correction can be rapidly carried out; for any two codewords, the Hamming distance is 1 due to the existence of the respective truncated codes, namely, the respective truncated codes are different codes, then a function f (-) of many-to-one mapping can be selected to recover lost codeword elements, namely, the code C has local self-repairing capability and can realize self-checking by utilizing the characteristic of Gray codes, namely, the front and rear truncated codes are different in one bit number, so that the method is suitable for the rapid repairing of data between nodes of a power distribution network, the construction of the code C is realized by interleaving and cyclic shift of Gray codes, and the Gray codes are cyclic codes, so that the code C still belongs to the cyclic codes, namely, the method is easy to realize and decode; and the code C contains enough code word numbers and meets the requirement of a large amount of node data of the distribution network, so the invention uses the Gray code coding method in the field of image processing for fast repair of the data nodes of the distribution network, and improves the power supply recovery speed of the distribution network.
Drawings
The accompanying drawings, which are included to provide a further understanding of embodiments of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the principles of the application. In the drawings:
Fig. 1 shows a flow diagram of a gray code-based power grid communication node disaster recovery self-repairing method provided by an embodiment of the invention;
fig. 2 shows a schematic flow chart of a method for disaster recovery and self-repairing of a power grid communication node based on gray codes according to an embodiment of the present invention;
fig. 3 shows a schematic block diagram of a gray code-based power grid communication node disaster recovery self-repairing device according to an embodiment of the invention.
Detailed Description
For the purpose of making apparent the objects, technical solutions and advantages of the present invention, the present invention will be further described in detail with reference to the following examples and the accompanying drawings, wherein the exemplary embodiments of the present invention and the descriptions thereof are for illustrating the present invention only and are not to be construed as limiting the present invention.
It is noted that the terms "comprises" or "comprising" when utilized in various embodiments of the present application are indicative of the existence of the claimed function, operation or element and do not limit the addition of one or more functions, operations or elements. Furthermore, as used in various embodiments of the application, the terms "comprises," "comprising," and their cognate terms are intended to refer to a particular feature, number, step, operation, element, component, or combination of the foregoing, and should not be interpreted as first excluding the existence of or increasing likelihood of one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing.
Referring to fig. 1, fig. 1 shows a flow chart of a method for disaster recovery and self-repairing of a power grid communication node based on gray codes according to an embodiment of the present invention, and as shown in fig. 1, the method includes:
S110, selecting Gray codes G with length of m and code word number of 2 m, wherein m is a positive integer;
S120, constructing a code C 0 with the code word number of m and the length of m multiplied by 2 m based on the Gray code G;
S130, performing cyclic shift operation on the code C 0 to form a code C consisting of m.times.2 m code words;
S140, encoding node data of the power distribution network according to the code C;
S150, when the ith row and jth column data of the code C corresponding to the encoded power distribution network node data are detected to be lost, calculating a truncated code corresponding to the ith row and jth column data;
S160, mapping the truncated codes by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function;
S170, when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1, the node of the power distribution network completes self-repairing.
Specifically, gray codes: in a binary code, if only one bit number is different between any two adjacent code words, the code is called gray code. Such as: 0000,0001,0011,0010,0110, 0111, 0101, 0100, 1100, 1101, 1111, 1110, 1010, 1011, 1001, 1000.
Hamming distance: for two codewords a= (a 1,a2,…,an) and b= (b 1,b2,…,bn), its hamming distance d (a, b) is defined as followsWherein diff (a i,bi) =1 if and only if a i≠bi, diff (a i,bi) =0.
Gray code is commonly used in the field of image processing as one of communication coding modes. Gray code is the first choice for image coding because of the fact that only one binary number is different between any two adjacent code words, and for image data, the adjacent pixels can be respectively represented by code words with the distance of 1, so that the Gray code can be used for rapidly checking and repairing the image data.
The embodiment of the invention uses the Gray coding method in the field of image processing for rapid repair of the distribution network data node so as to improve the power supply recovery speed. However, because the distribution network data storage in the electric power internet of things is in a distributed storage mode and the like, and the data processing mode can only be local processing, when a disaster occurs, the distribution network data needs to be repaired in a large amount and rapidly, and therefore a single Gray code cannot be used as an encoding mode of the distribution network node data under the disaster backup condition.
Therefore, on the basis of the gray code, the code that can be used as the coding scheme of the distribution network node data under disaster recovery conditions is obtained based on the configuration and the cyclic shift scheme corresponding to steps S120 and S130. The theorem for code C is as follows:
theorem: code C is A code, where m=2 u, and for any two codewords is represented as follows:
The method comprises the following steps:
d(a′,b′)≥1，0≤i≤2m-1
And (3) proving: obviously the codeword length is Dimension is/>For any two codewordsThe hamming distance of (2) is:
Due to Belonging to codewords in Gray code, the Hamming distance is at least 1, i.e./>
So the code C isAnd (5) code. Similarly available, for:
Has the following components
The syndrome is known.
Let m=8, select gray code G as follows:
G＝{(00000000),(00000001),(00000011),
…,(10000000)}
The configurable code C is as follows:
C＝
{(00000000…0001),(00000000…0010),(00000000…0100)，(00000000…1000)，
…,(10000000...0001)}
Easy verification that the code C is 2 11,11,28]2, if the first code word and the last code word lose the code element with the reciprocal number of 2 8 bits respectively, the code words can be repaired by function mapping 0000 … 0 and 1000 … 0, and the code words at the front stage and the rear stage can be verified to be 1000 … 0, 0000 … 1, 1000 … 1 and 0000 … 0 respectively. The checking and repairing process can quickly recover lost distribution network node data (calculation is not needed), and power supply can be quickly recovered.
In step S140, encoding the node data of the power distribution network based on the code C is a conventional technical means for those skilled in the art, and this embodiment will not be described in detail.
In steps S150 to S170, the self-repairing process is based on the code C, so that the encoded power distribution network node can be quickly repaired, and the power supply recovery speed of the power distribution network is improved.
The truncated code is calculated as: wherein/> Represents the remainder portion of j divided by 2 m,/>Representing the integer portion of i divided by 2 m.
Based on the proving process aiming at theorem, the code C is obtained by interleaving construction based on Gray code, so that error detection and correction can be rapidly carried out; according to theorem, for any two code words, the respective truncated codes exist to enable the distance between the two code words to be 1, namely, the respective truncated codes are different codes, then a function f (-) of many-to-one mapping can be selected to enable lost code word elements to be recovered, namely, the code C has local self-repairing capability, self-checking can be realized by utilizing the characteristic of Gray codes, namely, the front and rear truncated codes are different in number of one bit, and the method is suitable for quick repairing of data between nodes; the construction of the code C is realized by interleaving and cyclic shift of Gray codes, and the Gray codes are cyclic codes, so that the code C still belongs to the cyclic codes, namely, the code C is easy to realize and decode; the code C contains enough code word numbers and meets the requirement of a large amount of node data of the distribution network. Therefore, the coding mode of the distribution network node data based on the Gray code solves and realizes a recovery mechanism of data loss of a large amount of distributed storage of the distribution network, and simultaneously improves self-repairing speed among data nodes of the distribution network under disaster recovery conditions (such as earthquake, flood, typhoon and the like), so that power supply is recovered in time.
In some embodiments, the gray code G is expressed as:
wherein/> Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
In one implementation, a code C 0 with a number of codewords of m and a length of m×2 m is constructed based on a gray code G, specifically: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
In some embodiments, the expression of code C 0 is:
Wherein h i represents the ith codeword in C 0, i is equal to or more than 1 and m, Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
In some embodiments, the cyclic shift operation is performed on the code C 0 to form a code C consisting of m×2 m code words, specifically:
Setting shift operators According to shift operator/>The codeword a= (a 1,a2,…,an) is circularly shifted to obtain
According toForming code C.
In some embodiments, the expression for code C is: Where i denotes the cyclic shift of the j-th codeword h j in C 0 by i bits, j denotes the j-th codeword in C 0, and h j denotes the j-th codeword h j,/>, in C 0 Representing that the j-th codeword h j in C 0 is subjected to cyclic shift i-bit operation to obtain a new codeword
In some embodiments, when the hamming distance calculated in step S170 is not equal to 1, i.e. the self-repair of the node is not completed, the new ith row and jth column data needs to be redetermined, referring to fig. 2, the method further includes:
S210, correcting the ith row and jth column data to obtain new ith row and jth column data when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is not equal to 1.
S220, calculating a new truncated code of the new ith row and jth column data, mapping the new truncated code by using a function f (·) to obtain repaired new code data g, until the hamming distance between the truncated code of the new code data g corresponding to the new ith row and jth column data and the truncated code corresponding to the front codeword and the rear codeword is equal to 1, and completing self-repair of the power distribution network nodes.
Referring to fig. 3, fig. 3 shows a schematic block diagram of a gray code-based power grid communication node disaster recovery device according to an embodiment of the present invention, where, as shown in fig. 3, the device includes:
A code selecting module 310, configured to select a gray code G with a length m and a codeword number of 2 m, where m is a positive integer;
A code construction module 320, configured to construct a code C 0 with a codeword number m and a length m×2 m based on the gray code G;
A code forming module 330, configured to perform a cyclic shift operation on the code C 0 to form a code C consisting of m×2 m code words;
the encoding module 340 is configured to encode the node data of the power distribution network according to the code C;
The detection calculation module 350 is configured to calculate a truncated code corresponding to the jth column data of the ith row when it is detected that the jth column data of the code C corresponding to the encoded node data of the power distribution network is lost;
the mapping module 360 is configured to map the truncated code by using a function f (·) to obtain repaired code data g, where the function f (·) is a multiple function;
The node self-repairing module 370 is configured to complete self-repairing of the power distribution network node when the hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the preceding and following code words is equal to 1.
The grid communication node disaster recovery self-repairing device based on the gray code in the embodiment of the present application is based on the same concept as the grid communication node disaster recovery self-repairing method based on the gray code shown in fig. 1, and by the detailed description of the grid communication node disaster recovery self-repairing method based on the gray code, a person skilled in the art can clearly understand the implementation process of the grid communication node disaster recovery self-repairing device based on the gray code in the embodiment, so that the description is omitted herein for brevity.
Correspondingly, the Gray code-based power grid communication node disaster recovery self-repairing device provided by the embodiment of the application can quickly detect and correct errors because the code C is obtained by interweaving the Gray code; for any two codewords, the Hamming distance is 1 due to the existence of the respective truncated codes, namely, the respective truncated codes are different codes, then a function f (-) of many-to-one mapping can be selected to recover lost codeword elements, namely, the code C has local self-repairing capability and can realize self-checking by utilizing the characteristic of Gray codes, namely, the front and rear truncated codes are different in one bit number, so that the method is suitable for the rapid repairing of data between nodes of a power distribution network, the construction of the code C is realized by interleaving and cyclic shift of Gray codes, and the Gray codes are cyclic codes, so that the code C still belongs to the cyclic codes, namely, the method is easy to realize and decode; and the code C contains enough code word numbers and meets the requirement of a large amount of node data of the distribution network, so the application uses the Gray code coding method in the field of image processing for fast repair of the data nodes of the distribution network, and improves the power supply recovery speed of the distribution network.
Optionally, the code construction module 320 is specifically configured to: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
Based on the same inventive concept as the grid communication node disaster recovery self-repair method based on gray codes in the foregoing embodiment, a further embodiment of the present invention further provides a computer readable storage medium, where the computer readable storage medium is a memory device in a computer device, and is used for storing a program and data. It is understood that the computer readable storage medium herein may include both built-in storage media in a computer device and extended storage media supported by the computer device. The computer-readable storage medium provides a storage space storing an operating system of the terminal. Also stored in the memory space are one or more instructions, which may be one or more computer programs (including program code), adapted to be loaded and executed by the processor. The computer readable storage medium herein may be a high-speed RAM memory or a non-volatile memory (non-volatilememory), such as at least one magnetic disk memory. One or more instructions stored in a computer-readable storage medium may be loaded and executed by a processor to implement the corresponding steps of the Gray code-based power grid communication node disaster recovery method in the above-described embodiments. It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The foregoing description of the embodiments has been provided for the purpose of illustrating the general principles of the invention, and is not meant to limit the scope of the invention, but to limit the invention to the particular embodiments, and any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (10)
1. A Gray code-based power grid communication node disaster recovery self-repairing method is characterized by comprising the following steps:
Selecting Gray code G with length of m and code number of 2 m, wherein m is a positive integer;
Constructing a code C 0 with the code word number of m and the length of m x2 m based on the Gray code G;
Performing cyclic shift operation on the code C 0 to form a code C consisting of m.times.2 m code words;
encoding node data of the power distribution network according to the code C;
When the loss of the jth row data of the code C corresponding to the encoded power distribution network node data is detected, calculating a truncated code corresponding to the jth row data of the ith row;
Mapping the truncated code by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function;
And when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1, the node of the power distribution network completes self-repairing.
2. The gray code-based power grid communication node disaster recovery self-repairing method according to claim 1, wherein the expression of the gray code G is: wherein/> Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
3. The gray code-based power grid communication node disaster recovery self-repairing method according to claim 1, wherein a code C 0 with a code word number of m and a length of m×2 m is constructed based on a gray code G, specifically: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
4. The gray code-based power grid communication node disaster recovery self-repairing method according to claim 1, wherein the expression of the code C 0 is:
Wherein h i represents the ith codeword in C 0, i is equal to or more than 1 and m, Representing the j-th code element in the i-th code word in the Gray code G, wherein i is more than or equal to 1 and less than or equal to 2 m, and j is more than or equal to 1 and less than or equal to m.
5. The gray code-based power grid communication node disaster recovery self-repairing method according to claim 1, wherein the cyclic shift operation is performed on the code C 0 to form a code C consisting of m×2 m code words, specifically:
Setting shift operators According to shift operator/>The codeword a= (a 1,a2,…,an) is circularly shifted to obtain
According toForming code C.
6. The gray code-based power grid communication node disaster recovery self-repair method according to claim 5, wherein the expression of the code C is: Where i denotes the cyclic shift of the j-th codeword h j in C 0 by i bits, j denotes the j-th codeword in C 0, and h j denotes the j-th codeword h j,/>, in C 0 Representing that the j-th codeword h j in C 0 is subjected to cyclic shift i-bit operation to obtain a new codeword/>
7. The gray code-based power grid communication node disaster recovery self-repairing method according to claim 1, wherein the method further comprises:
correcting the ith row and jth column data to obtain new ith row and jth column data when the hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is not equal to 1;
And calculating a new truncated code of the new ith row and jth column data, mapping the new truncated code by using a function f (·) to obtain repaired new code data g, until the hamming distance between the truncated code where the new code data g corresponding to the new ith row and jth column data is located and the truncated code corresponding to the front codeword and the rear codeword is equal to 1, and completing self-repair of the power distribution network nodes.
8. Gray code-based power grid communication node disaster recovery self-repairing device is characterized in that the device comprises:
The code selecting module is used for selecting Gray codes G with the length of m and the code word number of 2 m, wherein m is a positive integer;
A code construction module, configured to construct a code C 0 with a codeword number of m and a length of m×2 m based on a gray code G;
the code forming module is used for performing cyclic shift operation on the code C 0 to form a code C consisting of m x2 m code words;
The coding module is used for coding the node data of the power distribution network according to the code C;
the detection calculation module is used for calculating a truncated code corresponding to the jth column data of the ith row when the ith row and jth column data of the code C corresponding to the encoded power distribution network node data are detected to be lost;
the mapping module is used for mapping the truncated codes by using a function f (·) to obtain repaired code data g, wherein the function f (·) is a multiple function;
And the node self-repairing module is used for completing self-repairing of the power distribution network nodes when the Hamming distance between the truncated code where the code data g is located and the truncated code corresponding to the front and rear code words is equal to 1.
9. The gray code-based power grid communication node disaster recovery self-repairing device according to claim 8, wherein the code construction module is specifically configured to: the gray code G is interleaved to obtain a code C 0 with a number of code words of m and a length of m×2 m.
10. A storage medium having instructions stored therein; when the instructions are run on a processor, the processor performs the gray code based method of self-repair of a power grid communication node disaster recovery as defined in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311740220.3A CN117938307A (en) | 2023-12-15 | 2023-12-15 | Gray code-based power grid communication node disaster recovery self-repairing method, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311740220.3A CN117938307A (en) | 2023-12-15 | 2023-12-15 | Gray code-based power grid communication node disaster recovery self-repairing method, device and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117938307A true CN117938307A (en) | 2024-04-26 |
Family
ID=90767592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311740220.3A Pending CN117938307A (en) | 2023-12-15 | 2023-12-15 | Gray code-based power grid communication node disaster recovery self-repairing method, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117938307A (en) |
-
2023
- 2023-12-15 CN CN202311740220.3A patent/CN117938307A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8448050B2 (en) | Memory system and control method for the same | |
| TWI613674B (en) | Detection and decoding in flash memories with selective binary and non-binary decoding | |
| US8266495B2 (en) | Systems and methods for performing concatenated error correction | |
| US10333558B2 (en) | Decoding device and decoding method | |
| US20180167088A1 (en) | Error-Correcting Code Method and System with Hybrid Block Product Codes | |
| EP2218003B1 (en) | Correction of errors in a memory array | |
| CN102034547A (en) | Memory system and control method for the same | |
| JPH05108495A (en) | Error correcting and detecting method for data and error detecting circuit for computer memory | |
| EP3852275A1 (en) | Method, device and apparatus for storing data, computer readable storage medium | |
| CN112000512B (en) | Data restoration method and related device | |
| KR101550762B1 (en) | Concatenated error correction device | |
| CN112799875B (en) | Method, system, device and medium for verification recovery based on Gaussian elimination | |
| CN111858142A (en) | Data processing method and device, electronic equipment and storage medium | |
| US20070260962A1 (en) | Methods and apparatus for a memory device with self-healing reference bits | |
| CN115454712B (en) | Check code recovery method, system, electronic equipment and storage medium | |
| US10191801B2 (en) | Error correction code management of write-once memory codes | |
| US20140019822A1 (en) | Coding and decoding of error correcting codes | |
| US20180122494A1 (en) | Raid decoding architecture with reduced bandwidth | |
| CN110716824B (en) | Encoding method and memory storage device using the same | |
| US20170161141A1 (en) | Method and apparatus for correcting data in multiple ecc blocks of raid memory | |
| CN117938307A (en) | Gray code-based power grid communication node disaster recovery self-repairing method, device and medium | |
| CN101803204B (en) | Bit string-error correcting method | |
| US10379937B2 (en) | Memory architecture including response manager for error correction circuit | |
| CN113258938B (en) | Construction method for rapidly repairing erasure codes in single-node fault | |
| CN106911793B (en) | I/O optimized distributed storage data repair method |
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 |