CN101350699A - Method for distributing information based on increment fountain - Google Patents
Method for distributing information based on increment fountain Download PDFInfo
- Publication number
- CN101350699A CN101350699A CNA200810119663XA CN200810119663A CN101350699A CN 101350699 A CN101350699 A CN 101350699A CN A200810119663X A CNA200810119663X A CN A200810119663XA CN 200810119663 A CN200810119663 A CN 200810119663A CN 101350699 A CN101350699 A CN 101350699A
- Authority
- CN
- China
- Prior art keywords
- data
- fountain
- branch road
- sequence
- coding
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000005540 biological transmission Effects 0.000 claims abstract description 11
- 230000004224 protection Effects 0.000 claims abstract description 4
- 230000001186 cumulative effect Effects 0.000 claims description 3
- 238000005315 distribution function Methods 0.000 claims description 3
- 230000005059 dormancy Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 8
- 230000000694 effects Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 241001504519 Papio ursinus Species 0.000 description 1
- 238000005266 casting Methods 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention relates to an information distribution method based on the incremental fountain, and belongs to the technical field of wireless data transmission. The information distribution method has the following characteristics: a data splitter is used at the transmitting end for arranging the data of the same layer number in the layered and encoded data sequence, so as to form a branch; the sum of the branches is the sum of the layers; a weighting sequence is designed according to the principle of smaller layer number and higher degree of importance; a scheduling parameter calculator is used for calculating the scheduling parameters of each layer in each original data block; the scheduling parameters are transmitted to a scheduling device, which is used for controlling the work of the fountain encoder of different layers according to different probabilities, so as to complete different types of redundancy protection of different layers, thus the system has the capacity of adapting to complex and changeable states of the channel. The method can be used for effective data distribution of no feedback and low redundancy in the poor channel.
Description
Technical field
The present invention relates to a kind of information dispensing method, belong to the wireless data transmission technology field based on increment fountain.
Background technology
The data distribution is meant that data set provider sends data to the user's of some these data of needs process.Data set provider generally is the communication terminal with data transmission capabilities, also claims information centre or transmitting terminal, and the user then is the communication terminal with Data Receiving ability, is also referred to as receiving terminal.Usually information centre has only one, and the user has several, so normally a kind of communication of point-to-multipoint of data distribution.The method that realizes this point-to-multipoint delivery roughly has several at present.
1, adopts a plurality of clean cultures.Under this mode, information centre realizes the data distribution by setting up a plurality of point-to-point clean cultures with each user.Since independent mutually between each unicast communication, take different channels, identical data are all wanted transmission primaries on each channel, therefore can waste a large amount of channel width resources, and the efficient of data distribution is not high.
2, adopt simple multicast.Because this transmission means only takies a channel---Multicast Channel, therefore identical data only need transmit once, do not transmit and do not need to be copied into many parts, have therefore saved bandwidth.Its shortcoming is that the distribution reliability is not high.In unicast communication, the reliable reception of user data guarantees by the feedback retransmission mechanism.But in multi-casting communication, the first, the time-delay that feedback is brought can influence the real-time of data distribution, and a large amount of re-transmissions can reduce the efficient of transmission; The second, a large amount of feedbacks can cause insoluble feedback blast problem.Therefore, when adopting this mode to carry out the data distribution, the feedback retransmission mechanism is difficult to adopt, and when channel quality was relatively poor, the user was difficult to obtain useful data.
3, adopt hierarchical coding to carry out multicast.So-called hierarchical coding is meant initial data is divided into the several layers coded data that can embed step by step.After adopting hierarchical coding, receiving end receives that low layer data can recover basic useful information, and the high level data of receiving can further improve information quality.Adopt this method, making a start needs regularly feedback channel information of receiving terminal, so that adjust its transmission speed and send data volume (number of plies).This still can run into the problems that feedback is brought on the one hand, transmit in a public Multicast Channel owing to data on the other hand, therefore the second-rate user of a few channels can directly influence all users' reception data volume, thereby reduces the effect of whole data distribution.
4, adopt the multiple description coded multicast of carrying out.Information centre at first carries out multiple description coded to initial data, promptly generate a plurality of descriptions of equal importance, that can independently decipher according to initial data, and the mode with multicast is distributed to the user with data then.The user can recover the essential information with certain availability when receiving any description, and the description of receiving is many more, and the information that recovers is just complete more.All comprise identical essential information because each road is described, even without the feedback retransmission mechanism, the user also can guarantee basic data recovery effects by the redundancy of essential information between a plurality of descriptions like this.Therefore adopt this method can improve the reliability of distribution.But because the amount of redundancy of essential information is bigger, code efficiency is very low, especially to channel quality user preferably, can waste the channel resource of a large amount of preciousnesses.
5, adopt fountain coding to carry out multicast.In recent years, fountain coding has become the research focus as the packet level chnnel coding of a kind of on-fixed code check (Rateless).Its encoding and decoding algorithm complexity is very low, encoder sends the initial data coding continuously as fountain, need not feedback and retransmit, the coded data that the user only need receive sufficient amount can recover the initial data of making a start, and with the reception sequence independence of encoded packets.In this process, the influence that information centre need not to consider heterogeneous user's the characteristic of channel and inserts concrete application mode such as the moment, discontinuous transmission.Therefore the fountain sign indicating number is specially adapted to reliable multicast and data delivery applications.But its shortcoming is the user will correctly be received at least with the data of originating data equal in length and could recover former data, therefore relatively poor when channel, when the correct data volume that receives of user is not enough, just can not recover initial data.
In fact, data that good more user recovers that desirable data distribution effect should be channel quality are complete more, the useful information of receiving in other words is many more, and the relatively poor user of channel quality also can obtain basic useful information, information centre does not need feedback simultaneously, do not consume too much extra bandwidth, guarantee higher channel efficiency.And the explanation by the front as can be known, and existing data distributing method all can't be realized such effect.
Summary of the invention
The present invention proposes a kind of information dispensing method, have and do not have feedback, hang down characteristics redundant, that user's useful data amount of obtaining increases with the channel quality based on increment fountain.So-called increment fountain is meant a kind of hierarchical coding that the present invention proposes and the combining form of fountain coding.
Information dispensing method based on increment fountain of the present invention is characterized in that, described method is to realize according to following steps in the digital integrated circuit chip of transmitting terminal, system block diagram as shown in Figure 1, concrete steps can illustrate in conjunction with Fig. 3:
Step (1) is data shunt of the data sequence of hierarchical coding input, and the described data sequence of hierarchical coding is expressed as: D
1 1, d
2 1..., D
L 1, D
1 2, D
2 2..., D
L 2..., D
1 d, D
2 d..., D
L d, wherein subscript is represented the sequence number j of original data block, and subscript is represented the numbering i in described each original data block middle level, and the total number of plies in described each original data block is L, the data D of described j original data block i layer
i jIn, except comprising data, also preserved each original data block piecemeal j, level number i, D in the mode of header
i jData length S
i jAnd total number of plies L;
The described data distribution device of step (2) splits into L branch road to data based its level number of the hierarchical coding of input, and the data of each branch road are described each original data block data with one deck behind hierarchical coding, and wherein, i branch road is output as: D
i 1, D
i 2..., D
i d
The described data distribution device of step (3) also is the data setting weight a of hierarchical coding in described each original data block simultaneously, makes the low more person's weight of level number a big more, and a is more little for the high more person's weight of level number, constitutes the sequence a of a weight a
1, a
2.., a
L, wherein, a
1〉=a
2〉=... 〉=a
L
Step (4) scheduling parameter calculator is imported the sequence of the weight a of hierarchical coding data in described each original data block, described D from described data distribution device
i jThe ratio m of data total length after the length of data and the layering
i jAfter, be calculated as follows out L scheduling parameter of different masses, the scheduling parameter p of wherein said j piece i layer data
i jBe expressed as:
I=1 wherein ..., L, j=1,2 ..., d;
Step (5) scheduler is at the scheduling parameter p that receives described scheduling parameter calculator output
i jAfter, control the transmission ratio of described each circuit-switched data successively according to the following steps, thereby control the different degree of protections of each circuit-switched data;
Step (5.1) is calculated the cumulative distribution function of corresponding j blocks of data according to scheduling parameter by following formula
Wherein, p
i jRepresent that j piece i bar props up the scheduling parameter of circuit-switched data;
Step (5.2) produces the equally distributed random number r of an obedience [0,1]
j, if this r
jSatisfy
Then choose l branch road fountain coder F
lWork, and the fountain coder dormancy of other branch road simultaneously;
Step (6) is as described l branch road encoder F
lWhen being chosen by described scheduler, under the control of scheduler with the data block D of l branch road
l jSend into fountain sign indicating number coded program bag, produce a coded data packet, and add the information that comprises data block numbering, level number and coding seed, encoded packets sequence number, send on the channel, notify scheduler F then in packet header based on LT or Raptor sign indicating number
lEncoder work is finished, and stops coding, waits for selected next time;
Step (7) is when receiving fountain coder F
lGo to step (5) after the notice finished of work, the j blocks of data is done next time branch road select and carry out fountain coding, go to step (8) during greater than default bit rate output up to the total coding bit rate output of all j blocks of data;
Step (8) makes j=j+1, and repeating step (5～8) is till j=d.
The sequence of weight a of the present invention can for [L, L-1, L-2 ..., 2,1] or [L
β, (L-1)
β..., 1], wherein β is a positive count.
Information dispensing method based on increment fountain of the present invention is characterized in that, described method is to realize according to following steps in the digital integrated circuit chip of receiving terminal, system block diagram as shown in Figure 2:
Step (1) is sent into the coded data packet that receives with the corresponding fountain decoder of its level number and is deciphered, and L decoder will be exported data after the decoding of L bar branch road, and wherein the data of each branch road are behind the hierarchical coding data with one deck;
The output of step (2) L bar branch road is resequenced through data integrator, is reduced to the information source data of hierarchical coding.
Do not distribute or only adopt hierarchical coding not to be with feedback to distribute and compare with traditional data are not dealt with, the method that adopts the present invention to propose, adding the equivalent redundant data not under the condition with any feedback, receiving terminal can obtain better data recovery effects, obtain more useful information, for example for view data, the method that the present invention proposes can obtain higher Y-PSNR (PSNR).
Description of drawings
Fig. 1 is the transmitting terminal block diagram of the inventive method.
Fig. 2 is the receiving terminal block diagram of the inventive method.
Fig. 3 is the flow chart of the inventive method.
Embodiment
What the present invention is directed to is the information source of process hierarchical coding.The method of hierarchical coding has a variety of for image and video, such as passing through wavelet transformation at image, but can realize by extension information source encoder H.263/264 at video, see document (ITU-T H263, Video coding for low bit rate communication) for details.
Information dispensing method based on increment fountain of the present invention is characterized in that described method is to realize according to following steps in the digital integrated circuit chip of transmitting terminal:
Step (1) is data shunt of the data sequence of hierarchical coding input, and the described data sequence of hierarchical coding is expressed as: D
1 1, D
2 1..., D
L 1, D
1 2, D
2 2..., D
L 2..., D
1 d, D
2 d..., D
L d, wherein subscript is represented the sequence number j of original data block, and subscript is represented the numbering i in described each original data block middle level, and the total number of plies in described each original data block is L, the data D of described j original data block i layer
i jIn, except comprising data, also preserved each original data block piecemeal j, level number i, D in the mode of header
i jData length S
i jAnd total number of plies L;
The described data distribution device of step (2) splits into L branch road to data based its level number of the hierarchical coding of input, and the data of each branch road are described each original data block data with one deck behind hierarchical coding, and wherein, i branch road is output as: D
i 1, D
i 1..., D
i d
The described data distribution device of step (3) also is the data setting weight a of hierarchical coding in described each original data block simultaneously, makes the low more person's weight of level number a big more, and a is more little for the high more person's weight of level number, constitutes the sequence a of a weight a
1, a
2..., a
L, wherein, a
1〉=a
2〉=... 〉=a
L
Step (4) scheduling parameter calculator is imported the sequence of the weight a of hierarchical coding data in described each original data block, described D from described data distribution device
i jThe ratio m of data total length after the length of data and the layering
i jAfter, be calculated as follows out L scheduling parameter of different masses, the scheduling parameter p of wherein said j piece i layer data
i jBe expressed as:
I=1 wherein ..., L, j=1,2 ..., d;
Step (5) scheduler is at the scheduling parameter p that receives described scheduling parameter calculator output
i jAfter, control the transmission ratio of described each circuit-switched data successively according to the following steps, thereby control the different degree of protections of each circuit-switched data;
Step (5.1) is calculated the cumulative distribution function of corresponding j blocks of data according to scheduling parameter by following formula
Wherein, p
i jRepresent that j piece i bar props up the scheduling parameter of circuit-switched data;
Step (5.2) produces the equally distributed random number r of an obedience [0,1]
j, if this r
jSatisfy
Then choose l branch road fountain coder F
lWork, and the fountain coder dormancy of other branch road simultaneously;
Step (6) is as described l branch road encoder F
lWhen being chosen by described scheduler, under the control of scheduler with the data block D of l branch road
l jSend into fountain sign indicating number coded program bag, produce a coded data packet, and add the information that comprises data block numbering, level number and coding seed, encoded packets sequence number, send on the channel, notify scheduler F then in packet header based on LT or Raptor sign indicating number
lEncoder work is finished, and stops coding, waits for selected next time;
Step (7) is when receiving fountain coder F
lGo to step (5) after the notice finished of work, the j blocks of data is done next time branch road select and carry out fountain coding, go to step (8) during greater than default bit rate output up to the total coding bit rate output of all j blocks of data;
Step (8) makes j=j+1, and repeating step (5～8) is till j=d.
In the above-mentioned sending end structure, as long as a is satisfied in the setting of weights of importance vector a
1〉=a
2〉=... 〉=a
LAll be feasible, according to the total number of plies L that from data head information, extracts, a can be made as [L, L-1, L-2 ..., 2,1], [L
β, (L-1)
β..., 1] or [1,2
-β..., L
-β], wherein β is a positive count.
Fountain coder F
lCan adopt the encoding scheme of LT sign indicating number or Raptor sign indicating number.See document for details: Luby, M.:LT codes, Proc.43
RdAnn.IEEE Symp.on Foundations of Computer Science.
Information dispensing method based on increment fountain of the present invention is characterized in that described method is to realize according to following steps in the digital integrated circuit chip of receiving terminal:
Step (1) is sent into the coded data packet that receives with the corresponding fountain decoder of its level number and is deciphered, and L decoder will be exported data after the decoding of L bar branch road, and wherein the data of each branch road are behind the hierarchical coding data with one deck;
The output of step (2) L bar branch road is resequenced through data integrator, is reduced to the information source data of hierarchical coding.
Provide an example that adopts this method to distribute for image file below:
With standard testing image " Baboon " is that example describes.Its pixel is 480 * 480, each pixel 8bit, data are not carried out piecemeal (block count is 1), adopt the Daubechies small echo to carry out wavelet decomposition, raw image data is divided into the L=5 layer, each layer data length is respectively 900,2700,10800,43200 and 172800, and level number, data length and the total number of plies 5 these hierarchical coding parameters of piecemeal number 1, each layer data mode with header is kept in the output stream.The data distribution device splits into 5 branch roads according to the level number that comes out from the extracting data of hierarchical coding with it, makes the data of each branch road be behind the hierarchical coding data with one deck.The data distribution device also sends to the scheduling parameter calculator with each layer data length.Each layer data length gauge that the scheduling parameter calculator provides according to shunt is calculated ratio data vector m=[0.0039,0.0117,0.0469,0.1875,0.75], and the weights of importance of setting each layer data is respectively [L, L-1, L-2, ..., 2,1], i.e. a=[5,4,3,2,1], calculates scheduling parameter vector p=[0.0146,0.0352,0.1056,0.2816,0.5631].
Default bit rate output is 1, promptly do not increase any extra redundancy, channel deletion rate is made as 70%, 50% and 30% respectively, then do not deal with in data and distribute (method a), only adopts hierarchical coding not distribute (method b) with feedback to compare as shown in the table at the PSNR of receiving terminal image restored with method of the present invention (method c):
The PSNR of table 1. receiving terminal image restored
As seen by data being carried out hierarchical coding and relying on after the fountain sign indicating number lays special stress on protecting low layer data; although under the situation of bad channel, can lose a lot of high level datas; but the low layer data of carrying essential information has been retained; thereby the user has received the information of most worthy, and the validity of communication is greatly improved.
Concrete image effect is seen Appendix.
Claims (4)
1, a kind of information dispensing method based on increment fountain is characterized in that, described method is to realize according to following steps in the digital integrated circuit chip of transmitting terminal:
Step (1) is data shunt of the data sequence of hierarchical coding input, and the described data sequence of hierarchical coding is expressed as: D
1 1, D
2 1..., D
L 1, D
1 2, D
2 2..., D
L 2..., D
1 d, D
2 d..., D
L d, wherein subscript is represented the sequence number j of original data block, and subscript is represented the numbering i in described each original data block middle level, and the total number of plies in described each original data block is L, the data D of described j original data block i layer
i jIn, except comprising data, also preserved each original data block piecemeal j, level number i, D in the mode of header
i jData length S
i jAnd total number of plies L;
The described data distribution device of step (2) splits into L branch road to data based its level number of the hierarchical coding of input, and the data of each branch road are described each original data block data with one deck behind hierarchical coding, and wherein, i branch road is output as: D
i 1, D
i 2..., D
i d
The described data distribution device of step (3) also is the data setting weight a of hierarchical coding in described each original data block simultaneously, makes the low more person's weight of level number a big more, and a is more little for the high more person's weight of level number, constitutes the sequence a of a weight a
1, a
2..., a
L, wherein, a
1〉=a
2〉=... 〉=a
L
Step (4) scheduling parameter calculator is imported the sequence of the weight a of hierarchical coding data in described each original data block, described D from described data distribution device
i jThe ratio m of data total length after the length of data and the layering
i jAfter, be calculated as follows out L scheduling parameter of different masses, the scheduling parameter p of wherein said j piece i layer data
i jBe expressed as:
I=1 wherein ..., L, j=1,2 ..., d;
Step (5) scheduler is at the scheduling parameter p that receives described scheduling parameter calculator output
i jAfter, control the transmission ratio of described each circuit-switched data successively according to the following steps, thereby control the different degree of protections of each circuit-switched data;
Step (5.1) is calculated the cumulative distribution function of corresponding j blocks of data according to scheduling parameter by following formula
Wherein, p
i jRepresent that j piece i bar props up the scheduling parameter of circuit-switched data;
Step (5.2) produces the equally distributed random number r of an obedience [0,1]
j, if this r
jSatisfy
Then choose l branch road fountain coder F
lWork, and the fountain coder dormancy of other branch road simultaneously;
Step (6) is as described l branch road encoder F
lWhen being chosen by described scheduler, under the control of scheduler with the data block D of l branch road
l jSend into fountain sign indicating number coded program bag, produce a coded data packet, and add the information that comprises data block numbering, level number and coding seed, encoded packets sequence number, send on the channel, notify scheduler F then in packet header based on LT or Raptor sign indicating number
lEncoder work is finished, and stops coding, waits for selected next time;
Step (7) is when receiving fountain coder F
lGo to step (5) after the notice finished of work, the j blocks of data is done next time branch road select and carry out fountain coding, go to step (8) during greater than default bit rate output up to the total coding bit rate output of all j blocks of data;
Step (8) makes j=j+1, and repeating step (5～8) is till j=d.
2, according to the described a kind of information dispensing method of claim 1, it is characterized in that based on increment fountain, the sequence of described weight a be [L, L-1, L-2 ..., 2,1].
3, according to the described a kind of information dispensing method of claim 1, it is characterized in that the sequence of described weight a is [L based on increment fountain
β, (L-1)
β..., 1], wherein β is a positive count.
4, a kind of information dispensing method based on increment fountain is characterized in that, described method is to realize according to following steps in the digital integrated circuit chip of receiving terminal:
Step (1) is sent into the coded data packet that receives with the corresponding fountain decoder of its level number and is deciphered, and L decoder will be exported data after the decoding of L bar branch road, and wherein the data of each branch road are behind the hierarchical coding data with one deck;
The output of step (2) L bar branch road is resequenced through data integrator, is reduced to the information source data of hierarchical coding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810119663XA CN101350699B (en) | 2008-09-05 | 2008-09-05 | Method for distributing information based on increment fountain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810119663XA CN101350699B (en) | 2008-09-05 | 2008-09-05 | Method for distributing information based on increment fountain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101350699A true CN101350699A (en) | 2009-01-21 |
| CN101350699B CN101350699B (en) | 2012-02-08 |
Family
ID=40269307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810119663XA Expired - Fee Related CN101350699B (en) | 2008-09-05 | 2008-09-05 | Method for distributing information based on increment fountain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101350699B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101902296A (en) * | 2010-06-23 | 2010-12-01 | 中兴通讯股份有限公司 | Coding/decoding method and device for fountain codes |
| CN102130690A (en) * | 2010-01-15 | 2011-07-20 | 华为技术有限公司 | Method and device for encoding fountain codes |
| CN102195743A (en) * | 2010-03-17 | 2011-09-21 | 清华大学 | Coding scheme of dynamic real-time fountain code |
| CN101567755B (en) * | 2009-05-25 | 2012-01-04 | 北京理工大学 | Network coding method based on fountain codes |
| CN102546115A (en) * | 2012-02-13 | 2012-07-04 | 河南工业大学 | Fountain-coding-based spectrum aggregation method |
| CN101667904B (en) * | 2009-10-19 | 2012-10-24 | 上海奇微通讯技术有限公司 | All-in-one feedback retransmission method based on fountain codes |
| CN103401649A (en) * | 2013-08-07 | 2013-11-20 | 清华大学 | Fountain code-based distributed transmission device and method under severe channels |
| CN104168099A (en) * | 2014-07-24 | 2014-11-26 | 中国传媒大学 | Multitask-concurrent coding method for Raptor codes |
| WO2016119619A1 (en) * | 2015-01-26 | 2016-08-04 | Huawei Technologies Co., Ltd. | Method and system for rate adaptation for data traffic |
| CN103716134B (en) * | 2013-11-21 | 2016-08-24 | 浙江大学 | The coding method of cumulative fountain codes is spent under feedback condition |
| CN105991226A (en) * | 2015-02-13 | 2016-10-05 | 上海交通大学 | Unequal-error-protection-based forward error correction method |
| CN104104727B (en) * | 2014-07-24 | 2017-05-17 | 中国传媒大学 | Raptor code based large file transmission method |
| CN109194445A (en) * | 2018-09-13 | 2019-01-11 | 中国电子科技集团公司第二十八研究所 | A kind of coding and decoding optimization method suitable for the long fountain codes of short code |
| CN110336644A (en) * | 2019-07-15 | 2019-10-15 | 杭州泽铭睿股权投资有限公司 | A kind of hierarchy encoding method under multidimensional simplex |
| CN110535563A (en) * | 2019-08-30 | 2019-12-03 | 西安交通大学 | A kind of wireless security transmission method based on fountain codes control and data interlock |
-
2008
- 2008-09-05 CN CN200810119663XA patent/CN101350699B/en not_active Expired - Fee Related
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101567755B (en) * | 2009-05-25 | 2012-01-04 | 北京理工大学 | Network coding method based on fountain codes |
| CN101667904B (en) * | 2009-10-19 | 2012-10-24 | 上海奇微通讯技术有限公司 | All-in-one feedback retransmission method based on fountain codes |
| CN102130690A (en) * | 2010-01-15 | 2011-07-20 | 华为技术有限公司 | Method and device for encoding fountain codes |
| CN102195743B (en) * | 2010-03-17 | 2013-08-21 | 清华大学 | Coding scheme of dynamic real-time fountain code |
| CN102195743A (en) * | 2010-03-17 | 2011-09-21 | 清华大学 | Coding scheme of dynamic real-time fountain code |
| CN101902296B (en) * | 2010-06-23 | 2014-07-16 | 中兴通讯股份有限公司 | Coding/decoding method and device for fountain codes |
| CN101902296A (en) * | 2010-06-23 | 2010-12-01 | 中兴通讯股份有限公司 | Coding/decoding method and device for fountain codes |
| CN102546115A (en) * | 2012-02-13 | 2012-07-04 | 河南工业大学 | Fountain-coding-based spectrum aggregation method |
| CN103401649B (en) * | 2013-08-07 | 2016-10-26 | 清华大学 | Distributed transmission method based on fountain coding under a kind of noisy channels |
| CN103401649A (en) * | 2013-08-07 | 2013-11-20 | 清华大学 | Fountain code-based distributed transmission device and method under severe channels |
| CN103716134B (en) * | 2013-11-21 | 2016-08-24 | 浙江大学 | The coding method of cumulative fountain codes is spent under feedback condition |
| CN104168099A (en) * | 2014-07-24 | 2014-11-26 | 中国传媒大学 | Multitask-concurrent coding method for Raptor codes |
| CN104104727B (en) * | 2014-07-24 | 2017-05-17 | 中国传媒大学 | Raptor code based large file transmission method |
| WO2016119619A1 (en) * | 2015-01-26 | 2016-08-04 | Huawei Technologies Co., Ltd. | Method and system for rate adaptation for data traffic |
| US10230648B2 (en) | 2015-01-26 | 2019-03-12 | Huawei Technologies Co., Ltd. | Method and system for rate adaptation for data traffic |
| CN105991226A (en) * | 2015-02-13 | 2016-10-05 | 上海交通大学 | Unequal-error-protection-based forward error correction method |
| CN105991226B (en) * | 2015-02-13 | 2019-03-22 | 上海交通大学 | A kind of forward error correction based on unequal error protection |
| CN109194445A (en) * | 2018-09-13 | 2019-01-11 | 中国电子科技集团公司第二十八研究所 | A kind of coding and decoding optimization method suitable for the long fountain codes of short code |
| CN109194445B (en) * | 2018-09-13 | 2020-11-27 | 中国电子科技集团公司第二十八研究所 | Coding and decoding optimization method suitable for short code and long fountain code |
| CN110336644A (en) * | 2019-07-15 | 2019-10-15 | 杭州泽铭睿股权投资有限公司 | A kind of hierarchy encoding method under multidimensional simplex |
| CN110535563A (en) * | 2019-08-30 | 2019-12-03 | 西安交通大学 | A kind of wireless security transmission method based on fountain codes control and data interlock |
| CN110535563B (en) * | 2019-08-30 | 2020-06-19 | 西安交通大学 | Wireless safe transmission method based on fountain code control and data interlocking |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101350699B (en) | 2012-02-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101350699B (en) | Method for distributing information based on increment fountain | |
| CN101902296B (en) | Coding/decoding method and device for fountain codes | |
| CN101359981B (en) | Method, apparatus and system for data packet redundant encoding and decoding | |
| CN101432969B (en) | Forward error-correcting (FEC) coding and streaming | |
| CN1981503B (en) | System for scalable transmission of content in a data network | |
| CN101478373B (en) | Signal source and channel combined optimized adaptive error control method | |
| JP5485302B2 (en) | File download and streaming system | |
| CN102638331B (en) | Wireless reliable broadcasting method based on random linear network code | |
| CN102694636B (en) | Adopt sending, receiving method and the system of the HARQ technology of fountain codes | |
| CN107196746A (en) | Anti-dropout methods, devices and systems in real-time Communication for Power | |
| WO2007145487A3 (en) | Method of encoding/decoding using low density check matrix | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| CN100568744C (en) | A kind of method and apparatus of convolutional code rate coupling | |
| CN101286819B (en) | Data receiving method and device | |
| CN103260033B (en) | Robust video transmission method combined with networking coding on end system and relay node | |
| CN101849378A (en) | A method and apparatus for streaming scalable multimedia data streams | |
| CN103716134B (en) | The coding method of cumulative fountain codes is spent under feedback condition | |
| CN106464432A (en) | Low-delay packet erasure coding | |
| CN101540778A (en) | Method, device and system for transmitting data | |
| CN101459490A (en) | Data transmission method and device | |
| CN102065289B (en) | Reliable video transmission method and device based on network coding | |
| CN101494517B (en) | Data transmission method and apparatus | |
| CN107005349B (en) | A kind of data processing method, base station and terminal device | |
| CN107222294A (en) | A kind of improved fountain codes degree Distribution Algorithm | |
| CN105409151A (en) | Information processing device, information processing method, and program |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: SHENZHEN INSTITUTE OF STINGHUA UNIVERSITY Free format text: FORMER OWNER: TSINGHUA UNIVERSITY Effective date: 20121025 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100084 HAIDIAN, BEIJING TO: 518057 SHENZHEN, GUANGDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20121025 Address after: 518057 Nanshan District science and Technology Park, Guangdong, Shenzhen, Tsinghua University, Shenzhen, A301 Patentee after: RESEARCH INSTITUTE OF TSINGHUA University IN SHENZHEN Address before: 100084 Beijing 100084-82 mailbox Patentee before: Tsinghua University |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160707 Address after: 518000 Guangdong province high tech Industrial Development Zone of Guangzhou Science City Science Innovation Building Road No. 182 building 903 unit C1 (topon a public record office space Card No. 64) Patentee after: GUANGZHOU TUGUIYAO INFORMATION TECHNOLOGY CO.,LTD. Address before: 518057 Nanshan District science and Technology Park, Shenzhen, Shenzhen Research Institute, Tsinghua University, A301 Patentee before: RESEARCH INSTITUTE OF TSINGHUA University IN SHENZHEN |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120208 Termination date: 20210905 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |