CN101969354A - Channel coding and decoding method based on Chinese conversion codes - Google Patents
Channel coding and decoding method based on Chinese conversion codes Download PDFInfo
- Publication number
- CN101969354A CN101969354A CN2009100633747A CN200910063374A CN101969354A CN 101969354 A CN101969354 A CN 101969354A CN 2009100633747 A CN2009100633747 A CN 2009100633747A CN 200910063374 A CN200910063374 A CN 200910063374A CN 101969354 A CN101969354 A CN 101969354A
- Authority
- CN
- China
- Prior art keywords
- coding
- decoding
- coding groups
- groups
- sign indicating
- 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
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention provides a channel coding and decoding method based on Chinese conversion codes. The Chinese conversion codes are constructed by using the Chinese remainder theorem, coding is realized by continuously decomposing the original group with finite length into coding groups comprising the information of decomposition primes and remainders, and thus, coding groups with infinite length in theory can be produced. Decoding is realized by receiving a plurality of groups from the coding groups, and the coding structure of the original group value can be recovered by decoding. The channel coding and decoding method based on the Chinese conversion codes is designed on the basis of an erase channel. When being combined with other traditional channel coding and decoding technologies, the channel coding and decoding method can be popularized and applied to the channel coding and decoding technology of a lossy channel.
Description
Technical field
The present invention relates to the channel coding/decoding technical field, particularly based on the channel coding/decoding method of Chinese conversion code.
Background technology
In the single-point communication of traditional employing cbr (constant bit rate) coding, the application layer of communication protocol and transport layer adopt ARQ (Auto Repeat reQuest) technology to guarantee reliable transmission, for example TCP (the Transmission Control Protocol) agreement that extensively adopts.But in limited bandwidth, the uncertain broadband wireless communication network of delaying time, the performance of Transmission Control Protocol is performed poor.The ARQ technology is difficult for solving feedback implosion problem, a large amount of user feedbacks has increased the weight of the burden of transmit leg, limited the extensibility of multicast, be difficult to satisfy the growing actual demand of high-speed radiocommunication of future generation based on the channel error correcting technique of the cbr (constant bit rate) coding techniques and the congested hierarchy of control of ARQ.
The most typical at present representative of fountain sign indicating number is LT sign indicating number and Raptor sign indicating number.The Raptor sign indicating number is a kind of suboptimum concatenated schemes based on the LT sign indicating number that proposes in 2005, it with LDPC (Low Density Parity-check Codes) sign indicating number as outer yard, with the reduction the LT sign indicating number as ISN, earlier original packet is implemented coding with the LDPC sign indicating number, again with LT sign indicating number coding, decoding end is after receiving the LT sign indicating number, only need recovered part LT coding groups, therefore at present remaining original packet just can utilize the powerful iterative decoding algorithm of LDPC sign indicating number to be recovered, and the core content of fountain sign indicating number still embodies a concentrated reflection of in the research to the LT sign indicating number.
For the fountain sign indicating number, have the unexistent innate advantage of following conventional coding technology:
(1) desirable extensibility: because the individual event multicast of fountain sign indicating number does not need the ARQ feedback, so in based on the system of fountain sign indicating number the growth of number of users for coding side without any influence, coding side can be served the user of any amount at any time.
(2) receiving efficiency of near ideal: in order to obtain k original packet, the user need receive K coding groups, and receiving efficiency approximates 1.Comparatively speaking, broadcasting in the solution based on traditional coded data wheel, if the user does not obtain enough coding groups in first round transmission, just must be in order to obtain a few remaining coding groups, and take turns a large amount of repeated packets of reception in the transmission second, obviously reduced user's receiving efficiency.And each transmission grouping all is useful in the fountain code system, cannot be mentioned in the same breath with tradition wheel broadcast mode on the utilization ratio of transmission grouping.
(3) adapt to time varying channel: when the user can receive K coding groups in the fountain code system, depends on the actual channel condition of there and then fully.Packet loss is low or bandwidth is high then early receives, otherwise receives that then obtain k original packet in order to decipher, the time of reception that the user needs leveled off in following shortest time that can reach of actual channel evening.
(4) adapt to heterogeneous user: the user with different packet loss rate or bandwidth is independent of each other, user inferior not can or minimum level pin down the high-quality user.Meanwhile, in the multicast scheme based on the ARQ technology, transmit leg is that the grouping overwhelming majority of user's re-transmission inferior is utterly useless to the high-quality user, in fact is equivalent to pin down high-quality user's the progress of accepting.
(5) asynchronous reception and interrupted the reception: the user can arbitrarily add multicast at different time, withdraws from after also can adding to add again again, and asynchronous performance is better.Because each coding groups is of equal value fully, which grouping when the user receives if forgetting it, and only need be concerned about the coding groups quantity of receiving.Relative therewith, other multicast schemes then are difficult for solving asynchronous reception and interrupted reception problem.
Table 1 is with LT codes, Fountain Codes, Rateless Codes is the quantity of document of keyword retrieval-by-unification in the SCI/EI/IEEE document, as can be seen, since formally proposing the specific implementation LT sign indicating number of fountain sign indicating number from Luby in 2002, the research of relevant fountain sign indicating number is and increases progressively trend, especially domestic and international correlative study was rapid growth situation especially at nearly 3 years, therefore innovation research is followed the tracks of in the technology implementation of fountain sign indicating number aspect, can be laid certain basis for the formation and the patented technology deposit of China's NGBW communication network relevant criterion.
Table 12002-2008 fountain code weight is wanted searching document quantity list
At present Related domestic documents also only limits to summarize and the concrete aspect of discussing of using, for the research of LT sign indicating number degree distribution design and realization, security performance and the total system related data of rare further investigation at home.The application prospect of fountain sign indicating number is mathematical, the application that has abominable channel condition for high-speed mobile communications, satellite communication and underwater sound communication etc., the fountain sign indicating number has the huge advantage that traditional F EC and ARQ technology do not possess, domestic research for the fountain sign indicating number at present mainly concentrates on the deep space communication field, is representative with the Lu Jianhua of Tsing-Hua University professor seminar and Harbin Institute of Technology, Zhang Naitong academician seminar of Shenzhen University.
With regard to external pertinent literature; on the one hand: aspect the specific implementation of LT sign indicating number; the document that proposes LT sign indicating number specific implementation algorithm at present is few; mainly be because Luby has applied for patent protection to the LT sign indicating number; therefore only provide limited principle document, retrieved less than data substantially about LT sign indicating number specific implementation about the LT sign indicating number.From existing literature, a large amount of documents all how to discuss with existing system and technology combine rarely seen document about the theoretical research of LT code book body.And also adopt traditional random generator generation degree distributed data based on traditional LT coding method of emulation more, degree distributed data and degree contiguous data need be added the LT coding groups as the head expense, decoding end is recovered decoding according to the head overhead data, for the average number of degrees H (d) that degree distributes, need to add the head expense of H (d) lnk.In present most of document, because the key message that the fountain sign indicating number recovers to decipher all leaves in the header information of LT sign indicating number grouping, therefore, as long as intercept and capture these groupings, just can reply the purpose that raw information reaches eavesdropping easily in view of the above, and relate to the LT sign indicating number the secure communication aspect document we also not do not find at present, be a field that remains deep excavation so how secret communication method is introduced the LT sign indicating number.
On the other hand, though the fountain sign indicating number proposes as packet-based channel coding technology, its application has expanded to the channel of other types, and expanding to wider field for the fountain sign indicating number for the research of various channel conditions provides theory and experiment basis.The fountain sign indicating number is mainly containing following method at present in the application aspect noisy communication channel and the wireless channel: (1) adopts the strategy of directly using the fountain sign indicating number on noisy communication channel, promptly after collecting a large amount of coding groups, realize the application of noisy communication channel with the mode of examination decoding, with the Raptor sign indicating number is example, as original packet k=9500, when outer sign indicating number is 0.95 code rate LDPC code, under the AWGN of signal to noise ratio Es/No=-2.83dB (Additive White Gaussion Noise) channel, with 19000 coding groups is the thresholding that starts decoding, if examination decoding is unsuccessful, then continue to collect 100 groupings, decoding once more, so circulation is up to successfully decoded.Emulation experiment shows under this strategy, successfully decoded probability peak packet count is about 20737, and only be 10800 under erasure channel, the obvious successfully decoded needed packet count of this method almost is 2 times under the erasure channel, and the decoding that makes repeated attempts under a large amount of number of packet also can cause certain time delay.(2) at the characteristics of wireless channel,, promptly earlier original packet is implemented CTC (Cyclical Redundancy Check) verification, and then carry out the fountain code coding/decoding from deciphering the application strategy that machine-processed angle has proposed noise and wireless channel.(3) proposition is used for reference LDPC decoding mechanism and is implemented iterative decoding based on the interative encode method of channel status.Determine to judge successfully decoded machine-processed differently with check matrix with the LDPC sign indicating number, this method is judged whether success of decoding with the result with the CTC verification after reaching predetermined iterations, and FEEDBACK CONTROL receives the quantity that the fountain sign indicating number divides into groups simultaneously.
In a word, the fountain sign indicating number will occupy important one seat as up-to-date chnnel coding and congested control technology in wireless broadband communication network mark standard of future generation.
On the other hand, Chinese remainder theorem is one of greatest mathematics achievement of Ancient Times in China, simple congruence problem the earliest appears in " grandson calculate through ", the mathematician Qin Jiushao of the Southern Song Dynasty proposes to understand the conventional method of congruence of first degree formula in its works " number book nine chapters ", be referred to as Chinese remainder theorem, Chinese remainder theorem or Chinese remainder theorem in the world, its substance is:
If m
1, m
2..., m
kBe relatively prime in twos positive integer, m is m
1, m
2..., m
kLeast common multiple, r
1, r
2..., r
kBe that a number x is respectively divided by m
1, m
2..., m
kThe remainder of gained.
Linear congruence group x ≡ r then
i(mod Mi), i=1,2 ..., k must separate, and skill is unique, and the minimal positive integral solution of this congruence group is:
(wherein p is an integer,
) (1)
But the fountain sign indicating number technology that Chinese remainder theorem realizes does not appear using in this area as yet.
Summary of the invention
The object of the invention is to solve the prior art deficiency, provides a kind of Chinese conversion code as new fountain sign indicating number, and the channel coding/decoding that can solve network congestion problem method is provided on state's conversion code basis hereinto.
Technical solution of the present invention provides a kind of channel coding method based on Chinese conversion code, and coding side carries out following steps,
At first, for single raw information grouping, set coding groups length and prime number collection;
Then, concentrate picked at random to decompose prime number, the raw information grouping is carried out the complementation computing to decomposing prime number, remainder and the relevant corresponding relation that decomposes prime number are constituted coding groups from prime number; Circulation generates coding groups and transfers to decoding end, after receiving the feedback that decoding end is successfully decoded and stop to decipher, stops coding.
And, circulation ask for coding groups carry out 3 take turns after, beginning is evenly chosen gained coding groups encapsulation at random and is constituted the transmission grouping.
The also corresponding channel decoding method that provides a kind of based on Chinese conversion code of technical solution of the present invention, decoding end is carried out following steps,
Step 1 is calculated the isolation that each coding groups constituted that receives from coding side
Wherein z presentation code section provides the coding groups number, m
jRepresent the corresponding decomposition prime number of each coding groups;
Step 2 is to the isolation D of each coding groups formation
zJudge;
If D
z＞2
h, the length of the raw information of h presentation code end grouping wherein is then by formula
Recover decoding value, x is for recovering the gained decoding value, and p is for making x [0,2
h] within integer, a
jBe multiplying factor, r
jRemainder during for the generation coding groups after the complementation computing;
If D
z＜2
h, wherein the length of the raw information of h presentation code end grouping then receives new coding groups from coding side, returns step 1 circulation and carries out.
And, multiplying factor a
jAsk for as follows,
Wherein R represents m
j, D
z/ m
jThe number of times that has the non-zero remainder to produce when tossing about in bed to be divided by, and q
tThe quotient that produces when representative is divided by at every turn, 1≤t≤R,
Then the multiplying factor of asking is α
j≡ (1)
nc
n(modm
j).
The present invention has realized the characteristics of fountain sign indicating number notion by Chinese remainder theorem, promptly adopt Chinese conversion code encryption algorithm to realize the original packet of finite length constantly is decomposed into the coding groups that comprises decomposition prime number and remainder information, thereby the coding groups of endless on the generative theory, and decoding end promptly can be recovered the code construction of original packet value by decoding algorithm as long as receive some groupings from these coding groups.Because omnidistance ARQ (the Auto Repeat reQuest) mechanism of not using again of encoding and decoding realizes that feedback retransmits, also just fundamentally solved the congested control problem of network.Congestion control mechanism provided by the present invention is a kind of chnnel coding that is applicable to erasure channel in essence.China's conversion code combines with the channel coding method that other tradition diminish channel (deep space channel, wireless channel, underwater acoustic channel etc.), also can promote the use of and diminish channel.This technical scheme can be widely used in various fields such as Next Generation Internet, next generation wireless communication, deep space communication, underwater sound communication, the storage of digital robust, CD error correcting technique.
Description of drawings
Fig. 1 is the coding flow chart of the embodiment of the invention;
Fig. 2 is the decoding flow chart of the embodiment of the invention;
Fig. 3 is a LDPC-CT code system block diagram;
Fig. 4 is a TURBO-CT code system block diagram;
Fig. 5 is a RS-CT code system block diagram;
Fig. 6 is a CT-LDPC code system block diagram;
Fig. 7 is a CT-TURBO code system block diagram.
Embodiment
Set forth technical solution of the present invention below in conjunction with drawings and Examples, respective symbol is irrelevant in symbol implication in the attention elaborate process and the background technology.
Technical solution of the present invention is that theoretical foundation makes up the fountain sign indicating number with the Chinese remainder theorem, and coding side carries out following steps,
At first, for single raw information grouping, set coding groups length and prime number collection;
Then, concentrate picked at random to decompose prime number, the raw information grouping is carried out the complementation computing to decomposing prime number, remainder and the relevant corresponding relation that decomposes prime number are constituted coding groups from prime number; Circulation generates coding groups and transfers to decoding end, after receiving the feedback that decoding end is successfully decoded and stop to decipher, stops coding.
After setting coding groups length, every process that generates coding groups of taking turns is carried out according to this length setting is consistent.During concrete enforcement, original document waiting for transmission at first is carried out and is divided into the raw information grouping, and grouping is carried out the first run and asked for coding groups according to raw information, asks for the coding groups that the gained coding groups is asked for epicycle according to last round of successively afterwards.According to the performance of fountain sign indicating number concept requirement, be that Infinite Cyclic is gone down in theory, from the coding groups that Infinite Cyclic generates, appoint and get severally, just can recover to decipher.During enforcement, then be after receiving the feedback that decoding end is successfully decoded and stop to decipher, can stop coding.Referring to accompanying drawing 1, concentrate picked at random to decompose prime number from prime number in every the wheel, can adopt randomizer to generate the sequence number of choosing of prime number collection at random, concentrate the decomposition prime number of the corresponding prime number of extraction according to this sequence number from prime number as epicycle.With decomposing the grouping of prime number and raw information, carry out modulo operation, obtain remainder.Remainder and the relevant corresponding relation that decomposes prime number are constituted coding groups, also just can encapsulate the realization of formation coding groups by the remainder that will take turns and the sequence number of choosing of prime number collection.
The length of supposing to be used to decompose the prime number of original packet is 2
k, i.e. kbit, then the length of the coding groups that obviously generates also must be stored with kbit, and the length that makes original packet information is that (y gets smaller or equal to the natural number of n and sets up h=nk-y herein, generally will obtain best performance and just get and equal; It is exactly different sign indicating number structures when several that n gets different, and general recommendations gets 3), in the time of then will making the coding groups of generation choose n arbitrarily (prerequisite is to guarantee there is not number of repeated packet), the condition that can recover decipher with probability 1 be:
The inequality left side belongs to comparatively wide in range being similar to, because for (2
K-1, 2
k), initial n prime number is inevitable greater than n initial integer of this interval.For (1) obviously when the y=n (1) formula must set up, then condition is constructed corresponding Chinese conversion code in view of the above, Chinese conversion code can abbreviate the CT sign indicating number as.
For ease of implementing reference, the embodiment of the invention is as follows at the algorithm that coding side is realized:
If original document length waiting for transmission is Lbit, at first set the size of raw information grouping, promptly be identified for the interval of the positive integer of decomposing, making the length of a raw information grouping is hbit, obvious original document will be divided into L/h raw information grouping, and (supposition L can be eliminated by h, if having aliquant situation then to adopt the mode of zero padding in the practical application is an original packet with unnecessary information polishing), the raw information set of packets after order is divided is P ∈ (p
1, p
2... p
t| t=L/h)
Raw information grouping p then
IiBe 0≤p between its location after (variable i i is from value between 1～t herein) is converted to the decimal system
Ii≤ 2
h, make M ∈ (m
1, m
2..., m
k) be since 2 tactic prime number collection, i.e. m
1=2, m
2=3, m
3=5 ..., then ensuing universal coding process is as follows,
The first step: make j=1;
Second step: from M ' ∈ (m
1, m
2..., m
k| m
k＜p
Ii) in evenly choose one at random and decompose prime number m
i(variable i value between 1～k herein), order grouping q
1j=p
IiMod m
i, will decompose prime number m
iIn several i add grouping q as head
1jForm a complete coding groups s
1j
The 3rd step: j=j+1 repeated for second step up to j=L/h.
So far finish first round cataloged procedure, repeat the code packet that above step can constantly generate endless.For ease of understanding, taking turns cataloged procedure with second of embodiment is example, the j=L/h that the first round obtains coding groups s
1jBe s
11, s
12..., s
1t, t=L/h, process is as follows,
The first step: make j=1;
Second step: from M ' ∈ (m
1, m
2..., m
k| m
k＜p
Ii) in evenly choose one at random and decompose prime number m
i(variable i value between 1～k herein), order grouping q
2j=s
1jModm
i, will decompose prime number m
iIn several i add grouping s as head
1jForm a complete coding groups s
2j
The 3rd step: j=j+1 repeated for second step up to j=L/h;
Third round continues at coding groups s
2jContinue coding groups on the basis ...
In actual applications, the transmission that some coding groups wherein can be merged into realistic needed length divides into groups to transmit.Because several coding groups of asking for of taking turns of beginning generally can not satisfy decoding, the present invention suggestion circulation ask for coding groups carry out 3 take turns after, beginning is evenly chosen the encapsulation of gained coding groups at random and is constituted the transmission grouping.
The prerequisite that it is pointed out that the remainder notion is meant big number divided by decimal, therefore needs to set M ' ∈ (m
1, m
2..., m
k| m
k＜p
Ii), guarantee that promptly the decomposition prime number of choosing is not more than the numerical value of original packet to be decomposed.Picked at random is decomposed prime number and is considered mainly that then erasure channel wipes the randomness of grouping, and it is in order to reflect the relevant corresponding relation that decomposes prime number, so that accept the prime number value that corresponding selection is determined in the back in decoding end that number i adds as head.
Decode procedure provided by the invention and cataloged procedure are corresponding, and step is as follows:
Step 1 is calculated the isolation that each coding groups constituted that receives from coding side
Wherein z presentation code section provides the coding groups number, m
iRepresent the corresponding decomposition prime number of each coding groups;
If constitute coding groups by the sequence number encapsulation of choosing with remainder and prime number collection during coding, then correspondingly, the sequence number of choosing in that decoding end is taken out the prime number collection from coding groups contrasts the prime number collection consistent with coding side, obtains the corresponding prime number that decomposes.
Step 2 is to the isolation D of each coding groups formation
zJudge;
If D
z＞2
h, wherein h represents the length of raw information grouping, then by formula
Recover decoding value, x is for recovering the gained decoding value, and p is for making x [0,2
h] within integer, isolation D
zPromptly going up step asks
a
jBe multiplying factor, r
jRemainder during for the generation coding groups after the complementation computing (each coding groups extraction that receives from coding side gets final product);
If D
z＜2
h, wherein h represents the length of raw information grouping, then receives new coding groups from coding side, returns step 1 circulation and carries out.
The length h of so-called raw information grouping, the length of set raw information grouping when just coding side divide into groups to raw information adopts h value consistent when encoding during decoding.2
hRepresent metric raw information grouping integer maximum.If the step 2 gained decoding value that is restored, then illustrate successfully decodedly, decode procedure stops; Decoding end feedback notice coding side allowed coding side stop circulation and asked for coding groups, to avoid the unnecessary wasting of resources this moment.Formula
Come from the described Chinese remainder theorem of background technology, decode procedure has been adjusted wherein partly symbol for convenience of explanation.
Referring to Fig. 2, the embodiment of the invention is as follows at the algorithm that coding side is realized:
After receiving some wheel the (being generally 3 takes turns) coding groups, promptly can start decode procedure, then ensuing general decoding algorithm process following (is starting point to receive z coding groups):
The first step: calculate the isolation D that z coding groups constitutes
zIf, D
z＞2
h, then by formula
Recovering decoding value, promptly is to recover the gained decoding value with x, and it is output as the decoding grouping, informs that coding side is successfully decoded;
Second step: if D
z＜2
h, then receive one again and be different from preceding z coding groups (if coding side transmits after several coding groups are formed the transmission grouping, then decoding end is extracted on demand one by one) fully from the transmission grouping that receives; The 3rd step: repeat the first step, second step.Certainly, newly receive when returning circulation decoding after the coding groups, the z value adds 1.
Multiplying factor a
jDetermine, can influence whole Chinese conversion code performance boost.Ask the method for multiplying factor to mainly contain a Chinese remainder theorem and Euler's function method at present, by contrast, a Chinese remainder theorem possesses the characteristics of practicality and mechanization more, tangible algorithmic characteristic is arranged, when for example finding the solution 9253r ≡ 1 (mod225600), adopt the Euler's function method, its amount of calculation is 9253
φ (225600)Even utilize the high-performance computer also to be difficult to finish fast, but a Chinese remainder theorem then can be finished the work very soon.
Therefore the present invention proposes further technical scheme, and multiplying factor a is found the solution in suggestion
jAdopt a Chinese remainder theorem.Suppose that the congruence expression that need find the solution is α G ≡ 1 (modm), wherein m, G are given coprime natural numbers, then utilize a Chinese remainder theorem to find the solution multiplying factor a with following recurrence relation
j:
Wherein R represents m
j, D
z/ m
jThe number of times that has the non-zero remainder to produce when tossing about in bed to be divided by, and q
tThe quotient that produces when representative is divided by at every turn, 1≤t≤R.Be q
1Represent the quotient that produces when being divided by for the first time.
Then the multiplying factor of asking is α
j≡ (1)
nc
n(modm
j).
Based on technical scheme provided by the present invention, multiple coding/decoding system can be provided, be exemplified below:
Referring to the LDPC-CT code system of Fig. 3, serve as outer sign indicating number with LDPC (Low Density Parity Check) sign indicating number, be the cascaded code that is applicable to erasure channel (LDPC-CT sign indicating number) of ISN with Chinese conversion code.
Implementation: the raw information grouping is carried out the ISN precoding with the LDPC sign indicating number earlier, then the coding groups that generates is carried out outer sign indicating number coding with Chinese conversion code again, obtain new coding groups, be transferred to decoding end then; Decoding end is carried out Chinese conversion code decoding to the coding groups that receives, only require that the successfully decoded of Chinese conversion code reaches about 80%, can stop the decoding of Chinese conversion code, utilize the decoding packet recovery raw information of the interative encode method of LDPC sign indicating number then from Chinese conversion code.
Referring to the TURBO-CT code system of Fig. 4, the TURBO sign indicating number is outer sign indicating number, is the cascaded code that is applicable to erasure channel (TURBO-CT sign indicating number) of ISN with Chinese conversion code
Implementation: the raw information grouping is carried out the ISN precoding with the TURBO sign indicating number earlier, then the coding groups that generates is carried out outer sign indicating number coding with Chinese conversion code again, decoding end is carried out Chinese conversion code decoding to the grouping that receives, and utilizes the interative encode method of TURBO sign indicating number to recover raw information then.
Referring to the RS-CT code system of Fig. 5, serve as outer sign indicating number with RS (Reed-Solomon) sign indicating number, be the cascaded code that is applicable to erasure channel (RS-CT sign indicating number) of ISN with Chinese conversion code
Implementation: the raw information grouping is carried out the ISN precoding with RS (Reed-Solomon) sign indicating number earlier, then the coding groups that generates is carried out outer sign indicating number coding with Chinese conversion code again, decoding end is carried out Chinese conversion code decoding to the grouping that receives, and utilizes the interative encode method of RS (Reed-Solomon) sign indicating number to recover raw information then.
Referring to the CT-LDPC code system of Fig. 6, serve as outer sign indicating number with Chinese conversion code, be the cascaded code (CT-LDPC sign indicating number) that being applicable to of ISN diminishes channel with LDPC (Low DensityParity Check) sign indicating number
Implementation: the raw information grouping is carried out the ISN precoding with Chinese conversion code earlier, then the coding groups that generates is used again LDPC (Low Density Parity Check) sign indicating number to carry out outer sign indicating number coding, after diminishing channel, decoding end is carried out the decoding of LDPC (Low Density Parity Check) sign indicating number to the grouping that receives, successfully decoded grouping is collected, and the decoding step that enters Chinese conversion code is recovered raw information.With LDPC (Low Density Parity Check) sign indicating number is media, realizes that Chinese conversion code is diminishing the application of channel.
Referring to the CT-TURBO code system of Fig. 7, serve as outer sign indicating number with Chinese conversion code, be the cascaded code (CT-TURBO sign indicating number) that being applicable to of ISN diminishes channel with the TURBO sign indicating number
Implementation: the raw information grouping is carried out the ISN precoding with Chinese conversion code earlier, then the coding groups that generates is carried out outer sign indicating number coding with the TURBO sign indicating number again, after diminishing channel, decoding end is carried out the decoding of TURBO sign indicating number to the grouping that receives, successfully decoded grouping is collected, and the decoding step that enters Chinese conversion code is recovered raw information.With the TURBO sign indicating number is media, realizes that Chinese conversion code is diminishing the application of channel.
Claims (4)
1. channel coding method based on Chinese conversion code, it is characterized in that: coding side carries out following steps,
At first, for single raw information grouping, set coding groups length and prime number collection;
Then, concentrate picked at random to decompose prime number, the raw information grouping is carried out the complementation computing to decomposing prime number, remainder and the relevant corresponding relation that decomposes prime number are constituted coding groups from prime number; Circulation generates coding groups and transfers to decoding end, after receiving the feedback that decoding end is successfully decoded and stop to decipher, stops coding.
2. according to claim 1 based on the channel decoding method of Chinese conversion code, it is characterized in that: circulation ask for coding groups carry out 3 take turns after, beginning is evenly chosen gained coding groups encapsulation at random and is constituted the transmission grouping.
3. channel decoding method based on Chinese conversion code, it is characterized in that: decoding end is carried out following steps,
Step 1 is calculated the isolation that each coding groups constituted that receives from coding side
Wherein z presentation code section provides the coding groups number, m
jRepresent the corresponding decomposition prime number of each coding groups;
Step 2 is to the isolation D of each coding groups formation
zJudge;
If D
z＞2
h, the length of the raw information of h presentation code end grouping wherein is then by formula
Recover decoding value, x is for recovering the gained decoding value, and p is for making x [0,2
h] within integer, a
jBe multiplying factor, r
jRemainder during for the generation coding groups after the complementation computing;
If D
z＜2
h, wherein the length of the raw information of h presentation code end grouping then receives new coding groups from coding side, returns step 1 circulation and carries out.
As described in the claim 3 based on the channel decoding method of Chinese conversion code, it is characterized in that: multiplying factor a
jAsk for as follows,
Wherein R represents m
j, D
z/ m
jThe number of times that has the non-zero remainder to produce when tossing about in bed to be divided by, and q
tThe quotient that produces when representative is divided by at every turn, 1≤t≤R,
Then the multiplying factor of asking is α
j≡ (1)
nc
n(modm
j).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100633747A CN101969354B (en) | 2009-07-28 | 2009-07-28 | Channel coding and decoding method based on Chinese conversion codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100633747A CN101969354B (en) | 2009-07-28 | 2009-07-28 | Channel coding and decoding method based on Chinese conversion codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101969354A true CN101969354A (en) | 2011-02-09 |
| CN101969354B CN101969354B (en) | 2013-04-10 |
Family
ID=43548462
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100633747A Expired - Fee Related CN101969354B (en) | 2009-07-28 | 2009-07-28 | Channel coding and decoding method based on Chinese conversion codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101969354B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105337696A (en) * | 2015-10-08 | 2016-02-17 | 东南大学 | Polarization decoding method based on subsection CRC |
| CN105720991A (en) * | 2016-01-19 | 2016-06-29 | 重庆邮电大学 | QC-LDPC code construction method based on Chinese remainder theorem |
| WO2017177609A1 (en) * | 2016-04-11 | 2017-10-19 | 中兴通讯股份有限公司 | Encoding method and device, and decoding method and device |
| CN117519646A (en) * | 2024-01-08 | 2024-02-06 | 深圳市纽创信安科技开发有限公司 | Random data generation method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101252413A (en) * | 2008-03-21 | 2008-08-27 | 哈尔滨工业大学深圳研究生院 | Method for removing small ring of length 4 in fountain code generated matrix and uses thereof |
| CN101282203A (en) * | 2007-12-07 | 2008-10-08 | 华中科技大学 | Switch type multicast transmission method |
| US20090182890A1 (en) * | 2008-01-15 | 2009-07-16 | Adobe Systems Incorporated | Information Communication |
-
2009
- 2009-07-28 CN CN2009100633747A patent/CN101969354B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282203A (en) * | 2007-12-07 | 2008-10-08 | 华中科技大学 | Switch type multicast transmission method |
| US20090182890A1 (en) * | 2008-01-15 | 2009-07-16 | Adobe Systems Incorporated | Information Communication |
| CN101252413A (en) * | 2008-03-21 | 2008-08-27 | 哈尔滨工业大学深圳研究生院 | Method for removing small ring of length 4 in fountain code generated matrix and uses thereof |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105337696A (en) * | 2015-10-08 | 2016-02-17 | 东南大学 | Polarization decoding method based on subsection CRC |
| CN105337696B (en) * | 2015-10-08 | 2018-03-30 | 东南大学 | Polarization coding/decoding method based on segmentation CRC check |
| CN105720991A (en) * | 2016-01-19 | 2016-06-29 | 重庆邮电大学 | QC-LDPC code construction method based on Chinese remainder theorem |
| WO2017177609A1 (en) * | 2016-04-11 | 2017-10-19 | 中兴通讯股份有限公司 | Encoding method and device, and decoding method and device |
| CN117519646A (en) * | 2024-01-08 | 2024-02-06 | 深圳市纽创信安科技开发有限公司 | Random data generation method and device, electronic equipment and storage medium |
| CN117519646B (en) * | 2024-01-08 | 2024-03-26 | 深圳市纽创信安科技开发有限公司 | Random data generation method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101969354B (en) | 2013-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102164026B (en) | Fountain code compiling method based on deep space communication environment | |
| CN101902296B (en) | Coding/decoding method and device for fountain codes | |
| EP2202888A1 (en) | File download and streaming system | |
| CN107294652A (en) | A kind of data mixing retransmission processing method and device | |
| EP1980041A2 (en) | Multiple-field based code generator and decoder for communications systems | |
| CN102324998B (en) | Raptor Codes encoding/decoding method suitable for medium/short code lengths of additive white Gaussian noise channel | |
| CN101188428A (en) | Speed matching method of limited length circular buffer of LDPC code | |
| CN103067137A (en) | Multicast retransmission method based on network codes | |
| CN101969354B (en) | Channel coding and decoding method based on Chinese conversion codes | |
| CN103580803A (en) | Weighted broadcast retransmission method based on network coding | |
| CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
| Qureshi et al. | Primer and recent developments on fountain codes | |
| CN101465655B (en) | Method for encoding ultra short code length density parity check code | |
| Xiong et al. | Evaluation framework for user experience in 5G systems: On systematic rateless-coded transmissions | |
| CN103532674A (en) | File transmission encoding method based on complex network | |
| CN101882972B (en) | Decoding method of Raptor code | |
| Dai et al. | LT codes with limited feedback | |
| CN108023679A (en) | Iterative decoding zoom factor optimization method based on parallel cascade system polarization code | |
| CN101645753B (en) | Coding method without rate codes | |
| Karat et al. | Optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers | |
| CN101242247A (en) | Mixed automatic retransfer system for decomposable code rate compatible to low density checkup code | |
| Hussain et al. | Erasure floor analysis of distributed LT codes | |
| Zhang et al. | Design of improved Luby transform codes with decreasing ripple size and feedback | |
| CN107257244A (en) | A kind of fountain code encoding method based under broadcast environment | |
| Lin et al. | An adaptive hybrid ARQ scheme with constant packet lengths |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130410 Termination date: 20150728 |
|
| EXPY | Termination of patent right or utility model |