CN107800516B - Method and device for high-speed downlink packet access (HSDPA) storage management - Google Patents

Method and device for high-speed downlink packet access (HSDPA) storage management Download PDF

Info

Publication number
CN107800516B
CN107800516B CN201610801045.8A CN201610801045A CN107800516B CN 107800516 B CN107800516 B CN 107800516B CN 201610801045 A CN201610801045 A CN 201610801045A CN 107800516 B CN107800516 B CN 107800516B
Authority
CN
China
Prior art keywords
storage
data
block
size
storage area
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
Application number
CN201610801045.8A
Other languages
Chinese (zh)
Other versions
CN107800516A (en
Inventor
徐超祥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sanechips Technology Co Ltd
Original Assignee
Sanechips Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sanechips Technology Co Ltd filed Critical Sanechips Technology Co Ltd
Priority to CN201610801045.8A priority Critical patent/CN107800516B/en
Priority to PCT/CN2017/088264 priority patent/WO2018040668A1/en
Publication of CN107800516A publication Critical patent/CN107800516A/en
Application granted granted Critical
Publication of CN107800516B publication Critical patent/CN107800516B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • 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
    • 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/1806—Go-back-N protocols
    • 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/1835—Buffer management

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention discloses a method for HSDPA storage management, which comprises the following steps: obtaining HARQ data continuously for multiple times, and storing the HARQ data obtained each time according to a preset storage management strategy; determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in a corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data. The embodiment of the invention also discloses a device for HSDPA storage management.

Description

Method and device for high-speed downlink packet access (HSDPA) storage management
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a method and an apparatus for High Speed Downlink Packet Access (HSDPA) storage management.
Background
HSDPA is an enhancement proposed by the third Generation Partnership Project (3 GPP) Release5 that is applicable to both Wideband Code Division Multiple Access (WCDMA) and Time Division Duplex (TD) systems. The main goal of HSDPA is to support high speed packet data services while guaranteeing lower time delays, higher system throughput and stronger Quality of Service (QoS) guarantees.
In TD and WCDMA systems, HSDPA service has the characteristics of strong real-time performance and large data volume; wherein, the TD system receives a packet of HSDPA data every Transmission Time Interval (TTI), where the TTI may be 5ms or the like; in WCDMA system, the system receives one HSDPA data packet every TTI (2ms), which may be 2 ms. If the downlink quality is too poor, the amount of data accumulated in real time may be large.
At present, there is no clear description on how to perform storage management on HSDPA in the existing communication protocol, and if storage resources are completely divided for HSDPA services according to a theoretical maximum, it is undoubtedly a great waste of the storage resources. Therefore, an HSDPA storage management method meeting the HSDPA service requirement needs to be studied according to the actual HSDPA service data volume to solve the current situation of storage resource waste.
Disclosure of Invention
In order to solve the foregoing technical problems, embodiments of the present invention are expected to provide a method and an apparatus for HSDPA storage management, which reduce waste of storage resources and improve utilization efficiency of the storage resources.
The technical scheme of the invention is realized as follows:
the embodiment of the invention provides a method for HSDPA storage management, which comprises the following steps:
acquiring hybrid automatic repeat request (HARQ) data continuously and repeatedly, and storing the HARQ data acquired each time according to a preset storage management strategy;
determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in a corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data.
In the above solution, the storage management policy is: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
In the above scheme, the method further comprises: n storage areas with different levels are divided in advance, wherein n is larger than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the sizes of the storage blocks of any two storage areas with different levels are different;
the storing each queue data in a corresponding storage area includes: and selecting one storage block with the smallest difference between the size of the storage block and the size of the corresponding queue data from the divided storage blocks of the storage areas, and storing the corresponding queue data in the selected storage block.
In the above scheme, the method further comprises: each grade of storage area corresponds to one grade of RLC PDU; and determining the number of storage blocks of the storage area corresponding to the grade according to the size of the RLC PDU of each grade.
In the above scheme, the storage area of each level corresponds to an RLC PDU of one level;
accordingly, the method further comprises: determining the size of a memory block of a memory area of each level;
the determining the size of the memory block of the memory region of each level comprises: judging Nmax RLCsize and SMAC headerWhether the sum of the number of the RLC PDUs and the transmission rate of the HSPDA is less than Tbsize (max), wherein Nmax represents the maximum number of the RLC PDUs of the corresponding grade which can be carried by one queue data, RLCsize represents the size of the RLC PDUs of the corresponding grade, and Tbsize (max) represents the size of the HSPDA maximum transmission block; sMAC headerIndicating the size of a MAC head pointer in queue data;
the Nmax RLCsize and SMAC headerWhen the sum is less than Tbsize (max), determining the size of the memory block of the memory region corresponding to the rank as Nmax RLCsize; the Nmax RLCsize and SMAC headerWhen the sum is equal to or larger than Tbsize (max), the size of the memory block of the memory area corresponding to the rank is determined as Tbsize (max) -SMAC header。
In the foregoing solution, after acquiring HARQ data each time, the method further includes: applying for and storing one storage block for each acquired HARQ data;
the number of the storage blocks of each acquired HARQ data application is determined according to the actual data processing capacity of the UE, and the size of the storage block of each acquired HARQ data application is equal to the size of the HSPDA maximum transmission block.
The embodiment of the invention also provides a device for HSDPA storage management, which comprises: the system comprises an acquisition module, a first storage management module and a second storage management module;
the device comprises an acquisition module, a transmission module and a receiving module, wherein the acquisition module is used for continuously acquiring hybrid automatic repeat request (HARQ) data for multiple times;
the first storage management module is used for storing the HARQ data acquired each time according to a preset storage management strategy;
and the second storage management module is used for determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in the corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data.
In the above solution, the storage management policy is: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
In the above scheme, the second storage management module is specifically configured to pre-partition n storage areas with different levels, where n is greater than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the sizes of the storage blocks of any two storage areas with different levels are different;
the second storage management module is further configured to select, from the storage blocks of each of the divided storage areas, one storage block whose size has the smallest difference from the size of the corresponding queue data, and store the corresponding queue data in the selected storage block.
In the above scheme, the storage area of each level corresponds to an RLC PDU of one level; the second storage management module is further configured to determine, according to the size of the RLC PDU of each level, the number of storage blocks in the storage area corresponding to the level.
In the above scheme, the storage area of each level corresponds to an RLC PDU of one level;
correspondingly, the second storage management module is further configured to determine the size of a storage block of the storage area of each rank;
the second storage management module is further used for judging Nmax RLCsize and SMAC headerWhether the sum of the number of the RLC PDUs and the transmission rate of the HSPDA is less than Tbsize (max), wherein Nmax represents the maximum number of the RLC PDUs of the corresponding grade which can be carried by one queue data, RLCsize represents the size of the RLC PDUs of the corresponding grade, and Tbsize (max) represents the size of the HSPDA maximum transmission block; sMAC headerIndicating the size of a MAC head pointer in queue data;
the second storage management module is further configured to determine whether the Nmax RLCsize and S are the sameMAC headerWhen the sum is less than Tbsize (max), theThe size of the memory block of the memory region corresponding to the rank is determined to Nmax RLCsize; the Nmax RLCsize and SMAC headerWhen the sum is equal to or larger than Tbsize (max), the size of the memory block of the memory area corresponding to the rank is determined as Tbsize (max) -SMAC header。
In the above scheme, the first storage management module is specifically configured to apply for and store one storage block for each acquired HARQ data;
the number of the storage blocks of each acquired HARQ data application is determined according to the actual data processing capacity of the UE, and the size of the storage block of each acquired HARQ data application is equal to the size of the HSPDA maximum transmission block.
In the method and apparatus for HSDPA storage management according to an embodiment of the present invention, HARQ data is continuously obtained a plurality of times, and the HARQ data obtained each time is stored according to a preset storage management policy; determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in a corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data. Compared with the prior art, the method effectively realizes the storage management of the HSDPA service data, reduces the waste of storage resources and improves the use efficiency of the storage resources.
Drawings
Fig. 1 is a HSDPA data flow diagram according to an embodiment of the present invention;
fig. 2 is a HSDPA memory management diagram according to an embodiment of the present invention;
fig. 3 is a flowchart of a HSDPA memory management method according to a first embodiment of the present invention;
FIG. 4 is a flowchart illustrating evaluation of the number of storage blocks of a Type storage area according to an embodiment of the present invention;
FIG. 5 is a flowchart illustrating an evaluation of a size of a storage block of a Type storage area according to an embodiment of the present invention;
fig. 6 is a flow chart of a HSDPA memory management method according to a second embodiment of the present invention;
fig. 7 is a schematic diagram illustrating a structure of an apparatus for HSDPA storage management according to an embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
Fig. 1 is a HSDPA data flow diagram according to an embodiment of the present invention, and as shown in fig. 1, the HSDPA data flow is as follows:
first, Hybrid Automatic Repeat request (HARQ) data is obtained. After the physical layer successfully analyzes the High-Speed Downlink Shared Channel (HS-DSCH), a storage block is applied for the HARQ data, and the medium Access Control layer (MAC layer) releases the HARQ storage block after the HARQ data is analyzed.
Next, queue data in the HARQ data is sequentially stored in Que (0) to Que (n) corresponding to the MAC layer. Que (0) to Que (n) buffer the rearranged data of queue 0 to queue n, respectively.
Finally, the buffered queue data of Que (0) to Que (n) in the MAC layer are respectively transferred to RBs (Idx0) to RB (Idxn) corresponding to the RLC layer. RB (Idx0) to RB (Idxn) respectively denote RB with index 0 to RB with index n, and the window of these RBs buffers Radio Link Control Protocol Data Unit (RLC PDU) information.
Fig. 2 is a HSDPA memory management diagram according to an embodiment of the present invention, and as shown in fig. 2, the HSDPA memory management may include: management of HARQ storage areas and Type storage areas, wherein the management of the two types of data can be managed in an idle linked list mode, and when data needs to apply for a storage block, the data can directly obtain one storage block from the head of the idle linked list; and after the data is released, storing the storage block at the tail part of the idle linked list.
Based on the above-described HSDPA data flow and HSDPA memory management, the following embodiments are proposed.
First embodiment
Fig. 3 is a flowchart of a HSDPA memory management method according to a first embodiment of the present invention, and as shown in fig. 3, the method includes:
step 100: and continuously acquiring the HARQ data for multiple times, and storing the HARQ data acquired each time according to a preset storage management strategy.
The storage management policy is as follows: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
That is, a storage block is applied for the data to be stored, and the storage block of the data is used for storing the next data to be stored after the data is released.
After each acquisition of HARQ data, the method further comprises: applying for and storing one storage block for each acquired HARQ data, wherein the number of the storage blocks applied for each acquired HARQ data is determined according to the actual data processing capacity of the UE, and the size of the storage block applied for each acquired HARQ data is equal to the size of the HSPDA maximum transmission block. The size of the HSPDA maximum transmission block is determined by the actual channel quality or the downlink packet service supported by the UE acquiring the HARQ data.
It can be understood that, each time the UE receives HARQ data sent by one base station, and after the physical layer successfully analyzes the HARQ data, applies for a block of storage and delivers the block of storage to the MAC layer, and the MAC layer releases the block of storage after analyzing the block of storage.
As can be seen from fig. 2, the HARQ0 storage block to the HARQ memory block in the HARQ storage area are used to store continuously acquired HARQ data, after the physical layer successfully analyzes the HARQ data, an HARQ qi storage block is applied from the HARQ0 storage block to the HARQ memory block, and the HARQ qi storage block is delivered to the MAC layer for processing, where i has a value range from 0 to m, and the number of storage blocks in the HARQ storage area may be 2.
Step 101: determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in a corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data.
In a specific embodiment of the present invention, the step may include:
firstly, n storage areas with different levels are divided in advance, wherein n is larger than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the memory blocks of any two different levels of memory regions are of different sizes.
As can be seen from the Type memory area management in the HSDPA memory management diagram of fig. 2, types 0 to Typen indicate pre-divided memory areas of different classes, each of which corresponds to one class RLC PDU, where RLCsize indicates the size of the RLC PDU of the corresponding class, and the size of each class RLC PDU is different.
Taking WCDMA as an example, in an actual network, the RLCsize includes 144bits, 336bits, 4800bits, etc., the storage area can be divided into three levels of Type0, Type1, and Type2, and the storage areas of different levels of Type0, Type1, and Type2 correspond to the RLCsize being 144bits, 336bits, 4800bits, respectively. The network configuration of different storage areas is different, and the level of the rlc pdu can be adjusted appropriately.
Here, the Type0 storage area includes Type0 to store blocks 0 through 0 to store blocks i, the Type1 storage area includes Type1 to store blocks 0 through 1 to store blocks j, and so on, and the Type storage area includes Type storage blocks 0 through Type storage blocks k.
Here, the storage area of each rank corresponds to RLC PDU of one rank; and determining the number of storage blocks of the storage area corresponding to the grade according to the size of the RLC PDU of each grade.
As shown in fig. 4, the method for determining the number of Type storage area storage blocks may include the steps of:
step 1011 a: and evaluating the maximum range of the number of the storage blocks.
Illustratively, when one HARQ data includes one RLC PDU data, and the maximum HSDPA queue window is 128, one HSDPA queue window may include a maximum of 128 RLC PDUs, and a minimum of 1 RLC PDU. The maximum window number of RBs is 4096, one maximum HSDPA queue window data is not enough to fill the whole window of RBs, and when one HSDPA queue window only contains 1 RLC PDU, one RB window contains 4096 HSDPA queue windows at most. Since one HSDPA queue window requires one memory block, one RB window contains 4096 memory blocks at most, and therefore the number of memory blocks per memory area is not more than 4096.
Step 1011 b: a single Type storage area is evaluated to store the number of blocks.
Illustratively, the RLCsize corresponding to the Type0 storage area is 144bits, the RLC PDU with the RLCsize is generally used for signaling transmission, the rate is not high, and the RB window is generally configured within 128, so the number of storage blocks of the Type0 storage area can be set to 128; the RLCsize of the storage area of the Type1 corresponding to the level is 336bits, and the RB window is generally configured at 2048, so that the number of storage blocks of the storage area of the Type1 can be set to 2048; the RLCsize corresponding to the Type2 storage area is 4800bits, and the RB window is generally configured at 2048, so the number of storage blocks in the Type2 storage area can be set to 2048. Due to the difference of actual networks, the number of the storage blocks in different levels can be dynamically adjusted according to the actual networks.
The method further comprises the following steps: determining the size of the storage block in the storage area of each level, as shown in fig. 5, the method for determining the size of the storage block in the Type storage area may include the steps of:
step 1012 a: RLCsize is obtained for a level corresponding to a storage area.
Here, RLCsize denotes the size of RLC PDU of the corresponding rank.
Step 1012 b: and acquiring the maximum number Nmax of RLC PDUs of the corresponding grade which can be carried by one queue data in one HARQ data.
Here, Nmax indicates the maximum number of RLC PDUs of the corresponding class that can be carried by one queue data. In practical application, when the UE supports enhanced high speed downlink packet access HSDPA +, Nmax takes a value of 44; when the UE supports only HSDPA, Nmax takes a value of 70.
Step 1012 c: judgment (Nmax. RLCsize + S)MAC header) If it is smaller than the size of Tbsize (max), if so, go to step 1012 d; if not, step 1012e is performed.
Specifically, SMAC headerFor the size of the MAC head pointer in a queue data, Tbsize (max) is according to the preset column in the downlink packet service supported by UEThe size of the largest transport block in the table. Taking WCDMA as an example, when the UE supports HSDPA +, Tbsize (max) is 42192 bits; when the UE supports only HSDPA, Tbsize (max) is 27952 bits.
Step 1012 d: the memory block size is (Nmax RLCsize).
Step 1012 e: the memory block size is Tbsize (max) -SMAC header。
In the embodiment of the invention, the evaluation mode of the size and the number of the storage blocks in the storage area of each grade is determined according to the configuration of the RLCsize of the corresponding grade, the size of the HSDPA queue window and the size of the RB window. The evaluation method of the size and number of memory blocks in the memory area of each rank may also be evaluated in other manners, for example, determined according to an HSDPA table size table (a table of transport block sizes in an HSDPA protocol), the HSDPA TB size table is divided into a plurality of ranks, the memory block size is an HSDPA table size of different ranks, and the number of memory blocks may be an average value of three RB windows.
And secondly, selecting a storage block with the smallest difference between the size of the storage block and the size of the corresponding queue data from the divided storage blocks of the storage areas, and storing the corresponding queue data in the selected storage block.
It will be appreciated that, among the memory blocks larger than the size of the queue data, a memory block having a size that differs the least from the size of the queue data is selected. Illustratively, the sizes of the storage blocks in the storage areas of Type0, Type1 and Type2 are 1450bits, 3370bits and 4810bits respectively. The size of one queue data in the HARQ data is 1500bits, therefore, a storage block is selected from the Type1 storage area and the Type2 storage area, the size of the storage block in the Type1 storage area is closest to the size of the queue data, the storage area of the queue data in the HARQ data is determined to be Type1, and the storage block is applied for the queue data in the Type1 storage area and stored.
In the storage management method provided by the embodiment of the invention, HARQ data is continuously acquired for multiple times, and the HARQ data acquired each time is stored according to a preset storage management strategy; determining a storage area of each queue data of the HARQ data acquired each time, and storing each queue data in a corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data. Compared with the prior art, the method effectively realizes the storage management of the HSDPA service data, reduces the waste of storage resources and improves the use efficiency of the storage resources.
Second embodiment
To further illustrate the object of the present invention, the first embodiment of the present invention is further illustrated.
Fig. 6 is a flowchart of a HSDPA memory management method according to a second embodiment of the present invention, and as shown in fig. 6, the flowchart includes:
step 200: and judging whether the physical layer receives the HARQ data. If not, go to step 201; if so, go to step 202.
Step 201: the storage management process ends.
Step 202: and applying for a storage block for the HARQ data and storing the HARQ data.
In the embodiment of the invention, according to the management of the HARQ storage area, a storage block is applied for the HARQ data, and the HARQ data is stored in the HARQ storage area. The number of the storage blocks in the HARQ storage area is determined according to the actual data processing capacity of the UE; the memory block size needs to be planned according to the maximum HSDPA TB size, which takes 42192bits for WCDMA as an example.
Step 203: and analyzing the HARQ data.
It can be understood that the HARQ data is divided into a plurality of queue data, each queue data is parsed, and a storage block is applied for the parsed queue data.
Step 204: and judging whether the HARQ data contains the unresolved queue data. If yes, go to step 206; if not, step 205 is performed.
It can be understood that one HARQ data includes at least one queue data, and before the HARQ data is delivered to the RLC layer, each queue data in the HARQ data needs to be parsed, and a Type storage block is newly applied for each parsed queue data through Type storage management and stored.
Step 205: and releasing the HARQ storage block and returning to the step 200.
It can be understood that, after all the queue data in the HARQ data are analyzed, the storage block storing the HARQ data can be released to store the next HARQ data to be stored.
In the embodiment of the invention, when the number of the storage blocks in the HARQ storage area is 2, in a transmission time interval TTI0(2ms), if the physical layer analysis is successful, the HARQ0 storage block is applied, and the HARQ0 storage block is delivered to the MAC layer for processing, and in a transmission time interval TTI1(2ms), if the physical layer analysis is successful, the HARQ1 storage block is applied, and the HARQ1 storage block is delivered to the MAC layer for processing. Before the end of TTI1, the MAC layer needs to finish parsing the HARQ0 memory block and release the HARQ0 memory block, so that the physical layer can continue to utilize the HARQ0 memory block when the TTI2(2ms) comes.
Step 206: and applying for a storage block for the queue data and storing.
In the embodiment of the invention, a Type storage area is selected first for applying for a storage block for one queue data in the HARQ data, and a Type storage area closest to the size of the storage block in the Type storage area can be selected according to the size of the queue data. And applying for a storage block for the queue data in a Type storage area corresponding to the queue data according to the Type storage area management.
Illustratively, the sizes of the storage blocks in the storage areas of Type0, Type1 and Type2 are 1450bits, 3370bits and 4810bits respectively. The size of one queue data in the HARQ data is 1200bits, and the size of the queue data is compared with the sizes of the storage blocks in the Type0, Type1 and Type2 storage areas, so that the size of the storage block in the Type0 storage area is closest to the size of the queue data, and the storage area of the queue data in the HARQ data is determined to be a Type0 storage area; and applying for a storage block for the queue data in the Type0 storage area through Type storage area management and storing the storage block.
Step 207: and grouping the RLC PDUs and delivering the RLC layer.
And rearranging the queue data to form RLC PDU and delivering the RLC PDU to an RLC layer.
Step 208: and completing Radio Link Control service data Unit (RLC SDU) of an RLC layer group and releasing the storage block in the Type storage area.
And when the RLC PDUs are assembled into the RLC SDUs, the storage blocks are released through Type storage area management.
Third embodiment
Aiming at the method of the embodiment of the invention, the embodiment of the invention also provides a device for HSDPA storage management. The device comprises: an acquisition module 300, a first storage management module 301 and a second storage management module 302; wherein the content of the first and second substances,
an obtaining module 300, configured to obtain HARQ data multiple times in succession.
The first storage management module 301 is configured to obtain HARQ data for multiple times continuously, and store the HARQ data obtained each time according to a preset storage management policy.
The second storage management module 302 is configured to determine a storage area of each queue data of the HARQ data acquired each time, and store each queue data in a corresponding storage area according to the storage management policy, where the storage area of each queue data is determined by a size of the corresponding queue data.
The storage management policy is as follows: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
Further, the first storage management module 301 is specifically configured to apply for and store one storage block for each acquired HARQ data; the number of the storage blocks of each acquired HARQ data application is determined according to the actual data processing capacity of the UE, and the size of the storage block of each acquired HARQ data application is equal to the size of the HSPDA maximum transmission block.
A second storage management module 302, configured to pre-partition n storage regions with different levels, where n is greater than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the memory blocks of any two different levels of memory regions are of different sizes.
The second storage management module 302, configured to store the each queue data in a corresponding storage area, includes: and selecting one storage block with the smallest difference between the size of the storage block and the size of the corresponding queue data from the divided storage blocks of the storage areas, and storing the corresponding queue data in the selected storage block.
The second storage management module 302 is further configured to determine, according to the size of the RLC PDU of each class, the number of storage blocks in the storage area corresponding to the class. Each rank of memory region corresponds to one rank of RLC PDUs.
The second storage management module 302 is further configured to determine the size of the storage block of the storage area of each rank.
The second storage management module 302 is further configured to determine Nmax RLCsize and SMAC headerWhether the sum of the number of the RLC PDUs and the transmission rate of the HSPDA is less than Tbsize (max), wherein Nmax represents the maximum number of the RLC PDUs of the corresponding grade which can be carried by one queue data, RLCsize represents the size of the RLC PDUs of the corresponding grade, and Tbsize (max) represents the size of the HSPDA maximum transmission block; sMAC headerIndicating the size of the MAC header pointer in a queue of data.
The second storage management module 302 is further configured to determine the storage capacity of the storage system based on the Nmax RLCsize and SMAC headerWhen the sum is less than Tbsize (max), determining the size of the memory block of the memory region corresponding to the rank as Nmax RLCsize; the Nmax RLCsize and SMAC headerWhen the sum is equal to or larger than Tbsize (max), the size of the memory block of the memory area corresponding to the rank is determined as Tbsize (max) -SMAC header。
In practical applications, the obtaining module 300, the first storage management module 301 and the second storage management module 302 may be implemented by a Central Processing Unit (CPU), a MicroProcessor Unit (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like in a terminal device.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.

Claims (12)

1. A method for High Speed Downlink Packet Access (HSDPA) storage management, the method comprising:
acquiring hybrid automatic repeat request (HARQ) data for multiple times continuously, and applying for and storing a storage block for the HARQ data acquired each time according to a preset storage management strategy, wherein applying for and storing a storage block for the HARQ data acquired each time according to the preset storage management strategy comprises: after the physical layer analysis of the HARQ data acquired each time is successful, applying for a storage block for the successfully analyzed HARQ data and delivering the storage block to a Media Access Control (MAC) layer;
analyzing each queue data in the HARQ data acquired each time on an MAC layer, applying a storage area for each analyzed queue data, storing each queue data in the corresponding storage area according to the storage management strategy, wherein the storage area of each queue data is determined by the size of the corresponding queue data, and if the MAC layer completes the analysis of one HARQ data, releasing a storage block which is applied to a physical layer and stores the HARQ data;
when each queue data analyzed by the MAC layer is stored in a corresponding storage area, the storage areas of different grades are divided in advance, and each grade of storage area corresponds to one grade of RLC PDU;
and after the RLC PDU is assembled into an RLC service data unit SDU on the RLC layer, a storage area which applies for and stores the data of each queue on the MAC layer is released.
2. The method of claim 1, wherein the storage management policy is: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
3. The method of claim 1, further comprising: n storage areas with different levels are divided in advance, wherein n is larger than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the sizes of the storage blocks of any two storage areas with different levels are different;
the storing each queue data in a corresponding storage area includes: and selecting one storage block with the smallest difference between the size of the storage block and the size of the corresponding queue data from the divided storage blocks of the storage areas, and storing the corresponding queue data in the selected storage block.
4. The method of claim 3, further comprising: and determining the number of storage blocks of the storage area corresponding to each grade according to the size of the RLC PDU of each grade.
5. The method of claim 3, wherein each level of the storage area corresponds to one level of the rlc pdus;
accordingly, the method further comprises: determining the size of a memory block of a memory area of each level;
the determining the size of the memory block of the memory region of each level comprises: judging Nmax RLCsize and SMAC headerWhether the sum of the number of the RLC PDUs and the transmission rate of the HSPDA is less than Tbsize (max), wherein Nmax represents the maximum number of the RLC PDUs of the corresponding grade which can be carried by one queue data, RLCsize represents the size of the RLC PDUs of the corresponding grade, and Tbsize (max) represents the size of the HSPDA maximum transmission block; sMAC headerIndicating the size of a MAC head pointer in queue data;
the Nmax RLCsize and SMAC headerWhen the sum is less than Tbsize (max), determining the size of the storage block of the storage area corresponding to the rank as Nmax RLCsize; the Nmax RLCsize and SMAC headerWhen the sum is equal to or greater than Tbsize (max), the corresponding is carried outThe size of the memory block of the memory region of the rank is determined to be Tbsize (max) -SMAC header。
6. The method of claim 1, wherein after each time HARQ data is acquired, the method further comprises: applying for and storing one storage block for each acquired HARQ data;
the number of the storage blocks of the HARQ data application acquired each time is determined according to the actual data processing capacity of the user equipment UE, and the size of the storage block of the HARQ data application acquired each time is equal to the size of the HSPDA maximum transmission block.
7. An apparatus for High Speed Downlink Packet Access (HSDPA) storage management, the apparatus comprising: the system comprises an acquisition module, a first storage management module and a second storage management module; wherein the content of the first and second substances,
the device comprises an acquisition module, a transmission module and a receiving module, wherein the acquisition module is used for continuously acquiring hybrid automatic repeat request (HARQ) data for multiple times;
a first storage management module, configured to apply for and store one storage block for HARQ data acquired each time according to a preset storage management policy, where the first storage management module is specifically configured to: after the physical layer analysis of the HARQ data acquired each time is successful, applying for a storage block for the successfully analyzed HARQ data and delivering the storage block to a Media Access Control (MAC) layer;
the second storage management module is used for analyzing each queue data in the HARQ data acquired each time on the MAC layer, applying a storage area for each analyzed queue data, storing each queue data in the corresponding storage area according to the storage management strategy, determining the size of each queue data in the storage area, and releasing a storage block which is applied to the physical layer and stores the HARQ data if the MAC layer completes the analysis of one HARQ data;
the apparatus is further configured to: when each queue data analyzed by the MAC layer is stored in a corresponding storage area, the storage areas of different grades are divided in advance, and each grade of storage area corresponds to one grade of RLC PDU; and forming a Radio Link Control (RLC) Protocol Data Unit (PDU) after data rearrangement is carried out on each queue analyzed by the MAC layer, delivering the PDU to the RLC layer, assembling the RLC PDUs into RLC Service Data Units (SDUs) on the RLC layer, and releasing a storage area which applies for and stores data of each queue on the MAC layer.
8. The apparatus of claim 7, wherein the storage management policy is: applying for a storage block for data needing to be stored, wherein the storage block of the data is used for being recycled after the data is released, and the recycled storage block is recycled.
9. The apparatus according to claim 7, wherein the second storage management module is specifically configured to pre-partition n storage areas with different levels, where n is greater than 1; wherein each level of the storage area comprises at least one storage block; when the number of the storage blocks of the storage area of any level is more than 1, the sizes of the storage blocks of the storage areas of the corresponding levels are the same; the sizes of the storage blocks of any two storage areas with different levels are different;
the second storage management module is further configured to select, from the storage blocks of each of the divided storage areas, one storage block whose size has the smallest difference from the size of the corresponding queue data, and store the corresponding queue data in the selected storage block.
10. The apparatus of claim 9, wherein the second storage management module is further configured to determine the number of storage blocks of the storage area corresponding to each rank according to the size of the RLC PDU of each rank.
11. The apparatus of claim 9, wherein each level of the storage area corresponds to one level of rlc pdus;
correspondingly, the second storage management module is further configured to determine the size of a storage block of the storage area of each rank;
the above-mentionedThe second storage management module is also used for judging Nmax RLCsize and SMAC headerWhether the sum of the number of the RLC PDUs and the transmission rate of the HSPDA is less than Tbsize (max), wherein Nmax represents the maximum number of the RLC PDUs of the corresponding grade which can be carried by one queue data, RLCsize represents the size of the RLC PDUs of the corresponding grade, and Tbsize (max) represents the size of the HSPDA maximum transmission block; sMAC headerIndicating the size of a MAC head pointer in queue data;
the second storage management module is further configured to determine whether the Nmax RLCsize and S are the sameMAC headerWhen the sum is less than Tbsize (max), determining the size of the storage block of the storage area corresponding to the rank as Nmax RLCsize; the Nmax RLCsize and SMAC headerWhen the sum is equal to or larger than Tbsize (max), the size of the memory block of the memory area corresponding to the rank is determined as Tbsize (max) -SMAC header。
12. The apparatus according to claim 7, wherein the first storage management module is specifically configured to apply for and store one storage block for each obtained HARQ data;
the number of the storage blocks of the HARQ data application acquired each time is determined according to the actual data processing capacity of the user equipment UE, and the size of the storage block of the HARQ data application acquired each time is equal to the size of the HSPDA maximum transmission block.
CN201610801045.8A 2016-09-01 2016-09-01 Method and device for high-speed downlink packet access (HSDPA) storage management Active CN107800516B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201610801045.8A CN107800516B (en) 2016-09-01 2016-09-01 Method and device for high-speed downlink packet access (HSDPA) storage management
PCT/CN2017/088264 WO2018040668A1 (en) 2016-09-01 2017-06-14 Method, apparatus and device for hsdpa storage management, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610801045.8A CN107800516B (en) 2016-09-01 2016-09-01 Method and device for high-speed downlink packet access (HSDPA) storage management

Publications (2)

Publication Number Publication Date
CN107800516A CN107800516A (en) 2018-03-13
CN107800516B true CN107800516B (en) 2020-09-25

Family

ID=61299969

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610801045.8A Active CN107800516B (en) 2016-09-01 2016-09-01 Method and device for high-speed downlink packet access (HSDPA) storage management

Country Status (2)

Country Link
CN (1) CN107800516B (en)
WO (1) WO2018040668A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110808815B (en) * 2019-10-30 2021-10-22 紫光展锐(重庆)科技有限公司 Data storage method and device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102479159A (en) * 2010-11-25 2012-05-30 大唐移动通信设备有限公司 Caching method and equipment of multi-process HARQ (Hybrid Automatic Repeat Request) data

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101034961B (en) * 2007-04-11 2010-05-26 重庆重邮信科通信技术有限公司 Management method and device of IR buffer in the multi-process HARQ technology
US9160496B2 (en) * 2007-06-29 2015-10-13 Qualcomm Incorporated Methods and apparatus for H-ARQ process memory management
CN101799788B (en) * 2010-03-23 2014-06-11 中兴通讯股份有限公司 Level-to-level administration method and system of storage resources
US9565140B2 (en) * 2013-10-11 2017-02-07 Mediatek, Inc. HARQ memory space management for LTE carrier aggregation
US20160050049A1 (en) * 2014-08-12 2016-02-18 Qualcomm Incorporated Managing hybrid automatic repeat request (harq) soft buffer in td-hsdpa for dual sim dual standby (dsds) device

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102479159A (en) * 2010-11-25 2012-05-30 大唐移动通信设备有限公司 Caching method and equipment of multi-process HARQ (Hybrid Automatic Repeat Request) data

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"DRAFT Introduction of 8C-HSDPA";Ericsson, ST-Ericsson;《3GPP TSG-RAN WG1 Meeting #66》;20110826;全文 *
"Introduction of Multiflow";Nokia Siemens Networks;《3GPP TSG-RAN WG1 Meeting #68bis》;20120330;全文 *

Also Published As

Publication number Publication date
WO2018040668A1 (en) 2018-03-08
CN107800516A (en) 2018-03-13

Similar Documents

Publication Publication Date Title
CN101238659B (en) For accessing the slow MAC-E of the autonomy transmission in (HSUPA) together with the High Speed Uplink Packet of service specific transmission time controling
EP1706969B1 (en) System for processing data unit of radio protocol layer
EP2218294B1 (en) Buffer status reporting based on radio bearer configuration
CN101288247B (en) Method and apparatus for transmitting/receiving control information of user equipment for uplink data transmission
KR100929314B1 (en) Transmission control method, mobile station and network node
EP3537827A1 (en) Method and system for sending and receiving data
CN102300259B (en) Data block concatenation and splitting processing method, device and system
US20130343287A1 (en) Method and apparatus for efficient operation of an enhanced dedicated channel
US20060088058A1 (en) Data link layer protocol unit, mobile radio devices, mobile radio network control unit and method for reading data from a plurality of data link layer protocol buffer storages
CN107005560B (en) Data sending method, data receiving method and related equipment
JP2011511565A (en) Method and apparatus for prioritizing logical channels
CN103428883B (en) A kind of dispatching method of physical downlink control channel resource and equipment
WO2012002890A1 (en) Prioritization of data packets
CN102017547B (en) System and method for data size adaptation in a user equipment
CN110100494B (en) Data transmission method and equipment
US20180192427A1 (en) Dynamic delay scheduling method and base station for voice data
CN105471763A (en) Control message transmission method and device
US8605592B2 (en) Method and arrangement in a communication system
CN105792359B (en) Resource allocation methods, data mapping method and device
WO2022048773A1 (en) Method and apparatus to synchronize radio bearers
EP2373081A1 (en) User equipment, method for determining resource, method for reporting resource and system for distributing resource
CN104661315B (en) Method for reporting buffer status report and user equipment
CN109714824B (en) Semi-persistent scheduling resource allocation method and base station
CN107800516B (en) Method and device for high-speed downlink packet access (HSDPA) storage management
CN104427630B (en) A kind of grouping scheduling method and device

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
GR01 Patent grant
GR01 Patent grant