技术领域technical field
本发明涉及通信领域的信道编码和传输技术，尤其涉及一种适合物理层无速率编码传输的停等式传输方法。The invention relates to channel coding and transmission technology in the communication field, in particular to a stop-equation transmission method suitable for rateless coding transmission of the physical layer.
背景技术Background technique
通信系统的基本目的在于将信息由信源高效、可靠、安全地传送到信宿。有扰通信信道中的噪声会不可避免地对传输信息产生不同程度的干扰，从而可能降低通信可靠性。所以通信系统设计的核心问题就是在存在随机噪声的信道中如何克服干扰，减小信息传输的差错，同时又保证信息传输的效率。为了克服信道中各种噪声的干扰，人们提出了纠错编码的方法以实现可靠传输。在香农以前，人们都认为增加信道的信息传输速率总要引起错误概率的增加，认为要使错误概率为零，则传输速率只能为零。1948年，香农建立了信息论，为纠错编码的研究指明了方向。香农提出，对每个信道可以根据它的噪声干扰特性计算出它的容量C，所有低于信道容量C的速率R均是可达的，即当R<C时，总存在一系列码，当码长 时，最大误码概率趋于0。这一理论创造性的颠覆了关于人们对于通信的认识，而寻找能够实际应用的逼近香农极限的编码方案也就成了纠错编码理论的最终目标。The basic purpose of a communication system is to efficiently, reliably and safely transmit information from a source to a destination. The noise in the disturbed communication channel will inevitably produce different degrees of interference to the transmitted information, which may reduce the communication reliability. Therefore, the core issue of communication system design is how to overcome interference in channels with random noise, reduce the error of information transmission, and at the same time ensure the efficiency of information transmission. In order to overcome the interference of various noises in the channel, a method of error correction coding is proposed to achieve reliable transmission. Before Shannon, people believed that increasing the information transmission rate of the channel would always lead to an increase in the error probability, and believed that the transmission rate can only be zero if the error probability is to be zero. In 1948, Shannon established information theory, which pointed out the direction for the research of error correction coding. Shannon proposed that for each channel, its capacity C can be calculated according to its noise interference characteristics, and all rates R lower than the channel capacity C are reachable, that is, when R<C, there is always a series of codes, when code length When , the maximum bit error probability tends to 0. This theory has creatively subverted people's understanding of communication, and finding a coding scheme that can be practically applied close to Shannon's limit has become the ultimate goal of error-correcting coding theory.
自信道编码定理提出以来，如何构造一个逼近信道容量限的实用编码成了众多研究学者竟相研究的课题，并逐渐形成信息论的一个重要分支——信道编码理论。几十多年来，通过众多学者，特别是有关数学和信息论学术界的研究人员五十多年的共同努力，目前已经取得了很多成果。如已经相当成熟的线性分组码，编码器有记忆的卷积码，1993年由Berror，Glavieux和Thitimajashia提出的与香农极限只差几个分贝的Turbo码，之后出现的另一种可以逼近香农极限的低密度校验码LDPC码等。Since the channel coding theorem was proposed, how to construct a practical code approaching the channel capacity limit has become a subject of many researchers' research, and gradually formed an important branch of information theory - channel coding theory. Over the past decades, through the joint efforts of many scholars, especially researchers in the academic circles of mathematics and information theory for more than 50 years, many achievements have been achieved. For example, the already mature linear block code, the convolutional code with memory in the encoder, the Turbo code proposed by Berror, Glavieux and Thitimajashia in 1993, which is only a few decibels away from the Shannon limit, and another type that appears later can approach the Shannon limit The low density check code LDPC code and so on.
然而这些信道编码在设计时，通常先根据信道状态信息估计信道参数，根据信道参数设计一个码率固定为R的信道纠错编码（由k个输入符号得到n个输出符号，则码率为）。当估计的信道参数大于实际的信道参数时，虽然可以实现可靠传输，但是造成了传输的浪费，因为此时可以使用更高码率的信道纠错编码；当估计的信道参数小于实际的信道参数时，不能实现可靠传输，此时需要更低码率的信道纠错编码。而且很多时候，信道还是随时变化或者无法提前判断的，这个时候这些传统的编码就显得难以应付。于是出现了码率可变的无速率码。对于无速率码，由原始数据产生的编码数据包是随着编码过程而源源不断产生的，根据译码的需要可多可少，只要保证能成功译码即可。实际传输的码率取决于实际发送的编码包数目，而需要发送的编码包数目则取决于当时的信道状况。However, when these channel codes are designed, the channel parameters are usually estimated according to the channel state information, and a channel error correction code with a fixed code rate of R is designed according to the channel parameters (n output symbols are obtained from k input symbols, and the code rate is ). When the estimated channel parameter is greater than the actual channel parameter, although reliable transmission can be achieved, it causes a waste of transmission, because at this time a higher bit rate channel error correction coding can be used; when the estimated channel parameter is less than the actual channel parameter When , reliable transmission cannot be achieved, and channel error correction coding with a lower code rate is required at this time. And in many cases, the channel is still changing at any time or cannot be judged in advance. At this time, these traditional encodings are difficult to cope with. Then there is a rateless code with a variable code rate. For the rateless code, the encoded data packets generated from the original data are continuously generated along with the encoding process, which can be more or less according to the decoding needs, as long as the successful decoding is guaranteed. The actual code rate for transmission depends on the number of coded packets actually sent, and the number of coded packets to be sent depends on the channel conditions at that time.
无速率码具有三个重要属性：1)自适应链路速率适配：其最终速率决定于信道特性，不需要在传输前估计信道特性而固定码率，实际传输的码率取决于当时的信道状况。 2)无速率属性（流属性）：发送端可以源源不断的输出编码包，形成一个可以无限延续的编码包流，而没有任何速率约束；3)桶积水效应：接收端不断收集编码包，收集到足够多的编码包即能恢复出所有原始数据包。正是由于无速率码的三个重要属性，使其在广播信道，认知，网络传输，反馈代价较大的通信场合等各个方面具有广泛的应用前景。Rateless codes have three important properties: 1) Adaptive link rate adaptation: the final rate depends on the channel characteristics, and there is no need to estimate the channel characteristics before transmission to fix the code rate, and the actual transmission code rate depends on the channel at that time situation. 2) No rate attribute (stream attribute): the sender can continuously output encoded packets, forming an infinitely continuous encoded packet stream without any rate constraints; 3) bucket water effect: the receiver continuously collects encoded packets, Collecting enough encoded packets can recover all the original data packets. It is precisely because of the three important properties of the rateless code that it has broad application prospects in various aspects such as broadcast channels, cognition, network transmission, and communication occasions with high feedback costs.
目前关于无速率码在实际系统中的应用，主要集中在物理层以上的传输。而对于在物理层采用无速率编码传输的应用几乎是一片空白，尤其是在信道不断变化的通信环境下。At present, the application of rateless codes in actual systems mainly focuses on the transmission above the physical layer. However, the application of rateless coding transmission in the physical layer is almost blank, especially in the communication environment where the channel is constantly changing.
发明内容Contents of the invention
本发明的目的是针对现有技术的不足，提供一种适合物理层无速率编码传输的停等式传输方法。The object of the present invention is to provide a stop-and-equal transmission method suitable for the rateless transmission of the physical layer in view of the deficiencies of the prior art.
本发明的目的是通过以下技术方案实现的：本发明适合物理层无速率编码传输的停等式传输方法，其发送端先将数据包经过无速率编码产生编码包，然后将编码包拆分成多个编码包块并封装成一个个子帧。发送端每发送一个子帧，则检测信道接收ACK。若在一定的时间内没有收到ACK，则发送下一个子帧，再次检测信道；若收到ACK，则对下一个数据包进行无速率编码和子帧封装，发送下一个数据包的子帧。接收端收到一个子帧后便启动无速率译码。在译码的过程中若收到新的子帧，则将其加入译码器联合译码。若译码成功，则检测到信道空闲时反馈ACK；否则，等待新的子帧加入译码。本发明方法包括发送端的处理方法和接收端的处理方法。The purpose of the present invention is achieved by the following technical solutions: the present invention is suitable for the stop-equation transmission method of the physical layer rateless encoding transmission, and its sender first generates encoded packets through rateless encoding of data packets, and then splits the encoded packets into Multiple encoded packets are packaged into subframes. Each time the sender sends a subframe, it detects the channel to receive an ACK. If the ACK is not received within a certain period of time, the next subframe is sent, and the channel is detected again; if the ACK is received, the next data packet is subjected to rateless encoding and subframe encapsulation, and the subframe of the next data packet is sent. The receiving end starts rateless decoding after receiving a subframe. During the decoding process, if a new subframe is received, it is added to the decoder for joint decoding. If the decoding is successful, an ACK is fed back when the channel is detected to be idle; otherwise, it waits for a new subframe to be added to the decoding. The method of the invention includes a processing method at the sending end and a processing method at the receiving end.
设当发送端有子帧需要发送时，SendFlag为1。发送端先进入CS状态检测信道。如果检测到信道空闲且SendFlag为1，则进入TX状态，发送子帧。如果在CS的过程中检测到信号，则进入RX状态接收信号。如果是接收端反馈的ACK帧，则处理完ACK后返回到CS状态准备发送新的数据包的子帧；否则，直接回到CS状态继续等待ACK或者继续发送当前的消息包的子帧。设发送端将一个数据包的编码包拆分为N个子帧，则发送端具体的处理步骤如下：Set SendFlag to 1 when the sender has a subframe to send. The sending end first enters the CS state detection channel. If it is detected that the channel is idle and SendFlag is 1, it enters the TX state and sends subframes. If a signal is detected during CS, it enters the RX state to receive the signal. If it is the ACK frame fed back by the receiving end, return to the CS state to prepare to send the subframe of the new data packet after processing the ACK; otherwise, directly return to the CS state to continue waiting for the ACK or continue to send the subframe of the current message packet. Assuming that the sending end divides the encoded packet of a data packet into N subframes, the specific processing steps of the sending end are as follows:
(a)发送端读取一定大小的数据包，将数据包进行无速率编码；(a) The sender reads a data packet of a certain size, and performs rateless encoding on the data packet;
(b)将编码包拆分成N段并封装成N个子帧；(b) splitting the encoded packet into N sections and encapsulating it into N subframes;
(c)进入信道检测。如果信道空闲，则进入步骤(d)；如果检测到信号，则进入步骤(e)；(c) Incoming channel detection. If the channel is free, go to step (d); if a signal is detected, go to step (e);
(d)发送第j号子帧，并将子帧计数器j加1。若j等于N-1，则将j置零，下一次再重新发送0号子帧；否则下次发送新的子帧。(d) Send the jth subframe, and add 1 to the subframe counter j. If j is equal to N-1, set j to zero, and resend subframe 0 next time; otherwise, send a new subframe next time.
(e) 接收信号并解调，判断是否为当前数据包的ACK。如果是，则释放当前数据包的子帧数据，返回步骤(a)；如果不是，返回步骤(c)。(e) Receive and demodulate the signal to determine whether it is the ACK of the current data packet. If yes, release the subframe data of the current data packet, and return to step (a); if not, return to step (c).
设当接收端有ACK需要发送时，AckFlag不为0。接收端先进入CS状态检测信道，若检测到信道空闲且AckFlag不为0，则进入TX状态发送ACK帧；若检测到信号，则进入RX状态接收信号。若信号是当前正在译码的消息包的子帧，则将子帧解调加入译码；否则返回CS状态继续检测信号。接收端具体的处理步骤如下：It is assumed that AckFlag is not 0 when the receiving end has ACK to be sent. The receiving end first enters the CS state to detect the channel. If it detects that the channel is idle and AckFlag is not 0, it enters the TX state to send an ACK frame; if it detects a signal, it enters the RX state to receive the signal. If the signal is the subframe of the message packet currently being decoded, then demodulate the subframe and add it to the decoding; otherwise, return to the CS state and continue to detect the signal. The specific processing steps at the receiving end are as follows:
(a)接收端检测信道。若检测到信号，进入步骤(b)；若检测到信道空闲，进入步骤(c)；(a) The receiver detects the channel. If a signal is detected, go to step (b); if it is detected that the channel is idle, go to step (c);
(b)先将子帧的帧头解调译出，并判断该子帧的消息包标识。如果是当前的消息包子帧，则将该子帧的数据部分解调，并把解调后的数据加入译码器进行译码；如果该子帧是上一个消息包的子帧，则认为上一次ACK发送失败，再重新发送上一个消息包的ACK，将AckFlag置成2。返回步骤(a)；(b) Demodulate and decode the frame header of the subframe first, and judge the message packet identifier of the subframe. If it is the current subframe of the message packet, demodulate the data part of the subframe, and add the demodulated data to the decoder for decoding; if the subframe is the subframe of the previous message packet, consider the previous If an ACK transmission fails, resend the ACK of the previous message packet, and set AckFlag to 2. Return to step (a);
(c)判断是否有ACK需要发送。若AckFlag为1，则发送当前消息包的ACK；若AckFlag为2，则发送上一个消息包的ACK；否则，返回(a)；(c) Judging whether there is an ACK to be sent. If AckFlag is 1, then send the ACK of the current message packet; if AckFlag is 2, then send the ACK of the previous message packet; otherwise, return (a);
(d)接收端在检测信号的同时，译码也在进行。若译码结束，则进行CRC校验。若CRC校验正确，则将AckFlag置1；否则清空译码数据，等待新的子帧继续译码。(d) While the receiving end is detecting the signal, decoding is also in progress. When the decoding is finished, a CRC check is performed. If the CRC check is correct, set AckFlag to 1; otherwise, clear the decoding data and wait for a new subframe to continue decoding.
进一步地，发送端等待ACK的超时门限值为发送端到接收端的传输时延加上接收端接收收完一个子帧的时延最大值。Further, the timeout threshold for the sending end to wait for the ACK is the transmission delay from the sending end to the receiving end plus the maximum value of the receiving end delay after receiving and receiving one subframe.
本发明的有益效果是：该传输方法可以很好的发挥无速率码的信道自适应性，传输码率随着信道的变化而自适应变化，而且非常鲁棒，易于实现，不需要复杂的控制方法，适用于半双工和全双工模式下的无速率编码传输。The beneficial effects of the present invention are: the transmission method can well utilize the channel adaptability of the rateless code, and the transmission code rate changes adaptively with the change of the channel, and is very robust, easy to implement, and does not require complicated control method, applicable to rateless encoded transmissions in half-duplex and full-duplex modes.
附图说明Description of drawings
图1是适合物理层无速率编码传输的停等式传输方法下发送端的状态机示意图；Fig. 1 is a schematic diagram of a state machine at a sending end under a stop-and-equal transmission method suitable for physical layer rateless coded transmission;
图2是适合物理层无速率编码传输的停等式传输方法下接收端的状态机示意图；Fig. 2 is a schematic diagram of a state machine at the receiving end under the stop-and-equal transmission method suitable for physical layer rateless encoding transmission;
图 3是适合物理层无速率编码传输的停等式传输方法下发送端的处理流程示意图；Figure 3 is a schematic diagram of the processing flow of the sending end under the stop-and-equal transmission method suitable for the rateless transmission of the physical layer;
图 4是适合物理层无速率编码传输的停等式传输方法下接收端的处理流程示意图。Figure 4 is a schematic diagram of the processing flow at the receiving end under the stop-and-equal transmission method suitable for rateless transmission at the physical layer.
图 5是适合物理层无速率编码传输的停等式传输方法的传输过程示意图。Fig. 5 is a schematic diagram of the transmission process of the stop-and-equal transmission method suitable for rateless transmission of the physical layer.
具体实施方式Detailed ways
以下结合图1-5进一步说明本发明。The present invention will be further described below in conjunction with FIGS. 1-5.
本发明适合物理层无速率编码传输的停等式传输方法，其发送端先将数据包经过无速率编码产生编码包，然后将编码包拆分成多个编码包块并封装成一个个子帧。发送端每发送一个子帧，则检测信道接收ACK。若在一定的时间内没有收到ACK，则发送下一个子帧，再次检测信道；若收到ACK，则对下一个数据包进行无速率编码和子帧封装，发送下一个数据包的子帧。接收端收到一个子帧后便启动无速率译码。在译码的过程中若收到新的子帧，则将其加入译码器联合译码。若译码成功，则检测到信道空闲时反馈ACK；否则，等待新的子帧加入译码。本发明方法包括发送端的处理方法和接收端的处理方法。The present invention is suitable for the stop-and-equal transmission method of the rateless encoding transmission of the physical layer. The sending end first generates encoding packets through the rateless encoding of the data packets, and then splits the encoding packets into multiple encoding packet blocks and encapsulates them into subframes. Each time the sender sends a subframe, it detects the channel to receive an ACK. If the ACK is not received within a certain period of time, the next subframe is sent, and the channel is detected again; if the ACK is received, the next data packet is subjected to rateless encoding and subframe encapsulation, and the subframe of the next data packet is sent. The receiving end starts rateless decoding after receiving a subframe. During the decoding process, if a new subframe is received, it is added to the decoder for joint decoding. If the decoding is successful, an ACK is fed back when the channel is detected to be idle; otherwise, it waits for a new subframe to be added to the decoding. The method of the invention includes a processing method at the sending end and a processing method at the receiving end.
设当发送端有子帧需要发送时，SendFlag为1。发送端先进入CS状态检测信道。如果检测到信道空闲且SendFlag为1，则进入TX状态，发送子帧。如果在CS的过程中检测到信号，则进入RX状态接收信号。如果是接收端反馈的ACK帧，则处理完ACK后返回到CS状态准备发送新的数据包的子帧；否则，直接回到CS状态继续等待ACK或者继续发送当前的消息包的子帧。设发送端将一个数据包的编码包拆分为N个子帧，则发送端具体的处理步骤如下：Set SendFlag to 1 when the sender has a subframe to send. The sending end first enters the CS state detection channel. If it is detected that the channel is idle and SendFlag is 1, it enters the TX state and sends subframes. If a signal is detected during CS, it enters the RX state to receive the signal. If it is the ACK frame fed back by the receiving end, return to the CS state to prepare to send the subframe of the new data packet after processing the ACK; otherwise, directly return to the CS state to continue waiting for the ACK or continue to send the subframe of the current message packet. Assuming that the sending end divides the encoded packet of a data packet into N subframes, the specific processing steps of the sending end are as follows:
(a)发送端读取一定大小的数据包，将数据包进行无速率编码；(a) The sender reads a data packet of a certain size, and performs rateless encoding on the data packet;
(b)将编码包拆分成N段并封装成N个子帧；(b) splitting the encoded packet into N sections and encapsulating it into N subframes;
(c)进入信道检测。如果信道空闲，则进入步骤(d)；如果检测到信号，则进入步骤(e)；(c) Incoming channel detection. If the channel is free, go to step (d); if a signal is detected, go to step (e);
(d)发送第j号子帧，并将子帧计数器j加1。若j等于N-1，则将j置零，下一次再重新发送0号子帧；否则下次发送新的子帧。(d) Send the jth subframe, and add 1 to the subframe counter j. If j is equal to N-1, set j to zero, and resend subframe 0 next time; otherwise, send a new subframe next time.
(e) 接收信号并解调，判断是否为当前数据包的ACK。如果是，则释放当前数据包的子帧数据，返回步骤(a)；如果不是，返回步骤(c)。(e) Receive and demodulate the signal to determine whether it is the ACK of the current data packet. If yes, release the subframe data of the current data packet, and return to step (a); if not, return to step (c).
设当接收端有ACK需要发送时，AckFlag不为0。接收端先进入CS状态检测信道，若检测到信道空闲且AckFlag不为0，则进入TX状态发送ACK帧；若检测到信号，则进入RX状态接收信号。若信号是当前正在译码的消息包的子帧，则将子帧解调加入译码；否则返回CS状态继续检测信号。接收端具体的处理步骤如下：It is assumed that AckFlag is not 0 when the receiving end has ACK to be sent. The receiving end first enters the CS state to detect the channel. If it detects that the channel is idle and AckFlag is not 0, it enters the TX state to send an ACK frame; if it detects a signal, it enters the RX state to receive the signal. If the signal is the subframe of the message packet currently being decoded, then demodulate the subframe and add it to the decoding; otherwise, return to the CS state and continue to detect the signal. The specific processing steps at the receiving end are as follows:
(a)接收端检测信道。若检测到信号，进入步骤(b)；若检测到信道空闲，进入步骤(c)；(a) The receiver detects the channel. If a signal is detected, go to step (b); if it is detected that the channel is idle, go to step (c);
(b)先将子帧的帧头解调译出，并判断该子帧的消息包标识。如果是当前的消息包子帧，则将该子帧的数据部分解调，并把解调后的数据加入译码器进行译码；如果该子帧是上一个消息包的子帧，则认为上一次ACK发送失败，再重新发送上一个消息包的ACK，将AckFlag置成2。返回步骤(a)；(b) Demodulate and decode the frame header of the subframe first, and judge the message packet identifier of the subframe. If it is the current subframe of the message packet, demodulate the data part of the subframe, and add the demodulated data to the decoder for decoding; if the subframe is the subframe of the previous message packet, consider the previous If an ACK transmission fails, resend the ACK of the previous message packet, and set AckFlag to 2. Return to step (a);
(c)判断是否有ACK需要发送。若AckFlag为1，则发送当前消息包的ACK；若AckFlag为2，则发送上一个消息包的ACK；否则，返回(a)；(c) Judging whether there is an ACK to be sent. If AckFlag is 1, then send the ACK of the current message packet; if AckFlag is 2, then send the ACK of the previous message packet; otherwise, return (a);
(d)接收端在检测信号的同时，译码也在进行。若译码结束，则进行CRC校验。若CRC校验正确，则将AckFlag置1；否则清空译码数据，等待新的子帧继续译码。(d) While the receiving end is detecting the signal, decoding is also in progress. When the decoding is finished, a CRC check is performed. If the CRC check is correct, set AckFlag to 1; otherwise, clear the decoding data and wait for a new subframe to continue decoding.
进一步地，发送端等待ACK的超时门限值为发送端到接收端的传输时延加上接收端接收收完一个子帧的时延最大值。Further, the timeout threshold for the sending end to wait for the ACK is the transmission delay from the sending end to the receiving end plus the maximum value of the receiving end delay after receiving and receiving one subframe.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410135143.3ACN103986553B (en) | 2014-04-04 | 2014-04-04 | The stop-and-wait transmission method of suitable physical layer no rate coding transmission |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410135143.3ACN103986553B (en) | 2014-04-04 | 2014-04-04 | The stop-and-wait transmission method of suitable physical layer no rate coding transmission |
| Publication Number | Publication Date |
|---|---|
| CN103986553Atrue CN103986553A (en) | 2014-08-13 |
| CN103986553B CN103986553B (en) | 2017-03-01 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410135143.3AExpired - Fee RelatedCN103986553B (en) | 2014-04-04 | 2014-04-04 | The stop-and-wait transmission method of suitable physical layer no rate coding transmission |
| Country | Link |
|---|---|
| CN (1) | CN103986553B (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060251026A1 (en)* | 2005-05-09 | 2006-11-09 | Amit Kalhan | Multiple source wireless communication system and method |
| CN101179279A (en)* | 2007-11-27 | 2008-05-14 | 浙江大学 | A Rateless Coding and Decoding Method for Additive White Gaussian Noise Channels |
| CN101325461A (en)* | 2008-07-25 | 2008-12-17 | 浙江大学 | Cognitive radio communication link establishing and maintaining method based on no-rate codes |
| EP2122884A1 (en)* | 2006-12-14 | 2009-11-25 | Thomson Licensing | Rateless encoding in communication systems |
| US20090304117A1 (en)* | 2006-12-14 | 2009-12-10 | Joshua Lawrence Koslov | Concatenated coding/decoding in communication systems |
| CN101645753A (en)* | 2009-09-03 | 2010-02-10 | 电子科技大学 | Coding method without rate codes |
| CN101742570A (en)* | 2009-12-29 | 2010-06-16 | 浙江大学 | A Distributed Packet Access Method Based on Rateless Codes in Cognitive Radio |
| CN102324998A (en)* | 2011-05-11 | 2012-01-18 | 浙江大学 | A Raptor Codes Encoding and Decoding Method for Medium and Short Code Lengths Suitable for Additive White Gaussian Noise Channels |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060251026A1 (en)* | 2005-05-09 | 2006-11-09 | Amit Kalhan | Multiple source wireless communication system and method |
| EP2122884A1 (en)* | 2006-12-14 | 2009-11-25 | Thomson Licensing | Rateless encoding in communication systems |
| US20090304117A1 (en)* | 2006-12-14 | 2009-12-10 | Joshua Lawrence Koslov | Concatenated coding/decoding in communication systems |
| CN101179279A (en)* | 2007-11-27 | 2008-05-14 | 浙江大学 | A Rateless Coding and Decoding Method for Additive White Gaussian Noise Channels |
| CN101325461A (en)* | 2008-07-25 | 2008-12-17 | 浙江大学 | Cognitive radio communication link establishing and maintaining method based on no-rate codes |
| CN101645753A (en)* | 2009-09-03 | 2010-02-10 | 电子科技大学 | Coding method without rate codes |
| CN101742570A (en)* | 2009-12-29 | 2010-06-16 | 浙江大学 | A Distributed Packet Access Method Based on Rateless Codes in Cognitive Radio |
| CN102324998A (en)* | 2011-05-11 | 2012-01-18 | 浙江大学 | A Raptor Codes Encoding and Decoding Method for Medium and Short Code Lengths Suitable for Additive White Gaussian Noise Channels |
| Title |
|---|
| 张瑀琪: "基于无速率码的信道编码研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》* |
| Publication number | Publication date |
|---|---|
| CN103986553B (en) | 2017-03-01 |
| Publication | Publication Date | Title |
|---|---|---|
| CN101567755B (en) | Network coding method based on fountain codes | |
| CN104159166B (en) | Based on the live video data transmission error control method of mobile network's packet loss state | |
| CN103944689B (en) | A kind of pipeline method of suitable physical layer no rate coding transmission | |
| CN104168087B (en) | Active self-adaptive transmission frame length adjustment method based on Q-learning in rateless code transmission system | |
| CN103905152B (en) | Using the effective throughput randomized optimization process of layer-span combined coding in erasure channel | |
| JP2011520388A (en) | Preemptive acknowledgment for data transmission in communication systems | |
| CN102957511B (en) | Adaptive deceleration method of data transmission | |
| CN102664716B (en) | Wireless sensor network data collection method applied to real-time monitoring | |
| CN102984232B (en) | Real-time flow-medium transmission method in multihop network | |
| CN103944674B (en) | Data cutting and packaging method suitable for physical layer rateless code transmission | |
| Zhan et al. | A novel error correction mechanism for energy-efficient cyber-physical systems in smart building | |
| CN102013951A (en) | Wireless communication network coding method using fountain codes | |
| CN107181576B (en) | An IR-HARQ transmission method suitable for LDPC codes in 5G | |
| Liau et al. | Improved low-complexity soliton-like network coding for a resource-limited relay | |
| CN105391530A (en) | Satellite network reliable multicast method based on network coding | |
| CN102811120A (en) | Two-way relay HARQ control system and method based on network coding | |
| CN104852788B (en) | Data broadcasting ARQ methods based on minimax network code | |
| CN103200088A (en) | Improved type MMRS fixed relay node selection signal transmission method based on fountain encoding | |
| CN101888358A (en) | A Transmission Method for Reducing the Computational Complexity of Bidirectional Relay Nodes Based on Network Coding | |
| CN111510199A (en) | Code modulation method and system in satellite mobile communication | |
| CN110492981A (en) | Polarization code mixed automatic retransmission request method based on channel reliability and code distance | |
| Angelopoulos et al. | Harnessing partial packets in wireless networks: throughput and energy benefits | |
| CN103078712B (en) | Be applicable to dynamic long delay transmission without rate coding forward error control method | |
| CN103986553B (en) | The stop-and-wait transmission method of suitable physical layer no rate coding transmission | |
| CN102844997B (en) | For communication means and the Apparatus and system of bidirectional relay system |
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee | Granted publication date:20170301 |