CN115361103A - Buffer management mechanism for select-repeat hybrid automatic repeat request protocol - Google Patents
Buffer management mechanism for select-repeat hybrid automatic repeat request protocol Download PDFInfo
- Publication number
- CN115361103A CN115361103A CN202210992700.8A CN202210992700A CN115361103A CN 115361103 A CN115361103 A CN 115361103A CN 202210992700 A CN202210992700 A CN 202210992700A CN 115361103 A CN115361103 A CN 115361103A
- Authority
- CN
- China
- Prior art keywords
- data frame
- buffer
- buffer area
- sending
- harq
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1864—ARQ related signaling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
- H04L5/0055—Physical resource allocation for ACK/NACK
Abstract
The invention discloses a buffer management mechanism for a selective-repeat hybrid automatic repeat request protocol, which comprises the following steps: 1) The specific implementation of the HARQ mechanism comprises a sending end and a receiving end, and the sending end and the receiving end are respectively provided with an independent data frame buffer area and an independent data reading and writing module; 2) The data frame buffer area adopts an annular structure and is mainly characterized in that the buffer areas are connected end to form a cycle; 3) Before the data frame is read/written into the buffer area, the existing data frame or vacant space must be found in the buffer area in advance; 4) The error correction algorithm used by the mechanism comprises a cyclic redundancy check and a Reed-Solomon code; 5) The received data frames can be divided into three types: ACK/NACK information, a common data frame with CRC check bits and RS code check bits; 6) Besides calculating error check bits, metadata indicating the attribute of the data frame is added on the basis of the original data frame to form a new HARQ data frame format.
Description
Technical Field
The invention belongs to the technical field of data frame buffer management, and particularly relates to a buffer management mechanism for a selection-repeat hybrid automatic repeat request protocol.
Background
In reality, the communication channel has non-ideal factors such as noise, attenuation, interference, etc., and may cause bit errors in the data frame during transmission. Therefore, practical communication technologies need to implement error correction techniques at different levels to ensure that data frames can be correctly decoded by the receiving end. One of the widely used techniques is hybrid automatic transmission request (HARQ): the core of the method is that two mechanisms of error checking bits and data retransmission are combined. When the receiving end cannot correct the bit error in the data frame, the transmitting terminal is informed to retransmit the data frame until the data frame is successfully retransmitted. This way, the data frame with errors in the transmission process can be received without errors finally, and the reliability of the communication system is ensured.
In a different implementation of HARQ, HARQ based on a Selective Retransmission (SR) mechanism may retransmit the erroneous data frame in a non-blocking manner. This means that SR-HARQ can continue to transmit and receive data streams without waiting for the transmission of the erroneous data frame to succeed, and thus the channel utilization is high. However, this may lead to a situation where a subsequent new data frame may have been successfully received, provided that part of the old data frame has not been successfully transmitted. This will disturb the original sequence of the data frame, and make the receiving end unable to restore the original data according to the normal time sequence. Therefore, establishing a set of perfect data frame buffer area management mechanism is the key point for normally realizing the out-of-order transceiving function.
Hybrid Automatic Repeat reQuest (Hybrid Automatic Repeat reQuest) is one of the common protocols in communication systems, and is mainly used to ensure that a receiving end of communication can finally receive data accurately and without errors: if the receiving end detects that the data is interfered and has errors in the communication process, the receiving end returns a NACK message to the sending end to inform the sending end to resend the data; if no error occurs, an ACK message is returned to inform the sending terminal that the data is successfully received. This simple mechanism ensures that information can be reliably transmitted over unreliable communication channels.
The selective-Repeat (Select-Repeat) based mechanism only requires that the sending end resends the erroneous data frames when receiving the return, and other data frames can still normally perform transceiving actions. The SR-HARQ breaks through the limitation that in the traditional HARQ realization, a sending terminal needs to sequentially transmit data frames and tries to send the next data frame after a receiving terminal successfully receives the current data frame, thereby greatly improving the utilization rate of communication resources. However, this method causes the original timing of transmitting and receiving data frames to be disturbed, and therefore sequence management of data frames plays a crucial role in the specific implementation of SR-HARQ.
The current SR-HARQ has the following steps for the write operation:
1. attempting to write externally stored HARQ data into a cache;
2. if the writing is hit, writing the HARQ data; if the write is lost, reallocating the cache line;
3. aiming at the condition of writing missing in the step 2, if no data exists in the cache line, writing HARQ data; if yes, determining whether to execute the write-in operation according to the error check result and the specific configuration;
the operation of reading data from the cache to the external storage is substantially the same as the writing process, and will not be described herein.
Through the cache line allocation and the cache line data polling in the steps, bubbles in a storage space can be reduced, the cache utilization rate is improved, and HARQ operation resources are saved. However, this solution has several disadvantages:
1. data reading and writing are carried out only according to the occupation condition of the cache, queue management cannot be carried out on the data, and the original sequence of the data is reserved;
2. only CRC is used as error detection algorithm and the error correction function is not enhanced in combination with other algorithms.
Disclosure of Invention
To solve the above problems, it is a primary object of the present invention to provide a buffer management mechanism for a select-repeat hybrid automatic repeat request protocol, which is capable of implementing an out-of-order transceiving function while preserving the sequence of data frames.
In order to achieve the above object, the technical solution of the present invention is as follows.
A buffer management mechanism for a select-repeat hybrid automatic repeat request protocol, the mechanism comprising:
1) The specific implementation of the HARQ mechanism comprises a sending end and a receiving end, and the sending end and the receiving end are respectively provided with an independent data frame buffer area and an independent data reading and writing module;
2) The data frame buffer area adopts a ring structure and is mainly characterized in that the buffer areas are connected end to end, and the next element at the tail is the head, so that a cycle is formed; this feature is suitable for buffering data streams and is also key to implementing out-of-order transceiving functions.
3) Before a data frame is read/written into the buffer, the existing data frame or empty space must be found in the buffer in advance before the corresponding operation can be continued.
4) The error correction algorithm used by the mechanism comprises Cyclic Redundancy Check (CRC) and Reed-Solomon code (Reed-Solomon code); the specific algorithm is adopted and is determined based on the transmission times of the data frames, the complexity of the algorithm and the error correction capability.
5) The received data frames can be divided into three types: ACK/NACK information, a common data frame with CRC check bits and RS code check bits; the three are distinguished by the size of the received data frame.
6) Besides calculating error check bits, metadata indicating the attribute of the data frame is added on the basis of the original data frame to form a new HARQ data frame format.
Further, as for the point 1), reading and writing the object of the buffer area, wherein the object comprises a sending end and a receiving end; for a sending end, after a data frame from an upper layer of a network is coded by an error correction algorithm, the data frame is written into a module and temporarily stored in a sending buffer area, and then a reading module reads the data frame from the buffer area so as to carry out subsequent sending action; for a receiving end, the writing module can temporarily store a newly received data frame in a receiving buffer area, and the reading module reads the data frame from the buffer area and then decodes and verifies the data frame, and pushes the data frame which is verified successfully to an upper layer of a network; meanwhile, the sending and receiving ends and the reading and writing operations of the sending and receiving ends are independent respectively.
Further, for point 3), the position of writing the data frame to the buffer:
when a new data frame is to be written into the buffer, the writing module needs to poll the buffer by using a Round-Robin mode before the new data frame is written into the buffer so as to find an effective vacancy in the buffer; assuming that the buffer can store a maximum of N data frames and BUF [ i ] represents the ith position in the buffer, the specific steps are as follows:
s1, starting from a starting position i (default i = 0), checking whether BUF [ i ] is empty;
s2, if BUF [ i ] is empty, the position can be written in. The writing module writes the new data frame into the BUF [ i ] and updates the initial position i, and the next search starts from the position; otherwise, representing that the position has an old data frame, executing i + + at the moment and repeating the step 1;
s3, when i + + needs to be executed in the step 2 and i = N-1, the tail of the buffer area is checked. At this point, step 1 should be repeated after i is reset to 0 to continue the inspection process from the head;
s4, when the steps are executed for N times and no vacant position is found after the buffer zone is scanned, representing that the buffer zone is full, and returning corresponding error information.
Furthermore, for the point 3), the position of the data frame is read from the buffer, the reading module also needs to scan the buffer in advance, and the read-out scan will check whether the BUF [ i ] has the data frame, so as to perform the reading action from the position of the existing data frame, and avoid the erroneous reading of the empty bit in the buffer.
Further, for point 4), the use of an error check bit algorithm.
Before a new data frame is sent for the first time, a sending end adopts CRC to add check bits for the data frame; if the first transmission of the data frame fails, before retransmission is needed, the transmitting end will clear the original CRC check bit of the data frame, and then use the RS code with higher complexity and stronger error correction capability to re-encode the data frame. Because the sizes of the data frames generated after the two algorithms are coded are different, a receiving end can judge the decoding mode which should be used after receiving the data frames.
Further, for the point 6), the data frame structure, in addition to the error correction coding, the HARQ implementation also adds a metadata tag on the basis of the original data frame for marking and tracking the transmission status of the data frame.
The components of the HARQ data frame in this implementation are in order as follows:
1) Sequence number: and recording the specific position of the data frame in the sending buffer area, and quickly indexing the corresponding data frame from the ACK/NACK information returned by the receiving end.
2) A flag bit: the receiving end uses the flag bit to carry ACK/NACK information, which is mainly used to track the number of times the data frame has been sent: if the receiving end needs to return the ACK information, all the flag bits are set to be 0; otherwise it is set to 1. For the sending end, the information from the receiving end, of which the flag bits are all 0, is regarded as ACK; if all the flag bits are 1, the message is regarded as NACK. When the sending end receives NACK and decides to resend the data frame, the flag bit of the sending frame is added with 1, and then corresponding operation is executed.
3) Time stamping: and recording the time point of the data frame from the upper layer of the network to the HARQ sending end by adopting a UNIX microsecond timestamp format. The method can record the time sequence of the original data stream, so that the receiving end can restore the time sequence of the original data frame according to the time stamp.
4) Size: indicating the size of the original data frame.
5) Data: the original data frame containing the error check bits, and the tail zero padding (if any).
The invention forms a cycle by the head and the tail of the buffer areas, and is suitable for caching data flow; before the data frame is read out or written into the buffer area, the existing data frame or vacant position must be found in the buffer area in advance, then the corresponding operation can be continued, the reading and writing accuracy of the data is improved, the reliability of the data frame is further ensured by using the error correction algorithm, and the sequence of the data frame is ensured by forming a new HARQ data frame format, therefore, the invention can realize the disorder transceiving function and simultaneously reserve the sequence of the data frame.
Drawings
FIG. 1 is a flow chart of the buffer read/write steps implemented by the present invention.
Fig. 2 is a schematic diagram of a buffer polling process implemented by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The buffer management mechanism for the select-repeat hybrid automatic repeat request protocol implemented by the present invention is implemented as shown in fig. 1.
1) The specific implementation of the HARQ mechanism comprises a sending end and a receiving end, and the sending end and the receiving end are respectively provided with an independent data frame buffer area and an independent data reading and writing module.
2) The data frame buffer area adopts a ring structure and is mainly characterized in that the buffer areas are connected end to end, and the next element at the tail is the head, so that a cycle is formed. This feature is suitable for buffering data streams and is also key to implementing out-of-order transceiving functions.
3) Before a data frame is read/written into the buffer, the existing data frame or empty space must be found in the buffer in advance before the corresponding operation can be continued.
4) The error correction algorithm used by this mechanism includes both Cyclic Redundancy Check (CRC) and Reed-Solomon code (Reed-Solomon code). The specific algorithm is adopted and is determined based on the transmission times of the data frames, the complexity of the algorithm and the error correction capability.
5) The received data frames can be divided into three types: ACK/NACK information, a normal data frame with CRC check bits and RS code check bits. The three are distinguished by the size of the received data frame.
6) Besides calculating error check bits, metadata indicating the attribute of the data frame is added on the basis of the original data frame to form a new HARQ data frame format.
For point 1), the objects of the buffer are read and written.
For the sending end, after the data frame from the upper layer of the network is encoded by the error correction algorithm, the data frame is written into the module and temporarily stored in the sending buffer area, and then the data frame is read out from the buffer area by the reading module so as to carry out subsequent sending action. For the receiving end, the writing module can temporarily store the newly received data frame in the receiving buffer area, and the reading module reads the data frame from the buffer area and then decodes and verifies the data frame, and pushes the successfully verified data frame to the upper layer of the network. In addition, the sending and receiving ends and the reading and writing operations of the sending and receiving ends are independent, so that a full-duplex data receiving and sending mode can be realized in an asynchronous operation mode.
For point 3), the location of the data frame is written to the buffer.
When a new data frame is to be written into the buffer, there may be an existing old data frame in the buffer and distributed at a different location in the buffer. For example, after unsuccessful transmission, the data frame in the transmission buffer will occupy the same position until successful retransmission or clear. Therefore, the writing module needs to poll the buffer in a Round-Robin manner before a new data frame is written to find a valid empty bit in the buffer. Here, assuming that the buffer can store a maximum of N data frames, and BUF [ i ] represents the ith position in the buffer, the specific steps are as follows:
s1, starting from a starting position i (default i = 0), checking whether BUF [ i ] is empty;
s2, if BUF [ i ] is empty, the position is represented to be available for writing. The writing module writes the new data frame into the BUF [ i ] and updates the initial position i, and the next search starts from the position; otherwise, representing that the position has an old data frame, executing i + + at the moment and repeating the step 1;
s3, when step 2 needs to execute i + + and i = N-1, the buffer is checked to be at the tail. At this point, step 1 should be repeated after i is reset to 0 to continue the inspection process from the head. This step is a specific implementation of the buffer ring structure.
S4, when the steps are executed for N times and no vacant position is found after the buffer zone is scanned, representing that the buffer zone is full, and returning corresponding error information.
Generally, the above steps adopt a sequential search and rewrite mode, which can maximally ensure that the new data frame can be written into the buffer region in sequence, and can also skip the existing old data frame to avoid error data coverage. The mechanism can achieve good balance in terms of sequence and efficiency.
For the position of reading the data frame from the buffer, the reading module also needs to scan the buffer in advance, similar to the process of writing the data frame into the buffer. The difference is that the scan for read-out checks the BUF i for the presence of a data frame in order to perform a read action from the location of an existing data frame, avoiding erroneous reads to empty bits in the buffer. The remaining details are substantially the same as the writing process, as shown in fig. 2, and are not described herein again.
For point 4), the use of an error check bit algorithm.
Before a new data frame is sent for the first time, the sending end can adopt the CRC to add check bits for the data frame. The algorithm complexity of CRC is low, so the use of the algorithm for the new data frame can reduce the influence of the error correction step on the HARQ operation efficiency and avoid the blockage caused by the performance bottleneck. If the first transmission of the data frame fails, before retransmission is needed, the transmitting end will clear the original CRC check bit of the data frame, and then use the RS code with higher complexity and stronger error correction capability to re-encode the data frame. Because the sizes of the data frames generated after the two algorithms are coded are different, a receiving end can judge the decoding mode which should be used after receiving the data frames. The mechanism is well balanced in terms of efficiency and error capability correction.
For the data frame structure at point 6), besides error correction coding, the HARQ implementation adds metadata tags on the basis of the original data frame for marking and tracking the transmission status of the data frame. The components of the HARQ data frame in this implementation are in order as follows:
1) Sequence number: and recording the specific position of the data frame in the sending buffer area, and quickly indexing the corresponding data frame from the ACK/NACK information returned by the receiving end.
2) A flag bit: it is mainly used to keep track of the number of times a data frame has been sent (default is 1, since each data frame will be sent at least once). In addition, the receiving end will use the flag bit to carry ACK/NACK information: if the receiving end needs to return the ACK information, all the flag bits are set to be 0; otherwise it is set to 1. For the sending end, the information from the receiving end, of which the flag bits are all 0, is regarded as ACK; if all flag bits are 1, it is considered as NACK. When the sending end receives NACK and decides to resend the data frame, the flag bit of the sending frame is added with 1, and then corresponding operation is executed.
3) Time stamping: and recording the time point of the data frame from the upper layer of the network to the HARQ sending end by adopting a UNIX microsecond timestamp format. The method can record the time sequence of the original data stream, so that the receiving end can restore the time sequence of the original data frame according to the time stamp.
4) Size: indicating the size of the original data frame.
5) Data: the original data frame containing the error check bits, and the tail zero padding (if any).
It should be noted that the ACK/NACK returned from the receiving end to the transmitting end only contains two parts, namely, a sequence number and a flag bit. The reason is that the sequence number can locate the data frame that it corresponds to feeding back, while the flag bit is used to identify the ACK/NACK itself. The transmitting end can obtain all necessary information fed back by the receiving end from the two.
The present invention is not limited to the above preferred embodiments, and any modifications, equivalents and improvements made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (6)
1. A buffer management mechanism for a select-repeat hybrid automatic repeat request protocol, the mechanism comprising:
1) The specific implementation of the HARQ mechanism comprises a sending end and a receiving end, and the sending end and the receiving end are respectively provided with an independent data frame buffer area and an independent data reading and writing module;
2) The data frame buffer area adopts a ring structure and is mainly characterized in that the buffer areas are connected end to end, and the next element at the tail is the head, so that a cycle is formed;
3) Before the data frame is read out/written into the buffer area, the existing data frame or vacant position must be found in the buffer area in advance, and then the corresponding operation can be continued;
4) The error correction algorithm used by the mechanism comprises a cyclic redundancy check and a Reed-Solomon code;
5) The received data frames can be divided into three types: ACK/NACK information, a common data frame with CRC check bits and RS code check bits;
6) Besides calculating error check bits, metadata indicating the attribute of the data frame is added on the basis of the original data frame to form a new HARQ data frame format.
2. The buffer management mechanism for a select-repeat hybrid automatic repeat request protocol according to claim 1, wherein for point 1), objects read from and written to the buffer comprise a sender and a receiver; for a sending end, after a data frame from an upper layer of a network is coded by an error correction algorithm, the data frame is temporarily stored in a sending buffer area by a writing module, and then the data frame is read out from the buffer area by a reading module so as to carry out subsequent sending action; for a receiving end, the writing module can temporarily store a newly received data frame in a receiving buffer area, and the reading module reads the data frame from the buffer area and then decodes and verifies the data frame, and pushes the data frame which is verified successfully to an upper layer of a network; meanwhile, the sending and receiving ends and the read-write operations of the sending and receiving ends are independent respectively.
3. The buffer management mechanism for a select-repeat hybrid automatic repeat request protocol according to claim 1, wherein for point 3), the location of the data frame is written to the buffer:
when a new data frame is to be written into the buffer area, the writing module needs to poll the buffer area by using a Round-Robin mode before the new data frame is written into the buffer area so as to find an effective vacant position in the buffer area; assuming that the buffer can store a maximum of N data frames and BUF [ i ] represents the ith position in the buffer, the specific steps are as follows:
s1, starting from a starting position i (default i = 0), checking whether BUF [ i ] is empty;
s2, if the BUF [ i ] is empty, representing that the position can be written in; the writing module writes the new data frame into the BUF [ i ] and updates the initial position i, and the next search starts from the position; otherwise, representing that the position has an old data frame, executing i + + at the moment and repeating the step 1;
s3, when i + + needs to be executed in the step 2 and i = N-1, checking the tail of the buffer area; at this point, step 1 should be repeated after i is reset to 0 to continue the inspection process from the head;
s4, when the steps are executed for N times and no vacant position is found after the buffer zone is scanned, representing that the buffer zone is full, and returning corresponding error information.
4. The buffer management mechanism of claim 3, wherein for point 3), the location of the data frame is read from the buffer, and the read module also needs to scan the buffer in advance, and the scanning for reading will check if the data frame exists in the BUF [ i ] to perform the reading operation from the location of the existing data frame, so as to avoid the erroneous reading to the empty location in the buffer.
5. The buffer management mechanism for a select-repeat hybrid automatic repeat request protocol according to claim 1, wherein for point 4), the use of the error check bit algorithm: before a new data frame is sent for the first time, a sending end adds check bits to the data frame by using CRC; if the first transmission of the data frame fails, before retransmission is needed, the transmitting end will clear the original CRC check bit of the data frame, and then use the RS code with higher complexity and stronger error correction capability to re-encode the data frame.
6. The buffer management mechanism of claim 1, wherein for point 6), the data frame structure, in addition to error correction coding, the HARQ implementation adds metadata tags on the original data frame, and the HARQ data frame components in the implementation are sequentially as follows:
1) Sequence number: recording the specific position of the data frame in the sending buffer area, and quickly indexing the corresponding data frame from the ACK/NACK information returned by the receiving end;
2) A flag bit: the receiving end uses the flag bit to carry ACK/NACK information, which is mainly used to track the number of times the data frame has been sent: if the receiving end needs to return the ACK information, all the flag bits are set to be 0; otherwise, setting the value to 1;
3) Time stamping: recording the time point of a data frame from the upper layer of the network to the HARQ sending end by adopting a UNIX microsecond timestamp format;
4) Size: for indicating the size of the original data frame;
5) Data: the original data frame containing the error check bits, and the tail zero padding (if any).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210992700.8A CN115361103A (en) | 2022-08-18 | 2022-08-18 | Buffer management mechanism for select-repeat hybrid automatic repeat request protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210992700.8A CN115361103A (en) | 2022-08-18 | 2022-08-18 | Buffer management mechanism for select-repeat hybrid automatic repeat request protocol |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115361103A true CN115361103A (en) | 2022-11-18 |
Family
ID=84001755
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210992700.8A Pending CN115361103A (en) | 2022-08-18 | 2022-08-18 | Buffer management mechanism for select-repeat hybrid automatic repeat request protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115361103A (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1128920A (en) * | 1994-10-11 | 1996-08-14 | 日本电信电话株式会社 | System for retransmission in data communication |
| US6212659B1 (en) * | 1997-05-30 | 2001-04-03 | Qualcomm Inc. | Method and apparatus for providing error protection for over the air file transfer |
| CN1592244A (en) * | 2003-09-02 | 2005-03-09 | 皇家飞利浦电子股份有限公司 | Hybrid auto-repeating requesting method and apparatus for WLAN |
| CN101237310A (en) * | 2007-11-19 | 2008-08-06 | 北京邮电大学 | A method for enhanced self-adapted data retransfer |
| CN101610139A (en) * | 2009-07-20 | 2009-12-23 | 中国船舶重工集团公司第七一五研究所 | A kind of hybrid automatic repeat request method of underwater sound MODEM |
| CN102006154A (en) * | 2010-11-18 | 2011-04-06 | 中国人民解放军理工大学 | Multi-code channel hybrid automatic repeat request (ARQ) method based on selective repeat |
| CN102474343A (en) * | 2009-07-07 | 2012-05-23 | Lg电子株式会社 | Method of transmitting and receiving arq feedback information |
| CN103957089A (en) * | 2014-04-28 | 2014-07-30 | 上海大学 | High-reliability linear speed data communication method |
| CN104660384A (en) * | 2015-02-02 | 2015-05-27 | 武汉爱科唯自动化科技有限公司 | Network remote monitoring method for open numerical control system |
| CN107769901A (en) * | 2017-10-19 | 2018-03-06 | 中国科学院寒区旱区环境与工程研究所 | A kind of method and apparatus of field inspection data transfer |
| CN107800517A (en) * | 2016-09-05 | 2018-03-13 | 北京信威通信技术股份有限公司 | A kind of HARQ implementation method and device |
| CN108604956A (en) * | 2016-01-18 | 2018-09-28 | 高通股份有限公司 | HARQ LLR buffers and resequencing buffer management |
| CN110073625A (en) * | 2017-10-02 | 2019-07-30 | 联发科技股份有限公司 | Hybrid automatic repeat-request buffer size for communication system designs |
| CN111200477A (en) * | 2018-11-19 | 2020-05-26 | 中兴通讯股份有限公司 | Method, apparatus and storage medium for transmitting data frame |
-
2022
- 2022-08-18 CN CN202210992700.8A patent/CN115361103A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1128920A (en) * | 1994-10-11 | 1996-08-14 | 日本电信电话株式会社 | System for retransmission in data communication |
| US6212659B1 (en) * | 1997-05-30 | 2001-04-03 | Qualcomm Inc. | Method and apparatus for providing error protection for over the air file transfer |
| CN1592244A (en) * | 2003-09-02 | 2005-03-09 | 皇家飞利浦电子股份有限公司 | Hybrid auto-repeating requesting method and apparatus for WLAN |
| CN101237310A (en) * | 2007-11-19 | 2008-08-06 | 北京邮电大学 | A method for enhanced self-adapted data retransfer |
| CN102474343A (en) * | 2009-07-07 | 2012-05-23 | Lg电子株式会社 | Method of transmitting and receiving arq feedback information |
| CN101610139A (en) * | 2009-07-20 | 2009-12-23 | 中国船舶重工集团公司第七一五研究所 | A kind of hybrid automatic repeat request method of underwater sound MODEM |
| CN102006154A (en) * | 2010-11-18 | 2011-04-06 | 中国人民解放军理工大学 | Multi-code channel hybrid automatic repeat request (ARQ) method based on selective repeat |
| CN103957089A (en) * | 2014-04-28 | 2014-07-30 | 上海大学 | High-reliability linear speed data communication method |
| CN104660384A (en) * | 2015-02-02 | 2015-05-27 | 武汉爱科唯自动化科技有限公司 | Network remote monitoring method for open numerical control system |
| CN108604956A (en) * | 2016-01-18 | 2018-09-28 | 高通股份有限公司 | HARQ LLR buffers and resequencing buffer management |
| CN107800517A (en) * | 2016-09-05 | 2018-03-13 | 北京信威通信技术股份有限公司 | A kind of HARQ implementation method and device |
| CN110073625A (en) * | 2017-10-02 | 2019-07-30 | 联发科技股份有限公司 | Hybrid automatic repeat-request buffer size for communication system designs |
| CN107769901A (en) * | 2017-10-19 | 2018-03-06 | 中国科学院寒区旱区环境与工程研究所 | A kind of method and apparatus of field inspection data transfer |
| CN111200477A (en) * | 2018-11-19 | 2020-05-26 | 中兴通讯股份有限公司 | Method, apparatus and storage medium for transmitting data frame |
Non-Patent Citations (1)
| Title |
|---|
| 杨晓航: "5G通信系统下HARQ传输机制研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7003710B2 (en) | Communications method, communications apparatus and communications system using same communications apparatus | |
| RU2387087C2 (en) | Data exchange method, data exchange system and data exchange station | |
| US6697987B2 (en) | Method of packet data transfer with hybrid ARQ | |
| US6389016B1 (en) | Data communication system and method for transporting data | |
| US6778501B1 (en) | Selective repeat ARQ with efficient utilization of bitmaps | |
| US8526513B2 (en) | Method and apparatus for transmitting data, and communication system | |
| US5210751A (en) | Signal transmission system capable of performing re-transmission control in units of slots | |
| US8156407B2 (en) | Method and system for memory management in a HARQ communications system | |
| US6594791B2 (en) | Signalling method in an incremental redundancy communication system whereby data blocks can be combined | |
| KR100287351B1 (en) | Signal transmission method and communication system | |
| CN111490858B (en) | Adaptive transmission method, device and system for satellite communication | |
| US7567515B2 (en) | Inter-layer communication of receipt confirmation for releasing retransmission buffer contents | |
| US20070250751A1 (en) | Automatic repeat request (arq) scheme | |
| JP2003503894A (en) | System and method for implementing a hybrid automatic repeat request using a parity check combination | |
| JP2002135233A (en) | Method and apparatus for asynchronous incremental redundancy reception in communication system | |
| CN104782072A (en) | System and method adopting a reliable stop-and-wait hybrid automatic repeat request protocol | |
| CN103078721A (en) | Hybrid self-adaptive repeat request method and terminal | |
| EP0418866B1 (en) | Signal transmission system capable of performing re-transmission control in units of slots | |
| JPS62239735A (en) | Data transmission system | |
| JPH09284261A (en) | Automatic re-transmission control method | |
| JP3516929B2 (en) | Transmitting device, receiving device, and communication system including the same | |
| CN115361103A (en) | Buffer management mechanism for select-repeat hybrid automatic repeat request protocol | |
| CN113517950B (en) | Signal receiving and transmitting method, system and medium | |
| CN101465719B (en) | Data retransmission method and device | |
| JP2000078118A (en) | Automatic resending request data transmitting method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |