Method performed by a wireless device for processing a corrected transport block
阅读说明:本技术 由无线设备执行的用于处理校正的传输块的方法 (Method performed by a wireless device for processing a corrected transport block ) 是由 A·格罗夫伦 J-F·程 S·帕克瓦尔 D·拉松 于 2018-03-26 设计创作,主要内容包括:在此提供了一种由无线设备(120)执行的用于处理从传输设备(101)接收的第一传输块的方法。第一传输块包括第一组码块。无线设备(120)未成功解码至少第一码块子集。无线设备(120)和传输设备(101)在无线通信网络(100)中操作。无线设备(120)基于第一数量的未成功解码的码块,在无线设备(120)的第一存储器(1111)中确定(802)要分配的第二数量的码块,以存储未成功解码的码块。无线设备(120)还分配(803)所确定的第二数量的码块。然后,无线设备(120)在分配的确定的第二数量的码块中发起(805)存储第一组中未成功解码的码块。(A method performed by a wireless device (120) for processing a first transport block received from a transmitting device (101) is provided. The first transport block includes a first set of code blocks. The wireless device (120) fails to successfully decode at least the first subset of code blocks. The wireless device (120) and the transmitting device (101) operate in a wireless communication network (100). The wireless device (120) determines (802), in a first memory (1111) of the wireless device (120), a second number of code blocks to allocate to store the unsuccessfully decoded code blocks based on the first number of unsuccessfully decoded code blocks. The wireless device (120) also allocates (803) the determined second number of code blocks. The wireless device (120) then initiates (805) storage of unsuccessfully decoded code blocks of the first group among the allocated determined second number of code blocks.)
1. A method performed by a wireless device (120) for processing a first transport block received from a transmitting device (101), the first transport block comprising a first set of code blocks, wherein at least a first subset of code blocks in the first set has not been successfully decoded by the wireless device (120), the first subset comprising at least one first code block, the wireless device (120) and the transmitting device (101) operating in a wireless communication network (100), the method comprising:
-determining (802), in a first memory (1111) of the wireless device (120), a second number of code blocks to be allocated based on a first number of unsuccessfully decoded code blocks in the first subset, to store the unsuccessfully decoded code blocks in the first subset, wherein the first memory (1111) of the wireless device (120) comprises a plurality of code block buffers available for allocation,
-allocating (803) the determined second number of code blocks to store the unsuccessfully decoded code blocks in the first subset, and
-initiating (805) storage of the unsuccessfully decoded code block in the first group in the allocated determined second number of code blocks.
2. The method of claim 1, wherein the method further comprises refraining from storing successfully decoded code blocks of the first group in the first memory (1111) of the wireless device (120).
3. The method of any of claims 1-2, wherein the determining (802) is further based on a category or capability of the wireless device (120) that supports at least one of:
a. a maximum number N of code block buffers included in the plurality of code block buffers available for allocation in the first memory (1111); and
b. a maximum size Kmax of each of the plurality of code chunk buffers.
4. The method of claim 3, wherein the first memory (1111) is divided into a third number of first memory (1111) blocks, according to the maximum size K of each of the plurality of code block buffersmaxSaid third number of first memory (1111) blocks corresponds to a maximum number N of code block buffers.
5. The method of any of claims 1-4, further comprising:
-creating (801) at least one of: a) a first record of which of the plurality of code block buffers are free and which are occupied, b) a second record of hybrid automatic repeat request, HARQ, processes associated with each occupied code block buffer of the plurality of code block buffers, and c) a third record of component carriers associated with each occupied block buffer of the plurality of code block buffers,
-determining (804), based on the first record, whether the determined second number of code blocks is free for allocation in the first memory (1111), and
wherein initiating (805) storage of the unsuccessfully decoded code blocks in the first subset among the determined second number of code blocks is based on a first result of determining whether the determined second code block buffer subset corresponding to the determined second number of code blocks is free, and
-based on storing the unsuccessfully decoded code blocks in the first subset in the first memory (1111), updating (806) at least one of: a) the first record, b) the second record, and c) the third record.
6. The method of claim 5, the method further comprising:
-receiving (807) a retransmission of the unsuccessfully decoded code block in the first subset,
-determining (808) whether the received retransmission belongs to the same HARQ process as the stored first subset,
-performing (809) soft combining of the received retransmission with the stored first subset based on a second result of determining (808) whether the received retransmission belongs to the same HARQ process as the stored first subset; and
-determining (810) whether to store the received retransmission in the first memory (1111) based on whether the soft combined transport block was successfully decoded.
7. The method of claim 5, wherein the determined second subset of code block buffers is determined not to be free for allocation, and one of:
a. the unsuccessfully decoded code blocks in the first subset are not stored in the first memory (1111), and
b. the unsuccessfully decoded code blocks in the first subset are stored in an occupied code block buffer in the first memory (1111).
8. A method performed by a transmitting device (101) serving a wireless device (120), the wireless device (120) and the transmitting device (101) operating in a wireless communication network (100), the method comprising:
-obtaining (1001) a category or capability of the wireless device (120), the category or capability supporting at least one of:
a. a maximum number N of code block buffers included in an allocated plurality of code block buffers in a first memory (1111) available to the wireless device (120); and
b. a maximum size K of each of the plurality of code block buffersmax(ii) a And
-determining (1002) a second maximum number of code blocks to transmit to the wireless device (120) based on the obtained category or capability.
9. The method of claim 8, the method further comprising:
-performing (1003) an adaptation of a radio link between the transmitting device (101) and the wireless device (120) based on the obtained category or capability.
10. A wireless device (120) configured to process a first transport block received from a transmitting device (101), the first transport block configured to include a first group of code blocks, wherein at least a first subset of code blocks of the first group is configured to have not been successfully decoded by the wireless device (120), the first subset configured to include at least one first code block, the wireless device (120) and the transmitting device (101) configured to operate in a wireless communication network (100), the wireless device (120) further configured to:
-determining, in a first memory (1111) of the wireless device (120), a second number of code blocks to be allocated based on a first number of unsuccessfully decoded code blocks in the first subset, to store the unsuccessfully decoded code blocks in the first subset, wherein the first memory (1111) of the wireless device (120) is configured to comprise a plurality of code block buffers available for allocation,
-assigning the second number of code blocks configured to be determined for storing the unsuccessfully decoded code blocks in the first subset, and
-initiating storing of the unsuccessfully decoded code block of the first group in the determined second number of code blocks configured to be allocated.
11. The wireless device (120) of claim 10, wherein the wireless device (120) is further configured to avoid storing successfully decoded code blocks of the first group in the first memory (1111) of the wireless device (120).
12. The wireless device (120) of any of claims 10-11, wherein determining is further based on a category or capability of the wireless device (120), the category or capability further configured to support at least one of:
a. a maximum number N of code block buffers configured to be included in the plurality of code block buffers available for allocation in the first memory (1111); and
b. a maximum size K of each of the plurality of code block buffersmax。
13. The wireless device (120) of claim 12, wherein the first memory (1111) is configured to be divided into a third number of first memory (1111) blocks, according to the maximum size K of each of the plurality of code block buffersmaxSaid third number of first memory (1111) blocks corresponds to said maximum number N of code block buffers.
14. The wireless device (120) of any one of claims 10-13, the wireless device (120) further configured to:
-creating at least one of: a) a first record of which of the plurality of code block buffers are free and which are occupied, b) a second record of hybrid automatic repeat request, HARQ, processes associated with each occupied code block buffer of the plurality of code block buffers, and c) a third record of component carriers associated with each occupied block buffer of the plurality of code block buffers,
-based on the first record, determining whether the second number of code blocks configured to be determined is free for allocation in the first memory (1111), and
wherein initiating storage of the unsuccessfully decoded code block in the first subset among the second number of code blocks configured to determine is configured to: based on a first result of determining whether a second subset of code block buffers configured to determine that correspond to the second number of code blocks configured to determine is free, an
-based on storing the unsuccessfully decoded code blocks in the first subset in the first memory (1111), updating (806) at least one of: a) the first record, b) the second record, and c) the third record.
15. The wireless device (120) of claim 14, the wireless device (120) further configured to:
-receiving a retransmission of the unsuccessfully decoded code block in the first subset,
-determining whether the retransmission configured to be received belongs to the same HARQ process as the first subset configured to be stored,
-performing a soft combining of the retransmission configured to be received with the first subset configured to be stored, based on a second result of the determining whether the retransmission configured to be received belongs to the same HARQ process as the first subset configured to be stored; and
-determining whether to store the retransmission configured to be received in the first memory (1111) based on whether a soft combined transport block was successfully decoded.
16. The wireless device (120) of claim 14, wherein the determined second subset of code block buffers is configured to be determined to be not idle for allocation, and one of:
a. the unsuccessfully decoded code blocks in the first subset are configured not to be stored in the first memory (1111), and
b. the unsuccessfully decoded code blocks in the first subset are configured to be stored in an occupied code block buffer in the first memory (1111).
17. A transmitting device (101) configured to serve a wireless device (120), the wireless device (120) and the transmitting device (101) being configured to operate in a wireless communication network (100), the transmitting device (101) being further configured to:
-obtaining a category or capability of the wireless device (120), the category or capability being configured to support at least one of:
a. a maximum number N of code block buffers included in an allocated plurality of code block buffers in a first memory (1111) available to the wireless device (120); and
b. a maximum size K of each of the plurality of code block buffersmax(ii) a And
-determine a second maximum number of code blocks to transmit to the wireless device (120) based on the category or capability configured to be obtained.
18. The transmission device (101) according to claim 17, further configured to:
-performing an adaptation of a radio link configured between the transmitting device (101) and the wireless device (120) based on the class or capability configured to be obtained.
Technical Field
The present disclosure generally relates to a wireless device and a method performed by the same for processing a first transport block received from a transmitting device. The present disclosure also generally relates to a transmission device and a method performed thereby for providing a first transport block to a wireless device.
Background
A communication device within a wireless communication network may be a wireless device such as, for example, a Station (STA), a User Equipment (UE), a mobile terminal, a wireless terminal, a terminal, and/or a Mobile Station (MS). Enabling wireless devices to communicate wirelessly in a cellular or wireless communication network (sometimes also referred to as a cellular radio system, cellular system, or cellular network). Communication may be performed, for example, between two wireless devices, between a wireless device and a conventional telephone, and/or between a wireless device and a server via a Radio Access Network (RAN), and possibly one or more core networks included within the wireless communication network. The wireless device may be further referred to as a mobile phone, a cellular phone, a laptop computer, or a tablet computer with wireless capabilities, to mention just a few additional examples. A wireless device in the present context may be, for example, a portable, pocket-store, hand-held, computer-comprised, or vehicle-mounted mobile device capable of communicating voice and/or data with another entity, such as another terminal or server, via the RAN.
The communication device may also be a network node, such as a radio network node, e.g. a Transmission Point (TP). The wireless communication network covers a geographical area which may be divided into cell areas, each cell area being served by a network Node, such as a Base Station (BS), e.g. a Radio Base Station (RBS), sometimes also referred to as a gNB, evolved Node B ("eNB"), "eNodeB", "NodeB", "B Node" or BTS (base transceiver station), depending on the technology and terminology used. Based on the transmission power and thus also on the cell size, the base stations may have different categories, such as e.g. wide area base stations, medium range base stations, local area base stations and home base stations. A cell is a geographical area where radio coverage is provided by a base station at a base station site. One base station located at a base station site may serve one or several cells. In addition, each base station may support one or several communication technologies. The wireless communication network may also be a non-cellular system including network nodes that may employ a service beam to serve receiving nodes such as wireless devices. In third generation partnership project (3GPP) Long Term Evolution (LTE), a base station, which may be referred to as an eNodeB or even an eNB, may be directly connected to one or more core networks. In the context of the present disclosure, the expression Downlink (DL) may be used for the transmission path from the base station to the wireless device. The term Uplink (UL) may be used for the transmission path in the opposite direction, i.e. from the wireless device to the base station.
The standardization organization 3GPP is currently in the process of specifying a new radio interface called NR or 5G-UTRA and a fifth generation (5G) packet core network (which may be referred to as a next generation core network, abbreviated NG-CN, NGC or 5G CN). An understanding of the various concepts currently relevant to this work may be based on the input of 3GPP TS 23.799v1.1.0 and will be outlined below.
Initial high-level architecture view
Fig. 1 is a schematic diagram of the current high-level architecture of a system according to the next generation (also referred to as a next generation system). The high-level architecture may be used herein as a reference model. Fig. 1 shows NextGen UE, NextGen (r) AN, NextGen Core (that is, the Core network of the next generation system) and their reference points.
Whether and possibly how NextGen UEs can interact with NextGen Core is currently preparing for further research.
The reference points in the next generation system may be as follows:
NG 2: reference points for the control plane between NextGen (R) AN and NextGen Core.
NG 3: NextGen (R) A user plane reference point between NextGen Core and NextGen AN.
NG 1: reference point of the control plane between NextGen UE and NextGen Core.
NG 6: it is the reference point between the NextGen Core and the data network. The data network may be an operator, an external, public or private data network or an operator internal data network, e.g. for providing IP Multimedia Services (IMS) services. This reference point corresponds to the SGi used for 3GPP access.
The 5G RAN may include base stations that support evolved LTE and/or New Radio (NR) radio access. The new 5G base station is called the gbb.
The 5G system is expected to support the deployment in the virtualization environment and introduce the support for the expansion of the network function instance; and dynamically adding or removing network function instances.
In modern high data rate communication systems, a large number of data bits may be transmitted at a time in Transport Blocks (TBs). To achieve faster transmission, a codec may be used. A codec may be understood as a device or program that may achieve faster data transmission by compressing data to be transmitted or decompressing received data. Since it is impractical to implement a channel codec of a large block length, it may be necessary to divide a large TB into a plurality of small cells called Code Blocks (CBs). This process is schematically illustrated in fig. 2 by way of a non-limiting example, which depicts the division of a TB into three CBs: CB1, CB2 and CB 3. Then, each CB may be encoded, e.g., turbo encoded, and independently decoded. The number of CBs may vary from one transport block to another based on, for example, the size of the transport block.
In modern hybrid automatic repeat request (HARQ) protocols, incremental redundancy may be used. Instead of retransmitting the same part of the codeword, different redundancy versions may be retransmitted, resulting in additional gain on Chase combining, each retransmission being understood to contain the same information in each combination. Ideally, there should be a complete buffer at the receiver so that the soft values received for the entire codeword can be stored. However, soft buffer size in a terminal is limited due to terminal complexity and cost issues. For higher rate transmissions, where a large codeword may be sent from the transmitter, the UE may have only a limited buffer and may not be able to store the complete codeword. Thus, the eNB and terminal may need to have the same knowledge about the soft buffer size, since otherwise the eNB may transmit coded bits that the UE may not be able to store or worse, it may not know that these bits are other bits, and may confuse them with the bits it stores. Fig. 3 is a diagram illustrating coded transport blocks and coded bits (that is, the size of a soft buffer) stored by a terminal. Fig. 3 depicts a simplified diagram of a complete codeword, and how many soft bits the terminal may be able to store. As shown, the coded transport block includes systematic bits and parity bits, which together result in a full codeword size. The systematic bits may contain information bits that enter the channel encoder. Parity bits may be understood as bits that may be added to systematic bits to facilitate error detection. Fig. 3 also depicts that the size of the soft buffer is not large enough to store the complete codeword.
If the eNB and terminal have the same knowledge about the soft buffer size, the eNB may never transmit coded bits that the terminal may not be able to store. Instead, it may take only those coded bits stored by the terminal and may use those bits for transmission or retransmission. This can be described by the circular buffer shown in fig. 4. Fig. 4 is a schematic diagram showing how the bits used in the first transmission and retransmission are derived from the circular buffer. The size of the circular buffer is matched to the size of the soft buffer of the terminal. It can be noted that a complete cycle corresponds to the size of the soft buffer, rather than the entire codeword. The design objective behind this circular buffer procedure can be understood as that the underlying channel encoder may only produce a certain number of coded bits. When several retransmissions require more bits than a certain number of bits, some of these bits may need to be reused. In the first transmission, some or all of the systematic bits may be transmitted, and there may be no transmission, or some parity bits may be transmitted, depending on the coding rate. In retransmission, the starting position may be changed and bits corresponding to another portion of the circumference may be transmitted. Soft bit
In LTE, a method may be used by which the soft buffer may be statically partitioned evenly over the HARQ process. It is also understood that there may be only one HARQ process associated with a TB. In addition, limited buffer rate matching may be used to reduce soft requirements by allowing only a subset of the coded channel bits to be candidates for retransmission for a transport block of a particular size. Rate matching may be understood as a part of the baseband processing so that the number of bits in a Transport Block (TB) may match the number of bits that may be transmitted in a given allocation. When the Physical Downlink Shared Channel (PDSCH) transmission mode is not mode 3, 4 or 8, soft buffer allocation for single layer transmission mode in Rel-8LTE is as shown in fig. 5. In this diagram, each block represents a soft buffer for a HARQ process, denoted as "SB" followed by a number. It can be observed that there is a buffer reserved for each transport block of the HARQ process. The soft buffer allocation for the multi-layer transmission mode is shown in fig. 6. Fig. 6 is a diagram illustrating soft buffer allocation in Rel-8LTE when a PDSCH transmission mode is mode 3, 4 or 8. Also in this schematic diagram, each block represents a transport block. Each of the soft buffers is divided into two different frames, one for each of the two different transport blocks, which are represented for each of the rows in the frame. Transport blocks may be transmitted over multiple layers. The soft buffer allocated to each of the transport blocks is denoted as "SB" followed by a number and a letter. For each number, software with a different letter a or b is assigned to the transport blocks in each layer, respectively. It can be observed that, as shown in fig. 5, the buffer reserved for each transport block is only half of the previous working case. It can be appreciated that the soft buffer restriction problem is particularly acute in MIMO transmission operations. This can be understood because the soft buffer per transport block is only half the size when not used in MIMO transmission. This limitation reduces the effectiveness of soft combining gain from incremental redundancy retransmissions because soft buffer size limitations do not allow as much redundant transmission to be stored.
The cost of the soft buffer is a significant cost for the UE. Thus, existing methods for soft buffer management may result in significantly high cost UEs, or poor performance of HARQ processes.
Disclosure of Invention
It is an object of embodiments herein to improve handling of soft buffers in a wireless device.
According to a first aspect of embodiments herein, the object is achieved by a method performed by a wireless device. The method is for processing a first transport block received from a transmitting device. The first transport block includes a first set of code blocks. The wireless device fails to successfully decode at least the first subset of code blocks in the first group. The first subset includes at least one first code block. The wireless device and the transmitting device operate in a wireless communication network. The wireless device determines a second number based on the first number of unsuccessfully decoded code blocks in the first subset. The second number is a number of code blocks to be allocated in a first memory of the wireless device for storing unsuccessfully decoded code blocks in the first subset. The first memory of the wireless device includes a plurality of code block buffers available for allocation. The wireless device allocates the determined second number of code blocks for storing unsuccessfully decoded code blocks in the first subset. The wireless device then initiates storage of unsuccessfully decoded code blocks in the first group among the assigned determined second number of code blocks.
According to a second aspect of this embodiment, the object is achieved by a method performed by a transmitting device. The transmitting device serves the wireless device. The wireless device and the transmitting device operate in a wireless communication network. The transmitting device obtains the class or capabilities of the wireless device. The categories or capabilities support at least one of: a) a maximum number N of code block buffers included in the allocated plurality of code block buffers in the first memory available to the wireless device; and b) a maximum size K of each of the plurality of code block buffersmax. The transmitting device then determines a second maximum number of code blocks to transmit to the wireless device based on the obtained category or capability.
According to a third aspect of embodiments herein, the object is achieved by a wireless device configured to process a first transport block received from a transmitting device. The first transport block is configured to include a first group of code blocks, wherein at least a first subset of the code blocks in the first group is configured to have not been successfully decoded by the wireless device. The first subset is configured to include at least one first code block. The wireless device and the transmitting device are configured to operate in a wireless communication network. The wireless device is further configured to determine a second number based on the first number of unsuccessfully decoded code blocks in the first subset. The second number is a number of code blocks to allocate in a first memory of the wireless device to store unsuccessfully decoded code blocks in the first subset. The first memory of the wireless device is configured to include a plurality of code block buffers available for allocation. The wireless device is further configured to assign a second number of code blocks configured to determine unsuccessfully decoded code blocks stored in the first subset. The wireless device is further configured to initiate storage of unsuccessfully decoded code blocks in the first group among the determined second number of code blocks configured to be allocated.
According to a fourth aspect of embodiments herein, the object is achieved by a transmitting device configured to serve a wireless device. The wireless device and the transmitting device are configured to operate in a wireless communication network. The transmitting device is further configured to obtain a class or capability of the wireless device. The category or capability is configured to support at least one of: a) a maximum number N of code block buffers included in a plurality of code block buffers available for allocation in a first memory of the wireless device; b) maximum size K of each of a plurality of code block buffersmax. The transmitting device is further configured to determine a second maximum number of code blocks to transmit to the
By the wireless device determining the second number of code blocks to allocate based on the first number of unsuccessfully decoded code blocks in the first subset, the first wireless device can process the first memory in a dynamic manner and can reduce the overall size of the first memory (e.g., soft buffer). Further, the cost of the wireless device (e.g., UE) may also be reduced. Furthermore, by specifying the number of code blocks that the wireless device may need to store rather than the number of soft bits, the computational complexity involved in processing the first memory is reduced by, for example, enabling simplified mapping of stored information in the first memory to records maintained on the storage device.
The transmitting device may also facilitate these advantages by determining a second maximum number of code blocks to transmit to the wireless device and/or performing link adaptation based on the category of the wireless device. This may be understood because overflow may be avoided by, for example, never exceeding the maximum number of code blocks that the wireless device may be able to store.
Drawings
Examples of embodiments herein are described in more detail with reference to the accompanying drawings and from the following description.
FIG. 1 is a schematic diagram showing an initial high-level architectural view of the NextGen system according to prior methods.
Fig. 2 is a schematic diagram illustrating division of a transport block into Code Blocks (CBs).
Fig. 3 is a diagram illustrating encoded transport blocks and encoded bits stored by a terminal according to a soft buffer size.
Fig. 4 is a schematic diagram showing bits used in a first transmission and a retransmission derived from a circular buffer.
Fig. 5 is a diagram illustrating soft buffer allocation in Rel-8LTE when the PDSCH transmission mode is not mode 3, 4 or 8.
Fig. 6 is a diagram illustrating soft buffer allocation in Rel-8LTE when a PDSCH transmission mode is mode 3, 4 or 8.
Fig. 7 is a schematic diagram illustrating two non-limiting examples in a) and b), respectively, of a wireless communication network according to embodiments herein.
Fig. 8 is a flow chart depicting a method in a wireless device according to embodiments herein.
Fig. 9 is a flow chart depicting a non-limiting example of a method in a wireless device according to embodiments herein.
Fig. 10 is a flow chart depicting an embodiment of a method in a transmitting device according to embodiments herein.
Fig. 11 is a schematic block diagram illustrating an embodiment of a wireless device according to embodiments herein.
Fig. 12 is a schematic block diagram illustrating an embodiment of a transmission apparatus according to embodiments herein.
Detailed Description
As part of the development of the embodiments herein, the problems of the prior methods will first be identified and discussed.
Existing methods rely on the UE being able to store at least a part of all code blocks in all HARQ processes, assuming a maximum code block size. Under most operating conditions with a block error rate of 10-30%, the probability that all HARQ processes require retransmission is slight. Then, most of the soft buffer will not be used. Also, the UE cost will be unnecessarily high.
Further, the following problems may also be identified in the existing methods. First, the soft buffer may not be shared across HARQ processes. That is, in the existing method, the division of the soft buffer is done per HARQ process, where each HARQ process is allocated a fixed number of CBs. In addition, the entire TB is stored, including the successful bits and the unsuccessful bits. If a given HARQ process requires more soft buffer memory for storage than is allocated to it, it may not use the soft buffer that has been reserved or allocated to another HARQ process.
Second, for large transport block sizes, there is limited use of incremental redundancy. In other words, due to the fixed soft buffer size allocated to the HARQ process, depending on the size of the TB, incremental redundancy may not be used because there may not be enough soft buffer for it.
Again, specifying a common soft buffer in the stored number of bits may result in slight differences in rate matching, depending on the combination of the number of layers and carriers that need to be cared for when defining UE capabilities to ensure consistent behavior across classes.
To address these issues, several embodiments are included herein. As an overview, embodiments herein may be understood to relate to soft buffer management or processing. In particular, embodiments herein may be understood to relate to dynamic processing of soft buffers. Embodiments herein may relate to any of the NR, L1/L2 protocols relating to HARQ and soft buffer handling. Particular embodiments herein may relate to soft buffer management in NRs.
As an overview, the embodiments herein may be understood as related to what is done in existing approaches, rather than defining a total soft buffer size and a fixed division of the soft buffer size across HARQ processes, the UE may be required to have the capability to store a specified number of maximum size code blocks in the soft buffer. That is, according to embodiments herein, instead of a static allocation for each HARQ process, the allocation may be flexibly performed for each code block independently of the HARQ process, so a given HARQ process may be allocated a soft buffer it may need, e.g., if it corresponds to a large TB. The number of code blocks may be set so that the UE can handle typical operation points. The behavior of the UE may be left to the UE implementation when the empty code block is exhausted.
Any reference herein to a UE may be understood as an illustrative example of a wireless device.
Embodiments will now be described more fully hereinafter with reference to the accompanying drawings, in which examples are shown. In this section, embodiments herein will be illustrated in more detail by a number of exemplary embodiments. It should be noted that the exemplary embodiments herein are not mutually exclusive. Components from one embodiment may be assumed to be present in another embodiment by default, and it will be apparent to those skilled in the art how those components may be used in other exemplary embodiments.
Note that although terminology from 5G has been used in this disclosure to illustrate embodiments herein, this should not be taken as limiting the scope of embodiments herein to only the above-described system. Other wireless systems, including 3GPP LTE, may also benefit from the concepts covered within this disclosure.
Fig. 7 depicts two non-limiting examples in panels a) and b), respectively, of a
The
The
A plurality of wireless devices are located in the
Network node 110 may be a serving wireless network node for
In general, the use of "first" and/or "second" herein may be understood as any manner of representing different elements or entities, and may be understood as not imparting cumulative or chronological characteristics to the terms they modify.
Several embodiments are included herein. It should be noted that the examples herein are not mutually exclusive. Components from one embodiment may be assumed to be present in another embodiment by default, and it will be apparent to those skilled in the art how those components may be used in other exemplary embodiments.
More specifically, the following are: a) embodiments related to wireless devices such as wireless device 120 (e.g., UE), and b) embodiments related to transmission devices such as network node 110. Some non-limiting examples may be employed to describe embodiments herein. In the following description, any reference to a/gNB may be understood as relating to the transmitting device 101 as the network node 110; and any reference to a/the UE may be understood as relating to the
An embodiment of the method performed by the
The method may include the acts described below. Several embodiments are included herein. In some embodiments, all actions may be performed. In some embodiments, one or more actions may be performed. One or more embodiments may be combined, if applicable. For simplicity of description, not all possible combinations are described. It should be noted that the examples herein are not mutually exclusive. Components from one example may be assumed by default to be present in another example, and it will be apparent to those skilled in the art how those components may be used in other examples. In fig. 8, optional actions are indicated with dashed lines. Some actions may be performed in a different order than shown in fig. 8.
The actions of the method described herein may be understood as aiming at optimizing the management of the soft buffer such that it can flexibly adapt to the size of the received TB and such that it can exploit incremental redundancy even for large capacity TBs. Embodiments herein may be understood to be arranged in the context where a wireless device 120 (e.g., a UE) may divide its soft buffer into a number of memory blocks corresponding to the number of largest-sized code blocks given by the specification (e.g., the number of largest-sized code blocks "N"). In an advantageous implementation, any reasonable partitioning is possible. Better granularity may mean that smaller code blocks may occupy less space and may further reduce the risk of overflow, but may come at the cost of higher complexity in buffer handling. Thus,
Thus, each of the first record, the second record, and the third record may be, for example, a table or an entry in a table.
Idle may be understood as empty or unoccupied. Occupancy may be understood as including stored information, such as code blocks or soft bits.
The component carrier may be, for example, one of the
During communication in the
Determining may be understood as e.g. calculating. In other words, in this
The
In some embodiments, the
In light of the foregoing, in some examples, each category (e.g., UE category) of the
An example of LTE with an assumed same memory size may be one where for each UE category 1-5 listed in the first column, the maximum number of supported layers in DL for spatial multiplexing is shown in the furthest column to the right, corresponding to each UE category listed. Accordingly, for each UE category, the maximum number of downlink shared channel (DL-SCH) transport block bits that can be received within the Transmission Time Interval (TTI) of all layers is shown in the second column, and the maximum number of DL-SCH transport block bits that can be received within the TTI of each layer is shown in the third column. The total number of code blocks stored for each UE category is also shown in the fourth column.
Further, according to the examples herein, in 3GPP TS 38.213 or 3GPP TS 38.214, a similar section to section 7.1.8 in 36.213 may be used, replacing the formula with "the UE should store the received information with a size of KmaxSoft channel bits "corresponding to the minimum M code blocks, where M is given as 38.306.
In some examples, to encourage more advanced UEs to which the
for UEs without dynamic sharing between carriers, the soft buffer may have a size of N code blocks
For UEs that share dynamically between carriers, the soft buffer may have a size of M < C · N, where C is the number of supported carriers.
Dynamic sharing may be understood as a non-fixed adaptive sharing of soft buffers between different HARQ processes and different carriers.
In some embodiments, the
Once the
Act 804
In this act 804, the
Determining 804 whether the determined second number of code blocks is free for allocation in the
The determination in act 804 may be based on the first record.
In this
Initiating storage may be understood herein as storing or enabling, triggering or starting storage. The initiating storage of this
The unsuccessfully decoded code blocks in the first subset may be understood as being stored in a second subset of code block buffers in the
In one implementation, the
In another implementation, in the case of multiple code blocks in a transport block, the
In some embodiments, the
All correct code blocks may be stored, for example, in the memory 1110, or in a separate memory (e.g., a second memory) separate from the memory 1110. For the correct code block, the
In some embodiments, among the determined second number of code blocks, storage of unsuccessfully decoded code blocks in the first subset may be initiated in
In some embodiments, the determined second number of code blocks may be determined to be not free for allocation, that is, the determined second subset of code block buffers may be determined to be not free for allocation. In such embodiments, one of the following may occur: a) unsuccessfully decoded code blocks in the first subset may not be stored in the
In other words, when a new TB arrives, the
In this
For example, updating may be understood herein as adding, modifying, or removing entries in any record (e.g., in any table).
In this
After receiving the retransmission in
The determination in
When a retransmission arrives, the
Potentially, the
If the retransmission is successful, the
Fig. 9 is a flow chart illustrating a non-limiting example of the method performed by the
An embodiment of the method performed by the transmitting device 101 will now be described with reference to the flowchart depicted in fig. 10. The transmitting device 101 may be understood to serve the
In some embodiments, all actions may be performed. In some embodiments, some actions may be performed. One or more embodiments may be combined, if applicable. It should be noted that the examples herein are not mutually exclusive. Components from one example may be assumed by default to be present in another example, and it will be apparent to those skilled in the art how those components may be used in other examples. For simplicity of description, not all possible combinations are described. In fig. 10, optional actions are indicated with dashed lines. Some actions may be performed in a different order than shown in fig. 10.
Regarding the actions described for the
By taking into account the characteristics of the
Obtaining can be understood as any of the following: determined from memory, retrieved from memory, or received from the
In this
The determination may be understood as being calculated from, retrieved from, or received from the
The determination in this
The second maximum number may be considered to be the same maximum number, e.g., N, of code block buffers included in the plurality of code block buffers allocated in the
Alternatively or additionally, overflow may be avoided by adjusting link adaptation to reduce the likelihood of retransmissions.
In this
As a general view of the foregoing, in other words, embodiments herein may be understood as relating to specifying the number of code blocks that the UE needs to store rather than specifying the number of soft bits.
Similar to act 1002, by performing this
An advantage of embodiments herein is that by dynamic processing of switching to soft buffers, the overall soft buffer size can be reduced and thus the UE cost can be reduced.
To perform the method acts described above with respect to fig. 8 and/or 9,
With regard to the actions described for the
In fig. 11, the optional modules are indicated by dashed boxes.
The
In some embodiments, the determination may be further based on a category or capability of the
The
The
The
In some embodiments, the
In some embodiments, the
In some embodiments, the code block that initiates unsuccessful decoding stored in the first subset is configured to, among the second number of code blocks configured to be determined: based on a first result of determining whether a second subset of code block buffers configured to determine that correspond to the second number of code blocks configured to determine is free.
In some embodiments, the
In some embodiments, the
In some embodiments, the
In some embodiments,
In some embodiments, the
In some embodiments, wherein the determined second subset of code chunk buffers is configured to be determined to be not idle for allocation, one of the following is applicable: a) the unsuccessfully decoded code blocks in the first subset may be configured to be not stored in the
In some embodiments, the
The embodiments herein may be implemented by one or more processors (such as the
The
In some embodiments,
Those skilled in the art will also appreciate that any of
Further, in some embodiments, the
Thus, methods according to embodiments described herein for the
Accordingly, embodiments herein also relate to a
The
The transmission apparatus 101 may include the following arrangement depicted in fig. 12.
To perform the method acts described above with respect to fig. 10, the transmitting device 101 may include the following arrangement depicted in fig. 12. The transmitting device 101 is configured to serve the
With regard to the actions described for the transmitting device 101, some of the detailed description below corresponds to the same references provided above and will therefore not be repeated here. For example, the category of the
In fig. 12, the optional modules are indicated by dashed boxes.
The transmitting device 101 is configured to obtain the class or capabilities of the
The transmitting device 101 is further configured to determine a second maximum number of code blocks to transmit to the
In some embodiments, the transmitting device 101 may be configured to perform the adaptation of the radio link configured between the transmitting device 101 and the
Embodiments herein may be implemented by one or more processors (such as
The transmitting device 101 may further comprise a
In some embodiments, transmitting device 101 may receive information from
The
Those skilled in the art will also appreciate that the obtaining
Also, in some embodiments, the various modules 1201-1204 described above may be implemented as one or more applications running on one or more processors (such as processor 1205).
Thus, the method according to embodiments described herein for the transmitting device 101 may be implemented by means of a
Thus, embodiments herein also relate to a transmitting device 101 operable to serve a
The transmitting device 101 may include an interface unit to facilitate communication between the transmitting device 101 and other nodes or devices (e.g., wireless device 120) or any other nodes. In some particular examples, the interface may include, for example, a transceiver configured to transmit and receive wireless signals over an air interface according to a suitable standard.
When the word "comprising" or "including" is used, it is to be construed as non-limiting, i.e., meaning "consisting of at least … …".
The embodiments herein are not limited to the preferred embodiments described above. Various alternatives, modifications, and equivalents may be used. Therefore, the above embodiments should not be construed as limiting the scope of the invention.
The term module is understood here to be equivalent to the term unit.
The term processor may be understood to refer to a hardware component, such as a processing circuit.
- 上一篇:一种医用注射器针头装配设备
- 下一篇:数据传输中的不一致数据的检测