CN108259128A - A kind of building method of the system Raptor codes based on nonrandom generator matrix - Google Patents
A kind of building method of the system Raptor codes based on nonrandom generator matrix Download PDFInfo
- Publication number
- CN108259128A CN108259128A CN201711429039.5A CN201711429039A CN108259128A CN 108259128 A CN108259128 A CN 108259128A CN 201711429039 A CN201711429039 A CN 201711429039A CN 108259128 A CN108259128 A CN 108259128A
- Authority
- CN
- China
- Prior art keywords
- code
- raptor
- code word
- codes
- check
- 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
- 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
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0064—Concatenated codes
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3761—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The present invention relates to a kind of building methods of the system Raptor codes based on nonrandom generator matrix.Raptor codes in the present invention are divided into Internal Code and outer code, and Internal Code is for one without rate LT codes, LDPC code of the outer code for a high code check.LDPC code and LT codes are all systematic codes.Source bits are encoded into Raptor code words by Raptor encoders, and first part is uncoded systematic codeword in generated Raptor code words, and second part is check code word.Transmitting terminal sends uncoded systematic codeword first, and check code word is sent successively then according to the size order of degree.Receiving terminal receives and is iterated decoding using Global B P algorithms after a certain number of code words.Compared with prior art, the present invention has the advantages that throughput is higher, and BER is smaller, simple structure.
Description
Technical field
The present invention relates to the physical layer codings in a kind of wireless communication system, and nonrandom generation is based on more particularly, to one kind
The building method of the system Raptor codes of matrix.
Background technology
In a wireless communication system, channel coding is to improve a kind of most crucial technology of data transmission credibility.Tradition
The code check of channel coding (such as LDPC, Turbo etc.) there was only stepped several selections, it is impossible to realize the switching of arbitrary bit rate.
The transmitting terminal more importantly encoded using conventional channel will predict the quality of channel according to channel feedback situation, then according to letter
Road quality selects certain code check.Since wireless channel is time-varying, the prediction of channel quality often has very big retardance.
This will lead to the selected code check of transmitting terminal and channel quality and mismatch, so that the throughput of entire wireless communication system
It is relatively low.No-rate codes (or fountain codes) are a kind of unfixed codings of code check, and encoder can endlessly generate arbitrary code
The code word of rate, transmitting terminal do not need to prediction channel quality, it is only necessary to constantly send code word until receiving the ACK letters of receiving terminal feedback
Number.LT codes are the first practical no-rate codes, and in the near future Raptor codes are suggested.Raptor is a kind of cascade without rate
Code is made of, therefore the performance of Raptor codes is better than simple LT codes the LDPC outer codes and a LT Internal Code of high code check.Most
Early LT codes and Raptor codes be all towards erasure channel and the application layer that proposes encodes.In order to ensure that receiving terminal is collected into arbitrarily
Enough code words can recover original information source.Raptor encoders generate code word using random manner, this is main
It is embodied in two aspects：(1) for Raptor when code word is generated, the degree of each code word is randomly selected.(2) each code word
Degree determine after, randomly choose several LDPC intermediate bits carry out mould two plus.Wireless channel mainly has white Gaussian noise letter
Road and fading channel, the two channels will not all lose any code word, and additivity and multiplicative noise are only generated to code word so that
The value of code word generates distortion.Therefore the designing scheme of traditional random Raptor codes is not highly suitable for wireless channel.Although
Also the physical layer that many scholars are applied to Raptor codes wireless channel is studied and improved, but there is no break through Raptor
The shortcomings that code carries out code construction using random generator matrix.Therefore the performance of Raptor codes still improves a lot sky at present
Between.
Invention content
A kind of throughput proposed the purpose of the invention is to overcome the problems of the above-mentioned prior art is high, decoding
The building method of the low system Raptor codes based on nonrandom generator matrix of error rate.
The purpose of the present invention can be achieved through the following technical solutions：
A kind of building method of the system Raptor codes based on nonrandom generator matrix, which is characterized in that in the present invention
Raptor codes are divided into Internal Code and outer code, and Internal Code is for one without rate LT codes, LDPC code of the outer code for a high code check.Raptor is compiled
Source bits are encoded into Raptor code words by code device.The program includes the following steps：
(1) one-dimensional vector for enabling K source bits composition is s={ si, i=0,1 ..., K-1 }, s is encoded by LDPC
N number of intermediate code word b={ b are generated after devicei, i=0,1 ..., N-1 }.Intermediate code word b after LT encoders further across generating number
Measure variable Raptor code words r.The nonrandom generator matrix for enabling LT encoders is G, then has r=bG.
(2) since LT codes are systematic codes, Raptor code words r can be divided into two parts, can be expressed as r=r ',
R " }, wherein r ' is N number of uncoded systematic codeword, identical with LDPC intermediate bits b.R " is L check code word (due to no speed
The characteristic of rate code, the value of L be it is variable, theoretically can be infinitely great).G can be write as G=[I, P], and wherein I is a N*N
Unit matrix, P are the sparse matrixes of a N*L.
(3) uncoded code word is individually for a data packet, and check code word is divided into multiple data packets.
(4) degree of Raptor code words is the number of the selected LDPC intermediate bits of each code word.
(5) the identical code word of check code word r " moderates concentrates in together, and the degree of code word is dropped according to sequence from big to small
Sequence arranges.That is each row nonzero element number is fixed rather than random in G.Therefore P can be rewritten as：P=[P1,
P2,…,Pi,…,PI], wherein PiFor a N × LiSubmatrix, for degree of production be DiCheck code word.
(6) each Raptor code words (including codeless systematic codeword) select ratio among LDPC according to sequencing successively
It is special.That is the position of each row nonzero element does not randomly place in G, but is put together at together.WithTo represent PiIn
LiRow, thenInclude (N-Di) it is a value for 0 element and DiThe element that a value is 1.In order to avoid generator matrix middle ring
It generates, often generates a certain number of check code words, source bits will carry out once interweaving and rearrange.
More than technical method, the middle nonrandom generator matrix G obtained of step (1) is key technology of the invention.It is existing
Raptor codes use random generator matrix G.The reason is that Raptor codes are proposed towards BEC erasure channels.Erasure channel
Can a part of Raptor code words of random loss, therefore can in order to ensure that receiving terminal is collected into arbitrary enough Raptor code words
Recover original source bits.Existing Raptor encoders generate code word using random generator matrix G, this major embodiment
At two aspects：(1) for Raptor when code word is generated, the degree of each code word is randomly selected, i.e. each row is non-in G
Neutral element number (degree of i.e. each Raptor code words) is random.(2) after the degree of each Raptor code words determines, this code
Word randomly chooses several LDPC intermediate bits progress mould two and adds.That is the position of each row nonzero element randomly places in G.
Wireless channel mainly has Gaussian white noise channel and fading channel.Wireless channel will not be lost any unlike erasure channel
Code word, and additivity and multiplicative noise are only generated to Raptor code words so that the value of code word generates distortion.Therefore it is existing random
The designing scheme of Raptor codes is not highly suitable for wireless channel.In order to adapt to wireless channel, the present invention innovatively proposes
Raptor code constructing methods based on nonrandom generator matrix G.
System in application,
1st, transmitting terminal handle is sent successively via Raptor code words caused by the method for the present invention according to certain sequence.Tool
Body is said：The degree of all uncoded systematic codeword r ' is all 1, and these systematic codewords all concentrate in together, and is the code of foremost
Word, transmitting terminal all send these uncoded code words first.After uncoded systematic codeword followed by degree most
The set of big check code word, hereafter the degree of check code word be sequentially reduced in sequence.Transmitting terminal is first sent with more magnanimous
Check code word, it is rear to send the check code word with smaller degree, until receiving the ack signal that receiving terminal feedback comes.
2nd, receiving terminal is iterated decoding using Global B P algorithms.Specially：Receiving terminal is collected into whole N number of uncoded
Global B P iterative decoders are used after code word into row decoding.If cannot be successfully decoded, continue waiting for transmitting terminal and send more
More check code words.Combine pervious uncoded code word trial and error decoding together after a certain number of check code words are collected into.Such as
This continues until can be successfully decoded, and ack signal is sent after successfully decoded to transmitting terminal.The receiving terminal, implementation steps can
To include
(1) in the iteration each time of BP algorithm, LLR (log-likelihood ratio) first completes V nodes and C in a LT decoder
The update of node, then complete the update of V nodes and C nodes in a ldpc decoder.
(2) by exporting decoding bit by hard decision after multiple global iterative.
Innovative point of the present invention is embodied in two aspects：
(1) present invention connects the position of no-rate codes code word with channel condition for the first time.When channel condition is relatively good
When, transmitting terminal only needs to send a small amount of code word, and receiving terminal can just decode correct.When channel condition is poor, send
End, which needs to send more code word receiving terminals, could decode correctly.Therefore when channel condition is relatively good, transmitting terminal is sent out
The code word sent will have larger degree, and code word each in this way can cover more source bits, so as to save the code for needing to send
The quantity of word improves the throughput of whole system.When channel condition is poor, the code word needs transmitted by transmitting terminal have
Smaller degree can be easier to be decoded success in this way by the code word of channel pollution.Based on above premise, in the present invention
In the Raptor code words of method institute output, spend identical check code word and gather together, and spend distribution be according to from greatly to
Small sequence descending arrangement.After i.e. transmitting terminal has sent codeless systematic codeword, the check code word first sent is with larger
Degree, the check code word sent afterwards have smaller degree.
(2) in traditional Raptor codes, several LDPC intermediate bits of the random selection of each Raptor code words.When
When code word size is shorter, some LDPC intermediate bits may be chosen repeatedly, and other LDPC intermediate bits may be not
Selected, this can cause receiving terminal that cannot restore information source completely, so as to cause relatively low throughput.In the present invention, each code
Word selects LDPC intermediate bits according to sequencing successively (including codeless systematic codeword).
Compared with prior art, based on the system Raptor code energy designed by nonrandom generator matrix proposed by the invention
Enough significantly improve system throughput and decoding after BER.
Description of the drawings
Fig. 1 is the flow diagram of transmitting terminal and receiving terminal in present invention application.
Fig. 2 is schematic diagram of the LT encoders in the present invention by LDPC intermediate bits generation Raptor code words.
Fig. 3 is the detail portion component of part figure 2, illustrates selecting party of the Raptor check code words to LDPC intermediate bits
Method.
Fig. 4 is when the present invention is combined with 16QAM and comparison knot of the traditional scheme in throughput (goodput) performance
Fruit.
Fig. 5 is when the present invention is combined with 64QAM and comparison knot of the traditional scheme in throughput (goodput) performance
Fruit.
Fig. 6 is when the present invention is combined with 16QAM and comparing result of the traditional scheme in the bit error rate (BER) performance.
Fig. 7 is when the present invention is combined with 64QAM and comparing result of the traditional scheme in the bit error rate (BER) performance.
Specific embodiment
The present invention is described in detail with specific embodiment below in conjunction with the accompanying drawings.
Embodiment
The present invention proposes a kind of building method of the system Raptor codes based on nonrandom generator matrix.The present invention's
Raptor codes are a concatenated codes, are made of the LDPC outer codes and a LT Internal Code without rate of high code check.Source bits
LDPC encoder generation LDPC intermediate bits are introduced into, LDPC intermediate bits enter back into LT encoders generation Raptor code words.
First part is uncoded systematic codeword in Raptor code words, and second part is check code word.Spend identical check code word collection
In together, and spend according to from big to small sequence descending arrange.Each Raptor code words are (including systematic codeword and check code
Word) select LDPC intermediate bits successively according to sequencing.But in order to avoid the generation of generator matrix middle ring, often generation is certain
The check code word of quantity, source bits will carry out once interweaving and rearrange.Transmitting terminal sends whole systematic codewords first, then
Check code word data packet is sent successively, until receiving the ack signal of receiving terminal feedback.Receiving terminal is collected into a certain number of
Global B P iterative algorithms are used after Raptor code words into row decoding.The block diagram of whole system transmitting terminal and receiving terminal is as shown in Figure 1.
Specific embodiment step is as follows：
Step 1, Fig. 2 are the bipartite graph of LT encoder cataloged procedures.Circle represents N number of LDPC intermediate bits, square in figure
Represent Raptor code words.We can see that top n Raptor code words degree of being is 1 uncoded systematic codeword from figure, this
A little code words are identical with LDPC intermediate bits.It is check code word after systematic codeword.The collection of the degree of these check code words is combined into { D1,
D2,…,Di,…,DI}(Di>Di+1), corresponding code word size is respectively { L1,L2,…,Li,…,LI}.Wherein LiBetween N
Relationship be：Li=N × xi(1≤i≤I), wherein xiIt can be adjusted according to actual conditions.In specific design application, letter
The length of source bit is taken as 4096.The code check of LDPC code is taken as 0.95.Pass through the collection of the degree of the check code word designed by enumerative technique
It is combined into { 12,6,4,2 }, xiValue be x1≈0.27,x2≈0.146,x3≈0.27,x4Value be not fixed, can be infinitely great.
Step 2, Fig. 3 are the part detail view of LT encoders in Fig. 2.WhereinFor continuous 4 schools
Test code word, code wordDegree be Dj, code word { rI,0,rI,1,rI,2Degree all be 2.{bn-2,bn-1,bn,bn+1,…,bn+5Be
Continuous 8 LDPC intermediate bits.In Fig. 3,The last one selected intermediate bit is bn-1, then rI,0Select bn-1
Continuous intermediate bit { the b of two belown,bn+1, similarly rI,1Select bn+1Continuous intermediate bit { the b of two belown+2,bn+3,
rI,2Select bn+3Continuous intermediate bit { the b of two belown+4,bn+5}。
Step 3, the design in step 1 and step 2 represent generator matrix with G, then G can be write as G=[I,
P], wherein I is the unit matrix of a N*N, and P is that (wherein the length of L is variable, and is theoretically worth for the sparse matrix of a N*L
Can be endless), P can be rewritten as, P=[P1,P2,…,Pi,…,PI], wherein PiFor a N × LiSubmatrix, useTo represent PiIn liRow, thenInclude (N-Di) it is a value for 0 element and DiThe element that a value is 1.And these values are 1
The position of element concentrate in together, it is assumed that their position is from k ' to k ".Then there is equation below：
Step 4, receiving terminal are translated after being collected into whole N number of uncoded code words using Global B P iterative decoders
Code.If cannot be successfully decoded, continue waiting for transmitting terminal and send more check code words.When being collected into a certain number of verifications
Combine pervious uncoded code word trial and error decoding together after code word.So continue until can be successfully decoded, sent out after successfully decoded
Ack signal is sent to transmitting terminal.
The BP iterative decoding algorithms are specific as follows：
(41) in the iteration each time of BP algorithm, LLR (log-likelihood ratio) first complete in a LT decoder V nodes and
The update of C nodes, then complete the update of V nodes and C nodes in a ldpc decoder.
(42) by exporting decoding bit by hard decision after multiple global iterative.
Fig. 4 is when the present invention is combined with 16QAM and comparison knot of the traditional scheme in throughput (goodput) performance
Fruit.Fig. 5 is when the present invention is combined with 64QAM and comparing result of the traditional scheme in throughput (goodput) performance.Figure
Horizontal axis is the signal-to-noise ratio (SNR) of channel in 4 and Fig. 5, and the longitudinal axis is throughput curve.When Fig. 6 is combined for the present invention with 16QAM
With comparing result (channel SNRs 10dB) of the traditional scheme in the bit error rate (BER) performance.Fig. 7 is the present invention and 64QAM
With reference to when with comparing result (channel SNRs 10dB) of the traditional scheme in the bit error rate (BER) performance.Fig. 6 and Fig. 7
Middle horizontal axis is the inverse (1/R) of Raptor code code checks, and the longitudinal axis is the bit error rate (BER) curve.With circle in this four figures of Fig. 4 to Fig. 7
The curve that circle ' o ' is represented is the performance map of Raptor codes proposed by the present invention, is existing scheme with the curve that asterisk ' * ' is represented
The performance map of Raptor codes, from Fig. 4 and Fig. 5 we can see that being much better than existing in middle high s/n ratio performance of the invention
There are Raptor codes, existing Raptor codes are also slightly better than under low signal-to-noise ratio.The present invention is in BER side as can be seen from Figures 6 and 7
The performance in face is much better than existing Raptor codes.
The above, is only the preferred embodiments of the present invention, and the interest field that the present invention is advocated is not limited thereto.This hair
Bright to also have other various embodiments, without deviating from the spirit and substance of the present invention, those skilled in the art can basis
The present invention makes various corresponding changes and deformation, but these change and deformation should all belong to appended claims of the invention
Protection domain.
Claims (2)
1. a kind of building method of the system Raptor codes based on nonrandom generator matrix, which is characterized in that in the present invention
Raptor codes are divided into Internal Code and outer code, and Internal Code is for one without rate LT codes, LDPC code of the outer code for a high code check；Raptor is compiled
Source bits are encoded into Raptor code words by code device；The program includes the following steps：
(1) one-dimensional vector for enabling K source bits composition is s={ si, i=0,1 ..., K-1 }, s is produced after LDPC encoder
Raw N number of intermediate code word b={ bi, i=0,1 ..., N-1 }.Intermediate code word b after LT encoders further across generating variable amounts
Raptor code words r.The nonrandom generator matrix for enabling LT encoders is G, then has r=bG；
(2) since LT codes are systematic codes, Raptor code words r can be divided into two parts, can be expressed as r={ r ', r " },
Middle r ' is N number of uncoded systematic codeword, identical with LDPC intermediate bits b；R " is L check code word (due to no-rate codes
Characteristic, the value of L be it is variable, theoretically can be infinitely great)；G can be write as G=[I, P], and wherein I is the unit of a N*N
Battle array, P is the sparse matrix of a N*L；
(3) uncoded code word is individually for a data packet, and check code word is divided into multiple data packets；
(4) degree of Raptor code words is the number of the selected LDPC intermediate bits of each code word；
(5) the identical code word of check code word r " moderates concentrates in together, and the degree of code word is arranged according to sequence descending from big to small
It arranges, i.e. each row nonzero element number is fixed rather than random in G；Therefore P can be rewritten as：P=[P1,
P2..., Pi..., PI], wherein PiFor a N × LiSubmatrix, for degree of production be DiCheck code word；
(6) each Raptor code words select LDPC intermediate bits according to sequencing successively (including codeless systematic codeword).
That is the position of each row nonzero element does not randomly place in G, but is put together at together；WithTo represent PiIn
liRow, thenInclude (N-Di) it is a value for 0 element and DiThe element that a value is 1.
2. method as described in claim 1, which is characterized in that in order to avoid the generation of generator matrix middle ring, often generate a fixed number
The check code word of amount, source bits will carry out once interweaving and rearrange.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711429039.5A CN108259128B (en) | 2017-12-26 | 2017-12-26 | Method for constructing system Raptor code based on non-random generator matrix |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711429039.5A CN108259128B (en) | 2017-12-26 | 2017-12-26 | Method for constructing system Raptor code based on non-random generator matrix |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108259128A true CN108259128A (en) | 2018-07-06 |
| CN108259128B CN108259128B (en) | 2020-09-11 |
Family
ID=62722881
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711429039.5A Active CN108259128B (en) | 2017-12-26 | 2017-12-26 | Method for constructing system Raptor code based on non-random generator matrix |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108259128B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109088701A (en) * | 2018-09-26 | 2018-12-25 | 北京理工大学 | A kind of LDPC code serial transmission method based on online fountain codes |
| CN109194336A (en) * | 2018-09-30 | 2019-01-11 | 同济大学 | Cascade the coding and interpretation method, system and device of Spinal code |
| WO2021163916A1 (en) * | 2020-02-19 | 2021-08-26 | Qualcomm Incorporated | Enhanced raptorq codes |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070260957A1 (en) * | 2006-05-03 | 2007-11-08 | Emina Soljanin | Encoded transmission |
| CN102244922A (en) * | 2011-08-08 | 2011-11-16 | 浙江大学 | Power control method applicable to Raptor Codes under additive white Gaussian noise channel |
| CN102820952A (en) * | 2012-08-02 | 2012-12-12 | 林子怀 | Method for optimizing throughput of wireless network system based on no-rate encoding |
| CN106685597A (en) * | 2017-02-14 | 2017-05-17 | 华南理工大学 | Raptor code part ring elimination coding method based on degree optimization |
-
2017
- 2017-12-26 CN CN201711429039.5A patent/CN108259128B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070260957A1 (en) * | 2006-05-03 | 2007-11-08 | Emina Soljanin | Encoded transmission |
| CN102244922A (en) * | 2011-08-08 | 2011-11-16 | 浙江大学 | Power control method applicable to Raptor Codes under additive white Gaussian noise channel |
| CN102820952A (en) * | 2012-08-02 | 2012-12-12 | 林子怀 | Method for optimizing throughput of wireless network system based on no-rate encoding |
| CN106685597A (en) * | 2017-02-14 | 2017-05-17 | 华南理工大学 | Raptor code part ring elimination coding method based on degree optimization |
Non-Patent Citations (1)
| Title |
|---|
| HUIHUI LI: "Work in progress: A new algorithm to improve the decoding success probability of Raptor code", 《9TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109088701A (en) * | 2018-09-26 | 2018-12-25 | 北京理工大学 | A kind of LDPC code serial transmission method based on online fountain codes |
| CN109194336A (en) * | 2018-09-30 | 2019-01-11 | 同济大学 | Cascade the coding and interpretation method, system and device of Spinal code |
| WO2021163916A1 (en) * | 2020-02-19 | 2021-08-26 | Qualcomm Incorporated | Enhanced raptorq codes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108259128B (en) | 2020-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105227189B (en) | It is segmented the polarization code coding/decoding method of CRC auxiliary | |
| CN102164025B (en) | Coder based on repeated coding and channel polarization and coding/decoding method thereof | |
| KR100955952B1 (en) | Method and apparatus for space-time coding using lifting low density parity check codes in a wireless communication system | |
| CN106452460B (en) | A kind of polarization code and the error correction/encoding method of duplication code cascade | |
| CN106230489A (en) | It is applicable to the polarization code code modulating method of any high order modulation | |
| CN107565984A (en) | A kind of precoding is the Raptor code optimization coding methods of irregular codes | |
| CN103929210B (en) | Hard decision decoding method based on genetic algorithm and neural network | |
| CN109286405A (en) | A kind of progressive bit reversal SC interpretation method of the polarization code of low complex degree | |
| CN106888026A (en) | Segmentation polarization code coding/decoding method and system based on LSC CRC decodings | |
| CN108259128A (en) | A kind of building method of the system Raptor codes based on nonrandom generator matrix | |
| CN107231158A (en) | A kind of polarization code iterative receiver, system and polarization code iterative decoding method | |
| Chen et al. | Distributing CRC bits to aid polar decoding | |
| CN108111256A (en) | Cascade Compilation Method, device, storage medium and its computer equipment | |
| CN111245571B (en) | Receiver design method combined with coding modulation technology under noise aggregation system | |
| Liu et al. | Parallel concatenated systematic polar code based on soft successive cancellation list decoding | |
| CN106209305A (en) | A kind of fountain codes interpretation method under access channel | |
| Yu et al. | Raptor codes with descending order degrees for AWGN channels | |
| CN109660265A (en) | A kind of adaptive dual binary turbo code coding/decoding method based on DVB-RCS standard | |
| CN108880748B (en) | Coding and decoding method of rateless Spinal code based on Latin square matrix | |
| CN107612559B (en) | Generation method based on the duplicate polynary polarization code of multiplying property | |
| Dai et al. | Asynchronous polar-coded modulation | |
| Raj et al. | Design of successive cancellation list decoding of polar codes | |
| CN104378123B (en) | A kind of M dimension amount soft output Viterbi decoding methods suitable for MFSK | |
| KR100454952B1 (en) | Adaptive Channel Coding Method and Apparatus | |
| Yuan et al. | Design of raptor codes for small message length |
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 |