Distributed networking HARQ information storage method and device and storage medium

Abstract

The invention relates to the technical field of wireless communication, in particular to a distributed networking HARQ information storage method and device and a storage medium. According to the distributed networking HARQ information storage method, a memory slice is introduced when HARQ information is stored, and a family of addresses are used for indicating an allocated space, so that discontinuous allocation of a memory is supported, and fragmented memory is prevented from being generated; the memory is dynamically allocated and released according to feedback or demodulation information, so that the storage space required by hybrid automatic repeat request (HARQ) information is reduced, and the utilization rate is improved. According to the distributed networking HARQ information storage method and device and the storage medium, discontinuous allocation of the memory is supported, generation of fragmented memory can be prevented, the storage space required by HARQ information is reduced, and the utilization rate of the storage space is improved.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a distributed networking HARQ information storage method, device and storage medium. Background Art

[0002] Affected by noise, fading, interference, etc., errors always exist in the wireless communication process. In order to improve the utilization of system resources, a certain degree of block error rate (BLER) is usually tolerated, which requires the use of error control technology, and hybrid automatic repeat request (HARQ) is undoubtedly the most widely used technology.

[0003] Distributed networking is different from LTE / NR (Long Term Evolution / New Radio). User equipment UE communicates directly with nodes in the network, rather than the single-node communication mode of base station terminals. Due to scheduling restrictions, distributed networking user equipment UE may receive data packets from multiple nodes before unified feedback, so more storage space is required for hybrid automatic repeat request HARQ information cache. At this time, if memory is allocated according to maximum demand, it will bring huge costs.

[0004] In order to improve the storage efficiency of hybrid automatic repeat request HARQ information, the present invention proposes a distributed networking HARQ information storage method, device and storage medium. Summary of the invention

[0005] In order to make up for the defects of the prior art, the present invention provides a simple and efficient distributed networking HARQ information storage method, device and storage medium.

[0006] The present invention is achieved through the following technical solutions: A distributed networking HARQ information storage method, characterized in that: by introducing memory slices when storing hybrid automatic repeat request HARQ information, a family of addresses is used to indicate the allocated space to support discontinuous allocation of memory and prevent the generation of fragmented memory; Dynamically allocate and release memory based on feedback or demodulation information to reduce the storage space required for hybrid automatic repeat request HARQ information and improve utilization.

[0007] In the distributed networking hybrid automatic repeat request HARQ process, the sender and receiver cache information separately: Before receiving the ACK feedback, the sender caches the transport block TB (Transport block) of each hybrid automatic repeat request HARQ process of each node; Customize the fixed size of the memory space corresponding to each slice, divide the transmission block TB into slices and store them, and uniformly record the slice address, node ID, hybrid automatic repeat request HARQ process ID and transmission block TB size to form a dynamic memory allocation table; Memory space is dynamically allocated in slices, and discontinuous allocation is supported to avoid memory fragmentation and improve storage space utilization efficiency.

[0008] After receiving the confirmation character ACK feedback, the sending end releases the slices occupied by the hybrid automatic repeat request HARQ process of the relevant node and leaves it for the next allocation.

[0009] The receiver caches the soft bit information of each hybrid automatic repeat request HARQ process of each node until the signal is correctly demodulated or the maximum number of retransmissions is reached; The receiver stores the soft bit information after rate matching. Since the maximum code block CB (Code block) size used in encoding is fixed, the corresponding coded code block CB size is also fixed, so the code block CB is defined as the memory slice of the receiver. Customize the fixed size of the memory space corresponding to each slice, divide the program block CB into slices and store them, and uniformly record the slice address, node ID, hybrid automatic repeat request HARQ process ID and the number of program blocks CB to form a dynamic memory allocation table and add an address chain.

[0010] If the demodulated cyclic redundancy check CRC of the transport block TB is correct, the slice slice allocated to the corresponding transport block TB is released.

[0011] When allocating slices, if the span of the transmission block TB is too large and one slice size is difficult to allocate efficiently, multiple slices are introduced to divide the memory into multiple slice areas for mixed allocation.

[0012] The memory is divided into M slice areas for mixed allocation. The M slices are represented from large to small as follows: , ,……, , for the size The process of allocating slices for a transmission block TB includes the following steps: Step S1: Initialization ,set up , ; Step S2: Calculate the number of slices of the i-th type : ; like , then Add to collection middle; like : when When ,make , and Add to collection , go to step S3; when season Increment by 1 and go to step S2; Step S3: According to the set Allocate slices and record the address of each slice.

[0013] A distributed networking HARQ information storage device, characterized in that it includes a memory and a processor; the memory is used to store a computer program, and the processor is used to implement the above method steps when executing the computer program.

[0014] A readable storage medium, characterized in that: a computer program is stored on the readable storage medium, and the computer program implements the above method steps when executed by a processor.

[0015] The beneficial effects of the present invention are as follows: the distributed networking HARQ information storage method supports discontinuous allocation of memory, can prevent the generation of fragmented memory, reduce the storage space required for hybrid automatic repeat request HARQ information, and improve the storage space utilization rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0017] Figure 1 It is a schematic diagram of the dynamic allocation table and slice mapping of the present invention. DETAILED DESCRIPTION

[0018] In order to enable those skilled in the art to better understand the technical solutions in the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0019] The distributed networking HARQ information storage method introduces memory slices when storing hybrid automatic repeat request HARQ information, uses a family of addresses to indicate allocated space, supports discontinuous allocation of memory, and prevents generation of fragmented memory; Dynamically allocate and release memory based on feedback or demodulation information to reduce the storage space required for hybrid automatic repeat request HARQ information and improve utilization.

[0020] In the distributed networking hybrid automatic repeat request HARQ process, the sender and receiver cache information separately: Before receiving the ACK (Acknowledge character) feedback, the sender caches the transport block TB (Transport block) of each hybrid automatic repeat request HARQ process of each node; On the sender side, since the sizes of TBs vary greatly, ranging from tens of bits to tens of thousands of bits, allocating space according to the maximum TB will result in huge waste. For this reason, the concept of memory slices is introduced.

[0021] Customize the fixed size of the memory space corresponding to each slice, divide the transmission block TB into slices and store them, and uniformly record the slice address, node ID, hybrid automatic repeat request HARQ process ID and transmission block TB size to form a dynamic memory allocation table; Memory space is dynamically allocated in slices, and discontinuous allocation is supported to avoid memory fragmentation and improve storage space utilization efficiency.

[0022] After receiving the confirmation character ACK feedback, the sending end releases the slices occupied by the hybrid automatic repeat request HARQ process of the relevant node and leaves it for the next allocation.

[0023] The receiver caches the soft bit information of each hybrid automatic repeat request HARQ process of each node until the signal is correctly demodulated or the maximum number of retransmissions is reached; The receiver stores the soft bit information after rate matching. Since the maximum code block CB (Code block) size used in encoding is fixed, the corresponding coded code block CB size is also fixed, so the code block CB is defined as the memory slice of the receiver. Customize the fixed size of the memory space corresponding to each slice, store the program block CB after segmentation by slice, and record the slice address with the node ID, hybrid automatic repeat request HARQ process ID and the number of program blocks CB in a unified manner to form a dynamic memory allocation table, and add an address chain, such as Figure 1 shown.

[0024] If the demodulated cyclic redundancy check CRC of the transport block TB is correct, the slice slice allocated to the corresponding transport block TB is released.

[0025] When allocating slices, if the span of the transmission block TB is too large and one slice size is difficult to allocate efficiently, multiple slices are introduced to divide the memory into multiple slice areas for mixed allocation.

[0026] The memory is divided into M slice areas for mixed allocation. The M slices are represented from large to small as follows: , ,……, , for the size The process of allocating slices for a transmission block TB includes the following steps: Step S1: Initialization ,set up , ; In the initialization setting, to avoid the corresponding slice size when the slice type M is 0, that is, there is no slice This will have an impact on the subsequent calculation process. Set to 0.

[0027] Step S2: Calculate the number of slices of the i-th type : ; like , then Add to collection middle; like : when When ,make , and Add to collection , go to step S3; when season Increment by 1 and go to step S2; Step S3: According to the set Allocate slices and record the address of each slice.

[0028] An embodiment is introduced by taking a long term evolution LTE transport block TB table as an example.

[0029] Long Term Evolution LTE has a total of 178 types of transport blocks (TB) (limited to a maximum of 64QAM and a maximum of 2 layers and 2 codewords), ranging from 16 bits to 75376 bits, with a dramatic change. Two types of slices are set. , , each transport block TB uses at most 10 slices.

[0030] The distributed networking HARQ information storage device comprises a memory and a processor; the memory is used to store a computer program, and the processor is used to implement the above method steps when executing the computer program.

[0031] The readable storage medium stores a computer program, and when the computer program is executed by a processor, the above method steps are implemented.

[0032] Compared with the prior art, the distributed networking HARQ information storage method slices the memory into multiple slices in the distributed networking HARQ information storage, and the memory is dynamically allocated in slices. A transmission block TB can be allocated with multiple discontinuous slices, and the relevant information is recorded. Once it is confirmed that the transmission block TB is demodulated correctly, the relevant slices can be released. The discontinuous dynamic memory allocation based on slices avoids the generation of memory fragmentation and improves the utilization rate of storage space.

[0033] The embodiment described above is only one specific implementation of the present invention. Common changes and substitutions made by those skilled in the art within the scope of the technical solution of the present invention should be included in the protection scope of the present invention.

Claims

1. A distributed networking HARQ information storage method, characterized in that: By introducing memory slices when storing hybrid automatic repeat request HARQ information, a family of addresses is used to indicate the allocated space to support discontinuous allocation of memory and prevent fragmented memory. The receiver caches the soft bit information of each hybrid automatic repeat request HARQ process of each node until the signal is correctly demodulated or the maximum number of retransmissions is reached; The receiver stores the soft bit information after rate matching. Since the maximum block size CB used for encoding is fixed, the corresponding block size CB after encoding is also fixed, so the block CB is defined as the memory slice of the receiver. Customize the fixed size of the memory space corresponding to each slice, store the program block CB after segmentation by slice, and record the slice address with the node ID, hybrid automatic repeat request HARQ process ID and the number of program blocks CB in a unified manner to form a dynamic memory allocation table, and add an address chain; Dynamically allocate and release memory based on feedback or demodulation information to reduce the storage space required for hybrid automatic repeat request HARQ information and improve utilization.

2. The distributed networking HARQ information storage method according to claim 1, characterized in that: In the distributed networking hybrid automatic repeat request HARQ process, the sender and the receiver cache information separately; Before receiving the confirmation character ACK feedback, the sender caches the transmission block TB of each hybrid automatic repeat request HARQ process of each node; Customize the fixed size of the memory space corresponding to each slice, divide the transmission block TB into slices and store them, and uniformly record the slice address, node ID, hybrid automatic repeat request HARQ process ID and transmission block TB size to form a dynamic memory allocation table; Memory space is dynamically allocated in slices, and discontinuous allocation is supported to avoid memory fragmentation and improve storage space utilization efficiency.

3. The distributed networking HARQ information storage method according to claim 2, characterized in that: After receiving the confirmation character ACK feedback, the sending end releases the slices occupied by the hybrid automatic repeat request HARQ process of the relevant node and leaves it for the next allocation.

4. The distributed networking HARQ information storage method according to claim 1, characterized in that: If the demodulated cyclic redundancy check CRC of the transport block TB is correct, the slice slice allocated to the corresponding transport block TB is released.

5. The distributed networking HARQ information storage method according to claim 2, characterized in that: When allocating slices, if the span of the transmission block TB is too large and it is difficult to allocate one slice size, multiple slices are introduced to divide the memory into multiple slice areas for mixed allocation.

6. The distributed networking HARQ information storage method according to claim 5, characterized in that: The memory is divided into M slice areas for mixed allocation. The M slices are represented from large to small as follows: , ,……, , for the size The process of allocating slices for a transmission block TB includes the following steps: Step S1: Initialization ,set up , ; Step S2: Calculate the number of slices of the i-th type : ； like , then Add to collection middle; like : when When ,make , and Add to collection , go to step S3; when season Increment by 1 and go to step S2; Step S3: According to the set Allocate slices and record the address of each slice.

7. A distributed networking HARQ information storage device, characterized in that: The method comprises a memory and a processor; the memory is used to store a computer program, and the processor is used to implement the method steps described in any one of claims 1 to 6 when executing the computer program.

8. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the method steps described in any one of claims 1 to 6 are implemented.

Images