US20200133853A1 - Method and system for dynamic memory management in a user equipment (ue) - Google Patents
Method and system for dynamic memory management in a user equipment (ue) Download PDFInfo
- Publication number
- US20200133853A1 US20200133853A1 US16/665,607 US201916665607A US2020133853A1 US 20200133853 A1 US20200133853 A1 US 20200133853A1 US 201916665607 A US201916665607 A US 201916665607A US 2020133853 A1 US2020133853 A1 US 2020133853A1
- Authority
- US
- United States
- Prior art keywords
- data packet
- empty
- bin
- size
- tbs
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0646—Configuration or reconfiguration
-
- 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/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
-
- 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
- H04L1/1845—Combining techniques, e.g. code combining
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1041—Resource optimization
- G06F2212/1044—Space efficiency improvement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/16—General purpose computing application
- G06F2212/161—Portable computer, e.g. notebook
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
Definitions
- the present disclosure generally relates to field of telecommunication network. Particularly, but not exclusively, the present disclosure relates to method and system for dynamic memory management in a user equipment (UE).
- UE user equipment
- the 5G or pre-5G communication system is also called a “beyond 4G network” or a “post LTE (long term evolution) system”.
- the 5G communication system is considered to be implemented in higher frequency (mmWave) bands, e.g., 60 GHz bands, so as to accomplish higher data rates.
- mmWave millimeter wave
- FD-MIMO full dimensional MIMO
- array antenna an analog beam forming, large scale antenna techniques are discussed in 5G communication systems.
- RANs cloud radio access networks
- D2D device-to-device
- SWSC sliding window superposition coding
- ACM advanced coding modulation
- FBMC filter bank multi carrier
- NOMA non-orthogonal multiple access
- SCMA sparse code multiple access
- the Internet is now evolving to the Internet of things (IoT) where distributed entities, such as things, exchange and process information without human intervention.
- IoE Internet of everything
- technology elements such as “sensing technology”, “wired/wireless communication and network infrastructure”, “service interface technology”, and “Security technology” have been demanded for IoT implementation, a sensor network, a machine-to-machine (M2M) communication, machine type communication (MTC), and so forth are being researched.
- M2M machine-to-machine
- MTC machine type communication
- Such an IoT environment may provide intelligent Internet technology services that create a new value to human life by collecting and analyzing data generated among connected things.
- IoT may be applied to a variety of fields including smart home, smart building, smart city, smart car or connected cars, smart grid, health care, smart appliances and advanced medical services through convergence and combination between existing information technology (IT) and various industrial applications.
- 5G communication systems to IoT networks.
- technologies such as a sensor network, MTC, and M2M communication may be implemented by beamforming, MIMO, and array antennas.
- Application of a cloud RAN as the above-described big data processing technology may also be considered to be as an example of convergence between the 5G technology and IoT technology.
- a method for dynamic memory management in a UE includes receiving, by a UE, transport block size (TBS) information, from a base station (BS), associated with a data packet to be transmitted by the BS to the UE, identifying, by the UE, a plurality of empty bins and a size of each of the plurality of empty bins in a memory of the UE, detecting, by the UE, a presence of one or more empty bins, among the plurality of empty bins in the memory, with a size of each of the one or more empty bins greater than the TBS of the data packet, and allocating, by the UE, a smallest size empty bin, with a size greater than the TBS of the data packet, among the one or more empty bins to the data packet.
- TBS transport block size
- a UE for dynamic memory management includes a processor and a memory communicatively coupled to the processor, wherein the memory is configured to store processor-executable instructions, which, upon execution, cause the processor to receive TBS information, from a BS, associated with a data packet to be transmitted by the BS to the UE, identify a plurality of empty bins and a size of each of the plurality of empty bins in the memory of the UE, detect a presence of one or more empty bins, among the plurality of empty bins in the memory, with a size of each of the one or more empty bins greater than the TBS of the data packet, and allocate a smallest size empty bin among the one or more empty bins to the data packet.
- FIG. 1A illustrates an architecture of a system for dynamic memory management in a user equipment (UE) in accordance with an embodiment
- FIGS. 1B-1D illustrate a process for dynamic allocation of data packets in a hybrid automatic repeat request (HARQ) memory in accordance with an embodiment
- FIG. 2A illustrates a block diagram of a UE for dynamic memory management in accordance with an embodiment
- FIGS. 2B-2C illustrate sequence flow diagrams of a process of communication between the UE and base stations BS 1 and BS 2 in accordance with an embodiment
- FIG. 3 illustrates a flowchart of a method of dynamic memory management in a UE in accordance with an embodiment.
- exemplary is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or implementation of the present subject matter described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
- a HARQ protocol is used between BSs and a UE to ensure high reliability and high data transmission efficiency while transmitting data packets.
- a UE should have enough memory (also referred as soft buffer space) to store data packets which are not decoded successfully and a size of each buffer space should be greater than or equal to a sum of a maximum TBS of the data packets and redundancy versions.
- the redundancy versions may be used to decode the data packets.
- the current HARQ protocol implementation allows throughput of the HARQ protocol to be static for a given configuration.
- a memory space is equally divided for 8 HARQ processes and, hence, a UE may accommodate only 8 HARQ processes.
- a static memory allocation of data packets is calculated based on largest TBS of a data packet and corresponding redundancy versions. The problem associated with the static memory allocation is that the UE may not receive a largest TBS data packet due to number of downlink frequency carriers carrying the data packet and, hence, some memory may be wasted or may not be optimally utilized.
- a conventional method increases memory of a UE in order to increase a number of HARQ processes.
- the increase of the memory in the UE may lead to an increase in a cost of a user device.
- the present disclosure discloses a method for dynamic memory management in a UE which supports a greater number of HARQ processes.
- the present disclosure discloses a method which reduces latency of data packets by effectively utilizing memory of a UE.
- the present disclosure increases throughput of a UE in single connectivity or multi connectivity scenario across BSs without increasing a size of memory in the UE.
- the present disclosure supports high round trip time for providing HARQ feedback for successful receipt and decoding of a data packet.
- the present disclosure provides a method and a system for dynamic memory management in a UE.
- the system comprises one or more BSs and a UE.
- the one or more BSs may be configured to transmit data packets to the UE in a cellular network.
- the data packets may be associated with a HARQ process.
- a UE may include, but is not limited to, a mobile phone, a laptop computer and any computing device capable of receiving and transmitting data.
- a UE may receive TBS information associated with a data packet to be transmitted by a BS, from the BS.
- a TBS indicates block size of a data packet.
- the UE may identify a plurality of empty bins and a size of each of the plurality of empty bins in a memory of the UE to accommodate a data packet which is to be received from the BS. Thereafter, the UE may detect a presence of one or more empty bins among the plurality of empty bins in the memory wherein a size of each of the one or more empty bins is greater than the TBS of the data packet. For example, a TBS associated with a data packet may be 50 kb.
- a size of each of the 5 empty bins may be 10 kb, 50 kb, 60 kb, 70 kb, and 50 kb, respectively.
- the UE may identify that the sizes of empty bin 3 and empty bin 4 are greater than the TBS of the data packet. Therefore, the UE may select one empty bin among empty bin 3 and empty bin 4 with a smallest size and allocate the data packet. In this scenario, the size of empty bin 3 may be the smallest as compared with the size of empty bin 4 . Hence, the UE may allocate the data packet to empty bin 3 .
- the UE may detect an absence of one or more empty bins among a plurality of empty bins with a size greater than the TBS of the data packet. In such a scenario, the UE may reconfigure the plurality of empty bins to create an empty bin with a size greater than the TBS of the data packet and thereafter allocate the data packet to the created empty bin.
- FIG. 1A illustrates an architecture of a system 100 for dynamic memory management in a UE 103 in accordance with an embodiment.
- the system 100 includes one or more BSs (e.g., BS 1 101 1 to BSn 101 n (alternatively referred as one or more BSs 101 ) and the UE 103 .
- the UE 103 may include, but is not limited to, a mobile phone, a laptop computer and any computing device capable of receiving and transmitting data.
- the BS 101 may be a transceiver which connects the UE 103 to a central hub and allows connection to a cellular network.
- the one or more BSs 101 may be configured to transmit data packets to the UE 103 .
- the present disclosure may employ Frequency Division Duplex (FDD) wherein the BS 101 and the UE 103 operate at different carrier frequencies for transmitting and receiving data packets.
- FDD Frequency Division Duplex
- TDD Time Division Duplexing
- the UE 103 may include a HARQ memory for storing data packets transmitted by the UE 103 .
- the HARQ memory may be equally divided and, hence, 8 data packets may be stored and the UE 103 may take 8 milliseconds to confirm or provide an acknowledgement to the BS 101 on whether the data packets are successfully received and decoded at the UE 103 .
- the HARQ memory may be dynamically configured to incorporate more than 8 data packets.
- FIGS. 1B-1D illustrate a process for dynamic allocation of data packets in a HARQ memory 104 in accordance with an embodiment.
- the BS 101 may transmit the same data packet in each predefined transmission time interval (TTI) to the UE 103 in a first predefined process, namely a chase combining technique.
- the BS 101 may transmit a data packet along with one or more redundant bits to the UE 103 in a second predefined process, namely an incremental redundancy technique.
- TTI 1 transmission time interval
- the UE 103 may receive a data packet along with one or more redundant bits.
- the one or more redundant bits may be used for decoding the data packet at the UE 103 .
- three redundant bits may be transmitted by the BS 101 along with the data packet to the UE 103 .
- the size of a data packet “A” includes a size of the data packet and a size of the one or more redundant bits.
- the size of the data packet may be “a”.
- the size of the first redundant bit may be “a1”
- the size of the second redundant bit may be “a2”
- the size of the third redundant bit may be “a3”. Therefore, the size of the data packet “A” transmitted is a+a1+a2+a3.
- the data packet “A” may be stored in a memory location (also referred as a bin) bin 1 .
- the UE 103 may receive data packet “B”.
- the data packet “B” may be allocated in a memory location (also referred as bin 2 ) adjacent to bin 1 which is occupied by the data packet “A”.
- the UE 103 may receive data packet “L”.
- the UE 103 may provide an indication as to whether the data packets are successfully received and decoded by the UE 103 .
- the UE 103 may provide an acknowledgement confirming that the data packets A, C, F, H, K and L at bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 are received and decoded successfully. Since the data packets A, C, F, H, K and L are received and successfully decoded, the UE 103 may remove these data packets from the HARQ memory 104 . Upon removal of these data packets, the HARQ memory 104 of the UE 103 may be as shown in FIG. 1C . FIG. 1C shows empty bins and non-empty bins.
- the empty bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 indicate free memory space since the data packets are removed.
- the non-empty bins bin 2 , bin 4 , bin 5 , bin 7 , bin 9 and bin 10 indicate occupied memory space by the respective data packets as the UE 103 has not provided an acknowledgement confirming that these packets are successfully received and decoded.
- the BS 101 may intend to transmit a new data packet “S” to the UE 103 .
- the UE 103 may receive information of a TBS of the data packet “S” to be transmitted to the UE 103 .
- the TBS of the data packet “S” may be 50 kb.
- the UE 103 may identify a plurality of empty bins and a size of each of the plurality of empty bins. In this scenario, the UE 103 may identify that the bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 are empty.
- the size of each of the bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 may be 10 kb, 20 kb, 30 kb, 40 kb, 60 kb and 70 kb, respectively.
- the UE 103 may identify one or more empty bins with sizes greater than the size of the TBS.
- the size of the data packet “S” is 50 kb.
- the size of the bins bin 11 and bin 12 are greater than the TBS of the data packet “S”.
- the UE 103 may allocate the data packet “S” in a smallest size empty bin among the one or more empty bins to the data packet. In this scenario, since, size of the bin 11 is less than the size of bin 12 , the data packet “S” may be allocated in bin 11 as shown in FIG. 1C .
- the UE 103 may detect an absence of one or more empty bins in the HARQ memory 104 wherein a size of the empty bins is greater than the TBS of the data packet.
- the size of each of the bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 may be 10 kb, 20 kb, 30 kb, 40 kb, 10 kb and 30 kb, respectively, and the TBS of the data packet “S” may be 50 kb.
- the TBS of the data packet “S” may be 50 kb.
- none of the sizes of the empty bins bin 1 , bin 3 , bin 6 , bin 8 , bin 11 and bin 12 is greater than the TBS of the data packer to allocate the data packet.
- the UE 103 may reconfigure the plurality of empty bins until an empty bin with a size greater than the TBS of the data packet is created.
- the reconfiguration may be performed using a technique which may include, but is not limited to, a linked list technique. Therefore, the bins bin 1 , bin 3 and bin 6 and may be reconfigured to form a new empty bin.
- the UE 103 may form the new empty bin of a size of 60 kb, which is greater than the TBS of the data packet. Therefore, the data packet “S” may be allocated to the new empty bin as shown in FIG. 1D .
- the UE 103 may transmit information associated with one of a presence or an absence of an empty bin with a size greater than the TBS of the data packet to one or more associated BS 101 upon detecting a presence or an absence of empty bins with sizes greater than the TB S of the data packet in the UE 103 . If the BS 101 receives information associated with a presence of an empty bin with a size greater than the TBS of the data packet, then the BS 101 may transmit the data packet to the UE 103 .
- FIG. 2A illustrates a block diagram of the UE 103 for dynamic memory management in accordance with an embodiment.
- the UE 103 may include an input/output (I/O) interface 106 , a processor 107 and a memory 111 .
- the I/O interface 106 may be configured to receive data packets from the BS 101 .
- the UE 103 may also include data 200 and modules 210 .
- the data 200 may be stored in the memory 111 .
- the data 200 may include TBS data 201 , bin data 203 and other data 205 .
- the modules 210 are described below in greater detail.
- the data 200 may be stored in the memory 111 in a form of various data structures. Additionally, the data 200 can be organized using data models, such as relational or hierarchical data models.
- the other data 205 may store data, including temporary data and temporary files, generated by the modules 210 for performing the various functions of the UE 103 .
- the data 200 stored in the memory 111 may be processed by the modules 210 of the UE 103 .
- the modules 210 may be stored within the memory 111 .
- the modules 210 communicatively coupled to the processor 107 configured in the UE 103 may also be present outside the memory 111 and implemented as hardware.
- the term “modules” may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor 107 (e.g., shared, dedicated, or grouped) and the memory 111 that executes one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.
- ASIC application specific integrated circuit
- a processor 107 e.g., shared, dedicated, or grouped
- the memory 111 that executes one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.
- the modules 210 may include, for example, a receiving module 211 , an empty bin identification module 213 , a detection module 215 , an allocation module 217 and other modules 221 .
- the other modules 221 may be used to perform various miscellaneous functionalities of the UE 103 . It will be appreciated that such aforementioned modules 210 may be represented as a single module or a combination of different modules.
- the modules 210 when configured with the functionality defined in the present disclosure, will result in a novel hardware.
- the receiving module 211 may be configured to receive TBS information associated with a data packet from the BS 101 .
- the receiving module 211 may receive the TBS of the data packet which is to be transmitted by the BS 101 to the UE 103 .
- the TBS may indicate a size of the data packet.
- the received TBS of the data packet may be stored as TBS data 201 .
- the empty bin identification module 213 may be configured to identify the empty bins in the HARQ memory 104 of the UE 103 .
- the UE 103 may identify the plurality of empty bins and a size of each of the plurality of empty bins.
- the plurality of empty bins is that from which the data packets are removed as they have been successfully received and decoded by the UE 103 .
- the information associated with identified empty bins may be stored as bin data 203 .
- the detection module 215 may be configured to detect a presence of one or more empty bins among the plurality of empty bins in the HARQ memory 104 wherein the sizes of the one or more empty bins are greater than the TBS of the data packet. For example, there may be three empty bins bin 1 , bin 2 and bin 3 whose sizes may be 10 kb, 30 kb and 40 kb, respectively.
- the TBS of the data packet may be 20 kb.
- the detection module 215 may detect a presence of two empty bins bin 2 and bin 3 with sizes greater than the TBS of the data packet.
- the allocation module 217 may allocate the data packet to the smallest size empty bin among the one or more empty bins.
- the sizes of the empty bins bin 1 , bin 2 and bin 3 may be 10 kb, 30 kb and 40 kb, respectively. Since the sizes of both empty bins bin 2 and bin 3 are greater than the TBS of the data packet, the data packet may be allocated to bin 2 or bin 3 .
- the allocation module 217 may allocate the data packet to the smallest empty bin among the one or more empty bins. Therefore, the allocation module 217 may allocate the data packet to the empty bin bin 2 since the size of the empty bin bin 2 is smaller than the size of the empty bin bin 3 . Therefore, the data packet may be allocated in the empty bin bin 2 .
- the TBS of the data packet may be 50 kb and the size of the empty bins bin 1 , bin 2 and bin 3 may be 10 kb, 30 kb and 40 kb, respectively.
- the UE 103 may reconfigure the one or more empty bins.
- the one or more empty bins may be reconfigured based on a link list wherein each of the one or more empty bins are linked using the link list. Due to the reconfiguration, the size of the empty bin is a sum of the size of the plurality of empty bins.
- the size of the empty bins bin 1 , bin 2 and bin 3 may be reconfigured to obtain an empty bin of size 80 kb which is greater than the TBS of the data packet which is 50 kb.
- the UE 103 may transmit information associated with a presence or an absence of an empty bin with a size greater than the TBS of the data packet to the one or more BS 101 .
- the UE 103 may implement the methods described below for transmitting the information.
- the UE 103 may be associated with two base stations BS 1 101 1 and BS 2 101 2 as shown in FIG. 2B .
- FIG. 2B illustrates a sequence flow diagram of a process of communication between the UE 103 and base stations BS 1 101 1 and BS 2 101 2 .
- the UE 103 may transmit information associated with a presence or an absence of an empty bin using “1 bit” information on a physical uplink control channel (PUCCH) between the UE 103 and the base stations BS 1 101 1 and BS 2 101 2 .
- PUCCH physical uplink control channel
- the UE 103 may transmit the “1 bit” information “0” upon detecting an absence of an empty bin and transmit “1 bit” information “1” upon detecting a presence of an empty bin in the UE 103 .
- the UE 103 may transmit the “1 bit” information “1” to both the base stations BS 1 101 1 and BS 2 101 2 in the PUCCH in steps 230 and 240 , respectively.
- both the base stations BS 1 101 1 and BS 2 101 2 may continue to retransmit the data packets to the UE 103 in steps 250 and 260 , respectively.
- the UE 103 may be associated with two base stations BS 1 101 1 and BS 2 101 2 as shown in FIG. 2C .
- FIG. 2C illustrates a sequence flow diagram of a process of communication between the UE 103 and the base stations BS 1 101 1 and BS 2 101 2 .
- the UE 103 may transmit information associated with a presence or an absence of an empty bin using “1 bit” information on a PUCCH between the UE 103 and the base stations, BS 1 1011 and BS 2 1012 .
- the UE 103 may transmit the “1 bit” information “0” upon detecting an absence of an empty bin and transmit “1 bit” information “1” upon detecting a presence of an empty bin in the UE 103 .
- the UE 103 may transmit the “1 bit” information “1” to the base station, BS 1 101 1 and “1 bit” information “0” to the base station BS 2 101 2 in the PUCCH in steps 270 and 280 , respectively.
- the BS 1 101 1 may continue to transmit the data packet to the UE 103 at step 290 .
- the BS 2 101 2 may not transmit the data packet to the UE 103 as there is no availability of an empty bin for the data packet. If an empty bin with a size greater than the TBS of the data packet is unavailable, the UE 103 may not transmit “1 bit” information “0”. The unavailability of the “1 bit” information may provide an indication to the UE 103 about an absence of an empty bin.
- the UE 103 and the associated BS 101 may implement same protocols for dynamic memory management in the UE 103 . In such a scenario, the UE 103 may not provide “1 bit” information to indicate a presence or an absence of empty bins in the HARQ memory 104 of the UE 103 .
- FIG. 3 illustrates a flowchart of a method of dynamic memory management in a UE in accordance with an embodiment.
- computer executable instructions may include routines, programs, objects, components, data structures, procedures, modules, and functions, which perform specific functions or implement specific abstract data types.
- the method may include receiving TBS information from the BS 101 .
- the TBS information may be associated with a data packet which is to be transmitted by the BS 101 to the TIE 103 .
- the TBS may indicate a size of the data packet.
- the method may include identifying a plurality of empty bins and a size of each of the plurality of empty bins in a HARQ memory 104 of the UE 103 .
- the UE 103 may include the HARQ memory 104 configured to store the data packets.
- the HARQ memory 104 may be configured in the form of a plurality of bins wherein each of the plurality of bins is configured to store the data packets.
- the UE 103 may identify a plurality of empty bins in the memory of the UE 103 , if the bins do not include any packets. Once the data packet is received by the UE 103 and successfully decoded, the UE 103 may remove the data packet from the bin and, hence, the bin may be empty.
- the UE 103 may also identify a size of each of empty bin.
- the method may include, detecting presence of one or more empty bins among the plurality of empty bins in the HARQ memory 104 wherein a size of each of the one or more empty bins are greater than the TBS of the data packet.
- the UE 103 may compare the TBS of the data packet and the sizes of the empty bins and detect those empty bins whose sizes are greater than the TBS of the data packet.
- the method may include allocating a smallest size empty bin among the one or more empty bins to the data packet. For example, there may be three empty bins with sizes 50 kb, 80 kb and 10 kb.
- the UE 103 may select the empty bin with size 10 kb, since the empty bin with size 10 kb is has the smallest size as compared to the other empty bins.
- the UE 103 may detect an absence of one or more empty bins whose sizes are less than a TBS of a data packet. In such a scenario, the UE 103 may reconfigure the plurality of empty bins to create an empty bin with a size greater than the TBS of the data packet. The reconfiguration may be performed by correlating empty bins until an empty bin is created whose size is greater than the TBS of the data packet.
- the method disclosed in the present disclosure may be implemented for any wireless device or system such as wireless fidelity (WiFi), narrow band-Internet of Things (NB-IOT), enhanced mobile broadband (eMBB), enhanced machine-type communication (eMTC) and machine to machine communication systems.
- WiFi wireless fidelity
- NB-IOT narrow band-Internet of Things
- eMBB enhanced mobile broadband
- eMTC enhanced machine-type communication
- an embodiment “embodiment” “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” indicate one or more (but not all) embodiments of the present disclosure, unless expressly specified otherwise.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- This application is based on and claims priority under 35 U.S.C. § 119 to Indian Provisional Patent Application No. 201841040460 (PS) filed on Oct. 26, 2018 and Indian Complete Patent Application No. 201841040460 (CS), filed on Oct. 21, 2019, in the Indian Patent Office, the disclosure of each of which is herein incorporated by reference.
- The present disclosure generally relates to field of telecommunication network. Particularly, but not exclusively, the present disclosure relates to method and system for dynamic memory management in a user equipment (UE).
- To meet the demand for wireless data traffic, which has increased since deployment of 4G communication systems, efforts have been made to develop an improved 5G or pre-5G communication system. The 5G or pre-5G communication system is also called a “beyond 4G network” or a “post LTE (long term evolution) system”. The 5G communication system is considered to be implemented in higher frequency (mmWave) bands, e.g., 60 GHz bands, so as to accomplish higher data rates. To decrease propagation loss of the radio waves and increase the transmission distance, the beamforming, massive multiple-input multiple-output (mMIMO), full dimensional MIMO (FD-MIMO), array antenna, an analog beam forming, large scale antenna techniques are discussed in 5G communication systems. In addition, in 5G communication systems, development for system network improvement is under way based on advanced small cells, cloud radio access networks (RANs), ultra-dense networks, device-to-device (D2D) communication, wireless backhaul, moving network, cooperative communication, coordinated multi-points (CoMP), reception-end interference cancellation and the like. In the 5G system, hybrid frequency shift keying (FSK) and frequency quadrature amplitude modulation (FQAM) and sliding window superposition coding (SWSC) as an advanced coding modulation (ACM), and filter bank multi carrier (FBMC), non-orthogonal multiple access (NOMA), and sparse code multiple access (SCMA) as an advanced access technology have been developed.
- The Internet is now evolving to the Internet of things (IoT) where distributed entities, such as things, exchange and process information without human intervention. The Internet of everything (IoE), which is a combination of IoT technology and big data processing technology through connection with a cloud server, has emerged. As technology elements, such as “sensing technology”, “wired/wireless communication and network infrastructure”, “service interface technology”, and “Security technology” have been demanded for IoT implementation, a sensor network, a machine-to-machine (M2M) communication, machine type communication (MTC), and so forth are being researched. Such an IoT environment may provide intelligent Internet technology services that create a new value to human life by collecting and analyzing data generated among connected things. IoT may be applied to a variety of fields including smart home, smart building, smart city, smart car or connected cars, smart grid, health care, smart appliances and advanced medical services through convergence and combination between existing information technology (IT) and various industrial applications.
- In line with this, various attempts have been made to apply 5G communication systems to IoT networks. For example, technologies such as a sensor network, MTC, and M2M communication may be implemented by beamforming, MIMO, and array antennas. Application of a cloud RAN as the above-described big data processing technology may also be considered to be as an example of convergence between the 5G technology and IoT technology.
- In accordance with an aspect of the disclosure, a method for dynamic memory management in a UE is provided. The method includes receiving, by a UE, transport block size (TBS) information, from a base station (BS), associated with a data packet to be transmitted by the BS to the UE, identifying, by the UE, a plurality of empty bins and a size of each of the plurality of empty bins in a memory of the UE, detecting, by the UE, a presence of one or more empty bins, among the plurality of empty bins in the memory, with a size of each of the one or more empty bins greater than the TBS of the data packet, and allocating, by the UE, a smallest size empty bin, with a size greater than the TBS of the data packet, among the one or more empty bins to the data packet.
- In accordance with another aspect of the disclosure, a UE for dynamic memory management is provided. The UE includes a processor and a memory communicatively coupled to the processor, wherein the memory is configured to store processor-executable instructions, which, upon execution, cause the processor to receive TBS information, from a BS, associated with a data packet to be transmitted by the BS to the UE, identify a plurality of empty bins and a size of each of the plurality of empty bins in the memory of the UE, detect a presence of one or more empty bins, among the plurality of empty bins in the memory, with a size of each of the one or more empty bins greater than the TBS of the data packet, and allocate a smallest size empty bin among the one or more empty bins to the data packet.
- The above and other aspects, features, and advantages of certain embodiments of the disclosure will be more apparent from the following description taken in conjunction with the accompanying drawings, in which:
-
FIG. 1A illustrates an architecture of a system for dynamic memory management in a user equipment (UE) in accordance with an embodiment; -
FIGS. 1B-1D illustrate a process for dynamic allocation of data packets in a hybrid automatic repeat request (HARQ) memory in accordance with an embodiment; -
FIG. 2A illustrates a block diagram of a UE for dynamic memory management in accordance with an embodiment; -
FIGS. 2B-2C illustrate sequence flow diagrams of a process of communication between the UE and base stations BS1 and BS2 in accordance with an embodiment; and -
FIG. 3 illustrates a flowchart of a method of dynamic memory management in a UE in accordance with an embodiment. - In the present document, the word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or implementation of the present subject matter described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
- While the disclosure is susceptible to various modifications and alternative forms, specific embodiments thereof have been shown by way of example in the drawings and will be described in detail below. It should be understood, however that it is not intended to limit the disclosure to the specific forms disclosed, but on the contrary, the disclosure is to cover all modifications, equivalents, and alternatives falling within the scope of the disclosure.
- It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative systems embodying the principles of the present subject matter. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable media and executed by a computer or processor, whether such computer or processor is explicitly shown.
- The terms “comprises”, “comprising”, “includes”, “including” or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a setup, device, or method that comprises a list of components or steps does not include only those components or steps but may include other components or steps not expressly listed or inherent to such setup or device or method. In other words, one or more elements in a system or apparatus proceeded by “comprises . . . a” does not, without more constraints, preclude the existence of other elements or additional elements in the system or method.
- In a wireless network, a HARQ protocol is used between BSs and a UE to ensure high reliability and high data transmission efficiency while transmitting data packets. A UE should have enough memory (also referred as soft buffer space) to store data packets which are not decoded successfully and a size of each buffer space should be greater than or equal to a sum of a maximum TBS of the data packets and redundancy versions. The redundancy versions may be used to decode the data packets.
- The current HARQ protocol implementation allows throughput of the HARQ protocol to be static for a given configuration. For, LTE systems, a memory space is equally divided for 8 HARQ processes and, hence, a UE may accommodate only 8 HARQ processes. A static memory allocation of data packets is calculated based on largest TBS of a data packet and corresponding redundancy versions. The problem associated with the static memory allocation is that the UE may not receive a largest TBS data packet due to number of downlink frequency carriers carrying the data packet and, hence, some memory may be wasted or may not be optimally utilized.
- Therefore, a conventional method increases memory of a UE in order to increase a number of HARQ processes. However, the increase of the memory in the UE may lead to an increase in a cost of a user device.
- The present disclosure discloses a method for dynamic memory management in a UE which supports a greater number of HARQ processes.
- The present disclosure discloses a method which reduces latency of data packets by effectively utilizing memory of a UE.
- The present disclosure increases throughput of a UE in single connectivity or multi connectivity scenario across BSs without increasing a size of memory in the UE.
- The present disclosure supports high round trip time for providing HARQ feedback for successful receipt and decoding of a data packet.
- The present disclosure provides a method and a system for dynamic memory management in a UE. The system comprises one or more BSs and a UE. The one or more BSs may be configured to transmit data packets to the UE in a cellular network. The data packets may be associated with a HARQ process. For example, a UE may include, but is not limited to, a mobile phone, a laptop computer and any computing device capable of receiving and transmitting data. A UE may receive TBS information associated with a data packet to be transmitted by a BS, from the BS. A TBS indicates block size of a data packet. Thereafter, the UE may identify a plurality of empty bins and a size of each of the plurality of empty bins in a memory of the UE to accommodate a data packet which is to be received from the BS. Thereafter, the UE may detect a presence of one or more empty bins among the plurality of empty bins in the memory wherein a size of each of the one or more empty bins is greater than the TBS of the data packet. For example, a TBS associated with a data packet may be 50 kb. There may be 5 empty bins in a memory of a UE, namely
empty bin 1,empty bin 2,empty bin 3,empty bin 4 and empty 5 and a size of each of the 5 empty bins may be 10 kb, 50 kb, 60 kb, 70 kb, and 50 kb, respectively. The UE may identify that the sizes ofempty bin 3 andempty bin 4 are greater than the TBS of the data packet. Therefore, the UE may select one empty bin amongempty bin 3 andempty bin 4 with a smallest size and allocate the data packet. In this scenario, the size ofempty bin 3 may be the smallest as compared with the size ofempty bin 4. Hence, the UE may allocate the data packet toempty bin 3. In another embodiment, the UE may detect an absence of one or more empty bins among a plurality of empty bins with a size greater than the TBS of the data packet. In such a scenario, the UE may reconfigure the plurality of empty bins to create an empty bin with a size greater than the TBS of the data packet and thereafter allocate the data packet to the created empty bin. -
FIG. 1A illustrates an architecture of asystem 100 for dynamic memory management in aUE 103 in accordance with an embodiment. - Referring to
FIG. 1A , thesystem 100 includes one or more BSs (e.g.,BS1 101 1 to BSn 101 n (alternatively referred as one or more BSs 101) and theUE 103. For example, theUE 103 may include, but is not limited to, a mobile phone, a laptop computer and any computing device capable of receiving and transmitting data. TheBS 101 may be a transceiver which connects theUE 103 to a central hub and allows connection to a cellular network. In an embodiment, the one or more BSs 101 may be configured to transmit data packets to theUE 103. The present disclosure may employ Frequency Division Duplex (FDD) wherein theBS 101 and theUE 103 operate at different carrier frequencies for transmitting and receiving data packets. However, the present disclosure may also be extended to a Time Division Duplexing (TDD) technique wherein theBS 101 and theUE 103 may operate at a single frequency for transmitting and receiving data packets. In an embodiment, theUE 103 may include a HARQ memory for storing data packets transmitted by theUE 103. In LTE, the HARQ memory may be equally divided and, hence, 8 data packets may be stored and theUE 103 may take 8 milliseconds to confirm or provide an acknowledgement to theBS 101 on whether the data packets are successfully received and decoded at theUE 103. However, in the present disclosure, the HARQ memory may be dynamically configured to incorporate more than 8 data packets. -
FIGS. 1B-1D illustrate a process for dynamic allocation of data packets in aHARQ memory 104 in accordance with an embodiment. - Referring to
FIGS. 1B-1D , theBS 101 may transmit the same data packet in each predefined transmission time interval (TTI) to theUE 103 in a first predefined process, namely a chase combining technique. In another embodiment, theBS 101 may transmit a data packet along with one or more redundant bits to theUE 103 in a second predefined process, namely an incremental redundancy technique. At a first millisecond time instance 1 (e.g., TTI 1), theUE 103 may receive a data packet along with one or more redundant bits. The one or more redundant bits may be used for decoding the data packet at theUE 103. For example, three redundant bits may be transmitted by theBS 101 along with the data packet to theUE 103. Therefore, the size of a data packet “A” includes a size of the data packet and a size of the one or more redundant bits. For example, the size of the data packet may be “a”. The size of the first redundant bit may be “a1”, the size of the second redundant bit may be “a2” and the size of the third redundant bit may be “a3”. Therefore, the size of the data packet “A” transmitted is a+a1+a2+a3. The data packet “A” may be stored in a memory location (also referred as a bin)bin 1. - Similarly, at a second millisecond time instance 2 (e.g., TT2), the
UE 103 may receive data packet “B”. The data packet “B” may be allocated in a memory location (also referred as bin 2) adjacent tobin 1 which is occupied by the data packet “A”. Similarly, and so forth, at a twelfth millisecond time instance 12 (e.g., TT12), theUE 103 may receive data packet “L”. At a thirteenth millisecond time instance 13 (e.g., TTI 13, theUE 103 may provide an indication as to whether the data packets are successfully received and decoded by theUE 103. For example, at TTI 13, theUE 103 may provide an acknowledgement confirming that the data packets A, C, F, H, K and L atbins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 are received and decoded successfully. Since the data packets A, C, F, H, K and L are received and successfully decoded, theUE 103 may remove these data packets from theHARQ memory 104. Upon removal of these data packets, theHARQ memory 104 of theUE 103 may be as shown inFIG. 1C .FIG. 1C shows empty bins and non-empty bins. Theempty bins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 indicate free memory space since the data packets are removed. Thenon-empty bins bin 2,bin 4,bin 5,bin 7,bin 9 andbin 10 indicate occupied memory space by the respective data packets as theUE 103 has not provided an acknowledgement confirming that these packets are successfully received and decoded. - In an embodiment, at TTI 13, the
BS 101 may intend to transmit a new data packet “S” to theUE 103. TheUE 103 may receive information of a TBS of the data packet “S” to be transmitted to theUE 103. The TBS of the data packet “S” may be 50 kb. TheUE 103 may identify a plurality of empty bins and a size of each of the plurality of empty bins. In this scenario, theUE 103 may identify that thebins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 are empty. The size of each of thebins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 may be 10 kb, 20 kb, 30 kb, 40 kb, 60 kb and 70 kb, respectively. In an embodiment, theUE 103 may identify one or more empty bins with sizes greater than the size of the TBS. In this scenario, the size of the data packet “S” is 50 kb. The size of thebins bin 11 andbin 12 are greater than the TBS of the data packet “S”. TheUE 103 may allocate the data packet “S” in a smallest size empty bin among the one or more empty bins to the data packet. In this scenario, since, size of thebin 11 is less than the size ofbin 12, the data packet “S” may be allocated inbin 11 as shown inFIG. 1C . - In an embodiment, the
UE 103 may detect an absence of one or more empty bins in theHARQ memory 104 wherein a size of the empty bins is greater than the TBS of the data packet. For example, the size of each of thebins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 may be 10 kb, 20 kb, 30 kb, 40 kb, 10 kb and 30 kb, respectively, and the TBS of the data packet “S” may be 50 kb. As is evident, none of the sizes of theempty bins bin 1,bin 3,bin 6,bin 8,bin 11 andbin 12 is greater than the TBS of the data packer to allocate the data packet. In such a scenario, theUE 103 may reconfigure the plurality of empty bins until an empty bin with a size greater than the TBS of the data packet is created. The reconfiguration may be performed using a technique which may include, but is not limited to, a linked list technique. Therefore, thebins bin 1,bin 3 andbin 6 and may be reconfigured to form a new empty bin. Upon reconfiguring theempty bins bin 1,bin 3 andbin 6, theUE 103 may form the new empty bin of a size of 60 kb, which is greater than the TBS of the data packet. Therefore, the data packet “S” may be allocated to the new empty bin as shown inFIG. 1D . - In an embodiment, the
UE 103 may transmit information associated with one of a presence or an absence of an empty bin with a size greater than the TBS of the data packet to one or more associatedBS 101 upon detecting a presence or an absence of empty bins with sizes greater than the TB S of the data packet in theUE 103. If theBS 101 receives information associated with a presence of an empty bin with a size greater than the TBS of the data packet, then theBS 101 may transmit the data packet to theUE 103. -
FIG. 2A illustrates a block diagram of theUE 103 for dynamic memory management in accordance with an embodiment. - Referring to
FIG. 2A , theUE 103 may include an input/output (I/O)interface 106, aprocessor 107 and amemory 111. The I/O interface 106 may be configured to receive data packets from theBS 101. TheUE 103 may also includedata 200 andmodules 210. For example, thedata 200 may be stored in thememory 111. Thedata 200 may includeTBS data 201,bin data 203 andother data 205. Themodules 210 are described below in greater detail. - The
data 200 may be stored in thememory 111 in a form of various data structures. Additionally, thedata 200 can be organized using data models, such as relational or hierarchical data models. Theother data 205 may store data, including temporary data and temporary files, generated by themodules 210 for performing the various functions of theUE 103. - The
data 200 stored in thememory 111 may be processed by themodules 210 of theUE 103. Themodules 210 may be stored within thememory 111. For example, themodules 210 communicatively coupled to theprocessor 107 configured in theUE 103 may also be present outside thememory 111 and implemented as hardware. As used herein, the term “modules” may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor 107 (e.g., shared, dedicated, or grouped) and thememory 111 that executes one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality. - The
modules 210 may include, for example, a receivingmodule 211, an emptybin identification module 213, adetection module 215, anallocation module 217 andother modules 221. Theother modules 221 may be used to perform various miscellaneous functionalities of theUE 103. It will be appreciated that suchaforementioned modules 210 may be represented as a single module or a combination of different modules. - The
modules 210, when configured with the functionality defined in the present disclosure, will result in a novel hardware. - The receiving
module 211 may be configured to receive TBS information associated with a data packet from theBS 101. The receivingmodule 211 may receive the TBS of the data packet which is to be transmitted by theBS 101 to theUE 103. The TBS may indicate a size of the data packet. The received TBS of the data packet may be stored asTBS data 201. - The empty
bin identification module 213 may be configured to identify the empty bins in theHARQ memory 104 of theUE 103. TheUE 103 may identify the plurality of empty bins and a size of each of the plurality of empty bins. As an example, the plurality of empty bins is that from which the data packets are removed as they have been successfully received and decoded by theUE 103. The information associated with identified empty bins may be stored asbin data 203. - The
detection module 215 may be configured to detect a presence of one or more empty bins among the plurality of empty bins in theHARQ memory 104 wherein the sizes of the one or more empty bins are greater than the TBS of the data packet. For example, there may be threeempty bins bin 1,bin 2 andbin 3 whose sizes may be 10 kb, 30 kb and 40 kb, respectively. The TBS of the data packet may be 20 kb. Thedetection module 215 may detect a presence of twoempty bins bin 2 andbin 3 with sizes greater than the TBS of the data packet. - The
allocation module 217 may allocate the data packet to the smallest size empty bin among the one or more empty bins. In the exemplary scenario, the sizes of theempty bins bin 1,bin 2 andbin 3 may be 10 kb, 30 kb and 40 kb, respectively. Since the sizes of bothempty bins bin 2 andbin 3 are greater than the TBS of the data packet, the data packet may be allocated tobin 2 orbin 3. Theallocation module 217 may allocate the data packet to the smallest empty bin among the one or more empty bins. Therefore, theallocation module 217 may allocate the data packet to theempty bin bin 2 since the size of theempty bin bin 2 is smaller than the size of theempty bin bin 3. Therefore, the data packet may be allocated in theempty bin bin 2. - There may not be one or more empty bins in the
HARQ memory 104 with sizes greater than the TBS of the data packet. For example, the TBS of the data packet may be 50 kb and the size of theempty bins bin 1,bin 2 andbin 3 may be 10 kb, 30 kb and 40 kb, respectively. In such a scenario, theUE 103 may reconfigure the one or more empty bins. The one or more empty bins may be reconfigured based on a link list wherein each of the one or more empty bins are linked using the link list. Due to the reconfiguration, the size of the empty bin is a sum of the size of the plurality of empty bins. For example, the size of theempty bins bin 1,bin 2 andbin 3 may be reconfigured to obtain an empty bin of size 80 kb which is greater than the TBS of the data packet which is 50 kb. - The
UE 103 may transmit information associated with a presence or an absence of an empty bin with a size greater than the TBS of the data packet to the one ormore BS 101. TheUE 103 may implement the methods described below for transmitting the information. -
Method 1 - In an embodiment, the
UE 103 may be associated with twobase stations BS 1 101 1 andBS2 101 2 as shown inFIG. 2B .FIG. 2B illustrates a sequence flow diagram of a process of communication between theUE 103 andbase stations BS 1 101 1 andBS2 101 2. Referring toFIG. 2B , theUE 103 may transmit information associated with a presence or an absence of an empty bin using “1 bit” information on a physical uplink control channel (PUCCH) between theUE 103 and thebase stations BS1 101 1 andBS2 101 2. TheUE 103 may transmit the “1 bit” information “0” upon detecting an absence of an empty bin and transmit “1 bit” information “1” upon detecting a presence of an empty bin in theUE 103. For example, theUE 103 may transmit the “1 bit” information “1” to both thebase stations BS1 101 1 andBS2 101 2 in the PUCCH insteps base stations BS1 101 1 andBS2 101 2 may continue to retransmit the data packets to theUE 103 insteps -
Method 2 - In an embodiment, the
UE 103 may be associated with twobase stations BS1 101 1 andBS 2 101 2 as shown inFIG. 2C .FIG. 2C illustrates a sequence flow diagram of a process of communication between theUE 103 and thebase stations BS 1 101 1 andBS2 101 2. Referring toFIG. 2C , theUE 103 may transmit information associated with a presence or an absence of an empty bin using “1 bit” information on a PUCCH between theUE 103 and the base stations,BS1 1011 andBS2 1012. TheUE 103 may transmit the “1 bit” information “0” upon detecting an absence of an empty bin and transmit “1 bit” information “1” upon detecting a presence of an empty bin in theUE 103. For example, theUE 103 may transmit the “1 bit” information “1” to the base station,BS1 101 1 and “1 bit” information “0” to thebase station BS2 101 2 in the PUCCH insteps BS1 101 1 may continue to transmit the data packet to theUE 103 atstep 290. Further, upon receiving the “1 bit” information “0”, theBS2 101 2 may not transmit the data packet to theUE 103 as there is no availability of an empty bin for the data packet. If an empty bin with a size greater than the TBS of the data packet is unavailable, theUE 103 may not transmit “1 bit” information “0”. The unavailability of the “1 bit” information may provide an indication to theUE 103 about an absence of an empty bin. TheUE 103 and the associatedBS 101 may implement same protocols for dynamic memory management in theUE 103. In such a scenario, theUE 103 may not provide “1 bit” information to indicate a presence or an absence of empty bins in theHARQ memory 104 of theUE 103. -
FIG. 3 illustrates a flowchart of a method of dynamic memory management in a UE in accordance with an embodiment. - Referring to
FIG. 3 , the method may be described in a general context of computer executable instructions. Generally, computer executable instructions may include routines, programs, objects, components, data structures, procedures, modules, and functions, which perform specific functions or implement specific abstract data types. - The order in which the method is described is not intended to be construed as a limitation, and any number of the described steps in the method may be combined in any order to implement the method. Additionally, individual steps may be deleted from the method without departing from the scope and spirit of the subject matter described herein. Furthermore, the method may be implemented in any suitable hardware, software, firmware, or combination thereof.
- Referring to
FIG. 3 , atstep 301, the method may include receiving TBS information from theBS 101. The TBS information may be associated with a data packet which is to be transmitted by theBS 101 to theTIE 103. The TBS may indicate a size of the data packet. - At
step 303, the method may include identifying a plurality of empty bins and a size of each of the plurality of empty bins in aHARQ memory 104 of theUE 103. TheUE 103 may include theHARQ memory 104 configured to store the data packets. TheHARQ memory 104 may be configured in the form of a plurality of bins wherein each of the plurality of bins is configured to store the data packets. TheUE 103 may identify a plurality of empty bins in the memory of theUE 103, if the bins do not include any packets. Once the data packet is received by theUE 103 and successfully decoded, theUE 103 may remove the data packet from the bin and, hence, the bin may be empty. TheUE 103 may also identify a size of each of empty bin. - At
step 305, the method may include, detecting presence of one or more empty bins among the plurality of empty bins in theHARQ memory 104 wherein a size of each of the one or more empty bins are greater than the TBS of the data packet. TheUE 103 may compare the TBS of the data packet and the sizes of the empty bins and detect those empty bins whose sizes are greater than the TBS of the data packet. - At
step 307, the method may include allocating a smallest size empty bin among the one or more empty bins to the data packet. For example, there may be three empty bins with sizes 50 kb, 80 kb and 10 kb. TheUE 103 may select the empty bin withsize 10 kb, since the empty bin withsize 10 kb is has the smallest size as compared to the other empty bins. - In an embodiment, the
UE 103 may detect an absence of one or more empty bins whose sizes are less than a TBS of a data packet. In such a scenario, theUE 103 may reconfigure the plurality of empty bins to create an empty bin with a size greater than the TBS of the data packet. The reconfiguration may be performed by correlating empty bins until an empty bin is created whose size is greater than the TBS of the data packet. - The method disclosed in the present disclosure may be implemented for any wireless device or system such as wireless fidelity (WiFi), narrow band-Internet of Things (NB-IOT), enhanced mobile broadband (eMBB), enhanced machine-type communication (eMTC) and machine to machine communication systems.
- The terms “an embodiment”, “embodiment” “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” indicate one or more (but not all) embodiments of the present disclosure, unless expressly specified otherwise.
- The terms “including”, “comprising”, “having” and variations thereof indicate including but not limited to, unless expressly specified otherwise. The enumerated listing of items does not imply that any or all of the items are mutually exclusive, unless expressly specified otherwise.
- The terms “a”, “an” and “the” indicate one or more, unless expressly specified otherwise.
- A description of an embodiment with several components in communication with each other does not imply that all such components are required. On the contrary, a variety of optional components are described above to illustrate the wide variety of possible embodiments of the present disclosure.
- Where a single device or article is described herein, it will be clear that more than one device/article (whether they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described herein (whether they cooperate), it will be clear that a single device/article may be used in place of the more than one device or article or a different number of devices/articles may be used instead of the shown number of devices or programs. The functionality and/or the features of a device may be alternatively embodied by one or more other devices which are not explicitly described as having such functionality/features. Thus, other embodiments of the present disclosure need not include the device itself.
- Finally, the terms used in the present disclosure are not intended to delineate or circumscribe the present disclosure. It is therefore intended that the scope of the present disclosure not be limited by a description, but rather by the appended claims and their equivalents. Accordingly, the present disclosure is intended to be illustrative, but not limiting, of the scope of the present disclosure, which is set forth in the appended claims.
- While the present disclosure has been shown and described with reference to certain embodiments thereof, it will be apparent to those skilled in the art that various changes in form and details may be made therein without departing from the scope of the present disclosure as defined by the appended claims and their equivalents.
Claims (18)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN201841040460 | 2018-10-26 | ||
IN201841040460PS | 2018-10-26 | ||
IN201841040460CS | 2019-10-21 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20200133853A1 true US20200133853A1 (en) | 2020-04-30 |
US11010292B2 US11010292B2 (en) | 2021-05-18 |
Family
ID=70329064
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/665,607 Active US11010292B2 (en) | 2018-10-26 | 2019-10-28 | Method and system for dynamic memory management in a user equipment (UE) |
Country Status (2)
Country | Link |
---|---|
US (1) | US11010292B2 (en) |
WO (1) | WO2020085886A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2022544728A (en) * | 2020-07-15 | 2022-10-21 | 太倉市同維電子有限公司 | HARQ transmission apparatus and transmission method based on shared buffer |
WO2024098640A1 (en) * | 2023-03-31 | 2024-05-16 | Zte Corporation | Bandwidth boosting for downlink & uplink transmission |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060069898A1 (en) * | 2004-09-30 | 2006-03-30 | Mehul Patel | Memory manager for an embedded system |
US20080162856A1 (en) * | 2006-12-29 | 2008-07-03 | Motorola, Inc. | Method for dynamic memory allocation on reconfigurable logic |
US20090059801A1 (en) * | 2007-08-28 | 2009-03-05 | Beceem Communications, Inc. | Managing storage of HARQ packets |
US20100272033A1 (en) * | 2009-04-28 | 2010-10-28 | Jong-Kae Fwu | Harq buffer management and feedback design for a wireless system |
US20170264404A1 (en) * | 2014-11-26 | 2017-09-14 | Huawei Technologies Co., Ltd. | Wireless Communication Method, Device and System |
US20180139743A1 (en) * | 2013-07-26 | 2018-05-17 | Lg Electronics Inc. | Method for transmitting signal for mtc and apparatus for same |
US20190236001A1 (en) * | 2018-01-31 | 2019-08-01 | Hewlett Packard Enterprise Development Lp | Shared fabric attached memory allocator |
US20200052824A1 (en) * | 2017-02-27 | 2020-02-13 | Ipcom Gmbh & Co. Kg | Feedback with configurable latency |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002003597A1 (en) * | 2000-06-30 | 2002-01-10 | Kanad Ghose | System and method for fast, reliable byte stream transport |
US6975593B2 (en) * | 2001-04-03 | 2005-12-13 | Sun Microsystems, Inc. | Method for triggering flow control packets |
JP4291664B2 (en) * | 2003-10-14 | 2009-07-08 | 株式会社日立製作所 | Storage apparatus and system having communication buffer reservation function |
AU2007212604A1 (en) | 2006-02-03 | 2007-08-16 | Interdigital Technology Corporation | Method and apparatus for dynamically configuring a hybrid automatic repeat request memory |
WO2007139426A1 (en) * | 2006-05-31 | 2007-12-06 | Intel Corporation | Multiple phase buffer enlargement for rdma data transfer |
WO2008097001A1 (en) | 2007-02-05 | 2008-08-14 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting/receiving variable-sized packet in a mobile communication system |
EP2026491A1 (en) * | 2007-08-13 | 2009-02-18 | Panasonic Corporation | Soft-buffer management of a re-transmission protocol for unicast and multicast transmissions |
WO2010032314A1 (en) * | 2008-09-19 | 2010-03-25 | 富士通株式会社 | Communication system, communication device, communication method, and communication program |
US8751890B2 (en) | 2008-12-18 | 2014-06-10 | Unwired Planet, Llc | Dynamic HARQ buffer management |
JP5521511B2 (en) * | 2009-11-27 | 2014-06-18 | 村田機械株式会社 | Network equipment |
KR20140023259A (en) | 2010-11-05 | 2014-02-26 | 블랙베리 리미티드 | Harq soft bit buffer partitioning for carrier aggregation |
US8797957B2 (en) * | 2010-11-12 | 2014-08-05 | Telefonaktiebolaget Lm Ericsson (Publ) | Terminal, network node, system and methods for soft buffer handling in carrier aggregation |
US8885525B2 (en) * | 2011-08-24 | 2014-11-11 | Industrial Technology Research Institute | Method and apparatus for soft buffer partitioning in time-division duplexing system |
US9565140B2 (en) | 2013-10-11 | 2017-02-07 | Mediatek, Inc. | HARQ memory space management for LTE carrier aggregation |
WO2016032077A1 (en) * | 2014-08-25 | 2016-03-03 | Lg Electronics Inc. | Method and apparatus for scheduling request in a wireless communication system |
US9819454B2 (en) | 2014-12-11 | 2017-11-14 | Nxp Usa, Inc. | Wireless communication apparatus and method for HARQ buffer management |
WO2016193793A1 (en) | 2015-06-05 | 2016-12-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Dynamic uplink/downlink subframe configuration |
US20170099664A1 (en) | 2015-10-01 | 2017-04-06 | Nokia Solutions And Networks Oy | Method, apparatus and computer program for transmission scheduling |
EP3474475A4 (en) | 2016-06-20 | 2019-06-26 | NTT Docomo, Inc. | User terminal and wireless communication method |
WO2018174473A1 (en) | 2017-03-19 | 2018-09-27 | 엘지전자 주식회사 | Method and apparatus for transmitting uplink transport block in wireless communication system |
-
2019
- 2019-10-28 WO PCT/KR2019/014305 patent/WO2020085886A1/en active Application Filing
- 2019-10-28 US US16/665,607 patent/US11010292B2/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060069898A1 (en) * | 2004-09-30 | 2006-03-30 | Mehul Patel | Memory manager for an embedded system |
US20080162856A1 (en) * | 2006-12-29 | 2008-07-03 | Motorola, Inc. | Method for dynamic memory allocation on reconfigurable logic |
US20090059801A1 (en) * | 2007-08-28 | 2009-03-05 | Beceem Communications, Inc. | Managing storage of HARQ packets |
US20100272033A1 (en) * | 2009-04-28 | 2010-10-28 | Jong-Kae Fwu | Harq buffer management and feedback design for a wireless system |
US20180139743A1 (en) * | 2013-07-26 | 2018-05-17 | Lg Electronics Inc. | Method for transmitting signal for mtc and apparatus for same |
US20170264404A1 (en) * | 2014-11-26 | 2017-09-14 | Huawei Technologies Co., Ltd. | Wireless Communication Method, Device and System |
US20200052824A1 (en) * | 2017-02-27 | 2020-02-13 | Ipcom Gmbh & Co. Kg | Feedback with configurable latency |
US20190236001A1 (en) * | 2018-01-31 | 2019-08-01 | Hewlett Packard Enterprise Development Lp | Shared fabric attached memory allocator |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2022544728A (en) * | 2020-07-15 | 2022-10-21 | 太倉市同維電子有限公司 | HARQ transmission apparatus and transmission method based on shared buffer |
JP7304013B2 (en) | 2020-07-15 | 2023-07-06 | 太倉市同維電子有限公司 | HARQ transmission apparatus and transmission method based on shared buffer |
WO2024098640A1 (en) * | 2023-03-31 | 2024-05-16 | Zte Corporation | Bandwidth boosting for downlink & uplink transmission |
Also Published As
Publication number | Publication date |
---|---|
US11010292B2 (en) | 2021-05-18 |
WO2020085886A1 (en) | 2020-04-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11337186B2 (en) | Method and apparatus for control information searching and data information transmission in a communication system | |
US11224050B2 (en) | Method and apparatus for allocating dynamic resources of integrated access and backhaul nodes in wireless communication system | |
US11638285B2 (en) | Method and apparatus for control and data information resource mapping in wireless cellular communication system | |
CN111182641B (en) | Method and device used in user and base station | |
US11838852B2 (en) | Method and apparatus for cell barring in wireless communication system | |
US20200014457A1 (en) | Multi-Layer NOMA Wireless Communication for Repeating Transmission of a Transport Block | |
US11395284B2 (en) | Method and apparatus of indicating alternative resource at collision of configured grants | |
US11743883B2 (en) | Apparatus and method for transmitting/receiving of data in a wireless communication system providing different services | |
CN115298989B (en) | Method, system and apparatus for wireless communication | |
US20160211948A1 (en) | Bundling HARQ Feedback in a Time Division Duplexing Communication System | |
US11647501B2 (en) | Method and apparatus for frequency and time resource allocation for data transmission in wireless communication system | |
US11010292B2 (en) | Method and system for dynamic memory management in a user equipment (UE) | |
JP2021517761A (en) | 5th Generation New Wireless Uplink Multiplexing Supported by Shared Grant Free Transmission | |
CN115843419A (en) | Hierarchical hybrid automatic repeat request across different decoding levels | |
US11785607B2 (en) | Method and apparatus for transmitting control information in wireless cellular communication system | |
US11659582B2 (en) | Method and apparatus for 5G migration in frequency interference combination band | |
WO2022011699A1 (en) | Communication method and sidelink device | |
CN113796141A (en) | In-device conflict handling | |
CN113661762A (en) | Method and apparatus for performing scheduling request | |
CN117083821A (en) | Transmission with repeated uplink channels | |
US20210307057A1 (en) | Method and apparatus to perform autonomous retransmission considering reactivated configured grant | |
US9320034B2 (en) | Systems, methods, apparatuses, and computer program products for coordinating communications between network nodes | |
US20240032056A1 (en) | Method and apparatus for transmitting control information in wireless cellular communication system | |
CN118101141A (en) | Method and device for sending and receiving feedback information | |
CN116939859A (en) | Apparatus and method for processing multicellular schedules |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: SAMSUNG ELECTRONICS CO., LTD., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VANKAYALA, SATYA KUMAR;KUMAR, DHEERAJ;GODAVARTI, SATYA VENKATA UMA KISHORE;AND OTHERS;SIGNING DATES FROM 20191024 TO 20191025;REEL/FRAME:050876/0775 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |