CN103997759B - A kind of data transmission method for wireless relay communication - Google Patents
A kind of data transmission method for wireless relay communication Download PDFInfo
- Publication number
- CN103997759B CN103997759B CN201410232527.7A CN201410232527A CN103997759B CN 103997759 B CN103997759 B CN 103997759B CN 201410232527 A CN201410232527 A CN 201410232527A CN 103997759 B CN103997759 B CN 103997759B
- Authority
- CN
- China
- Prior art keywords
- coding
- source symbol
- decoding
- ripple
- coded identification
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
A kind of data transmission method for wireless relay communication, including following operative step：(1) source node original data division to be sent into k size identical original packet；(2) transmitting terminal sends aforesaid whole k original packets to receiving terminal, and receiving terminal is successfully received n original packet；(3) transmitting terminal described in is encoded to original packet according to the coded method for setting, and is obtained coding bag, and is sent coding bag to receiving terminal；(4) receiving terminal described in is wrapped into row decoding to the coding for being received according to the interpretation method for setting, until original packet or decoding process that described receiving terminal can recover all loss completely terminate；The present invention is using the fountain coding and decoding method successively decreased based on the ripple size of packet loss so that in data transmission procedure, redundancy rate is little, and throughput is high, and transmission speed is fast.
Description
Technical field
The present invention relates to a kind of data transmission method for wireless relay communication, belongs to wireless communication technology field, special
Digital fountain code coding/decoding technical field is not belonging to.
Background technology
The development of cordless communication network and Internet of Things to wireless relay network in data transmission performance propose very high
Require, but compared with wireline communication network, wireless relay network has that packet loss is high and transmission delay is big.Traditional
Packet loss re-transmission policy is no longer suitable in the data transfer of wireless relay network.Generally use forward error correction coding, such as low-density
Parity check code come correct mistake or loss packet.However, these yard more complicated, special hardware device is needed
Encoding and decoding are carried out, can not be used well on the limited sensor device of a lot of computing capabilitys.
Fountain coding is a kind of sparse graph code, solves the encoding and decoding computational problem of the complexity of a lot of forward error corrections.
Rupee (Luby) coding (M.Luby, LT Codes, In Proceeding of the ACM Symposium on
Foundations of Computer Science, Vancouver, BC, CA, November 2002) be first general
Fountain coding, has been widely used.But the decoding complex degree of rupee coding is still higher, therefore the bird of prey (Raptor) coding
(A.Shokrollahi,Raptor Codes,Information Theory,vol.52,pp.2551-2567,June 2006)
By the way of precoding and rupee coding are combined, solve the problems, such as that decoding complex degree is high, but these codings are in wireless
Need to carry out multiple coding and decoding in network, consume substantial amounts of computing resource.
Feedback information using receiving terminal in transmitting procedure can improve the coding strategy of transmitting terminal, so as to reduce coding
The complexity and number of bag.For example (RT) stateless encodes (A.Beimel, S.Dolev, and N.Singer, " RT in real time
Oblivious Erasure Correcting,”IEEE Trans.Networking,vol.15,no.6,pp.1321-1332,
2007) December adjusts the number of degrees of transmitting terminal coding bag, the volume in real time according to the coding bag number that receiving terminal feedback is received
, due to the state before not preserving, therefore committed memory is little for code, but the packets need in order to recover a small amount of loss send big
The redundancy encoding bag of amount.Conversion rupee (SLT) coding (A.Hagedorn, S.Agarwal, D, Starobinski, and
A.Trachtenberg,“Rateless Coding with Feedback,”In Proceeding of INFOCOM,Rio
De Janeiro, Brazil, April 2009) with real-time stateless coding, using receiving terminal feed back recovered
The number of original packet carrys out the coding number of degrees of dynamic adjustment coding bag, but the coding encoders are using the ripple of fixed size, therefore
Average redundancy rate and the average coding number of degrees are than larger.
The problems referred to above of the fountain coding in wireless relay network how are solved, becomes current wireless communication technology field urgency
The technical barrier that need to be solved.
Content of the invention
In view of this, the purpose of the present invention is a kind of data transmission method for wireless relay communication of invention, realizes number
All compare according to the average data redundancy packet degree, average coding number of degrees distribution, ability consumption and the memory requirements that encode bag in transmitting procedure
Less target.
In order to achieve the above object, the present invention proposes a kind of data transmission method for wireless relay communication, including
Following operative step：
(1) original data division to be sent into k size identical original packet, original packet is also called information source to source node
Symbol, k are natural number, represent the length of source symbol, construct source symbol sequence S=[s1,s2,...,sk], wherein siRepresent
I-th source symbol, i are the no more than natural number of k；
(2) transmitting terminal sends aforesaid whole k original packets to receiving terminal, and due to there is packet loss, receiving terminal successfully connects
Receive n original packet, n is a natural number for being not more than k, receiving terminal is quantity n of the original packet for receiving by feedback
Mode tells transmitting terminal；Described transmitting terminal can be source node, or via node；During described receiving terminal can be
After node, or destination node；
(3) transmitting terminal described in is encoded to original packet according to the coded method for setting, and obtains coding bag, and to reception
End sends coding bag；Coding bag is also called coded identification；The coded method of described setting is the ripple size based on packet loss
The fountain coding method that successively decreases, its particular content include following operating procedure：
(31) calculation code degree distribution function ρ (d), wherein d be natural number, d=1,2,3 ..., k, concrete calculating process
Including following sub-step：
(3101) if the source symbol number that the receiving terminal is properly received is n, orderAs coding degree
The minimum number of degrees of distribution function, i.e.,：ρ (d)=0, as d ＜ d0When, operatorRepresent and take the no more than maximum integer of x；
(3102) minima R that ripple should keep is calculated according to the following formula0(L),
In above formula, L is a natural number, represents the number of the source symbol of also unsuccessful decoding during decoding；S tables
Show the number of the coded identification that the not processed coding number of degrees during decoding are 1；S is defined asWherein c is to translate
The regulation parameter of the not processed quantity for encoding the coded identification that the number of degrees are 1 during code, δ refer to the probability of decoding failure；Institute
The ripple that states refers to the set of the coded identification that the not processed coding number of degrees during decoding are 1, encodes the coding that the number of degrees are 1
Symbol is source symbol；
(3103) assume that n source symbol is successfully received and is added in described ripple, calculate ripple according to the following formula
Value R (L) that stricture of vagina size should keep,
(3104) quantity of the source symbol that should be discharged when k-L source symbol is decoded successful is calculated according to the following formula
Q(L),
Q (L)=R (L)-R (L+1)+1
(3105) calculate according to the following formula when the also undecoded success of L source symbol, when the ripple size is R, one is compiled
The code number of degrees are released and can be added to the probability q (d, L, R) in ripple for the coded identification of d,
(3106) following system of linear equations is solved by minimum non-negative square law, solves coding degree distribution function ρ (d),
In above-mentioned equation group, P is a matrix constructed by probability q (d, L, the R), is defined as follows：
In above-mentioned equation group, M represents the quantity of required coded identification；
(32) to the source symbol sequence S=[s described in step (1)1,s2,...,sk] fountain coding is carried out, obtain fountain
Coded sequence V=[v1,v2...], wherein, coded identification vi(i=1,2 ...) realizes that step is as follows：
(3201) coding degree distribution function ρ (d) calculated according to step (31), according to described distribution function ρ (d) with
Machine generates nonnegative integer di, by diAs coded identification viCoding degree；
(3202) d is randomly selected from k source symboliIndividual different source symbol；
(3203) to described diIndividual different source symbol carries out XOR, obtains coded identification vi.
(4) receiving terminal described in is wrapped into row decoding to the coding for being received according to the interpretation method for setting, until described
Receiving terminal can recover the original packet or decoding process of all loss completely to be terminated.
The coded method of the setting described in described step (3) and step (4) and interpretation method can be fountain codings
And interpretation method.
The content of the interpretation method of the setting described in described step (4) is to include following operating procedure：
(41) source symbol is selected from described ripple, and remove the source symbol from described ripple；
(42) each coded identification is directed to, if described source symbol is neighbours' symbol of the coded identification, should
The coding number of degrees of coded identification subtract one, and remove described source symbol as neighbours' symbol of described coded identification；
(43) if the value after the coding number of degrees of described coded identification subtract is 1, then it represents that decoding success goes out a letter
Source symbol；If decoded the source symbol do not appear in described ripple, the source symbol is added to described
Ripple in；All successfully translated if all of source symbol, then successfully decoded, decoding process terminates, and otherwise goes to step
(44)；
(44) if before decoding is completed, described ripple is changed into empty set, then it represents that decoding failure, decoding process knot
Beam；(41) are otherwise gone to step.
The beneficial effects of the present invention is when packet loss is less, then only produce and transmit little coding bag, this
Sample system does not need substantial amounts of computing resource to process encoding and decoding；When packet loss is larger, fountain codes forward error correction can be passed through
The packet that has lost, it is to avoid wait and retransmitting, so as to improve throughput；Using big based on packet loss and rapid decrement ripple
Little number of degrees distribution, average redundancy rate, the average number of degrees are all less, and as redundancy rate is little, therefore throughput is high, and transmission speed is fast；By
Little in the number of degrees, therefore the complexity of encoding and decoding is low, energy consumption is low.
Description of the drawings
Fig. 1 is the schematic network structure of data transfer in wireless relay network.
Fig. 2 is a kind of flow chart of data transmission method for wireless relay communication proposed by the present invention.
Fig. 3 is the simulation experiment result figure of the present invention-coding redundancy rate comparison diagram.
Fig. 4 is the coding bag quantity comparison diagram of the simulation experiment result figure of the present invention-be temporarily stored in internal memory.
Fig. 5 is the simulation experiment result figure-transmission time comparison diagram of the present invention.
Specific embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with the accompanying drawings the present invention is made further
Detailed description.
Referring to Fig. 1, basic process during traditional wireless relay communication transmitted data on network is：Assume that source node needs logical
Cross several via nodes and can just transmit data to destination node, and each node only one of which antenna, can only half pair
The work of work, or receiving data sends data, it is impossible to which enough i.e. receiving datas simultaneously send data again.Source node will be sent out
The data that send are divided into k size identical original packet, and source node generates coding bag according to original packet, is subsequently sent to and which
Connected via node, the via node recover original packet after collecting enough coding bags, source node stops transmission, in this
The via node that coding bag is then transferred to next-hop is generated after node, until all of original packet is received by destination node.
Basic process of the data transmission method for wireless relay communication proposed by the present invention in transmission data is：By
In the transmitting procedure from source node to destination node, packet loss may be than larger, but the packet loss of each jump does not but have
So big, so in the transmitting procedure of each jump, only a fraction of data-bag lost.Therefore the present invention proposes two
The data transmission scheme in stage：First stage：Transmitting terminal sends k original packet, and due to packet loss, receiving terminal is successfully received n
Individual original packet (n<=k), and tell that transmitting terminal, first stage are completed quantity n for receiving by way of feedback；Second
The individual stage：Transmitting terminal sends coding bag, until receiving terminal can recover the packet of all loss completely.
Referring to Fig. 2, a kind of data transmission method for wireless relay communication proposed by the present invention is introduced, including following behaviour
Make step：
(1) original data division to be sent into k size identical original packet, original packet is also called information source to source node
Symbol, k are natural number, represent the length (such as k=256) of source symbol, construct source symbol sequence S=[s1,s2,...,sk],
Wherein siRepresent i-th source symbol, i is the no more than natural number of k；
(2) transmitting terminal sends aforesaid whole k original packets to receiving terminal, and due to there is packet loss, receiving terminal successfully connects
Receive n original packet, n is a natural number for being not more than k, receiving terminal is quantity n of the original packet for receiving by feedback
Mode tells transmitting terminal；Described transmitting terminal can be source node, or via node；During described receiving terminal can be
After node, or destination node；
(3) transmitting terminal described in is encoded to original packet according to the coded method for setting, and obtains coding bag, and to reception
End sends coding bag；Coding bag is also called coded identification；The coded method of described setting is the ripple size based on packet loss
The fountain coding method that successively decreases, its particular content include following operating procedure：
(31) calculation code degree distribution function ρ (d), wherein d be natural number, d=1,2,3 ..., k, concrete calculating process
Including following sub-step：
(3101) if the source symbol number that the receiving terminal is properly received is n, orderAs coding
The minimum number of degrees of degree distribution function, i.e.,：ρ (d)=0, as d ＜ d0When, operatorRepresent and take the no more than maximum integer of x；
Such as k=10, during n=5, calculatesSo as to ρ (1)=0；
(3102) minima R that ripple should keep is calculated according to the following formula0(L),
In above formula, L is a natural number, represents the number of the source symbol of also unsuccessful decoding during decoding；S tables
Show the number of the coded identification that the not processed coding number of degrees during decoding are 1；S is defined asWherein c is to translate
The not processed coding number of degrees during code are the regulation parameter of the quantity of 1 coded identification, and (c is general, and value is relevant with k, warp
When crossing test k=256, c is proper for 0.01, if c values too greatly, are encoded, the coded identification that the number of degrees are 1 is too many, and coding is imitated
Rate is poor, that is, produce substantial amounts of redundancy encoding bag, if c values are too little, encode the number of degrees be 1 coded identification very little, be decoded into
Before work(, for 0), δ refers to that (δ represents the probability of decoding failure, also relevant with k, through surveying for the probability of decoding failure to ripple size
During examination k=256, which could be arranged to 0.01, if arranged is too little, then code efficiency may be poor, that is, produce big
The redundancy encoding bag of amount, if the ratio for arranging is larger, decoding may fail)；Described ripple refer to decoding during not by
The coding number of degrees of process are the set of 1 coded identification, and it is source symbol to encode the coded identification that the number of degrees are 1；
(3103) assume that n source symbol is successfully received and is added in described ripple, calculate ripple according to the following formula
Value R (L) that stricture of vagina size should keep,
(3104) quantity of the source symbol that should be discharged when k-L source symbol is decoded successful is calculated according to the following formula
Q(L),
Q (L)=R (L)-R (L+1)+1
(3105) calculate according to the following formula when the also undecoded success of L source symbol, when the ripple size is R, one is compiled
The code number of degrees are released and can be added to the probability q (d, L, R) in ripple for the coded identification of d,
(3106) following system of linear equations is solved by minimum non-negative square law, solves coding degree distribution function ρ (d),
In above-mentioned equation group, P is a matrix constructed by probability q (d, L, the R), is defined as follows：
In above-mentioned equation group, M represents the quantity of required coded identification；
Specifically calculating process is：Above-mentioned system of linear equations is solved by minimum non-negative square law, M ρ are first solved
(d), d=d0,d0+ 1 ..., k-1, k, desired coding degree distribution function ρ (d) is calculated again by equation below then,
It is exemplified below：
If when c=0.01, δ=0.01, k=10, n=5,
CalculateSo as to ρ (1)=0；
Calculate R0(L), the value of R (L) and Q (L) is as follows：
R0(10)=0.2184, R0(9)=0.2041, R0(8)=0.1891, R0(7)=0.1733,
R0(6)=0.1567, R0(5)=0.1370, R0(4)=0.1198, R0(3)=0.099, R0(2)=0.0749；
R (10)=4.0, R (9)=3.0, R (8)=2.0, R (7)=1.0,
R (6)=0.1567, R (5)=0.1390, R (4)=0.1198, R (3)=0.099, R (2)=0.075；
Q (10)=0.0, Q (9)=0.0, Q (8)=0.0, Q (7)=0.0,
Q (6)=0.1567, Q (5)=0.9823, Q (4)=0.9809, Q (3)=0.9790, Q (2)=0.9761；
The matrix P constructed by probability q (d, L, the R) for calculating is as follows：
Following system of linear equations is solved by minimum non-negative square law,
Obtain：
M ρ (2)=0.0, M ρ (3)=0.0, M ρ (4)=0.3954, M ρ (5)=3.6816, M ρ (6)=
0.0,
M ρ (7)=0.0, M ρ (8)=0.0, M ρ (9)=0.0, M ρ (10)=0.1148
It is as follows that coding degree distribution function ρ (d) is finally obtained：
(32) to the source symbol sequence S=[s described in step (1)1,s2,...,sk] fountain coding is carried out, obtain fountain
Coded sequence V=[v1,v2...], wherein, coded identification vi(i=1,2 ...) realizes that step is as follows：
(3201) coding degree distribution function ρ (d) calculated according to step (31), according to described distribution function ρ (d) with
Machine generates nonnegative integer di, by diAs coded identification viCoding degree；
(3202) d is randomly selected from k source symboliIndividual different source symbol；
(3203) to described diIndividual different source symbol carries out XOR, obtains coded identification vi.
(4) receiving terminal described in is wrapped into row decoding to the coding for being received according to the interpretation method for setting, until described
Receiving terminal can recover the original packet or decoding process of all loss completely to be terminated.
The coded method of the setting described in described step (3) and step (4) and interpretation method can be fountain codings
And interpretation method.
The content of the interpretation method of the setting described in described step (4) is to include following operating procedure：
(41) source symbol is selected from described ripple, and remove the source symbol from described ripple；
(42) each coded identification is directed to, if described source symbol is neighbours' symbol of the coded identification, should
The coding number of degrees of coded identification subtract one, and remove described source symbol as neighbours' symbol of described coded identification；
(43) if the value after the coding number of degrees of described coded identification subtract is 1, then it represents that decoding success goes out a letter
Source symbol；If decoded the source symbol do not appear in described ripple, the source symbol is added to described
Ripple in；All successfully translated if all of source symbol, then successfully decoded, decoding process terminates, and otherwise goes to step
(44)；
(44) if before decoding is completed, described ripple is changed into empty set, then it represents that decoding failure, decoding process knot
Beam；(41) are otherwise gone to step.
To method proposed by the invention, inventor has carried out emulation experiment, and experiment parameter arranges as follows：δ=0.01, c
=0.01, k=256, b=256 byte, b represent the size of original packet.In emulation experiment, inventor is the method for the present invention (letter
It is written as LT-LR-DRS) and rupee coded method SLT-LR (the Shifted LT with Loss Rate based on packet loss：
A.Hagedorn,S.Agarwal,D,Starobinski,and A.Trachtenberg,“Rateless Coding with
Feedback, " In Proceeding of INFOCOM, Rio de Janeiro, Brazil, April 2009), rupee coding
Method LT (Luby Transfer：M.Luby,LT Codes,In Proceeding ofthe ACM Symposium on
Foundations of Computer Science, 2002) and based on ripple Vancouver, BC, CA, November pass
Rupee coded method LT-DRS (LT with Decreasing Ripple Size, J.H.Sorensen, the P.Popovski for subtracting
and J.Ostergaard,“Design and Analysis of LT Codes with Decreasing Ripple
Size, " IEEE Transactions on, vol.60,2012, pp.1-7.) etc. carried out contrast experiment, experimental result referring to
Fig. 3, Fig. 4 and Fig. 5.Contrast and experiment shows that the method for the present invention is in coding redundancy rate, the coding bag number being temporarily stored in internal memory
All it is better than other three kinds of methods in the technical specification such as amount and transmission time.
Claims (3)
1. a kind of data transmission method for wireless relay communication, it is characterised in that：Methods described includes following operative step：
(1) original data division to be sent into k size identical original packet, original packet is also called information source symbol to source node
Number, k is natural number, represents the length of source symbol, constructs source symbol sequence S=[s1,s2,...,sk], wherein siRepresent the
I source symbol, i are the no more than natural number of k；
(2) transmitting terminal sends aforesaid whole k original packets to receiving terminal, and due to there is packet loss, receiving terminal is successfully received n
Individual original packet, n is a natural number for being not more than k, and receiving terminal by way of feedback is accused quantity n of the original packet for receiving
Tell transmitting terminal；Described transmitting terminal can be source node, or via node；Described receiving terminal can be relaying section
Point, or destination node；
(3) transmitting terminal described in is encoded to original packet according to the coded method for setting, and is obtained coding bag, and is sent out to receiving terminal
Send coding bag；Coding bag is also called coded identification；The coded method of described setting is successively decreased based on the ripple size of packet loss
Fountain coding method, its particular content includes following operating procedure：
(31) calculation code degree distribution function ρ (d), wherein d be natural number, d=1,2,3 ..., k, concrete calculating process includes
Following sub-step：
(3101) if the source symbol number that the receiving terminal is properly received is n, orderIt is distributed as coding degree
The minimum of a function number of degrees, i.e.,：ρ (d)=0, as d ＜ d0When, operatorRepresent and take the no more than maximum integer of x；
(3102) minima R that ripple should keep is calculated according to the following formula0(L),
In above formula, L is a natural number, represents the number of the source symbol of also unsuccessful decoding during decoding；S is represented and is translated
The not processed coding number of degrees during code are the number of 1 coded identification；S is defined asWherein c is decoding
During the not processed coding number of degrees be 1 coded identification quantity regulation parameter, δ refers to the probability of decoding failure；Described
Ripple refer to the set of coded identification that the not processed coding number of degrees during decoding are 1, encode the coding symbol that the number of degrees are 1
Number it is source symbol；
(3103) assume that n source symbol is successfully received and is added in described ripple, calculate ripple according to the following formula big
Little value R (L) that should be kept,
(3104) quantity Q of the source symbol that should be discharged when k-L source symbol is decoded successful is calculated according to the following formula
(L),
Q (L)=R (L)-R (L+1)+1
(3105) calculate according to the following formula when the also undecoded success of L source symbol, the ripple size for R when, a coding degree
Number is released and can be added to the probability q (d, L, R) in ripple for the coded identification of d,
(3106) following system of linear equations is solved by minimum non-negative square law, solves coding degree distribution function ρ (d),
In above-mentioned equation group, P is a matrix constructed by probability q (d, L, the R), is defined as follows：
In above-mentioned equation group, M represents the quantity of required coded identification；
(32) to the source symbol sequence S=[s described in step (1)1,s2,...,sk] fountain coding is carried out, obtain fountain coding
Sequence V=[v1,v2...], wherein, coded identification vi(i=1,2 ...) realizes that step is as follows：
(3201) coding degree distribution function ρ (d) calculated according to step (31), raw at random according to described distribution function ρ (d)
Into nonnegative integer di, by diAs coded identification viCoding degree；
(3202) d is randomly selected from k source symboliIndividual different source symbol；
(3203) to described diIndividual different source symbol carries out XOR, obtains coded identification vi；
(4) receiving terminal described in is wrapped into row decoding to the coding for being received according to the interpretation method for setting, until described reception
End can recover the original packet or decoding process of all loss completely and terminate.
2. a kind of data transmission method for wireless relay communication according to claim 1, it is characterised in that：Described
The coded method of the setting described in step (3) and step (4) and interpretation method can be fountain coding and interpretation method.
3. a kind of data transmission method for wireless relay communication according to claim 1 and 2, it is characterised in that：Institute
The content of the interpretation method of the setting described in the step of stating (4) is to include following operating procedure：
(41) source symbol is selected from described ripple, and remove the source symbol from described ripple；
(42) each coded identification, if described source symbol is neighbours' symbol of the coded identification, the coding are directed to
The coding number of degrees of symbol subtract one, and remove described source symbol as neighbours' symbol of described coded identification；
(43) if the value after the coding number of degrees of described coded identification subtract is 1, then it represents that decoding success goes out an information source symbol
Number；If decoded the source symbol do not appear in described ripple, the source symbol is added to described ripple
In stricture of vagina；All successfully translated if all of source symbol, then successfully decoded, decoding process terminates, and otherwise goes to step (44)；
(44) if before decoding is completed, described ripple is changed into empty set, then it represents that decoding failure, and decoding process terminates；No
(41) are then gone to step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410232527.7A CN103997759B (en) | 2014-05-28 | 2014-05-28 | A kind of data transmission method for wireless relay communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410232527.7A CN103997759B (en) | 2014-05-28 | 2014-05-28 | A kind of data transmission method for wireless relay communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103997759A CN103997759A (en) | 2014-08-20 |
| CN103997759B true CN103997759B (en) | 2017-03-15 |
Family
ID=51311735
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410232527.7A Active CN103997759B (en) | 2014-05-28 | 2014-05-28 | A kind of data transmission method for wireless relay communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103997759B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112788051A (en) * | 2021-01-25 | 2021-05-11 | 高新兴讯美科技股份有限公司 | Https dynamic encryption transmission method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102364903A (en) * | 2011-11-11 | 2012-02-29 | 北京邮电大学 | Hierarchical-modulation-based wireless relaying secure forwarding method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5249983B2 (en) * | 2010-04-05 | 2013-07-31 | 株式会社エヌ・ティ・ティ・ドコモ | Radio base station apparatus, mobile terminal apparatus and cell selection method |
-
2014
- 2014-05-28 CN CN201410232527.7A patent/CN103997759B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102364903A (en) * | 2011-11-11 | 2012-02-29 | 北京邮电大学 | Hierarchical-modulation-based wireless relaying secure forwarding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103997759A (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101453297B (en) | Encoding method and apparatus for low density generation matrix code, and decoding method and apparatus | |
| US10476528B2 (en) | Data packet processing method and device | |
| CN103250463A (en) | Subset coding for communication systems | |
| CN106877973A (en) | The method and communication equipment of polarization code treatment | |
| CN107835063A (en) | Method, sending ending equipment and the receiving device of information transfer | |
| CN107819545A (en) | The repeating method and device of polarization code | |
| RU2461970C2 (en) | Method and apparatus for receiving data | |
| CN103067137A (en) | Multicast retransmission method based on network codes | |
| US10700816B2 (en) | Method for performing HARQ using polar code | |
| CN103905152B (en) | Using the effective throughput randomized optimization process of layer-span combined coding in erasure channel | |
| CN102957511B (en) | Adaptive deceleration method of data transmission | |
| CN104539387B (en) | A kind of hop-by-hop transmitting control method of water sound sensor network | |
| CN103944676B (en) | A kind of LT code coding/decoding methods based on deep space communication environment | |
| CN103152652B (en) | A kind of video requency frame data network transfer method of encoding based on Cauchy RS | |
| Yang et al. | From LDPC to chunked network codes | |
| CN102148665B (en) | Decoding method for LT (language translation) codes | |
| CN101552661B (en) | Method for error control | |
| CN104009830A (en) | Data broadcasting method based on finite set network code ARQs and for large-scale receiving ends | |
| CN103997759B (en) | A kind of data transmission method for wireless relay communication | |
| US20160211942A1 (en) | Encoding apparatus and encoding method | |
| CN107005349B (en) | A kind of data processing method, base station and terminal device | |
| CN102208963B (en) | Decoding method for determining rate-free codes through binary system | |
| CN108028667A (en) | Tail-biting convolutional code with very short block | |
| CN103532666B (en) | Improve the method for data transmission efficiency and LT code performance in distributed transmission | |
| CN104158641B (en) | Wireless sensor network data based on many bag decodings retransmits compressing method |
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 |