CN109379084A - A kind of interpretation method for burst error - Google Patents
A kind of interpretation method for burst error Download PDFInfo
- Publication number
- CN109379084A CN109379084A CN201811047097.6A CN201811047097A CN109379084A CN 109379084 A CN109379084 A CN 109379084A CN 201811047097 A CN201811047097 A CN 201811047097A CN 109379084 A CN109379084 A CN 109379084A
- Authority
- CN
- China
- Prior art keywords
- syndrome
- burst error
- unreliable
- matrix
- securing
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/1515—Reed-Solomon codes
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Error Detection And Correction (AREA)
Abstract
The present invention relates to a kind of interpretation methods for burst error, improve to RS code OSD Soft decision decoding algorithm.It include: to be recorded by the setting of threshold value to the biggish bit appearance position of level change；The position for being likely to occur random error is locked by log-likelihood calculations, determines the unreliable position that may be malfunctioned jointly；Increase the pre- judgment module of burst error, generates the parity matrix on corresponding position for unit matrix according to least securing position；The calculating of syndrome is carried out by reception code word and generated parity matrix, and calculate the number of non-zero bit in syndrome, it is compared with given threshold, if non-zero number of bits is less than threshold value, misjudgment all concentrates on selected unreliable position, conversely, judging the wrong appearance on securing position；Complete work decoding.
Description
Technical field
The invention belongs to error control coding field in channel coding, it is related under a kind of burst error channel to continuous burst
The decoding algorithm of mistake and individual random errors.
Background technique
With the rapid development of society, scientific and technological made rapid progress, the information exchange between people is increased, these all with
The development of mechanics of communication is closely related.Especially digital communication mode is stored and is integrated with remote, high quality, convenient for encryption
The advantages that, it has also become the core of contemporary communication mode.But the channel circumstance of Modern transmission becomes increasingly complex, since there are noises
The influence of the factors such as defect caused by the property of interference and channel itself, so that signal deviation occurs in the channel and causes
Signal error is received, influences to transmit result.Error Control is using digital information coding and decoding technology in digital communication to signal
The technology that the error signal occurred in transmission process is corrected.RS code is a kind of Linear codes of error correcting capability with higher
Code, structure is simple, and it is all to be widely used in data storage, digital video broadcasting, deep space exploration, wireless communication, wireless MAN etc.
It is multi-field.
RS decoding algorithm now is broadly divided into two major classes: Hard decision decoding algorithm (hard-decision decoding)
And Soft decision decoding algorithm (soft-decision decoding).Hard decision algorithm is the direct judgement according to transmission signal
As a result come the algorithm decoded, mainly there are Berlekamp-Massey Algorithm (BMA) algorithm, Euclidean algorithm
With Reformulation of the Inverse-Free BM (RiBM) algorithm.Soft-decision algorithm is passed through according to digital signal
Channel level information after crossing transmission is come what is completed, and due to considering the information of channel, soft-decision compares Hard decision decoding
Algorithm coding gain with higher, but also there is bigger algorithm complexity simultaneously, main algorithm has(KV) it calculates
Method, Low-Complexity Chase (LCC) algorithm, adaptive belief propagation (ABP) algorithm and Ordered Statistic decoding (OSD) are calculated
Method.
With the research to error control coding in wireless communication, research direction is studied closer to actual conditions
Channel model is from ideal additive white Gaussian noise channel to the channel mould with continuous burst error closer to actual conditions
Type promotes.And in the channel model with continuous burst error, due to the interference by pulse, occur in channel code word often
A certain segment encode member error probability is very high, or even the phenomenon that continuous error occurs, and simultaneously, additive Gaussian is come across often
Random error in white noise channel model similarly appears in channel model.Since the code field continuously to malfunction is longer and
The decoding capability of common RS code decoding algorithm is had exceeded, therefore algorithm above is just no longer applicable in, is proposed by Y.Wu et al. within 2012
For BCA (Burst-error Correcting Algorithm) algorithm of continuous burst error, Wang in 2016
Lingyu optimizes the fusion type Soft decision decoding (BCHDD- proposed based on hard decision on the basis of BCA algorithm
LCC) algorithm further improves the decoding effect under mixed channel.
Summary of the invention
It is an object of the invention to propose a kind of interpretation method that hardware consumption is less for burst error.Technical solution is such as
Under:
A kind of interpretation method for burst error improves RS code OSD Soft decision decoding algorithm.Including following
Step:
(1) the biggish bit appearance position of level change is recorded by the setting of threshold value, in this, as may go out
Wrong burst error position；The position for being likely to occur random error is locked by log-likelihood calculations, it is common to determine
The unreliable position that may be malfunctioned out；
(2) increase the pre- judgment module of burst error, for RS (N, K) code, code word input burst error to be decoded judges in advance
In module, burst error that may be present in code word position is judged in advance by the module, is found out according to log-likelihood ratio
N-K least securing positions are determined in other unreliable positions altogether.
(3) parity matrix on corresponding position for unit matrix is generated according to least securing position；
(4) calculating of syndrome is carried out by reception code word and generated parity matrix, and calculated non-in syndrome
The number of zero bit compares it with given threshold, if non-zero number of bits is less than threshold value, misjudgment all concentrates on selecting
Unreliable position on, conversely, judging the wrong appearance on securing position；
(5) work decoding is next completed according to the result in (3), it, will be with if mistake is only present in unreliable position
The corresponding unreliable bit reversal in syndrome non-zero position completes decoding；If occurring mistake at securing position, by syndrome
It is respectively arranged with parity matrix and carries out modular two addition, select the smallest column of non-zero bit number, and corresponding position code word is turned over
Turn, while updating syndrome, updated syndrome return (4) is decoded again.
Preferably, step (2) generates the parity matrix on corresponding position for unit matrix according to least securing position
For rarefaction parity matrix, generation method are as follows: obtain what parity check matrix rows respectively arranged by known unreliable position
Molecular computing multinomial and denominator evaluator, the two is divided by obtain the value of each ranks of parity matrix, to obtain
Rarefaction parity matrix.
Present invention is generally directed to the decoding processes of code word in burst error channel to be designed, by the think of of belief propagation algorithm
Want to apply on RS code.In burst error channel, channel model can be reduced to two kinds of not homoscedastic Gaussian channels, random wrong
Accidentally channel corresponds to smaller variance, and burst error channel corresponds to greater variance, burst error state and non-burst mistake in channel
Accidentally state only has variance difference, and the level fluctuation directly resulted at burst position is larger, therefore can use channel Soft Inform ation pair
Burst error position is judged in advance, at the same time, determines least securing position in conjunction with log-likelihood ratio, to prominent in channel
Hair mistake and individual random errors are decoded.In addition, being effectively reduced by new parity matrix rarefaction method
The area of hardware configuration, improves circuit efficiency.
Detailed description of the invention
The workflow of Fig. 1 decoding algorithm
The hardware structure of Fig. 2 parity matrix module
Specific embodiment
For burst error channel, when there is continuous burst error to occur in the channel, at burst error position due to by
The noise jamming arrived it is larger so that modulation level size variation range than other positions place modulation level variation range
It is big.Therefore, by many experiments threshold value, and by the setting of threshold value to the biggish bit appearance position of level change into
Row record, in this, as the burst error position that may be malfunctioned.At the same time, it there may also be individual random errors in channel to go out
It is existing, therefore, while the position for being likely to occur random error is locked by log-likelihood calculations, determines possibility jointly
The unreliable position of error.
The rarefaction that parity matrix is carried out according to the unreliable position that is recorded, by with corresponding to unreliable position
Check matrix column variation is unit array, to reduce influence of the unreliable position to decoding process, with gained sparse parity-check
Matrix calculates syndrome, and according to calculated syndrome bit weightings, carrying out threshold decision to syndrome weight, (threshold value passes through
Many experiments determine), different decoding schemes is selected, if weight is less than threshold value, illustrates only to occur at unreliable position wrong
Accidentally, will carry out overturning to corresponding unreliable bit position can be completed decoding；If more than threshold value, then explanation is in other reliable bits
The wrong appearance in place is set, then secondary calculating is carried out to syndrome and parity matrix to determine the position of the reliable code word of error
It sets, and carries out overturning adjustment to it, update syndrome, and calculate threshold value again and carry out secondary decoding.
When generating Sparse Parity-check Matrix, the method being currently known is gaussian elimination, but gaussian elimination algorithm is real
Existing process is complicated, and hardware consumption is huge.For this problem, which proposes a kind of New Algorithm, the algorithm by it is known not
Securing position obtains the molecular computing multinomial and denominator evaluator that parity check matrix rows respectively arrange, and the two is divided by obtain
The value of each ranks of parity matrix.The molecular computing multinomial and denominator evaluator of New Algorithm proposed by the invention
It with identical structure, can be realized with identical hardware structure assembly line, therefore structure is simple on hardware circuit, disappears compared to Gauss
Method is gone to greatly reduce hardware consumption.
The workflow of entire algorithm is as shown in Figure 1, specifically describe the process of algorithm below with reference to Fig. 1:
(1) for RS (N, K) code, code word to be decoded first enters the burst error anticipation in algorithm as the input of algorithm
In disconnected module, burst error that may be present in code word position can be judged in advance by the module.In addition, seemingly according to logarithm
So than finding out other unreliable positions, N-K least securing positions are determined altogether.
(2) parity matrix on corresponding position for unit matrix is generated according to least securing position, which can lead to
Recodification diagonalization or gaussian elimination are crossed to realize, this algorithm proposes a kind of novel sparse check matrix generating algorithm, reaches phase
Same effect, more conducively hardware realization.
(3) calculating of syndrome is next carried out by reception code word and generated rarefaction parity matrix, and counted
The number for calculating non-zero bit in syndrome, it is compared with given threshold, if non-zero number of bits is less than threshold value, illustrates mistake
It all concentrates on selected unreliable position, conversely, the wrong appearance on securing position.
(4) work decoding is next completed according to the result in (3).It, will be with if mistake is only present in unreliable position
The corresponding unreliable bit reversal in syndrome non-zero position completes decoding.
(5) if occurring mistake at securing position, syndrome and parity matrix is respectively arranged and carry out modular two addition, is selected
The smallest column of non-zero bit number, and corresponding position code word is overturn, while updating syndrome, updated syndrome is returned
(4) are gone back to decode again.
The specific pseudocode of algorithm is as shown in Algorithm:DecodingAlgorithm.
In the present invention, for generating the pseudo-code of the algorithm such as Algorithm:matrix of the sparse parity matrix in part
Shown in H, specifically described below with reference to pseudo-code of the algorithm:
(1) for RS (N, K) code, N-K least securing positions are determined according to upper layer module first, and will be least reliable
Position is shifted, so that first is unreliable position, since RS code is cyclic code, after such shifting function will not influence
Continuous decoding result.Unreliable position is denoted as γ after displacement1, γ2, γ3..., γN-K, securing position is denoted as ρ1, ρ2, ρ3...,
ρK。
(2) computational constant F (α)=(α-α2)(α-α3)…(α-αn), wherein α is this yuan of original of galois field, is subsequent
It calculates and basis is provided.
(3) according to after displacement unreliable position and securing position calculate separately parity matrix the first row molecule and
Each row denominator, wherein the first row molecular computing multinomial be
Denominator evaluator is
On the basis of the first row molecule, formula is utilized
The molecule of remaining each row is calculated, parity matrix can be obtained by each row is respectively finally arranged corresponding molecule denominator being divided by
The value of non-sparse part finally will fill upper unit matrix in the corresponding column in unreliable position, and can be obtained has part sparse
The parity matrix of characteristic.
It can be seen that the first row molecule of parity matrix and the calculating tool of each row denominator from the calculation formula in algorithm
There is same architecture, can be realized that hardware resource consumption is small with same hardware configuration.Its hardware architecture diagram is as shown in Fig. 2, wherein
B2P module is the binary representation of galois field and the conversion that power table shows.
Claims (2)
1. a kind of interpretation method for burst error improves RS code OSD Soft decision decoding algorithm.Including following step
It is rapid:
(1) the biggish bit appearance position of level change is recorded by the setting of threshold value, in this, as what may be malfunctioned
Burst error position；The position for being likely to occur random error is locked by log-likelihood calculations, determining jointly can
The unreliable position that can be malfunctioned；
(2) increase the pre- judgment module of burst error, for RS (N, K) code, code word to be decoded inputs the pre- judgment module of burst error
In, burst error that may be present in code word position is judged in advance by the module, other are found out according to log-likelihood ratio
N-K least securing positions are determined in unreliable position altogether；
(3) parity matrix on corresponding position for unit matrix is generated according to least securing position；
(4) calculating of syndrome is carried out by reception code word and generated parity matrix, and calculates non-zero ratio in syndrome
Special number, it is compared with given threshold, if non-zero number of bits is less than threshold value, misjudgment all concentrate on it is selected not
On securing position, conversely, judging the wrong appearance on securing position；
(5) next completing work decoding according to the result in (3) will be with verification if mistake is only present in unreliable position
The corresponding unreliable bit reversal in sub- non-zero position, completes decoding；If occurring mistake at securing position, by syndrome and surprise
Even parity check matrix, which respectively arranges, carries out modular two addition, selects the smallest column of non-zero bit number, and corresponding position code word is overturn, together
Shi Gengxin syndrome decodes updated syndrome return (4) again.
2. interpretation method according to claim 1, which is characterized in that step (2) is generated according to least securing position and corresponded to
The parity matrix on position being unit matrix is rarefaction parity matrix, generation method are as follows: by known unreliable
Position obtains the molecular computing multinomial and denominator evaluator that parity check matrix rows respectively arrange, and the two is divided by obtain odd even
The value of each ranks of check matrix, to obtain rarefaction parity matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811047097.6A CN109379084B (en) | 2018-09-08 | 2018-09-08 | Decoding method for burst errors |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811047097.6A CN109379084B (en) | 2018-09-08 | 2018-09-08 | Decoding method for burst errors |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109379084A true CN109379084A (en) | 2019-02-22 |
| CN109379084B CN109379084B (en) | 2021-09-17 |
Family
ID=65404669
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811047097.6A Active CN109379084B (en) | 2018-09-08 | 2018-09-08 | Decoding method for burst errors |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109379084B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110096384A (en) * | 2019-04-23 | 2019-08-06 | 西安电子科技大学 | The guard method of highly reliable aerospace data and intermediate variable |
| CN110339574A (en) * | 2019-08-13 | 2019-10-18 | 腾讯科技（深圳）有限公司 | A kind of hot spot Caton location determining method, device, server and the storage medium of game |
| CN111917420A (en) * | 2020-08-25 | 2020-11-10 | 广东省新一代通信与网络创新研究院 | LDPC self-adaptive decoding method and LDPC self-adaptive decoder |
| WO2022095680A1 (en) * | 2020-11-05 | 2022-05-12 | 华为技术有限公司 | Position detection method and apparatus |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1997011530A1 (en) * | 1995-09-20 | 1997-03-27 | Hitachi, Ltd. | Method and device for decoding burst error of reed-solomon code |
| US5659557A (en) * | 1990-11-08 | 1997-08-19 | Cirrus Logic, Inc. | Reed-Solomon code system employing k-bit serial techniques for encoding and burst error trapping |
| EP1387542A2 (en) * | 2002-07-29 | 2004-02-04 | Panasonic Communications Co., Ltd. | Symbol and hyperframe synchronisation in an ADSL modem |
| CN101621299A (en) * | 2008-07-04 | 2010-01-06 | 华为技术有限公司 | Burst correcting method, equipment and device |
| CN102122964A (en) * | 2011-03-31 | 2011-07-13 | 西安电子科技大学 | Implementation method of high-speed reed-solomon (RS) codec based on field programmable gate array (FPGA) |
| CN102299758A (en) * | 2010-06-23 | 2011-12-28 | 中兴通讯股份有限公司 | Method and device for processing data burst error |
| US20130219243A1 (en) * | 2008-11-26 | 2013-08-22 | Broadcom Corporation | Handling burst error events with interleaved Reed-Solomon (RS) codes |
| CN106330205A (en) * | 2016-08-17 | 2017-01-11 | 天津大学 | Decoding algorithm for long burst errors |
| CN106341211A (en) * | 2016-08-17 | 2017-01-18 | 天津大学 | Self-adaptive decoding method for multiple channel environments |
-
2018
- 2018-09-08 CN CN201811047097.6A patent/CN109379084B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5659557A (en) * | 1990-11-08 | 1997-08-19 | Cirrus Logic, Inc. | Reed-Solomon code system employing k-bit serial techniques for encoding and burst error trapping |
| WO1997011530A1 (en) * | 1995-09-20 | 1997-03-27 | Hitachi, Ltd. | Method and device for decoding burst error of reed-solomon code |
| EP1387542A2 (en) * | 2002-07-29 | 2004-02-04 | Panasonic Communications Co., Ltd. | Symbol and hyperframe synchronisation in an ADSL modem |
| CN101621299A (en) * | 2008-07-04 | 2010-01-06 | 华为技术有限公司 | Burst correcting method, equipment and device |
| US20130219243A1 (en) * | 2008-11-26 | 2013-08-22 | Broadcom Corporation | Handling burst error events with interleaved Reed-Solomon (RS) codes |
| CN102299758A (en) * | 2010-06-23 | 2011-12-28 | 中兴通讯股份有限公司 | Method and device for processing data burst error |
| CN102122964A (en) * | 2011-03-31 | 2011-07-13 | 西安电子科技大学 | Implementation method of high-speed reed-solomon (RS) codec based on field programmable gate array (FPGA) |
| CN106330205A (en) * | 2016-08-17 | 2017-01-11 | 天津大学 | Decoding algorithm for long burst errors |
| CN106341211A (en) * | 2016-08-17 | 2017-01-18 | 天津大学 | Self-adaptive decoding method for multiple channel environments |
Non-Patent Citations (3)
| Title |
|---|
| LINGYU WANG1: "Multiple channel error-correction algorithms for LCC decoding of Reed-Solomon codes and its high-speed architecture design", 《IET COMMUNICATIONS》 * |
| 王令宇: "一种RS码突发错误译码算法的改进算法", 《 南开大学学报(自然科学版)》 * |
| 胡岩: "突发错误检测重数分配算法及其电路设计", 《西安交通大学学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110096384A (en) * | 2019-04-23 | 2019-08-06 | 西安电子科技大学 | The guard method of highly reliable aerospace data and intermediate variable |
| CN110339574A (en) * | 2019-08-13 | 2019-10-18 | 腾讯科技（深圳）有限公司 | A kind of hot spot Caton location determining method, device, server and the storage medium of game |
| CN110339574B (en) * | 2019-08-13 | 2022-07-29 | 腾讯科技（深圳）有限公司 | Game hotspot card pause position determining method and device, server and storage medium |
| CN111917420A (en) * | 2020-08-25 | 2020-11-10 | 广东省新一代通信与网络创新研究院 | LDPC self-adaptive decoding method and LDPC self-adaptive decoder |
| CN111917420B (en) * | 2020-08-25 | 2023-07-04 | 广东省新一代通信与网络创新研究院 | LDPC self-adaptive decoding method and LDPC self-adaptive decoder |
| WO2022095680A1 (en) * | 2020-11-05 | 2022-05-12 | 华为技术有限公司 | Position detection method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109379084B (en) | 2021-09-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100517980C (en) | Decoding apparatus and method | |
| CN109379084A (en) | A kind of interpretation method for burst error | |
| US9166623B1 (en) | Reed-solomon decoder | |
| US9015547B2 (en) | Multi-level LDPC layered decoder with out-of-order processing | |
| TWI663839B (en) | Method for providing soft information with decoder under hard decision hard decoding mode | |
| US7949927B2 (en) | Error correction method and apparatus for predetermined error patterns | |
| US8566666B2 (en) | Min-sum based non-binary LDPC decoder | |
| US10084481B2 (en) | GLDPC soft decoding with hard decision inputs | |
| CN110915141A (en) | TURBO product code based on polar code | |
| US8775896B2 (en) | Non-binary LDPC decoder with low latency scheduling | |
| US8756478B2 (en) | Multi-level LDPC layer decoder | |
| US7319726B1 (en) | Soft-output decoding method and apparatus for controlled intersymbol interference channels | |
| Condo | A fixed latency ORBGRAND decoder architecture with LUT-aided error-pattern scheduling | |
| US20130139022A1 (en) | Variable Sector Size LDPC Decoder | |
| Yue et al. | Efficient decoders for short block length codes in 6G URLLC | |
| CN103269229A (en) | Mixed iterative decoding method for LDPC-RS two-dimensional product code | |
| WO2004032398A1 (en) | Iterative equalization and iterative decoding of a reed-muller coded signal | |
| US8499228B2 (en) | Method for decoding a succession of blocks encoded with an error correction code and correlated by a transmission channel | |
| US9793924B1 (en) | Method and system for estimating an expectation of forward error correction decoder convergence | |
| Zhang et al. | Iterative soft decoding of reed-solomon codes based on deep learning | |
| US10038456B1 (en) | Decoders with look ahead logic | |
| Alaoui et al. | A low complexity soft decision decoder for linear block codes | |
| Jamali et al. | Low-complexity decoding of a class of Reed-Muller subcodes for low-capacity channels | |
| Zhilin et al. | High-rate codes for high-reliability data transmission | |
| US8156412B2 (en) | Tree decoding method for decoding linear block codes |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |