CN109639422B - Error code negotiation method and device for discrete quantum key distribution system - Google Patents
Error code negotiation method and device for discrete quantum key distribution system Download PDFInfo
- Publication number
- CN109639422B CN109639422B CN201910064878.4A CN201910064878A CN109639422B CN 109639422 B CN109639422 B CN 109639422B CN 201910064878 A CN201910064878 A CN 201910064878A CN 109639422 B CN109639422 B CN 109639422B
- Authority
- CN
- China
- Prior art keywords
- error correction
- round
- negotiation
- interactive
- negotiation algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
Abstract
An error code negotiation method and device for a discrete quantum key distribution system are used for simultaneously improving the processing rate and the negotiation efficiency, and belong to the technical field of quantum communication. The invention comprises the following steps: scrambling the data block D; randomly sampling the scrambled data to obtain sampled data Ds(ii) a Using interactive negotiation algorithm to sample data DsError correction decoding, namely obtaining an estimated error rate by utilizing the relation between the parity check bits of the first round and the error rate, and executing initialization work by the forward error correction type negotiation algorithm when the interactive negotiation algorithm waits for interactive information in the first round; the forward error correction type negotiation algorithm is adjusted according to the estimated error rate, the interactive negotiation algorithm completes the remaining multi-round error correction decoding work on the sampled data, and the forward error correction type negotiation algorithm decodes the data remaining after sampling when each round waits for the interactive information; and splicing the decoding results of the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
Description
Technical Field
The invention relates to an error code negotiation algorithm, in particular to an error code negotiation method and device for a discrete quantum key distribution system, and belongs to the technical field of quantum communication.
Background
The role of the error negotiation algorithm is to correct the error bits in the screening code in Quantum Key Distribution (QKD). Error negotiation is the most interesting link in QKD post-processing.
Existing error negotiation algorithms include two broad categories: interactive error code negotiation algorithm and forward error correction type error code negotiation algorithm; the Cascade algorithm is a representative algorithm of an interactive error code negotiation algorithm, and the error code negotiation algorithm based on the LDPC is a representative algorithm of a forward error correction type error code negotiation algorithm.
The original Cascade algorithm was proposed by Brassard, 1993, by performing multiple rounds of error correction between Alice and Bob, by separately grouping, comparing the parity codes, and correcting the inconsistent groups using a binary search, the binary search process being effective only for groups having an odd number of errors. See, in particular, Brassard G, Salvail L.secret-key recognition by public discission [ C ], innovations in cryptography-EUROCRYPT' 93, 1994: 410-.
The LDPC code was first proposed by Gallager in 1962, and a probabilistic iterative decoding algorithm was given. In many error correction code algorithms, the performance of the LDPC code can approach to the Shannon limit, error negotiation can be completed only by interaction for several times, and the decoding process is introduced into QKD error negotiation due to the characteristics of parallel computation, hardware implementation and the like.
Interactive error negotiation algorithms, such as the Cascade algorithm, pay attention to how to reduce the amount of exposed information as much as possible, and have good negotiation efficiency especially at low error rates. However, the Cascade algorithm is an error code negotiation algorithm based on interaction, multiple rounds of interaction inevitably result in longer execution time, and the processing speed of error code negotiation is slowed down to a certain extent. A typical algorithm in the forward error correction negotiation algorithm, such as an LDPC-based error negotiation algorithm, focuses on how to improve the processing rate while ensuring a low amount of exposed information. Although the LDPC algorithm does not need to wait for interaction for a long time, and the processing rate is fast, the negotiation efficiency of the LDPC error negotiation algorithm is not very excellent under the condition of a low error rate, and the LDPC negotiation algorithm needs to obtain the error rate of a channel in advance before processing, which may cause poor negotiation performance of the forward error correction type negotiation algorithm when the error rate fluctuates.
Disclosure of Invention
Aiming at the advantages and disadvantages of the two major algorithms introduced above, the invention provides an error code negotiation method facing a discrete quantum key distribution system, which combines the two algorithms and can simultaneously improve the processing rate and the negotiation efficiency.
The invention relates to an error code negotiation method facing a discrete quantum key distribution system, which comprises the following steps:
s1: scrambling the data block D to make the error code distribution in the data block D more uniform;
s2: randomly sampling the scrambled data to obtain sampled data Ds；
S3: using interactive negotiation algorithm to sample data DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
s4: forward error correction type negotiation algorithm according to error rate QBERestMaking adjustments to the sampled data D using an interactive negotiation algorithmsCompleting the remaining multi-round error correction decoding work, and decoding the data left after sampling by a forward error correction type negotiation algorithm when each round waits for interactive information;
s5: and splicing the decoding results of the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
Preferably, in S2, the sample data DsRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe design method for the average processing time of the interactive negotiation algorithm mainly aims to enable the two algorithms to finish work simultaneously and improve the parallel throughput rate.
Preferably, in S3, the estimated error rate is:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and the L is the length of each block.
The invention also provides an error code negotiation device facing to the discrete quantum key distribution system, which comprises:
the scrambling module is used for scrambling the data block D to enable the error code distribution in the data block D to be more uniform;
a sampling module connected with the scrambling module for randomly sampling the scrambled data to obtain sampling data Ds；
A first round error correction module connected with the sampling module for utilizing the interactive negotiation algorithm to perform the data sampling DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
the residual multi-round error correction module is connected with the sampling module and the first round error correction module and is used for the forward error correction type negotiation algorithm according to the error rate QBERestMaking adjustments to the sampled data D using an interactive negotiation algorithmsCompleting the remaining multi-round error correction decoding work, and decoding the data left after sampling by a forward error correction type negotiation algorithm when each round waits for interactive information;
and the splicing module is connected with the scrambling module, the first round error correction module and the residual multi-round error correction module and is used for splicing the decoding results obtained by adopting the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
Preferably, in the sampling module, the sampling data DsRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe processing time is averaged for the interactive negotiation algorithm.
The design method mainly aims to enable two algorithms to complete work simultaneously and improve the parallel throughput rate.
Preferably, in the first round of error correction module, the estimated error rate is:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and the L is the length of each block.
The invention has the beneficial effect that the performance is improved by the error code negotiation algorithm from two aspects of negotiation efficiency and processing speed. The interactive negotiation algorithm and the forward error correction negotiation algorithm are executed in parallel, namely forward error correction decoding is carried out in parallel in the process of waiting for interactive information, so that the processing speed can be obviously improved. The error code negotiation mode can improve the negotiation efficiency because the interactive negotiation algorithm has higher negotiation efficiency under the condition of low error rate. The invention estimates the error rate before the forward error correction type negotiation algorithm, has certain adaptivity and can adapt to the channel environment with fluctuating error rate. Meanwhile, the performance of the forward error correction algorithm can be better, and the information exposed in the decoding process can be reduced. This error negotiation mode may therefore improve negotiation efficiency.
Drawings
FIG. 1 is a schematic flow chart of an embodiment of the present invention.
Detailed Description
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 derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict.
The invention is further described with reference to the following drawings and specific examples, which are not intended to be limiting.
The error code negotiation method for the discrete quantum key distribution system of the embodiment comprises the following steps:
s1: and scrambling the data block D to make the error code distribution in the data block D more uniform and make the error code estimation more accurate. (ii) a
S2: randomly sampling the scrambled data to obtain sampled data Ds；
S3: using interactive negotiation algorithm to sample data DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
the error rate of a channel needs to be obtained in advance before the forward error correction type negotiation algorithm is processed, when the error rate fluctuates, a large error exists between the predicted error rate and the current actual error rate, and the negotiation performance of the forward error correction type negotiation algorithm is poor, so that the current error rate is estimated by using a check bit of a first round of error correction decoding in the interactive negotiation algorithm, the error correction performance of the forward error correction type negotiation algorithm can be ensured, the extra resource overhead is reduced, and the exposed information amount can be reduced;
s4: forward error correction type negotiation algorithm according to error rate QBERestMaking adjustments to the sampled data D using an interactive negotiation algorithmsCompleting the remaining multi-round error correction decoding work, and decoding the data left after sampling by a forward error correction type negotiation algorithm when each round waits for interactive information; interactive negotiationThe algorithm needs multiple rounds of mutual information of both sides, so that the processing speed of error code negotiation is reduced. Because the forward error correction type negotiation algorithm only needs one-time interaction, the interactive negotiation algorithm and the forward error correction type negotiation algorithm have good parallelism, and when the interactive negotiation algorithm waits for the interactive information, the forward error correction type negotiation algorithm can be processed, so that the rate of error code negotiation is improved;
s5: and splicing the decoding results of the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
When the data processing amount of the forward error correction type negotiation algorithm and the interactive negotiation algorithm is 1:1, the processing rate can be increased by 1 time, if the two algorithms are ensured to be processed simultaneously, the data processing amount of the forward error correction type negotiation algorithm and the interactive negotiation algorithm is about 4:1, and the processing rate is 1.25 times of the original data processing rate. In addition, since the interactive error code algorithm has better negotiation efficiency than the forward error correction negotiation algorithm at a low error rate, the negotiation efficiency of the error correction mode is higher than that of the pure forward error correction negotiation algorithm.
Sampling data DsIs determined by the average duration of the interactive negotiation algorithm and the average processing duration of the forward error correction algorithm, in order to make the two parts of data complete error negotiation as simultaneously as possible, in the preferred embodiment, in the present embodiment, in S2, the sampled data D issRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe processing time is averaged for the interactive negotiation algorithm.
The design method mainly aims to enable two algorithms to complete work simultaneously and improve the parallel throughput rate.
The specific embodiment is as follows:
in this embodiment, the interactive negotiation algorithm adopts a Cascade algorithm, and the forward error correction negotiation algorithm adopts an LDPC decoding method, as shown in fig. 1, which includes the following steps:
the method comprises the following steps: the data block D is scrambled, the mapping change of the Scrambling Algorithm is an Arnold-Based Scrambling Algorithm (ABSA for short), the mapping change is in one-to-one correspondence, and no conflict is generated in the mapping change.
Step two: randomly sampling the scrambled data to obtain sampled data DsThe ratio R of the data blocks D is determined by equation (2):
tLaverage processing time, t, for LDPC decoding methodCAverage processing time for the Cascade algorithm;
step three: using interactive negotiation algorithm to sample data DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestAnd when the Cascade algorithm waits for mutual information in the first round, the LDPC decoding method executes initialization work;
estimated bit error rate QBERestComprises the following steps:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and the L is the length of each block.
Step four: the Cascade algorithm completes the remaining multi-round error correction work, and when each round waits for the mutual information, the LDPC decoding method is according to the error rate QBERestSelecting a proper matrix, and decoding in parallel;
step five: and splicing the decoding results of the Cascade algorithm and the LDPC decoding method according to the sequence before scrambling.
The invention also provides an error code negotiation device facing to the discrete quantum key distribution system, which comprises:
the scrambling module is used for scrambling the data block D to enable the error code distribution in the data block D to be more uniform;
a sampling module connected with the scrambling module for randomly sampling the scrambled data to obtain sampling data Ds；
A first round error correction module connected with the sampling module for utilizing the interactive negotiation algorithm to perform the data sampling DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
the residual multi-round error correction module is connected with the sampling module and the first round error correction module and is used for the forward error correction type negotiation algorithm according to the error rate QBERestMaking adjustments to the sampled data D using an interactive negotiation algorithmsCompleting the remaining multi-round error correction decoding work, and decoding the data left after sampling by a forward error correction type negotiation algorithm when each round waits for interactive information;
and the splicing module is connected with the scrambling module, the first round error correction module and the residual multi-round error correction module and is used for splicing the decoding results obtained by adopting the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
In a preferred embodiment, said sampled data D are sampled in a sampling modulesRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe processing time is averaged for the interactive negotiation algorithm.
In a preferred embodiment, in the first round of error correction module, the estimated error rate is:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and the L is the length of each block.
Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims. It should be understood that features described in different dependent claims and herein may be combined in ways different from those described in the original claims. It is also to be understood that features described in connection with individual embodiments may be used in other described embodiments.
Claims (4)
1. An error code negotiation method for a discrete quantum key distribution system, the method comprising:
s1: scrambling the data block D to make the error code distribution in the data block D more uniform;
s2: randomly sampling the scrambled data to obtain sampled data Ds；
S3: using interactive negotiation algorithm to sample data DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
the estimated bit error rate is:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and L is the length of each block;
s4: interactive negotiation algorithm on sampled data DsCompleting the remaining multi-round error correction decoding work, and when waiting for the mutual information in each round, performing the forward error correction type negotiation algorithm according to the error rate QBERestSelecting a proper matrix, and decoding the residual data after sampling in parallel;
s5: and splicing the decoding results of the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
2. The error negotiation method for the discrete quantum key distribution system as claimed in claim 1, wherein in S2, the sampled data D issRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe processing time is averaged for the interactive negotiation algorithm.
3. An error negotiation device for a discrete quantum key distribution system, the device comprising:
the scrambling module is used for scrambling the data block D to enable the error code distribution in the data block D to be more uniform;
a sampling module connected with the scrambling module for randomly sampling the scrambled data to obtain sampling data Ds；
A first round error correction module connected with the sampling module for utilizing the interactive negotiation algorithm to perform the data sampling DsPerforming error correction decoding, and performing error code estimation by using the relation between the first round of parity check bits and the error rate to obtain an estimated error rate QBERestWhen the interactive negotiation algorithm waits for the interactive information in the first round, the forward error correction type negotiation algorithm executes initialization work;
the estimated bit error rate is:
wherein, the errblocknum is the number of blocks with inconsistent parity of the first round, the blocknum is the total number of blocks with inconsistent parity of the first round, and L is the length of each block;
a residual multi-round error correction module connected with the sampling module and the first round error correction module and used for interactive negotiation algorithm to sample data DsCompleting the remaining multi-round error correction decoding work, and when waiting for the mutual information in each round, performing the forward error correction type negotiation algorithm according to the error rate QBERestSelecting a proper matrix, and decoding the residual data after sampling in parallel;
and the splicing module is connected with the scrambling module, the first round error correction module and the residual multi-round error correction module and is used for splicing the decoding results obtained by adopting the interactive negotiation algorithm and the forward error correction negotiation algorithm according to the sequence before scrambling.
4. The error code negotiation device for discrete quantum key distribution system according to claim 3, wherein in the sampling module, the sampling data DsRatio R to data block D:
wherein t isLAverage processing time, t, for forward error correction negotiation algorithmsCThe processing time is averaged for the interactive negotiation algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910064878.4A CN109639422B (en) | 2019-01-23 | 2019-01-23 | Error code negotiation method and device for discrete quantum key distribution system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910064878.4A CN109639422B (en) | 2019-01-23 | 2019-01-23 | Error code negotiation method and device for discrete quantum key distribution system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109639422A CN109639422A (en) | 2019-04-16 |
| CN109639422B true CN109639422B (en) | 2021-04-20 |
Family
ID=66063404
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910064878.4A Active CN109639422B (en) | 2019-01-23 | 2019-01-23 | Error code negotiation method and device for discrete quantum key distribution system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639422B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110113098B (en) * | 2019-05-10 | 2020-10-02 | 哈尔滨工业大学（深圳） | Error code estimation method and device for quantum key distribution system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501221A (en) * | 2013-09-29 | 2014-01-08 | 哈尔滨工业大学 | Evaluating method of error code negotiation algorithm for quantum communication |
| CN104737495A (en) * | 2012-10-23 | 2015-06-24 | Sk电信有限公司 | Permutation method for correcting bit error in quantum key distribution protocol |
| CN106027230A (en) * | 2015-03-28 | 2016-10-12 | 北京大学 | Method for carrying out Hamming error correction for error code in quantum secret key distribution postprocessing |
| CN106100835A (en) * | 2016-07-19 | 2016-11-09 | 北京邮电大学 | A kind of Highly precise FFT method in continuous variable quantum key distribution and high post processing data user rate method |
| CN106549755A (en) * | 2016-12-09 | 2017-03-29 | 哈尔滨工业大学 | The optimization method of Cascade class error code negotiation algorithms |
| CN108712232A (en) * | 2018-05-04 | 2018-10-26 | 北京邮电大学 | A kind of multi-code word parallel decoding method in continuous variable quantum key distribution system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6165638B2 (en) * | 2014-01-08 | 2017-07-19 | 株式会社東芝 | Quantum communication device, quantum communication method and program |
-
2019
- 2019-01-23 CN CN201910064878.4A patent/CN109639422B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104737495A (en) * | 2012-10-23 | 2015-06-24 | Sk电信有限公司 | Permutation method for correcting bit error in quantum key distribution protocol |
| CN103501221A (en) * | 2013-09-29 | 2014-01-08 | 哈尔滨工业大学 | Evaluating method of error code negotiation algorithm for quantum communication |
| CN106027230A (en) * | 2015-03-28 | 2016-10-12 | 北京大学 | Method for carrying out Hamming error correction for error code in quantum secret key distribution postprocessing |
| CN106100835A (en) * | 2016-07-19 | 2016-11-09 | 北京邮电大学 | A kind of Highly precise FFT method in continuous variable quantum key distribution and high post processing data user rate method |
| CN106549755A (en) * | 2016-12-09 | 2017-03-29 | 哈尔滨工业大学 | The optimization method of Cascade class error code negotiation algorithms |
| CN108712232A (en) * | 2018-05-04 | 2018-10-26 | 北京邮电大学 | A kind of multi-code word parallel decoding method in continuous variable quantum key distribution system |
Non-Patent Citations (1)
| Title |
|---|
| "QKD后处理的LDPC误码协商算法研究及硬件实现";毛昊坤;《中国优秀硕士学位论文全文库信息科技辑》;20180415;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109639422A (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110380819A (en) | A kind of segmentation overturning polarization code coding method and intelligent terminal based on LLR | |
| US20060136799A1 (en) | LDPC decoding apparatus and method with low computational complexity algorithm | |
| CN106059712B (en) | High-error-code arbitrary-code-rate convolutional code coding parameter blind identification method | |
| US9831987B2 (en) | Staggered parity | |
| WO2015079193A1 (en) | Belief propagation decoding for short algebraic codes with permutations within the code space | |
| CN108092673B (en) | BP iterative decoding method and system based on dynamic scheduling | |
| CN110233628B (en) | Self-adaptive belief propagation list decoding method for polarization code | |
| WO2018219195A1 (en) | Decoding method and decoder | |
| Jin et al. | Reliability-based soft-decision decoding with multiple biases | |
| CN107347000B (en) | ARM-based digital fountain code compiling and decoding implementation method | |
| Schläfer et al. | Syndrome based check node processing of high order NB-LDPC decoders | |
| CN107276725B (en) | Improved threshold-based SCMA low-complexity parallel multi-user detection method | |
| WO2007053126A1 (en) | Methods and devices for decoding and encoding data | |
| CN109639422B (en) | Error code negotiation method and device for discrete quantum key distribution system | |
| Zarei et al. | An analytical model for sparse network codes: Field size considerations | |
| WO2006001748A2 (en) | Method and apparatus for decoding of turbo encoded data in a communication system | |
| CN111510286A (en) | Error code negotiation method of quantum key distribution system | |
| CN110190857B (en) | CRC (Cyclic redundancy check) auxiliary check polarization code decoding method and intelligent terminal | |
| EP1894305A2 (en) | Decoding method and apparatus | |
| RU2699833C1 (en) | Method of accelerated decoding of a linear code | |
| CN108988873B (en) | Polar code processing method, decoder and terminal | |
| CN111010196B (en) | Decoding method for BP List of polarization code | |
| CN111835363A (en) | LDPC code decoding method based on alternative direction multiplier method | |
| Azouaoui et al. | An efficient soft decoder of block codes based on compact genetic algorithm | |
| CN112534724B (en) | Decoder and method for decoding polarization code and product code |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Qiong Inventor after: Luo Yi Inventor after: Mao Haokun Inventor after: Liu Zhaoqing Inventor after: Han Qi Inventor after: Guo Hong Inventor before: Li Qiong Inventor before: Mao Haokun Inventor before: Luo Yi Inventor before: Liu Zhaoqing Inventor before: Han Qi Inventor before: Guo Hong |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |