Method for transmitting and receiving a physical shared channel based on harq in a wireless communication system and apparatus therefor
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- LG ELECTRONICS INC
- Filing Date
- 2021-07-12
- Publication Date
- 2026-07-07
AI Technical Summary
In existing technologies, when polar codes support incremental redundancy HARQ in wireless communication systems, there are problems such as variations in the mother code size and inconsistent data bit arrangement, leading to codeword decoding errors and unnecessary retransmission signaling overhead.
By allocating bit channel indexes and redundancy version information based on polar codes in a wireless communication system, initial and retransmission codewords are generated, ensuring the reliability of data blocks and the correct combination of redundancy versions, and supporting incremental redundancy HARQ of polar codes.
It improves the reliability of system performance and reduces erroneous operations caused by PDCCH errors, reduces signaling overhead and UE power consumption, and optimizes the signal transmission process.
Smart Images

Figure CN117616712B_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to a method and apparatus for transmitting and receiving a physical shared channel based on HARQ in a wireless communication system. Background Technology
[0002] A mobile communication system has been developed to provide voice services while ensuring user activity. This system has expanded its services from voice to data. The current rapid growth of data services is consuming resources, and user demand for higher data rate services is driving the need for more advanced mobile communication systems.
[0003] The requirements for next-generation mobile communication systems must be able to handle the explosive growth in data traffic, the dramatic increase in transmission rates per user, the significant increase in the number of connected devices, and support for very low end-to-end latency and high energy efficiency. To this end, various technologies have been investigated, such as dual connectivity, massive MIMO, in-band full-duplex, non-orthogonal multiple access (NOMA), ultra-wideband, and device networking. Summary of the Invention
[0004] This disclosure presents a method and apparatus for transmitting signals based on HARQ. Polar codes are only used for control data transmission in the NR standard and do not support HARQ. To use polar codes for data transmission in 6G systems, it is necessary to support HARQ.
[0005] In the case of the Incremental Freezing (IF) HARQ method, the channel index of the bit allocated to the data bits changes. Therefore, after decoding the codewords based on the retransmission reception, the codewords based on the retransmission reception and the codewords based on the first transmission reception can be combined.
[0006] In the case of Incremental Redundancy (IR) HARQ, when a retransmitted codeword is received, a combination operation can be performed without decoding the codeword. Therefore, IF HARQ does not significantly improve system performance compared to IR HARQ.
[0007] Simultaneously, to support IR HARQ, the characteristic that the codeword generated for the initial transmission must be included in the codeword generated for retransmissions must be satisfied. In this respect, the size of the polarity code used for retransmissions (the master code size) can differ from the size of the polarity code used for the initial transmission. In this case, since data bits are allocated according to the bit channel index determined by the reliability of the polarity encoder, the problem may arise where the codeword generated for the initial transmission is not included in the codeword generated for retransmissions.
[0008] This disclosure proposes a method to address the aforementioned issues in supporting polarity-based IR HARQ.
[0009] Furthermore, if the UE fails to receive the PDCCH for scheduling the initial transmission when supporting polarity code-based IR-HARQ for data transmission, the following problems may occur: i) or ii).
[0010] i) The mother code size used by the base station and the mother code size expected by the UE change.
[0011] ii) Even if the mother code size desired by the UE is the same as the mother code size used to generate the codeword, the arrangement of data bits within the codeword generated based on the copy operation that depends on retransmission is different from the arrangement of data bits desired by the UE.
[0012] In i) and ii) above, the UE performing codeword decoding determines that an error has occurred, even if the codeword is received normally without error. Subsequently, unnecessary signaling overhead occurs because the UE repeatedly requests retransmission from the base station.
[0013] This disclosure provides a signal transmission method for solving the above-mentioned problems.
[0014] The technical objectives to be achieved by this disclosure are not limited to those described above by way of example only, and other technical objectives not mentioned can be clearly understood by those skilled in the art from the following description.
[0015] A method for a user equipment (UE) to receive a physical downlink shared channel (PDSCH) in a wireless communication system according to embodiments of the present disclosure includes: receiving downlink control information (DCI) that schedules the PDSCH and receiving the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0016] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0017] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0018] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0019] DCI includes i) information indicating the size of the polar code associated with PDSCH, ii) information indicating whether one or more fourth-bit channel indices are used to generate the codeword associated with PDSCH, and iii) information indicating the redundant version (RV) associated with PDSCH.
[0020] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0021] One or more values determined based on the magnitude of the polar code associated with PDSCH can be associated with one or more specific positions within a circular buffer, into which the codeword associated with PDSCH is input.
[0022] One or more specific positions may be associated with at least one of i) the first bit channel index of the lower polar subcode of the polar code associated with PDSCH or ii) the first bit channel index of the upper polar subcode of the polar code associated with PDSCH.
[0023] One or more values determined based on the polar code size associated with PDSCH can be determined based on the size of the first polar code and the number of bits representing the information of RV.
[0024] Based on the fact that the size of the second polarity code is greater than the size of the first polarity code and the size of the data block is greater than or equal to a specific value, the one or more second-bit channel indices may further include the one or more fourth-bit channel indices.
[0025] A specific value can be determined based on the order of the bit channel indices with the highest reliability value among the bit channel indices belonging to the lower polarity subcode of the second polarity code, and this order can be defined as the order of reliability values based on all bit channel index ranges of the second polarity code.
[0026] One or more fourth-bit channel indices can be determined based on the number of one or more third-bit channel indices and the size of the data block.
[0027] One or more fourth-bit channel indices may be based on a specific number of bit channel indices determined within a specific range of the second polar code. This specific range may be based on a range of bit channel indices of the second polar code that excludes specific bit channel indices determined based on the size of the data block and the order of reliability.
[0028] A specific number of bit channel indices can be determined based on a reliability-based order among bit channel indices based on a specific range of upper polarity subcodes.
[0029] A specific quantity can be based on the number of one or more third-bit channel indices.
[0030] A user equipment (UE) receiving a physical downlink shared channel (PDSCH) in a wireless communication system according to another embodiment of this disclosure includes: one or more transceivers, one or more processors configured to control the one or more transceivers, and one or more memories operatively connected to the one or more processors. The one or more memories are configured to store instructions that, based on execution by the one or more processors, allow the one or more processors to perform operations.
[0031] The operation includes: receiving downlink control information (DCI) that schedules the PDSCH and receiving the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0032] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0033] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0034] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0035] The DCI includes: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate the codeword associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0036] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0037] A method for transmitting a Physical Downlink Shared Channel (PDSCH) in a wireless communication system according to another embodiment of this disclosure includes: transmitting downlink control information (DCI) for scheduling the PDSCH and transmitting the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0038] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0039] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0040] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0041] The DCI includes: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate the codeword associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0042] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0043] A base station (BS) transmitting a Physical Downlink Shared Channel (PDSCH) in a wireless communication system according to another embodiment of this disclosure includes: one or more transceivers, one or more processors configured to control the one or more transceivers, and one or more memories operatively connected to the one or more processors. The one or more memories are configured to store instructions that, based on execution by the one or more processors, allow the one or more processors to perform operations.
[0044] The operation includes: sending downlink control information (DCI) to schedule the PDSCH and sending the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0045] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0046] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0047] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0048] The DCI includes: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate the codeword associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0049] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0050] An apparatus according to another embodiment of the present disclosure includes one or more memories and one or more processors operatively connected to the one or more memories.
[0051] The one or more memories are configured to store instructions that, based on execution by the one or more processors, allow the one or more processors to perform operations.
[0052] The operation includes: receiving downlink control information (DCI) for scheduling the physical downlink shared channel (PDSCH), and receiving the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0053] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0054] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0055] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0056] The DCI includes: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether one or more fourth-bit channel indices are used to generate the codeword associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0057] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0058] One or more instructions are stored in one or more non-transitory computer-readable media according to another embodiment of the present disclosure.
[0059] The one or more instructions are configured to allow one or more processors to perform operations based on execution by the one or more processors.
[0060] The operation includes: receiving downlink control information (DCI) for scheduling the physical downlink shared channel (PDSCH) and receiving the PDSCH based on the DCI. The PDSCH is associated with codewords generated based on polar codes.
[0061] The transmission based on PDSCH is the initial transmission, and PDSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel index of the first polarity code, allocated to the data block associated with the PDSCH, are used to generate the first codeword.
[0062] PDSCH-based transmission is a retransmission, and the PDSCH is associated with a second codeword generated based on the second polarity code. One or more second-bit channel indices allocated to the data block from the second polarity code's bit channel index are used to generate the second codeword.
[0063] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices also include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0064] The DCI includes: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate the codeword associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0065] The information representing RV represents one of one or more values determined based on the size of the polar code associated with PDSCH, and the one or more values determined based on the size of the polar code associated with PDSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PDSCH or ii) the starting point of the upper polar subcode of the polar code associated with PDSCH.
[0066] A method for transmitting a Physical Uplink Shared Channel (PUSCH) in a wireless communication system according to another embodiment of this disclosure includes: receiving downlink control information (DCI) for scheduling the PUSCH and transmitting the PUSCH based on the DCI. The PUSCH is associated with codewords generated based on polar codes.
[0067] The PUSCH-based transmission is the initial transmission, and the PUSCH is associated with a first codeword generated based on a first polarity code. One or more first bit channel indices from the bit channel indexes of the first polarity code, allocated to the data block associated with the PUSCH, are used to generate the first codeword.
[0068] PUSCH-based transmission is a retransmission, and the PUSCH is associated with a second codeword generated based on the second polarity code. One or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code are used to generate the second codeword.
[0069] The one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0070] The DCI includes: i) information indicating the size of the polar code associated with the PUSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate the codeword associated with the PUSCH, and iii) information indicating the redundant version (RV) associated with the PUSCH.
[0071] The information representing RV represents one or more values determined based on the size of the polar code associated with PUSCH, and the one or more values determined based on the size of the polar code associated with PUSCH are associated with at least one of i) the starting point of the lower polar subcode of the polar code associated with PUSCH or ii) the starting point of the upper polar subcode of the polar code associated with PUSCH.
[0072] [Beneficial Effects]
[0073] According to embodiments of this disclosure, if the PDSCH transmission is a retransmission, a second codeword associated with the PDSCH is generated based on one or more fourth-bit channel indices. Even if the data bits are arranged in the lower polarity subcode bit channel index, the second codeword is generated based on one or more fourth-bit channel indices, thus satisfying the IR-HARQ support characteristics. As described above, since polarity-based IR HARQ can be used for data transmission, system performance can be improved in terms of reliability.
[0074] Furthermore, according to the polar code-based IR HARQ scheme, since the received bits are immediately combined without decoding, the performance of polar code-based HARQ operation can be further improved compared with the existing IF-HARQ scheme.
[0075] According to embodiments of this disclosure, the DCI for scheduling PDSCH includes information indicating whether one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH.
[0076] Therefore, even if the UE fails to receive the PDCCH of the initial scheduled transmission, it can still perform normal decoding of the codewords associated with the PDSCH based on the DCI of the subsequently retransmitted PDSCH. For polar code-based IR-HARQ applied to data transmission, this improves robustness against PDCCH errors.
[0077] Furthermore, it prevents erroneous operations caused by PDCCH detection failure (PDSCH-related codeword decoding failure). By preventing unnecessary PDSCH retransmissions, the signal transmission process for polar code-based IR-HARQ support can be improved in terms of signaling overhead and UE power consumption.
[0078] According to embodiments of this disclosure, the DCI includes information indicating a redundant version (RV) associated with the PDSCH, and the information indicating the RV represents one of one or more values determined based on the size of the polar code associated with the PDSCH. One of the one or more values determined based on the size of the polar code associated with the PDSCH may be associated with one or more specific positions within a circular buffer into which the PDSCH-associated codeword is input. Furthermore, the one or more specific positions may be associated with at least one of i) a first-bit channel index of the lower polar code of the polar code associated with the PDSCH or ii) a first-bit channel index of the upper polar code of the polar code associated with the PDSCH.
[0079] If the encoded bits within the circular buffer are selected and retransmitted based on the rate matching type, the starting point of the lower polarity subcode or the upper polarity subcode can be indicated within the circular buffer via RV. Therefore, decoding of the retransmission-related codeword can be performed based on a mother code size smaller than the mother code size used to generate the codeword. This offers advantages in terms of receiver implementation complexity.
[0080] The effects achievable by this disclosure are not limited to those described above by way of example only. Other effects and advantages of this disclosure will be more clearly understood by those skilled in the art to which this disclosure pertains from the following description. Attached Figure Description
[0081] The accompanying drawings are provided to aid in understanding this disclosure and may be used in conjunction with the detailed description to provide embodiments of the disclosure. However, the technical features of this disclosure are not limited to the specific drawings, and the features disclosed in each drawing can be combined with each other to form new embodiments. The reference numerals in each drawing may refer to structural elements.
[0082] Figure 1 This is a view illustrating an example of a communication system applicable to this disclosure.
[0083] Figure 2 This is a view showing an example of a wireless device applicable to this disclosure.
[0084] Figure 3 This is a view showing another example of a wireless device applicable to this disclosure.
[0085] Figure 4 This is a view showing an example of a handheld device applicable to this disclosure.
[0086] Figure 5 This is a view illustrating the physical channel applicable to this disclosure and the signal transmission method using the physical channel.
[0087] Figure 6 This is a view illustrating a method for processing transmitted signals applicable to this disclosure.
[0088] Figure 7 This is a view illustrating the structure of a radio frame applicable to this disclosure.
[0089] Figure 8 This is a view showing the time slot structure applicable to this disclosure.
[0090] Figure 9 This is a view illustrating an example of a communication architecture available in a 6G system applicable to this disclosure.
[0091] Figure 10 This is a diagram illustrating a first-level channel combination for polarity compilation according to an embodiment of the present disclosure.
[0092] Figure 11 This is a diagram illustrating the Nth level channel combination for polarity compilation according to an embodiment of the present disclosure.
[0093] Figure 12 This is a diagram used to explain the generation of parity bits according to embodiments of this disclosure.
[0094] Figure 13 The illustration shows a polarity encoding operation performed to support IF-HARQ according to an embodiment of the present disclosure.
[0095] Figure 14 The illustration shows a receiver structure supporting IF-HARQ according to an embodiment of the present disclosure.
[0096] Figure 15 This is a diagram used to explain the coding operations related to incremental redundancy according to embodiments of this disclosure.
[0097] Figure 16 The illustration shows a bit channel index rearranged according to the reliability order of the bit channels, based on an embodiment of the present disclosure.
[0098] Figure 17 An example of data arranged into a bit channel index based on a specific payload size, according to an embodiment of the present disclosure, is illustrated.
[0099] Figure 18 The illustration shows another example of data arranged into a bit channel index based on a specific payload size, according to an embodiment of the present disclosure.
[0100] Figure 19 The illustration shows a redundant version (RV) when using the same master code size as the initial transmission, according to an embodiment of the present disclosure.
[0101] Figure 20 The illustration shows an embodiment of the present disclosure using an RV with an increased master code size compared to the initial transmission.
[0102] Figure 21 This is a flowchart illustrating a method for a UE to receive a physical downlink shared channel according to an embodiment of the present disclosure.
[0103] Figure 22 This is a flowchart illustrating a method for a base station to transmit a physical downlink shared channel according to another embodiment of the present disclosure. Detailed Implementation
[0104] The embodiments of this disclosure described below are combinations of elements and features of this disclosure in specific forms. Unless otherwise stated, these elements or features may be considered optional. Each element or feature may be practiced without combination with other elements or features. Furthermore, embodiments of this disclosure may be constructed by combining portions of elements and / or features. The order of operations described in the embodiments of this disclosure may be rearranged. Some constructions or elements of any embodiment may be included in another embodiment and may be replaced by corresponding constructions or features of another embodiment.
[0105] In the description of the accompanying drawings, processes or steps that would unnecessarily obscure the scope of this disclosure will be omitted, as will processes or steps that would be understandable to those skilled in the art.
[0106] Throughout the specification, when a part “comprises” or “includes” a component, this indicates that other components are not excluded, and may be further included unless otherwise stated. The terms “unit,” “-or / or,” and “module” described in the specification indicate a unit for performing at least one function or operation, which may be implemented by hardware, software, or a combination thereof. Furthermore, the terms “a or an,” “a,” “the,” etc., in the context of this disclosure (more specifically, in the context of the appended claims) may include both singular and plural representations unless otherwise indicated in the specification or explicitly stated in the context.
[0107] In the embodiments of this disclosure, the data transmission and reception relationship between a base station (BS) and a mobile station is primarily described. A BS refers to a terminal node of a network that communicates directly with the mobile station. Specific operations described as being performed by the BS can be performed by upper-layer nodes of the BS.
[0108] In other words, it is clear that in a network consisting of multiple network nodes, including the BS, the various operations performed to communicate with the mobile station can be performed by the BS or network nodes other than the BS. The term "BS" can be replaced by fixed station, node B, evolved Node B (eNode B or eNB), advanced base station (ABS), access point, etc.
[0109] In embodiments of this disclosure, the term terminal may be replaced by UE, mobile station (MS), subscriber station (SS), mobile subscriber station (MSS), mobile terminal, advanced mobile station (AMS), etc.
[0110] A transmitter is a fixed and / or mobile node that provides data or voice services, and a receiver is a fixed or mobile node that receives data or voice services. Therefore, on the uplink (UL), a mobile station can act as a transmitter, and a BS can act as a receiver. Similarly, on the downlink (DL), a mobile station can act as a receiver, and a BS can act as a transmitter.
[0111] Embodiments of this disclosure may be supported by at least one publicly disclosed standard specification for a radio access system, including the Institute of Electrical and Electronics Engineers (IEEE) 802.xx system, the 3rd Generation Partnership Project (3GPP) system, the 3GPP Long Term Evolution (LTE) system, the 5G New Radio (NR) system, and the 3GPP2 system. Specifically, embodiments of this disclosure may be supported by the standard specifications 3GPP TS 36.211, 3GPP TS 36.212, 3GPP TS 36.213, 3GPP TS 36.321, and 3GPP TS 36.331.
[0112] Furthermore, the embodiments of this disclosure are applicable to other radio access systems, and are not limited to the systems described above. For example, the embodiments of this disclosure are applicable to systems used after 3GPP 5G NR systems, and are not limited to any particular system.
[0113] In other words, no steps or portions described to elucidate the technical features of this disclosure can be supported by these documents. Furthermore, all terms set forth herein can be interpreted using standard documents.
[0114] Embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. The detailed description given below with reference to the drawings is intended to explain exemplary embodiments of the present disclosure, and not merely to illustrate embodiments that can be implemented according to the present disclosure.
[0115] To provide a full understanding of this disclosure, the following detailed description includes specific terminology. However, it will be apparent to those skilled in the art that these specific terms may be replaced with other terms without departing from the spirit and scope of this disclosure.
[0116] The embodiments disclosed herein can be applied to various radio access systems, such as Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single Carrier Frequency Division Multiple Access (SC-FDMA), etc.
[0117] In the following description, for the purpose of clarification, 3GPP communication systems (e.g., LTE, NR, etc.) are used, but the spirit of this disclosure is not limited thereto. LTE may refer to technology after 3GPP TS 36.xxx version 8. Specifically, LTE technology after 3GPP TS 36.xxx version 10 may be referred to as LTE-A, and LTE technology after 3GPP TS 36.xxx version 13 may be referred to as LTE-A pro. 3GPP NR may refer to technology after TS 38.xxx version 15. 3GPP 6G may refer to technology TS versions 17 and / or 18. "xxx" may refer to the detailed number of the standard document. LTE / NR / 6G may be collectively referred to as the 3GPP system.
[0118] For background techniques, terms, abbreviations, etc., used in this disclosure, please refer to the descriptions in the standard documents previously published before this disclosure. For example, refer to standard documents 36.xxx and 38.xxx.
[0119] Communication systems applicable to this disclosure
[0120] The various descriptions, functions, processes, proposals, methods, and / or operation flowcharts of this disclosure described in this document can be applied to, but are not limited to, various fields requiring wireless communication / connectivity between devices (e.g., 5G).
[0121] The following description will be made with reference to the accompanying drawings. In the following drawings / descriptions, unless otherwise stated, the same reference numerals may denote the same or corresponding hardware blocks, software blocks, or functional blocks.
[0122] Figure 1 The diagram illustrates the communication system 1 applied to this disclosure. (Reference) Figure 1The communication system 100 applied in this disclosure includes wireless devices, base stations (BS), and networks. Here, a wireless device refers to a device that performs communication using a radio access technology (RAT) (e.g., 5G New RAT (NR)) or Long Term Evolution (LTE), and may be referred to as a communication / radio / 5G device. Wireless devices may include, but are not limited to, robots 100a, vehicles 100b-1 and 100b-2, extended reality (XR) devices 100c, handheld devices 100d, home appliances 100e, Internet of Things (IoT) devices 100f, and artificial intelligence (AI) devices / servers 400. For example, vehicles may include vehicles with wireless communication capabilities, autonomous vehicles, and vehicles capable of communication between vehicles. Here, vehicles 100b-1 and 100b-2 may include unmanned aerial vehicles (UAVs) (e.g., drones). XR device 100c may include augmented reality (AR) / virtual reality (VR) / mixed reality (MR) devices and can be implemented in the form of head-mounted displays (HMDs), head-up displays (HUDs) installed in vehicles, televisions, smartphones, computers, wearable devices, home appliances, digital signage, vehicles, robots, etc. Handheld device 100d may include smartphones, smart tablets, wearable devices (e.g., smartwatches or smart glasses), and computers (e.g., laptops). Home appliances 100e may include televisions, refrigerators, and washing machines. IoT device 100f may include sensors and smart meters. For example, BS 120 and network 130 may be implemented as wireless devices, and a particular wireless device 120a may operate as a BS / network node relative to other wireless devices.
[0123] Wireless devices 100a to 100f can connect to network 130 via BS120. AI technology can be applied to wireless devices 100a to 100f, and wireless devices 100a to 100f can connect to AI server 400 via network 130. Network 130 can be configured using a 3G network, a 4G (e.g., LTE) network, or a 5G (e.g., NR) network. Although wireless devices 100a to 100f can communicate with each other via BS120 / network 130, wireless devices 100a to 100f can also perform direct communication with each other without going through BS120 / network 130 (e.g., sidelink communication). For example, vehicles 100b-1 and 100b-2 can perform direct communication (e.g., vehicle-to-vehicle (V2V) / vehicle-to-everything (V2X) communication). IoT device 100f (e.g., a sensor) can perform direct communication with other IoT devices (e.g., sensors) or other wireless devices 100a to 100f.
[0124] Wireless communication / connections 150a, 150b, or 150c can be established between wireless devices 100a to 100f / BS120 or between BS120 and BS120. Here, wireless communication / connections can be established via various RATs (e.g., 5G NR) such as uplink / downlink communication 150a, sidelink communication 150b (or D2D communication), or inter-BS communication (e.g., relay, Integrated Access Backhaul (IAB)). Wireless devices and BS / wireless devices can transmit / receive radio signals to / from each other via wireless communication / connections 150a and 150b. For example, wireless communication / connections 150a and 150b can transmit / receive signals via various physical channels. For this purpose, at least a portion of the various configuration information configuration processes, various signal processing processes (e.g., channel coding / decoding, modulation / demodulation, and resource mapping / demapping), and resource allocation processes used for transmitting / receiving radio signals can be performed based on various suggestions of this disclosure.
[0125] Communication systems applicable to this disclosure
[0126] Figure 2 The illustrations are applicable to wireless devices disclosed herein.
[0127] refer to Figure 2 The first wireless device 200a and the second wireless device 200b can transmit radio signals via various RATs (e.g., LTE and NR). Here, {first wireless device 200a and second wireless device 200b} can correspond to Figure 1 {Wireless Device 100x and BS120} and / or {Wireless Device 100x and Wireless Device 100x}.
[0128] The first wireless device 200a may include one or more processors 202a and one or more memories 204a, and may also include one or more transceivers 206a and / or one or more antennas 208a. The processor 202a may control the memory 204a and / or the transceiver 206a, and may be configured to implement the descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document. For example, the processor 202a may process information in the memory 204a to generate a first information / signal, and then transmit a radio signal including the first information / signal via the transceiver 206a. The processor 202a may receive a radio signal including a second information / signal via the transceiver 206a, and then store the information obtained by processing the second information / signal in the memory 204a. The memory 204a may be connected to the processor 202a and may store various information related to the operation of the processor 202a. For example, memory 204a may store software code including commands for executing some or all of the processes controlled by processor 202a, or for executing the descriptions, functions, processes, suggestions, methods, and / or operation flowcharts disclosed in this document. Here, processor 202a and memory 204a may be part of a communication modem / circuit / chip designed to implement RAT (e.g., LTE or NR). Transceiver 206a may be connected to processor 202a and transmit and / or receive radio signals via one or more antennas 208a. Each transceiver 206a may include a transmitter and / or a receiver. Transceiver 206a may be used interchangeably with a radio frequency (RF) unit. In this disclosure, a wireless device may represent a communication modem / circuit / chip.
[0129] The second wireless device 200b may include one or more processors 202b and one or more memories 204b, and additionally includes one or more transceivers 206b and / or one or more antennas 208b. The processor 202b may control the memory 204b and / or the transceivers (206b) and may be configured to implement the descriptions, functions, processes, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor 202b may process information in the memory 204b to generate a third message / signal, and then transmit a radio signal including the third message / signal via the transceiver 206b. The processor 202b may receive a radio signal including a fourth message / signal via the transceiver 206b, and then store the information obtained by processing the fourth message / signal in the memory 204b. The memory 204b may be connected to the processor 202b and may store various information related to the operation of the processor 202b. For example, memory 204b may store software code including commands for executing some or all of the processes controlled by the processor or for executing the descriptions, functions, processes, suggestions, methods, and / or operation flowcharts disclosed in this document. Here, processor 202b and memory 204b may be part of a communication modem / circuit / chip designed to implement RAT (e.g., LTE or NR). Transceiver 206b may be connected to processor 202b and transmit and / or receive radio signals via one or more antennas 208b. Each transceiver 206b may include a transmitter and / or a receiver. Transceiver 206b may be used interchangeably with an RF unit. In this disclosure, a wireless device may represent a communication modem / circuit / chip.
[0130] The hardware components of wireless devices 200a and 200b will be described in more detail below. One or more protocol layers may be implemented by, but are not limited to, one or more processors 202a and 202b. For example, one or more processors 202a and 202b may implement one or more layers (e.g., functional layers such as PHY (Physical), MAC (Media Access Control), RLC (Radio Link Control), PDCP (Packet Data Convergence Protocol), RRC (Radio Resource Control), and SDAP (Service Data Adaptation Protocol)). One or more processors 202a and 202b may generate one or more Protocol Data Units (PDUs) and / or one or more Service Data Units (SDUs) according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors 202a and 202b may generate messages, control information, data, or information according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors 202a and 202b may generate signals (e.g., baseband signals) including PDUs, SDUs, messages, control information, data, or information, according to the descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document, and provide the generated signals to one or more transceivers 206a and 206b. One or more processors 202a and 202b may receive signals (e.g., baseband signals) from one or more transceivers 206a and 206b and obtain PDUs, SDUs, messages, control information, data, or information according to the descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document.
[0131] One or more processors 202a and 202b may be referred to as controllers, microcontrollers, microprocessors, or microcomputers. One or more processors 202a and 202b may be implemented by hardware, firmware, software, or a combination thereof. For example, one or more application-specific integrated circuits (ASICs), one or more digital signal processors (DSPs), one or more digital signal processing devices (DSPDs), one or more programmable logic devices (PLDs), or one or more field-programmable gate arrays (FPGAs) may be included in one or more processors 202a and 202b. The descriptions, functions, processes, proposals, methods, and / or operational flowcharts disclosed in this document may be implemented using firmware or software, and the firmware or software may be configured to include modules, processes, or functions. Firmware or software configured to execute the descriptions, functions, processes, proposals, methods, and / or operational flowcharts disclosed in this document may be included in one or more processors 202a and 202b, or stored in one or more memories 204a and 204b, such that they are driven by one or more processors 202a and 202b. The descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document can be implemented using firmware or software in the form of code, commands, and command sets.
[0132] One or more memories 204a and 204b may be connected to one or more processors 202a and 202b and store various types of data, signals, messages, information, programs, code, instructions, and / or commands. One or more memories 204a and 204b may be configured with read-only memory (ROM), random access memory (RAM), erasable programmable read-only memory (EPROM), flash memory, hard disk drive, registers, buffer memory, computer-readable storage media, and / or combinations thereof. One or more memories 204a and 204b may be located internally and / or externally to one or more processors 202a and 202b. One or more memories 204a and 204b may be connected to one or more processors 202a and 202b via various technologies such as wired or wireless connections.
[0133] One or more transceivers 206a and 206b can transmit user data, control information, and / or radio signals / channels as mentioned in the methods and / or operation flowcharts of this document to one or more other devices. One or more transceivers 206a and 206b can receive user data, control information, and / or radio signals / channels mentioned in the descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document from one or more other devices. For example, one or more transceivers 206a and 206b can be connected to one or more processors 202a and 202b and transmit and receive radio signals. For example, one or more processors 202a and 202b can perform control such that one or more transceivers 206a and 206b can transmit user data, control information, or radio signals to one or more other devices. One or more processors 202a and 202b can perform control such that one or more transceivers 206a and 206b can receive user data, control information, or radio signals from one or more other devices. One or more transceivers 206a and 206b may be connected to one or more antennas 208a and 208b, and the one or more transceivers 206a and 206b may be configured to transmit and receive user data, control information, and / or radio signals / channels mentioned in the descriptions, functions, processes, proposals, methods, and / or operation flowcharts disclosed in this document. In this document, one or more antennas may be multiple physical antennas or multiple logical antennas (e.g., antenna ports). One or more transceivers 206a and 206b may convert received radio signals / channels, etc., from RF band signals to baseband signals for processing by one or more processors 202a and 202b. One or more transceivers 206a and 206b may convert user data, control information, radio signals / channels, etc., processed by one or more processors 202a and 202b from baseband signals to RF band signals. For this purpose, one or more transceivers 206a and 206b may include (analog) oscillators and / or filters.
[0134] Structure of wireless devices applicable to this disclosure
[0135] Figure 3 The diagram shows a signal processing circuit used for transmitting signals.
[0136] refer to Figure 3 Wireless device 300 can correspond to Figure 2The wireless devices 200a and 200b can be configured from various elements, components, units / parts, and / or modules. For example, each of the wireless devices 300 may include a communication unit 310, a control unit 320, a memory unit 330, and an additional component 340. The communication unit may include a communication circuit 312 and a transceiver 314. For example, the communication circuit 312 may include... Figure 2 One or more processors 202a and 202b and / or one or more memories 204a and 204b may be included. For example, transceiver 314 may include... Figure 1 One or more transceivers 206a and 206b and / or one or more antennas 208a and 208b. Control unit 320 is electrically connected to communication unit 310, memory 330, and add-on components 340, and controls the overall operation of the wireless device. For example, control unit 320 can control the electrical / mechanical operation of the wireless device based on programs / code / commands / information stored in memory unit 330. Control unit 320 can transmit information stored in memory unit 330 to an external source (e.g., other communication devices) via communication unit 310 through a wireless / wired interface, or store information received from an external source (e.g., other communication devices) via communication unit 310 in memory unit 330.
[0137] The additional component 340 can be configured differently depending on the type of wireless device. For example, the additional component 340 may include at least one of a power unit / battery, an input / output (I / O) unit, a drive unit, and a computing unit. The wireless device is capable of operating in, but is not limited to, robotic applications. Figure 1 100a), vehicles ( Figure 1 100b-1 and 100b-2), XR equipment ( Figure 1 100c), handheld devices ( Figure 1 100d), home appliances ( Figure 1 100e), IoT devices ( Figure 1 100f), digital broadcasting terminals, holographic devices, public safety equipment, MTC devices, medical devices, fintech devices (or financial devices), security devices, climate / environmental devices, AI servers / devices ( Figure 1 140 in the middle), base station ( Figure 1 This can be achieved through methods such as 120 (network nodes, etc.). Depending on the use case / service, wireless devices can be used in mobile or fixed locations.
[0138] exist Figure 3In the wireless device 300, the various elements, components, units / parts, and / or modules can be interconnected via a wired interface, or at least a portion thereof can be wirelessly connected via a communication unit. For example, in the wireless device 300, the control unit 320 and the communication unit 310 can be wired together, and the control unit 320 and the first unit (e.g., 130 and 140) can be wirelessly connected via the communication unit 310. Each element, component, unit / part, and / or module within the wireless device 300 may further include one or more elements. For example, the control unit 320 may be configured by a collection of one or more processors. As an example, the control unit 320 may be configured by a collection of communication control processors, application processors, electronic control units (ECUs), graphics processing units, and memory control processors. As another example, the memory 130 may be configured by random access memory (RAM), dynamic RAM (DRAM), read-only memory (ROM), flash memory, volatile memory, non-volatile memory, and / or combinations thereof.
[0139] Handheld devices applicable to this disclosure
[0140] Figure 4 An example of a handheld device applicable to this disclosure is illustrated.
[0141] Figure 4 The illustration applies to a handheld device disclosed herein. This handheld device may include a smartphone, smartpad, wearable device (e.g., a smartwatch or smart glasses), or portable computer (e.g., a laptop). The handheld device may be referred to as a mobile station (MS), user terminal (UT), mobile subscriber station (MSS), subscriber station (SS), advanced mobile station (AMS), or wireless terminal (WT).
[0142] refer to Figure 4 The handheld device 100 may include an antenna unit 408, a communication unit 410, a control unit 420, a memory unit 430, a power supply unit 440a, an interface unit 440b, and an I / O unit 440c. The antenna unit 408 may be configured as part of the communication unit 410. Blocks 410 to 430 / 440a to 440c respectively correspond to... Figure 3 The boxes are 310 to 330 / 340.
[0143] Communication unit 410 can send signals (e.g., data and control signals) to other wireless devices or BSs and receive signals (e.g., data and control signals) from other wireless devices or BSs. Control unit 420 can perform various operations by controlling the components of handheld device 400. Control unit 420 may include an application processor (AP). Memory unit 430 can store data / parameters / programs / codes / commands required to drive handheld device 400. Memory unit 430 can store input / output data / information. Power supply unit 440a can power handheld device 400 and includes wired / wireless charging circuitry, a battery, etc. Interface unit 440b can support connection of handheld device 400 to other external devices. Interface unit 440b may include various ports for connecting to external devices (e.g., audio I / O ports and video I / O ports). I / O unit 440c can input or output video information / signals, audio information / signals, data, and / or information input by the user. I / O unit 440c may include a camera, microphone, user input unit, display unit 440d, speaker and / or haptic module.
[0144] As an example, in the case of data communication, I / O unit 440c can acquire information / signals input by the user (e.g., touch, text, voice, image, or video) and can store the acquired information / signals in memory unit 430. Communication unit 410 can convert the information / signals stored in memory into radio signals and transmit the converted radio signals directly to other wireless devices or to the BS. Communication unit 410 can receive radio signals from other wireless devices or the BS and then recover the received radio signals into the original information / signals. The recovered information / signals can be stored in memory unit 430 and can be output as various types (e.g., text, voice, image, video, or haptic) through I / O unit 440c.
[0145] Physical channels and general signal transmission
[0146] In a radio access system, the UE receives information from the base station on the DL and transmits information to the base station on the UL. The information transmitted and received between the UE and the base station includes general data information and various control information. Depending on the type / purpose of the information transmitted and received between the base station and the UE, there are many physical channels.
[0147] Figure 5 The illustration shows a physical channel applicable to this disclosure and a signal transmission method using the physical channel.
[0148] In step S1011, when a UE is turned on again from the off state or enters a new cell, it performs an initial cell search operation, such as obtaining synchronization with the base station. Specifically, the UE performs synchronization with the base station by receiving the primary synchronization channel (P-SCH) and secondary synchronization channel (S-SCH) from the base station, and obtains information such as the cell identifier (ID).
[0149] Subsequently, the UE can receive the Physical Broadcast Channel (PBCH) signal from the base station and obtain intra-cell broadcast information. Simultaneously, the UE can receive the Downlink Reference Signal (DL RS) and check the downlink channel status during the initial cell search step. In step S1012, the UE, having completed the initial cell search, can receive the Physical Downlink Control Channel (PDCCH) and Physical Downlink Control Channel (PDSCH) based on the Physical Downlink Control Channel information, thereby obtaining more detailed system information.
[0150] Subsequently, the UE can perform random access procedures such as steps S1013 to S1016 to complete access to the base station. For this purpose, the UE can transmit a preamble via the Physical Random Access Channel (PRACH) (S1013) and receive a random access response (RAR) to the preamble via the Physical Downlink Control Channel and its corresponding Physical Downlink Shared Channel (S1014). The UE can use the scheduling information in the RAR to transmit the Physical Uplink Shared Channel (PUSCH) (S1015) and perform a contention resolution process, such as receiving the Physical Downlink Control Channel signal and its corresponding Physical Downlink Shared Channel signal (S1016).
[0151] As a general uplink / downlink signal transmission process, the UE that has already performed the above process can perform the reception of physical downlink control channel signals and / or physical downlink shared channel signals (S1017) and the transmission of physical uplink shared channel (PUSCH) signals and / or physical uplink control channel (PUCCH) signals (S1018).
[0152] Control information sent from the UE to the base station is collectively referred to as uplink control information (UCI). UCI includes hybrid automatic repeat and request-acknowledge / denial (HARQ-ACK / NACK), scheduling request (SR), channel quality indicator (CQI), precoding matrix indicator (PMI), rank indicator (RI), beam indicator (BI), etc. Typically, UCI is sent periodically via PUCCH, but in some embodiments, it can be sent via PUSCH (e.g., when sending control information and service data simultaneously). Furthermore, the UE can send UCI aperiodically via PUSCH based on network requests / instructions.
[0153] Figure 6 The illustration depicts a method for processing transmitted signals applicable to this disclosure. For example, the transmitted signal can be processed by a signal processing circuit. In this case, the signal processing circuit 1200 may include a scrambler 1210, a modulator 1220, a layer mapper 1230, a pre-encoder 1240, a resource mapper 1250, and a signal generator 1260. For example, Figure 6 Operations / functions can be provided by Figure 2 The processors 202a and 202b and / or transceivers 206a and 206b execute. Furthermore, for example, Figure 6 The hardware components can be Figure 2 Processors 202a and 202b and / or Figure 2 This is implemented in transceivers 206a and 206b. For example, boxes 1010 to 1060 can be... Figure 2 This is implemented in processors 202a and 202b. Furthermore, boxes 1210 to 1250 can be... Figure 2 Implemented in processors 202a and 202b, box 1260 can be Figure 2 The transceivers 206a and 206b are implemented in the above embodiments, but are not limited to the above embodiments.
[0154] Typing can be done Figure 6 The signal processing circuit 1200 converts the signal into a radio signal. Here, a codeword is the encoded bit sequence of an information block. The information block may include a transport block (e.g., a UL-SCH transport block or a DL-SCH transport block). This can be achieved through... Figure 5 Various physical channels (e.g., PUSCH and PDSCH) are used to transmit radio signals. Specifically, codewords can be converted into a bit sequence scrambled by scrambler 1210. The scrambling sequence used for scrambling is generated based on initial values, which may include the wireless device's ID information, etc. The scrambled bit sequence can be modulated into a modulation symbol sequence by modulator 1220. Modulation methods may include π / 2 binary phase shift keying (π / 2-BPSK), m-phase shift keying (m-PSK), and m-quadrature amplitude modulation (m-QAM), etc.
[0155] A sequence of complex modulated symbols can be mapped to one or more transmission layers by layer mapper 1230. The modulated symbols of each transmission layer can be mapped to a corresponding antenna port (precoding) by precoder 1240. The output z of precoder 1240 can be obtained by multiplying the output y of layer mapper 1230 by an N*M precoding matrix W. Here, N can be the number of antenna ports, and M can be the number of transmission layers. Precoder 1240 can perform precoding after transform precoding (e.g., Discrete Fourier Transform (DFT)) of the complex modulated symbols. Alternatively, precoder 1240 can perform precoding without transform precoding.
[0156] Resource mapper 1250 can map the modulation symbols of each antenna port to time-frequency resources. The time-frequency resources can include multiple symbols in the time domain (e.g., CP-OFDMA symbols and DFT-s-OFDMA symbols) and multiple subcarriers in the frequency domain. Signal generator 1260 can generate radio signals from the mapped modulation symbols and can transmit the generated radio signals to another device via each antenna. For this purpose, signal generator 1260 may include an inverse fast Fourier transform (IFFT) module, a cyclic prefix (CP) inserter, a digital-to-analog converter (DAC), a frequency uplink converter, etc.
[0157] The signal processing procedure for signals received in a wireless device can be configured as follows: Figure 6 The signal processing procedures 1210 to 1260 are the reverse of those in the signal processing procedures. For example, wireless devices (e.g., Figure 2 The 200a or 200b transceiver can receive radio signals from an external source via its antenna port / transceiver. The received radio signals can be converted into baseband signals using a signal recovery unit. For this purpose, the signal recovery unit may include a frequency downlink converter, an analog-to-digital converter (ADC), a CP remover, and a Fast Fourier Transform (FFT) module. Subsequently, the baseband signals can be recovered into codewords through a resource demapping process, a post-encoding process, a demodulation process, and a descrambling process. The codewords can be recovered to the original information blocks through decoding. Therefore, the signal processing circuitry (not shown) for the received signals may include a signal recovery unit, a resource demapping unit, a post-encoder, a demodulator, a descrambler, and a decoder.
[0158] Figure 7 The diagram illustrates the structure of a radio frame applicable to this disclosure.
[0159] UL and DL transmission based on NR system can be based on Figure 7 The frame shown is an example. In this case, a radio frame has a length of 10 ms and can be defined as two 5 ms half-frames (HF). A half-frame can be defined as five 1 ms subframes (SF). A subframe can be divided into one or more time slots, and the number of time slots in a subframe can depend on the subcarrier spacing (SCS). In this case, depending on the cyclic prefix (CP), each time slot can include 12 or 14 OFDM(A) symbols. If normal CP is used, each time slot can include 14 symbols. If extended CP is used, each time slot can include 12 symbols. Here, the symbols can include OFDM symbols (or CP-OFDM symbols) and SC-FDMA symbols (or DFT-s-OFDM symbols).
[0160] Table 1 shows the number of symbols per slot, the number of slots per frame, and the number of slots per subframe according to SCS when using normal CP. Table 2 shows the number of symbols per slot, the number of slots per frame, and the number of slots per sub-subframe according to SCS when using extended CP.
[0161] [Table 1]
[0162]
[0163] [Table 2]
[0164]
[0165] In Tables 1 and 2 above, N slot symb It can indicate the number of symbols in a time slot, N frame,μ slot It can indicate the number of time slots in a frame, and N subframe,μ slot It can indicate the number of time slots in a subframe.
[0166] Furthermore, in the system to which this disclosure applies, OFDM(A) parameter sets (e.g., SCS, CP length, etc.) can be set differently among multiple cells merged into a single UE. Therefore, the (absolute time) period of time resources (e.g., SF, time slots, or TTI) (collectively referred to as time units (TU) for convenience) consisting of the same number of symbols can be set differently among the merged cells.
[0167] NR can support multiple parameter sets (or subcarrier spacing (SCS)) that support various 5G services. For example, when the SCS is 15kHz, it supports wide areas in traditional cellular bands; when the SCS is 30kHz / 60kHz, it supports dense urban areas, lower latency, and wider carrier bandwidth; and when the SCS is 60kHz or higher, it can support bandwidths greater than 24.25GHz to overcome phase noise.
[0168] The NR band is defined as frequency ranges of two types (FR1 and FR2). FR1 and FR2 can be configured as shown in the table below. Furthermore, FR2 can refer to millimeter wave (mmW).
[0169] [Table 3]
[0170] Frequency range name Corresponding frequency range Subcarrier spacing FR1 410MHz-7125MHz 15, 30, 60kHz FR2 24250MHz-52600MHz 60, 120, 240kHz
[0171] Furthermore, for example, in the communication systems to which this disclosure applies, the above parameter set can be set differently. For example, the terahertz (THz) band can be used as a band higher than FR2. In the THz band, the SCS can be set to be greater than that of the NR system, and the number of time slots can be set differently, not limited to the embodiments described above. The THz band will be described below.
[0172] Figure 8 The diagram illustrates the time slot structure applicable to this disclosure.
[0173] A time slot comprises multiple symbols in the time domain. For example, in normal CP, a time slot comprises seven symbols, while in extended CP, a time slot comprises six symbols. A carrier comprises multiple subcarriers in the frequency domain. A resource block (RB) can be defined in the frequency domain as multiple (e.g., 12) consecutive subcarriers.
[0174] Furthermore, the bandwidth portion (BWP) is defined in the frequency domain as multiple consecutive (P)RBs and can correspond to a set of parameters (e.g., SCS, CP length, etc.).
[0175] A carrier can include up to N (e.g., five) BWPs. Data communication is performed through active BWPs, and only one BWP can be active for a UE. In the resource grid, each element is called a resource element (RE) and can be mapped to a complex number of symbols.
[0176] 6G communication system
[0177] 6G (wireless communication) systems aim to achieve goals such as: (i) very high data rates per device, (ii) a very large number of connected devices, (iii) global connectivity, (iv) very low latency, (v) reduced power consumption for battery-free IoT devices, (vi) ultra-reliable connectivity, and (vii) interconnected intelligence with machine learning capabilities. The vision for 6G systems may encompass four aspects: “intelligent connectivity,” “deep connectivity,” “holographic connectivity,” and “ubiquitous connectivity.” 6G systems may meet the requirements shown in Table 4 below. In other words, Table 4 illustrates the requirements for 6G systems.
[0178] [Table 4]
[0179] Peak data rate per device 1Tbps E2E Delay 1ms Maximum spectral efficiency 100bps / Hz Mobility support Up to 1000km / h Satellite integration completely AI completely autonomous vehicles completely XR completely tactile communication completely
[0180] At this point, 6G systems can have key elements such as enhanced mobile broadband (eMBB), ultra-reliable low-latency communication (URLLC), massive machine-type communication (mMTC), AI-integrated communication, tactile internet, high throughput, high network capacity, high energy efficiency, low backhaul and access network congestion, and enhanced data security.
[0181] Figure 9 An example of a communication architecture that may be provided in a 6G system applicable to this disclosure is illustrated.
[0182] refer to Figure 9 6G systems will offer 50 times greater simultaneous wireless connectivity than 5G systems. URLLC, a key feature of 5G, will become even more important in 6G communication by providing end-to-end latency of less than 1 millisecond. Furthermore, unlike the frequently used domain spectral efficiency, 6G systems can achieve better volumetric spectral efficiency. 6G systems can offer advanced battery technology for energy harvesting and very long battery life, meaning mobile devices may not require separate charging. In addition, new network characteristics may emerge in 6G.
[0183] - Satellite-integrated networks: To provide a global mobile network, 6G will be integrated with satellites. Integrating terrestrial waves, satellites, and public networks into a single wireless communication system may be crucial for 6G.
[0184] - Connected Intelligence: Unlike previous generations of wireless communication systems, 6G is innovative, and the evolution of wireless may evolve from "connecting things" to "connecting intelligence." AI can be applied to every step of the communication process (or every signal processing step described below).
[0185] - Seamless integration of wireless messaging and power transfer: 6G wireless networks can transmit power to charge the batteries of devices such as smartphones and sensors. Therefore, wireless messaging and power transfer (WIET) will be integrated.
[0186] -Ubiquitous Hyper-3D Connectivity: Network access and core network functions for drones and low Earth orbit satellites will establish hyper-3D connectivity in the ubiquitous 6G era.
[0187] The following are some general requirements for the new network features of 6G.
[0188] - Small Cellular Networks: The concept of small cellular networks was introduced to improve the quality of received signals as a result of improvements in throughput, energy efficiency, and spectral efficiency of cellular systems. Therefore, small cellular networks are a fundamental feature of 5G and other communication systems beyond 5G (5GB). Consequently, 6G communication systems also utilize the characteristics of small cellular networks.
[0189] - Ultra-dense heterogeneous networks: Ultra-dense heterogeneous networks will be another important feature of 6G communication systems. Multi-layered networks composed of heterogeneous networks improve overall QoS and reduce costs.
[0190] - High-capacity backhaul: Backhaul connections are characterized by a high-capacity backhaul network to support high-volume traffic. High-speed fiber optic and free-space optics (FSO) systems may be a possible solution to this problem.
[0191] - Radar technology integrated with mobile technology: High-precision positioning (or location-based services) via communication is one of the functions of 6G wireless communication systems. Therefore, radar systems will be integrated with 6G networks.
[0192] - Software-defined and virtualized: Software-defined and virtualized are two important features that form the basis of the design process in 5GB networks to ensure flexibility, reconfigurability and programmability.
[0193] The above discussion can be applied in conjunction with the methods proposed in this disclosure, which will be described later, or it can be supplemented to clarify the technical features of the methods proposed in this disclosure. For ease of explanation, the methods described below are divided, and needless to say, some components of one method can be replaced by some components of another method, or they can be combined with each other.
[0194] Polar code
[0195] A polar code is a code that can obtain channel capacity in a binary-input discrete memoryless channel (B-DMC). In other words, a polar code is a code whose channel capacity can be obtained by infinitely increasing the code block size N. Here, "obtaining channel capacity" may mean separating a noise-free channel from a noisy channel. A polar code encoder consists of two processes: channel combination and channel segmentation.
[0196] Channel combination is the process of determining the code block size by parallel concatenating binary input discrete memoryless channels (B-DMC).
[0197] Figure 10 This is a diagram illustrating a first-level channel combination for polarity compilation according to an embodiment of the present disclosure.
[0198] refer to Figure 10 Two binary-input discrete memoryless channels (B-DMCs) (W) are combined. Here, u1 and u2 are binary input source bits, and y1 and y2 are output coded bits. The entire equivalent channel is assumed to be W2. When N binary-input discrete memoryless channels (B-DMCs) are combined, each channel can be represented recursively. That is, when... and When GN is used as the generating matrix, it can be calculated as shown in Equation 1 below.
[0199] Equation 1
[0200]
[0201] In Equation 1, R_N represents the bit-reversing interleaver, and the input... Mapped to output This relationship is like Figure 11 As shown.
[0202] Figure 11 This is a diagram illustrating the Nth-level channel combination for polarity compilation according to an embodiment of the present disclosure. Reference Figure 11 N, as the size of the code block, can be restricted to having 2 N The value of (where n is a natural number).
[0203] The process of combining N binary input discrete memoryless channels (B-DMC) and then defining an equivalent channel for a specific input is called channel segmentation. This can be expressed as the channel transition probability shown in Equation 2 below.
[0204] Equation 2
[0205]
[0206] When performing channel combination and channel segmentation, the following theorem can be defined.
[0207] For any binary-input discrete memoryless channel (B-DMC) W, the corresponding channel... It is polarized from the following perspectives. Specifically, based on i) and ii), For a fixed δ∈(0,1), it is polarized.
[0208] i) N becomes infinity by 2 squared.
[0209] ii) The part of the exponent i∈{1,…,N} becomes I(W), and The part becomes 1-I(W)
[0210] Therefore, as N becomes infinitely large, the channel is polarized to be either completely noisy or noiseless. Since the transmitter side knows the polarization of the channel precisely, it can correct bad channels and transmit uncoded bits through good channels.
[0211] In other words, when the code block size N becomes infinitely large, the equivalent channel for a specific input bit can be classified as a noisy channel or a noiseless channel. This means that the capacity of the equivalent channel for a specific input bit is classified as 0 or I(W) (the capacity of channel W).
[0212] The decoding method for this polarity code is the Continuous Elimination Decoding (SC) method. The SC method obtains the channel transition probability and calculates the likelihood ratio (LLR) of the input bits. By utilizing the characteristic of recursively executing the channel combining and channel splitting processes, the channel transition probability can be calculated recursively.
[0213] Therefore, the final likelihood ratio (LLR) value can also be calculated recursively. First, the input bit u can be calculated based on equations 3 and 4 below. i Channel transition probability The indexes are divided into odd and even indices, and each index can be expressed as...
[0214] Equation 3
[0215] use Definition,
[0216]
[0217] Equation 4
[0218]
[0219] At this point, the LLR can be calculated based on the following equations 5 and 6.
[0220] Equation 5
[0221]
[0222] Equation 6
[0223]
[0224] The complexity of the polarity encoder and SC decoder depends on the block length N. For example, the complexity can be expressed as O(NlogN).
[0225] Assuming K bits are input into a polar code of length N, the compilation rate becomes K / N. In this case, the generator matrix of a polar encoder with a data payload size of N is G. N In this case, we can assume the following.
[0226] Encoded bits can be expressed as The K bits in the vector correspond to the payload bits. Assume that G corresponds to the payload bits. N The row index is I, and it is assumed that G corresponds to the remaining NK bits. N The column index is F.
[0227] The minimum distance of the above polar codes can be defined as shown in Equation 7 below.
[0228] Equation 7
[0229]
[0230] In Equation 7 above, wt(i) represents the number of 1s in the binary expansion of i, where i = 0, 1, ..., N-1.
[0231] As mentioned earlier, through the process of channel combination and channel segmentation, the equivalent channel is divided into noisy channels and noiseless channels, and the data payload must be transmitted on the noiseless channel.
[0232] In other words, in terms of communication performance, the data payload must be transmitted on a noise-free equivalent channel. This can be achieved by obtaining the equivalent channel for each input bit. The value is used to determine the method for finding a noise-free equivalent channel. Z(W) is the Battacharyya parameter. The Battacharyya parameter is the upper bound of the error probability associated with the maximum a posteriori (MAP) decision when sending a binary input of 0 or 1. Maximum a posteriori (MAP) refers to the posterior probability pattern in Bayesian statistics.
[0233] Therefore, once the Z(W) value is calculated, the channel for transmitting the data payload can be selected by arranging the values in ascending order (from smallest to largest). In the embodiments described later in this disclosure, the reliability value of the bit channel index of the polarity encoder can be expressed as Z(W).
[0234] For a binary erase channel (BEC), Z(W) can be calculated based on Equation 8 below.
[0235] Equation 8
[0236]
[0237] Using Equation 8 above, the Z(W) value for a binary erase channel (BEC) with an erase probability of 0.5 and a block size of 8 is calculated as follows.
[0238] Z(W)={1.00, 0.68, 0.81, 0.12, 0.88, 0.19, 0.32, 0.00}
[0239] Therefore, when the size of the data payload is 2, the data payload can be transmitted on the 8th equivalent channel (Z(W) = 0.00) and the 4th equivalent channel (Z(W) = 0.12).
[0240] Polar codes in the NR standard
[0241] First, examine the information bit allocation in detail.
[0242] As mentioned above, reliability varies depending on the input position of the polarity encoder. For example, reliability can refer to the Z(W) value.
[0243] Polarity encoding can be performed as follows.
[0244] Based on the size of the data blocks, the corresponding data blocks are allocated to the bit channel in order of reliability, and all other data blocks are configured to be frozen (e.g., value "0").
[0245] More specifically, assuming the master code size of the polarity encoder is N and the data block size is K, polarity encoding can be performed as follows: The data blocks are arranged in order of reliability across K bit channels, and NK bit channels are configured to be 0.
[0246] In this disclosure, the arrangement of data blocks / data bits on a bit channel can be expressed as the allocation of bit channels on data blocks / digital bits. A concrete example will be described later. Figure 18 The data bits (u3) in 18c. The above example can be expressed as 1) or 2) below.
[0247] 1) Data bits (e.g., u3) are arranged at bit channel index 31 and bit channel index 60.
[0248] 2) Bit channel index 31 and bit channel index 60 are assigned to data bits (e.g., u3).
[0249] Table 5 below illustrates the bit channel indexes in order of reliability when the maximum mother code size is 1024. If the mother code size is less than 1024, the bit channel indexes can be configured according to reliability using a nested method that removes bit channel indices larger than the corresponding mother code size.
[0250] Here, the polar sequence is This represents the bit channel index of the polarity encoder, where i = 0, 1, ..., N. max -1 and N max =1024. Indicates the reliability of the bit channel index. satisfy
[0251] [Table 5]
[0252]
[0253]
[0254]
[0255]
[0256]
[0257] Rate matching
[0258] In the NR standard, rate matching consists of interleaving and pruning / shortening / repetition operations. If d0, d1, d2, ..., d N-1 The inputs are interleavers and y0, y1, y2, ..., y N-1 If it is the output of the interleaver, then the relationship between the input and output of the interleaver is as follows.
[0259] for n=0 to N-1
[0260]
[0261] J(n)=P(i)×(N / 32)+mod(n,N / 32);
[0262] y n =d J(n) ;
[0263] end for
[0264] At this point, the interleaver pattern P(i) can be exemplified as shown in Table 6 below.
[0265] [Table 6]
[0266] i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) 0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27 1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29 2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30 3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31
[0267] Cleavage / shortening is a method of not transmitting a portion of the encoded bits when the resources allocated for transmission are less than the number of encoded bits. Repetition is a method of repeatedly transmitting a portion of the encoded bits when the resources allocated for transmission are greater than the number of encoded bits.
[0268] According to the NR standard, pruning and shortening are performed based on the compilation rate. When the size of the encoded bits is E and the data block size is K...
[0269] If K / E ≤ 7 / 16, then pruning is performed; 2) if not (K / E is less than 7 / 16), then shortening is performed. Furthermore, when pruning / shortening is performed, specific bit channels of the encoder are configured to be frozen (i.e., bit value 0) using the method illustrated in Table 7 below.
[0270] Table 7
[0271]
[0272]
[0273] In Table 7, N is the mother code size, n PC This indicates the number of parity bits (PC bits) when parity polarity codes (PC polarity codes) are supported. This represents the bit channel index used for data block allocation in the polarity sequence, and This indicates the bit channel index that is configured to be frozen.
[0274] Parity check polarity code (PC polarity code)
[0275] PC polarity code is a polarity code that uses a portion of the data block to generate parity bits (PC bits) and arranges them at the input of the polarity encoder. PC polarity code is the polarity code supported when the data block size is 18 <= K <= 25.
[0276] In the NR standard, the PC bit is 3 bits, and it uses, for example... Figure 12 The 5-bit shift register shown is used to generate it.
[0277] Figure 12 This is a diagram used to explain the generation of parity bits according to embodiments of this disclosure.
[0278] refer to Figure 12 As Figure 12 The 5-bit shift register y[0], ..., y[4] are all initialized to 0. That is to say, PC bits can be generated for the data block [u0, u1, u2, ..., uN-1] according to Table 8 below.
[0279] Table 8
[0280]
[0281] The PC bits generated in this way are allocated to the input bit channels of the polarity encoder as follows. Here, when E-K+3 > 192, When E-K+3<=192 and, yes middle The most reliable bit index.
[0282] The parity bits are arranged in In In the least reliable bit index.
[0283] The remaining The parity bits are arranged in In the bit index of the minimum row weight.
[0284] If in There is more than If there are more bit indices with the same minimum row weight, then the remaining ones will be... The parity bits are arranged in The one with the highest reliability and lowest row weight In the bit index.
[0285] HARQ (Hybrid Autorepeating and Requesting)
[0286] HARQ is a technique that combines forward error correction (FEC) and automatic repeat request (ARQ). That is, the transmitter sends all or part of the coded bits using FEC encoding, and the receiver detects errors in the received data and then sends a HARQ-ACK signal to the transmitter. If the data received by the receiver is error-free, the transmitter sends new data; if the received data contains errors, the transmitter retransmits the corresponding data block.
[0287] The receiver detects errors by combining the retransmitted data block with the previously transmitted data block and then decoding it again. This operation can be performed until no errors are detected, or until a predetermined order is reached. The methods for combining retransmitted data blocks for decoding can be divided into two types.
[0288] Append-and-merge: This is a method of retransmitting the same coded bits as the first transmitted data. When decoding retransmitted data blocks, the probability of errors can be reduced through power gain.
[0289] Incremental redundancy: This is a method of retransmitting coded bits that differ from those in the first transmission. When decoding retransmitted data blocks, the probability of errors can be reduced through compilation gain. Append-and-merge can often be interpreted as a special implementation of incremental redundancy.
[0290] In this disclosure, encoded bits can represent codewords.
[0291] HARQ methods can be classified as follows. Based on the timing of retransmission, HARQ methods can be divided into 1) synchronous HARQ and asynchronous HARQ, and based on whether the channel state is reflected in the amount of resources used in retransmission, they can be divided into 2) channel adaptive methods and channel non-adaptive methods.
[0292] The synchronous HARQ method is a approach where, if the initial transmission fails, subsequent retransmissions are performed at system-defined time intervals. That is, it's assumed that a retransmission is scheduled every four time units after the initial transmission failure, a timing already agreed upon between the base station and the UE. Therefore, no additional signaling is required to notify this timing. However, if the data transmission side receives a NACK message, the frame is retransmitted every four time units until an ACK message is received.
[0293] On the other hand, in the asynchronous HARQ method, rescheduling or determining the retransmission timing can be achieved through additional signaling. The timing for retransmitting previously failed frames can vary depending on various factors such as channel conditions.
[0294] Non-adaptive HARQ methods use frame modulation, the number of resource blocks used, AMC, etc., determined during the initial transmission, in retransmissions. Conversely, adaptive HARQ methods vary frame modulation, the number of resource blocks used, AMC, etc., according to the channel conditions.
[0295] For example, the transmitting side uses 6 resource blocks to send data during the initial transmission, and then uses the same 6 resource blocks for retransmission; this is a non-adaptive HARQ method. On the other hand, even if 6 resource blocks are used initially for transmission, more or less resource blocks are used for later retransmissions depending on the channel conditions; this is an adaptive HARQ method.
[0296] Each of the four HARQ combinations can be implemented through this classification, but the main HARQ methods used include asynchronous and channel-adaptive HARQ methods, as well as synchronous and channel-non-adaptive HARQ methods.
[0297] The asynchronous channel adaptive HARQ method can maximize retransmission efficiency by adaptively changing the retransmission timing and the amount of resources used according to the channel state, but its disadvantage is that it increases overhead, so it is usually not considered for use in the uplink.
[0298] On the other hand, synchronous and channel-independent HARQ methods have the advantage of almost no overhead for retransmission because the timing and resource allocation for retransmission are committed within the system. However, the disadvantage is that the retransmission efficiency is very low when used in highly variable channel conditions.
[0299] The following section presents a method for HARQ that supports polar codes.
[0300] Incremental Freeze (IF)
[0301] When polarity coding is performed, data blocks are arranged in order of reliability in the encoder's bit channels, and then encoding is performed. Incremental freezing is a HARQ method that achieves performance gains by moving data arranged in relatively less reliable bit channels to more reliable channels and then encoding it during retransmission.
[0302] Figure 13 The illustration shows a polarity encoding operation performed to support IF-HARQ according to an embodiment of the present disclosure.
[0303] refer to Figure 13 Assume the mother code size N is 16 and the data block size K is 12. 13a represents the bit channel index, and 13b represents the bit channel index rearranged according to reliability order. In this case, the reliability order can be ascending (low reliability -> high reliability), but is not limited to this, and different orders (descending order) can be applied.
[0304] When a data block is transmitted for the first time, 13c represents the data block (u0 to u11) allocated to bit channel index 13a. When a retransmission associated with a data block is performed, 13d represents the data block (u0 to u2, u4 to u6) allocated to bit channel index 13a.
[0305] In a polar encoder with N=16, the polar sequence 13b, generated in ascending order with reliability, is assumed to be {0, 1, 2, 4, 8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15}.
[0306] In the first transmission (first Tx), the data blocks are arranged on the bit channel {8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15} and encoded (13c).
[0307] If an error occurs during decoding of the first transmission and a retransmission (second Tx) is performed, the data that was arranged on the low-reliability bit channel in the first transmission is arranged on the high-reliability bit channel, and then encoding is performed.
[0308] Specifically, assuming the positions of 6 bits out of the initially transmitted 12 bits are changed, the data bits (u4, u0, u1, u2, u5, u6) arranged in bit channels {8, 3, 5, 6, 9, 10} are arranged in bit channels {12, 7, 11, 13, 14, 15}, and then encoding is performed. At this point, it can be... Figure 14 The receiver in the middle performs the decoding.
[0309] Figure 14 The illustration shows a receiver structure supporting IF-HARQ according to an embodiment of the present disclosure.
[0310] refer to Figure 14 The hard decision value of the data bits arranged in the bit channel {12, 7, 11, 13, 14, 15} in the initial transmission is used in the decoding process for retransmission. Here, hard decision means that the received data is only decoded into binary (0 or 1).
[0311] The goal is to achieve IF-HARQ combining by combining the log-likelihood ratio (LLR) of the decoded bits. By considering the reliability of the bit channel transmitted in the initial transmission, retransmitted data bits can be allocated to the bit channel. The bit channel can be allocated in retransmissions in reverse order of reliability compared to the initial transmission. In the following text, this will be based on... Figure 13 To describe it in more detail.
[0312] The data bits (u4, u0, u1, u2, u5, u6) arranged in bit channel {8, 3, 5, 6, 9, 10} are then arranged in bit channel {15, 14, 13, 11, 7, 12}, and encoding can then be performed. With this, a greater performance gain can be expected as the reliability of each bit increases on average.
[0313] Information regarding the number of data bits that are arranged into a high-reliability bit channel index during retransmission can be defined in the standard or sent to the UE via L1 / MAC / RRC signaling.
[0314] According to an embodiment, when the number of data bits transmitted in the initial transmission is K, the number of data bits arranged to the high-reliability bit channel index in the retransmission via the IF-HARQ scheme can be set to K-K1 or K1*K.
[0315] For example, K1 can be set to the same value regardless of the number of retransmissions. For instance, K1 in the first retransmission can be the same as K1 in the second retransmission. As another example, K1 can be set to a different value for each retransmission. For instance, K1 in the first retransmission and K1 in the second retransmission can be set to different values.
[0316] According to an embodiment, if the number of data bits allocated to the bit channel of the polarity encoder in the m-th transmission is K(m), then the number of data bits in the (m+1)-th transmission can be configured to satisfy K(m+1) = K(m) - K1 or K(m+1) = K1 * K(m). In this case, as described above, K1 can be set to: 1) the same value regardless of the number of retransmissions, or 2) a different value for each retransmission.
[0317] Incremental redundancy (IR)
[0318] To support IR-HARQ with polar codes, the mother code size can be increased in retransmissions. For example, if the mother code size used in the initial transmission is N, it can be increased to 2N in retransmissions. References will follow below. Figure 15 This will be described in detail. At this point, considering the complexity, even when retransmissions are performed repeatedly, the increased master code size can be limited to 2N or 4N. In other words, when retransmissions are performed repeatedly, the maximum size of the master code used can be limited to two or four times the size of the master code used in the initial transmission. This is because if the master code size increases repeatedly with each retransmission, the complexity may become excessively escalating.
[0319] In the following text, reference will be made to Figure 15 It is described in detail.
[0320] Figure 15 This is a diagram used to explain the coding operations related to incremental redundancy according to embodiments of this disclosure.
[0321] Figure 15 Figure (a) illustrates the bit channel allocation and data block size K=6 for polar sequences when the mother code size is N=8 and 16.
[0322] Figure 15 (b) illustrates the encoding operations when the mother code size is N = 8 and 16.
[0323] exist Figure 15 In this context, it is assumed that when the polar code with a data block size of K=6 is transmitted for the first time (first Tx), the mother code size is N=8, and when it is retransmitted (second Tx), the mother code size is N=16.
[0324] In the initial transmission, since K=6, the data block is arranged in bit channel index {2, 4, 3, 5, 6, 7}, determined by bit channel index 15b which is rearranged according to reliability order in bit channel index 15a. Based on this, polarity coding is performed.
[0325] When an error occurs after decoding the initial transmission and retransmission, if a polarity sequence of mother code size N=16 is applied, the bit channel indexes of the data block should be arranged as follows.
[0326] In bit channel index 15c, the bit channel index determined according to bit channel index 15d, which is rearranged in order of reliability, is {12, 7, 11, 13, 14, 15}. Therefore, encoding must be performed by arranging data blocks in the corresponding bit channel indices {12, 7, 11, 13, 14, 15}.
[0327] However, in order to support IR HARQ, the property that the coded bits generated for the first transmission must be included in the coded bits generated for the retransmission must be satisfied.
[0328] The corresponding characteristics will be described in detail below. When the mother code size increases from N to 2N, the codeword of the polarity encoding can be expressed as: Here, F is the kernel used for polar encoding of the mother code size N, and [U2 U1] is the data block. In this case, U1F must be the first codeword transmitted to support IRHARQ. Therefore, the data arranged in bit channel index 7 (the data assigned to bit channel index 7) must also be assigned to bit channel index 10.
[0329] In other words, when the data is arranged in the bit channel indices {12, 7, 11, 13, 14, 15} determined according to reliability order, the data is not arranged in bit channel index 10, therefore the encoded bits at the initial transmission are not included in the encoded bits at the retransmission. In this case, the characteristics supporting IR-HARQ are not met.
[0330] The above problem can be solved by a copying operation. A copying operation replicates data bits to a specific bit channel index to satisfy the requirements for IR HARQ support. Specifically, through the copying operation, identical data bits are arranged in bit channel indices 7 and 10, and then encoding can be performed. Such a copying operation can be performed in cases 1) and 2) below.
[0331] 1) When retransmitting, the master code size increases (e.g., from 8 to 16).
[0332] 2) The data blocks are arranged at the bit channel index corresponding to the upper polarity encoder. That is, the data blocks are arranged at the bit channel index (e.g., 7) corresponding to the lower polarity subcode (e.g., 0 to 7).
[0333] The copy operation can be performed as follows.
[0334] The data bits arranged in the lower polarity subcode of the polarity code (e.g., the second polarity code) used for retransmission are additionally arranged in the bit channel index of the second polarity code corresponding to the bit channel index (e.g., one or more first bit channels) of the polarity code in which the data bits were arranged during the initial transmission.
[0335] According to one embodiment, a copying operation can be performed based on the data block size being greater than a certain value. This specific value can refer to the data block size when the data block (or data bits) is first arranged in the bit channel index of the polarity code used for retransmission, belonging to the bit channel index of the next polarity subcode.
[0336] The specific value mentioned above can be defined based on the order of the bit channel indices belonging to the lower polarity subcode. Specifically, when the bit channel indices of the polarity code are rearranged in descending order of reliability, the specific value can be related to the order of the bit channel indices with the highest reliability among the bit channel indices belonging to the lower polarity subcode.
[0337] The following will be based on Figure 15 Provide a detailed description of a specific value.
[0338] according to Figure 15 For example, when the master code size (N) is 16, the bit channel indices associated with the upper polarity encoder (or belonging to the lower polarity subcode) are 0 to 7. Among the bit channel indices 0 to 7, the bit channel index with the highest reliability is 7.
[0339] The entire bit channel index, rearranged according to reliability order (descending order), is as follows: the bit channel index in reverse order of 15d.
[0340] {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0}
[0341] In the total bit channel index {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0} rearranged according to reliability order (descending order), the most reliable bit channel index (7) in the bit channel index of the lower polarity subcode has the fifth order.
[0342] Therefore, in this case, the specific value is 5, and when the data block size is 5 or larger, the retransmitted encoded bits do not include the encoded bits (15b) from the initial transmission, so a copy operation is required.
[0343] Based on the copy operation, coded bits (15e) for retransmission are generated. The coded bits (15e) for retransmission include the coded bits (15b) from the initial transmission.
[0344] exist Figure 15 In (b), 15f-0 to 15f-15 indicate reliability. Specifically, 15f-0 indicates the reliability of bit channel index 0 in the bit channel indices (0 to 15). 15f-15 indicates the reliability of bit channel index 15 in the bit channel indices (0 to 15). Reliability can be expressed as a probability value associated with the occurrence of an error. Bit channel index 15 has the highest reliability because its value (0.0001) is the smallest, and bit channel index 0 has the lowest reliability because its value (1.0) is the largest.
[0345] In the bit channel index (0 to 15), 15f-0 to 15f-7 are associated with the upper polarity encoder, and 15f-8 to 15f-15 are associated with the lower polarity encoder.
[0346] According to the LTE / NR standard, control information for either the channel (PDSCH) used for transmitting downlink data or the channel used for transmitting uplink data is transmitted on the downlink control channel (PDCCH). The UE detects the control information regarding downlink data transmitted on the PDCCH and then receives data by decoding the PDSCH. Alternatively, the UE can detect the scheduling information for the PUSCH used for transmitting uplink data on the PDCCH and then transmit uplink data via the PUSCH.
[0347] In the NR standard, polar codes are used for PDCCH or PUCCH / PUSCH to transmit control information (control data) (e.g., DCI, UCI).
[0348] The standard predefines the size of the control data and the time / frequency resources allocated to the PDCCH or PUCCH / PUSCH. Since the size of the control data and the resources allocated for data transmission are predefined, the size of the coded bits generated for control data transmission is also determined. The coded bits are generated based on the encoding of the control data.
[0349] Based on this information, the master code size of the polarity encoder can be determined. For example, it can be assumed that the size K of the control data corresponding to the DCI is 40, and the size E of the encoded bits transmitted in the time / frequency resources allocated to the PDCCH is 120. Since the code rate (i.e., K / E = 1 / 3) is less than 7 / 16, pruning is used. Eight bits are pruned from the codeword generated using the master code size N = 128, and then the codeword is transmitted on the PDCCH.
[0350] If the polar code is also used in the unicast data, higher-order modulation can be used, such as quadrature amplitude modulation (QAM) (e.g., 16QAM, 64QAM, 256QAM) and quadrature phase shift keying (QPSK).
[0351] In this context, the size of the data block encoded using polar codes can be indicated based on the data block size of the NR PDSCH or PUSCH. Specifically, the size of the data block encoded using polar codes can be indicated as the transport block size (TBS). That is, the TBS can be calculated based on the MCS indication and DCI associated with the allocation of time / frequency resources. Therefore, the master code size of the polar encoder can be calculated based on the payload size E that can be transmitted based on K (e.g., TBS) and time / frequency resources.
[0352] However, if polar code-based IR-HARQ is applied to the transmission of PDSCH, the following problems may occur.
[0353] If an error occurs during PDCCH transmission, the UE cannot receive either PDSCH or PDCCH. As mentioned above, this is because control information for decoding the PDSCH is transmitted on the PDCCH. Therefore, even if an error occurs during PDCCH transmission (even if the UE fails to receive the PDCCH due to an error in PDCCH transmission), a signal transmission method that can stably support polarity-based IR-HARQ needs to be designed.
[0354] The following describes in detail the methods for solving the above problems.
[0355] Suppose that the transmission of transport blocks (TBs) generated by polarity coding is scheduled based on the PDCCH. In this case, it is assumed that an error occurs in the PDCCH of the initial transmission of the TB (the PDCCH that schedules the initial transmission).
[0356] Because the error occurs in the PDCCH (transmission), the UE cannot receive the PDSCH (initial transmission TB) decoded using control information obtained through the PDCCH reception. Therefore, the UE cannot send any signal to the base station when sending HARQ-ACK. On the other hand, the base station attempts to detect the PUCCH or PUSCH containing the UE's HARQ-ACK information.
[0357] HARQ-ACK detection can vary depending on the base station implementation, but HARQ-ACK based on Discontinuous Transmission (DTX) can be detected as NACK. The above operations may be related to the requirements for HARQ-ACK errors. HARQ-ACK errors can be divided into two types: 1) ACK to NACK error, and 2) NACK to ACK error.
[0358] An ACK-to-NACK error occurs when a signal sent as an ACK is detected as a NACK. A NACK-to-ACK error occurs when a signal sent as a NACK is detected as an ACK. From the perspective of Layer 2, it is more important to reduce the probability of NACK-to-ACK errors occurring. This will be described in detail below.
[0359] If an ACK-to-NACK error occurs, the following can be assumed: The UE has successfully decoded the TB and sent an ACK to the base station based on this. The base station determines that the UE failed to receive the TB due to the ACK / NACK error (i.e., the UE failed to decode the TB). Therefore, the base station retransmits the TB to the UE. As mentioned above, in an ACK-to-NACK error, even if the UE has already received the TB normally, a retransmission will still be performed due to this error, which may reduce system output.
[0360] If a NACK-to-ACK error occurs, the following can be assumed: The UE fails to decode the TB and sends a NACK to the base station. The base station determines that the UE received the TB normally despite the NACK-to-ACK error (i.e., the UE successfully decoded the TB). Therefore, the base station sends a new TB to the UE. Unlike ACK-to-NACK errors, TB loss occurs in NACK-to-ACK errors. Since upper-layer retransmission is required to recover the TB, system output is further reduced compared to ACK-to-NACK errors. In this respect, requirements for NACK-to-ACK errors are generally set more strictly than those for ACK-to-NACK errors.
[0361] Since the DTX-based HARQ-ACK is detected as NACK at the base station, the base station performs a TB retransmission. Typically, the Transport Block Size (TBS) is maintained uniformly in retransmissions, but the time / frequency resources allocated for retransmissions can be changed. Furthermore, the base station can adjust the time / frequency resources in retransmissions by considering the coded bits from the initial transmission. For example, if IR-HARQ is supported, the UE performs decoding by combining the coded bits from the initial transmission and the coded bits from the retransmission. The base station can configure the time / frequency resources such that the coded bit size in the retransmission is smaller than the coded bit size in the initial transmission. However, the UE can achieve greater compilation gain and improve error performance through this combination.
[0362] If time / frequency resources change during retransmission, a difference arises between the coded bit size in the initial transmission and the coded bit size in the retransmission. To support IR-HARQ, the mother code size used for retransmission can be set to the sum of the coded bit size in the initial transmission and the coded bit size in the retransmission. In this case, the mother code size used by the base station to generate codewords may differ from the mother code size used by the UE (i.e., assuming the base station uses the mother code size at the UE). When the mother code size used by the base station differs from the (hypothetical) mother code size used by the UE, errors may occur in the decoding process of the UE / BS, leading to repeated retransmissions.
[0363] For example, if the UE fails to decode the base station's TB transmission, there may be a situation where the base station should retransmit the TB (PDSCH retransmission). As another example, if the base station fails to decode the UE's TB transmission, there may be a situation where the UE will retransmit the TB (PUSCH retransmission).
[0364] Therefore, as mentioned above, to avoid discrepancies in the mother code size between the base station and the UE, a method using DCI to indicate the mother code size can be considered. If the data and PC bits are arranged into the bit channel index based on a copy operation during retransmission, the polarity code-based IR-HARQ signal transmission method needs to be designed to be robust to PDCCH errors.
[0365] As mentioned above, the copy operation can be performed in the following cases 1) and 2).
[0366] 1) The size of the master code increases compared to the initial transmission.
[0367] 2) Arrangement of data bits to the channel index of the lower polarity subcode
[0368] Therefore, the design of an IR-HARQ signal transmission method robust to PDCCH errors can assume the case where the mother code size increases during retransmission. The following will refer to... Figures 16 to 18 This will be described in detail.
[0369] Figure 16 The illustration shows a bit channel index rearranged according to the reliability order of the bit channels, based on an embodiment of this disclosure. The bit channel index can be the bit channel index determined according to Table 5 above. Specifically, Figure 16 (a) shows the bit channel index when N = 32, and Figure 16 (b) shows the bit channel index when N = 64.
[0370] exist Figure 16 In (b), when the data block size is less than 7 according to the polarity sequence of N=64, the data is arranged in the lower polarity encoder. That is, the bit channel index is assigned to data in the range of 32 to 63. In this case, in the N=64 codeword represented as [(U1+U2)F U1F], U2=0, and the final codeword becomes [U1F U1F]. Therefore, in retransmission, the encoded bit U1F becomes a repetition of the first transmitted U1F.
[0371] Figure 17 An example of data arranged to a bit channel index based on a specific payload size, according to an embodiment of the present disclosure, is illustrated.
[0372] refer to Figure 17The data block size K is 7, and the payload size E is 24 (17b) and 34 (17c and 17d). Assume a retransmission is performed after the initial transmission at the base station (BS), and an error occurs in the PDCCH associated with the initial transmission. In this case, 17b is associated with the initial transmission (e.g., the initial transmission of the PDSCH), 17c is associated with the retransmission of the BS used for the initial transmission (e.g., the retransmission of the PDSCH), and 17d is associated with the transmission of the BS assumed by the UE (17c) due to the error in the PDCCH of the initial transmission (i.e., the PDCCH error that scheduled the PDSCH of the initial transmission).
[0373] 17a represents the bit channel index, and 17b represents the arrangement of data bits for the N=32 polarity encoder (the allocation of the bit channel index to the data bits). In 17b, the bit channel index is illustrated at a position offset 32 to the right for easy comparison with the arrangement of the N=64 polarity encoder, so as to easily check whether the characteristics supported by IR HARQ are met.
[0374] 17c represents the arrangement of the data bit indices of the N=64 polarity encoder. Furthermore, 17c represents the data arranged in the bit channel index for the BS to generate the codewords to be sent to the UE. In other words, 17c represents the actual arrangement of the bit channel index data related to the generation of the codewords used for retransmission.
[0375] 17d represents the data arrangement of the bit channel index assumed by the UE. Because the UE failed to receive the PDSCH due to a PDCCH error in the initial transmission, the UE assumes the data bit arrangement of 17d, not 17c. In other words, since the UE does not assume that a copy operation is performed, the UE assumes the data bit arrangement of 17d.
[0376] However, since the BS has already performed the initial transmission, in the retransmission, as shown in 17c, the BS uses an increased mother code size (N=64) to arrange the data into the bit channel index compared to the initial transmission. That is, the BS also arranges the data (u3) into bit channel index 60 based on the aforementioned copying operation to perform polarity coding. Therefore, the BS's arrangement of the data bits differs from the configuration of the data bits assumed by the UE.
[0377] To avoid errors, the following indication can be considered. Specifically, it can be indicated whether the operation of arranging data bits into the bit channel index is performed via PDCCH based on the copy operation.
[0378] If data bits are arranged into the bit channel index based on a copy operation, the following operations can be performed (operations related to data arrangement in 17c).
[0379] A copy operation is performed such that the data bits arranged in the bit channel index of the lower polarity subcode are also arranged in the bit channel index of the upper polarity subcode. In this case, the copy operation is performed on the bit channel index with the highest reliability among the bit channel indices corresponding to the upper polarity subcode configured with frozen bits, excluding a set of bit channel indices determined based on data block size and reliability order.
[0380] refer to Figure 17 The set of bit channel indices determined based on the data block size (K=7) and reliability order (descending order, bit channel index with high reliability -> bit channel index with low reliability) is {63, 62, 61, 59, 55, 47, 31} (see...). Figure 16 (b)). Among the bit channel indices 0 to 63, the bit channel index with the highest reliability among the bit channel indices of the upper polarity subcodes other than {63, 62, 61, 59, 55, 47, 31} is 60. Therefore, a copy operation is performed on bit channel index 60. The data (u3) arranged to the lower polarity subcode bit channel index 31 is also arranged to bit channel index 60 (bit channel index 60 is additionally allocated to the data (u3) allocated to bit channel index 31).
[0381] Figure 18 The illustration shows another example of data arranged to a bit channel index based on a specific payload size, according to an embodiment of the present disclosure.
[0382] refer to Figure 18 The data block size K is 16, and the payload size E is 30 (18b, 18c, 18d). Because... Figure 18 18a, 18b, 18c, and 18d correspond to Figure 17 17a, 17b, 17c and 17d, therefore redundant descriptions are omitted.
[0383] Because the UE failed to receive the PDSCH due to a PDCCH error in the initial transmission, the UE assumes the data bit arrangement of 18d instead of 18c. In other words, since the UE does not assume that a copy operation is performed, the UE assumes the data bit arrangement of 18d.
[0384] If the data bits are arranged to the bit channel index based on the copy operation, the following operations can be performed (operations related to data arrangement in 18c).
[0385] refer to Figure 18The set of bit channel indices determined based on the data block size (K=16) and reliability order (descending order) is {63, 62, 61, 59, 55, 47, 31, 60, 58, 57, 54, 53, 46, 51, 45, 30} (see...). Figure 16 (b)). Among the bit channel indices 0 to 63, the bit channel indices with the highest reliability among the bit channel indices of the upper polarity subcodes other than {63, 62, 61, 59, 55, 47, 31, 60, 58, 57, 54, 53, 46, 51, 45, 30} are 43 and 39. Therefore, a copy operation is performed on bit channel indices 43 and 39. The data (u0, u1) arranged to the lower polarity subcodes of bit channel indices 30 and 31 are also arranged to bit channel indices 39 and 43 (bit channel indices 39 and 43 are additionally assigned to the data (u1, u0) assigned to bit channel indices 30 and 31).
[0386] The following describes an implementation of an instruction for a redundant version (RV) associated with supporting polarity-based IR-HARQ.
[0387] According to the NR standard, the encoded bits generated by polarity encoding are input into a circular buffer, and then selectively transmitted from the circular buffer based on the following rate matching type.
[0388] If the rate-matching type is censored, then bits at positions (NE) to (N-1) in the circular buffer are selected.
[0389] If the rate-matching type is shortened, bits 0 to (E-1) in the circular buffer are selected.
[0390] If the rate matching type is repeating, all bits in the circular buffer are selected and appended with (EN) consecutive bits in the repeating circular buffer that have the smallest index bit.
[0391] The following method can be considered to support IR-HARQ for TBs encoded with polar codes. According to this method, coded bits for retransmission can be selected from specific points in the circular buffer and transmitted sequentially. This operation can be based on specifying a redundancy version (RV) on the circular buffer in the LTE / NR standard.
[0392] Since the size of the mother code of the polar code is 2... n Therefore, the mother code size in the initial transmission can be N, and the mother code size in the retransmission can be 2N. From the perspective of the mother code size N in the initial transmission, the following mother code size can be assumed.
[0393] {…, 4N, 2N, N, N / 2, N / 4,…}
[0394] Since decoding in the receiver is performed based on the master code size, the position within the circular buffer, which is divided by equal-division circular buffer, can be configured as the starting point of RV transmission.
[0395] For example, if RV is 2 bits and the mother code size is N, then the positions {0, N / 4, N / 2, 3N / 4} on the circular buffer can be configured as {RV0, RV1, RV2, RV3}. When the mother code size used in retransmission increases from N to 2N, the positions {0, N / 2, N, 3N / 2} on the circular buffer can be configured as {RV0, RV1, RV2, RV3}. In this case, since RV0 and RV2 indicate the starting points of the lower polarity subcode and the upper polarity subcode, the advantage is that decoding can be performed with a small mother code size. The following will refer to... Figure 19 and Figure 20 This will be described in detail.
[0396] Figure 19 The illustration shows an embodiment of the present disclosure using an RV with the same mother code size as the initial transmission. Specifically, Figure 19 An example of an RV indication used to support IR-HARQ in which the mother code size does not increase is illustrated.
[0397] refer to Figure 19 Assume the data block size K is 3 and the master code size N is 32. 19a represents the position within the circular buffer where the encoded bits, encoded by the polarity encoder of N=32, are input. 19b represents the bit (i.e., the encoded bit) selected by the circular buffer via RV0 in the initial transmission (first tx). 19c represents the bit selected by the circular buffer via RV2 in the retransmission of the initial transmission (second tx). 19d represents the bit selected by the circular buffer via RV3 in the retransmission of the second tx.
[0398] Assume the payload size E in 19b (first tx) is 18, the payload size E in 19c (second tx) is 10, and the payload size E in 19d (third tx) is 10.
[0399] 19r represents the position (or RV) on the circular buffer that can be configured by dividing the circular buffer into equal sizes (e.g., 8) based on N=32. Referring to 19r, {0, 8, 16, 24} as the position on the circular buffer can be configured as {RV0, RV1, RV2, RV3}.
[0400] The transmission start point is assumed to be RV0 in the first tx, RV2 in the second tx, and RV3 in the third tx.
[0401] refer to Figure 19 In the first tx, 19b is pruned because the code rate is 1 / 6 (i.e., K / E = 3 / 18). Eighteen coded bits corresponding to the payload size E are selected from the position of the circular buffer corresponding to RV0, and the selected coded bits are transmitted.
[0402] refer to Figure 19 In 19c, in the second tx, since the code rate is 3 / 10 (i.e., K / E = 3 / 10), pruning is performed. Ten coded bits corresponding to the payload size E are selected from the position of the circular buffer corresponding to RV2, and the selected coded bits are transmitted.
[0403] refer to Figure 19 In the 19th iteration, in the third tx, since the code rate is 3 / 10 in the same manner as the second tx (i.e., K / E = 3 / 10), pruning is performed. Ten coded bits corresponding to the payload size E are selected from the position in the circular buffer corresponding to RV3, and the selected coded bits are transmitted. In this case, eight coded bits are selected from the position of RV3 to the last position in the circular buffer (index 31), and the remaining two coded bits are selected from the first position in the circular buffer (index 0).
[0404] Figure 20 The illustration shows an RV according to an embodiment of the present disclosure when using a master code size increased compared to the initial transmission. Specifically, Figure 20 An example of an RV indication used to support IR-HARQ where the mother code size increases is illustrated.
[0405] refer to Figure 20 Assume the data block size K is 7, the mother code size N in the initial transmission (first tx) is 32, and the mother code size N in the retransmissions (second tx and third tx) is 64.
[0406] because Figure 20 20a, 20b, 20c, and 20d correspond to Figure 19 19a, 19b, 19c and 19d, therefore redundant descriptions are omitted.
[0407] 20r1 represents the position (or RV) on the circular buffer that can be configured by dividing the circular buffer into equal sizes (e.g., 8) based on N=32. Referring to 20r1, {0, 8, 16, 24} as the position on the circular buffer can be configured as {RV0, RV1, RV2, RV3}.
[0408] 20r2 represents the positions (or RVs) on the circular buffer that can be configured by dividing the circular buffer into equal-sized (e.g., 16) units based on N=64. Referring to 20r2, {0, 16, 32, 48} as positions on the circular buffer can be configured as {RV0, RV1, RV2, RV3}.
[0409] Assume the payload size E in 20b (first tx) is 20, the payload size E in 20c (second tx) is 24, and the payload size E in 20d (third tx) is 30.
[0410] Assume the transmission start points are as follows: RV0 (20r1) in the first tx, RV1 (20r2) in the second tx, and RV2 (20r2) in the third tx.
[0411] refer to Figure 20 In the second tx, the size of the circular buffer increases because the mother code size increases (32->64), and the RV indicating the start of transmission (based on its position within the circular buffer) also changes according to the size of the circular buffer.
[0412] refer to Figure 20 In the first tx, since the code rate is 7 / 20, pruning is performed. Twenty encoded bits corresponding to the payload size E are selected from the position of the circular buffer corresponding to RV0(20r1), and the selected encoded bits are transmitted.
[0413] refer to Figure 20 In the second transmission (TX), since the code rate is 7 / 24, pruning is performed. In the second TX, an increased master code size is used. Based on the increased master code size compared to the initial transmission, the position of RV1 according to 20r2 instead of RV1 of 20r1 is used. Specifically, 24 coded bits corresponding to the payload size E are selected at position (index 16) on the circular buffer corresponding to RV1 of 20r2, and the selected coded bits are transmitted.
[0414] refer to Figure 20 In the third tx of 20d, since the code rate is 7 / 30, pruning is performed. Since the mother code size is 64 in the same way as the second tx, 30 coded bits corresponding to the payload size E are selected at position (index 32) on the circular buffer corresponding to RV2 of 20r2, and the selected coded bits are transmitted.
[0415] For ease of explanation, the above embodiments have been described with a focus on the UE's PDSCH reception operation. However, the embodiments disclosed herein are not limited to PDSCH signaling operations and can also be applied to PUSCH signaling operations.
[0416] From an implementation perspective, the operations according to the above embodiments (e.g., operations related to signaling for supporting polar code-based IR-HARQ robustness to PDCCH errors) can be performed by... Figures 1 to 4 and Figure 6 Equipment (e.g.) Figure 2 Processors 202a and 202b are used to process it.
[0417] Furthermore, the operations according to the above embodiments (e.g., operations related to signaling for supporting PDCCH error robustness based on polar code IR-HARQ) can be used to run at least one processor (e.g., Figure 2 The commands / programs (e.g., instructions, executable code) of the processors 202a and 202b are stored in memory (e.g., Figure 2 In the memory (204a and 204b).
[0418] Below, for reference Figure 21 and Figure 22 In the UE and base station (e.g., Figure 2 The above embodiments are described in detail in terms of the operation of the first wireless device 200a and the second wireless device 200b. The methods described below are distinguished only for ease of explanation. Therefore, it is obvious that any part of the configuration of one method can be replaced by or combined with a part of the configuration of another method.
[0419] Figure 21 This is a flowchart illustrating a method for a UE to receive a physical downlink shared channel according to an embodiment of the present disclosure.
[0420] refer to Figure 21 The method for a UE to receive a Physical Downlink Shared Channel (PDSCH) according to embodiments of the present disclosure includes step S2110 of receiving a DCI that schedules the PDSCH and step S2120 of receiving the PDSCH based on the DCI.
[0421] In step S2110, the UE receives downlink control information (DCI) from the base station (BS) to schedule the physical downlink shared channel (PDSCH). The PDSCH may be associated with codewords generated based on polar codes.
[0422] According to step S2110, UE (e.g.) Figure 2 200a) from BS (e.g. Figure 2 In section 200b), the operation of the DCI receiving the PDSCH can be performed by... Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2 One or more processors 202a may control one or more memories 204a and / or one or more transceivers 206a to receive DCIs of scheduled PDSCHs from BS200b.
[0423] In step S2120, the UE receives the PDSCH from the BS based on the DCI.
[0424] According to an embodiment, if the transmission of PDSCH is an initial transmission, then PDSCH can be associated with a first codeword generated based on a first polarity code.
[0425] The first codeword can be generated based on one or more first bit channel indices allocated to the data block associated with the PDSCH in the bit channel index of the first polarity code.
[0426] According to an embodiment, if the transmission of PDSCH is a retransmission, then PDSCH can be associated with a second codeword generated based on the second polarity code.
[0427] The second codeword can be generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code.
[0428] According to an embodiment, one or more second bit channel indices may include: i) one or more first bit channel indices, or ii) bit channel indices obtained by adding a second specific value to one or more first bit channel indices. See below for reference. Figure 16 To describe its detailed examples.
[0429] If the size of the first polarity code (e.g., the value of the mother code size N) is 32, then one or more first bit channel indices selected in the polarity encoder based on the size of the data block (K=4) associated with the first codeword in reliability order (e.g., descending order) can be 31, 30, 29, and 27 (see...). Figure 16 (a)
[0430] In i), one or more second-bit channel indices can be 31, 30, 29, and 27. In ii), one or more second-bit channel indices can be 63, 62, 61, and 59. In this case, the second specific value can be 32.
[0431] According to an embodiment, the second specific value may be based on the difference between the size of the second polarity code and the size of the first polarity code. This is described in detail with reference to examples relating to one or more second bit channel indices.
[0432] If the size N of the second polarity code is 32, then the second specific value is 0 (=32-32). Therefore, one or more second-bit channel indices are the same as one or more first-bit channel indices.
[0433] If the size N of the second polarity code is 64, then the second specific value is 32 (=64-32). Therefore, one or more second bit channel indices can be bit channel indices (e.g., 63, 62, 61, and 59) obtained by adding 32 to one or more first bit channel indices (e.g., 31, 30, 29, and 27).
[0434] According to an embodiment, the size of the second polarity code is 2 times the size of the first polarity code. n The value of the second polar code can be multiplied by 1, where n is an integer equal to or greater than 0. In this case, considering the complexity, the maximum size of the second polar code can be limited to 2 or 4 times the size of the first polar code.
[0435] According to an embodiment, if one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, then the one or more second-bit channel indices may further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0436] To prevent repeated failures in decoding codewords associated with subsequent PDSCH retransmissions due to errors in the PDCCH of the initial PDSCH, the DCI may include the following information.
[0437] According to an embodiment, the DCI may include i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0438] According to an embodiment, the information representing RV can represent one of one or more values determined based on the size of the polar code associated with PDSCH. The one or more values determined based on the size of the polar code associated with PDSCH can be associated with at least one of i) the starting point of the lower polar code of the polar code associated with PDSCH or ii) the starting point of the upper polar code of the polar code associated with PDSCH. Reference will be made below. Figure 19 The 19r describes this. One or more values determined based on the size of the polar code associated with PDSCH can include {0, 8, 16, 24}, which are positions within the circular buffer. In this case, 0 and 16, corresponding to RV0 and RV2, respectively, correspond to the starting points of the lower polar code and the upper polar code.
[0439] According to an embodiment, one or more values determined based on the size of the polar code associated with PDSCH can be associated with one or more specific positions in the cyclic buffer where the PDSCH-associated codeword is input.
[0440] According to an embodiment, one or more specific positions may be associated with at least one of i) the first bit channel index of the lower polar subcode of the polar code associated with PDSCH or ii) the first bit channel index of the upper polar subcode of the polar code associated with PDSCH.
[0441] According to an embodiment, one or more values determined based on the size of the polar code associated with the PDSCH can be determined based on the size of the first polar code and the number of bits representing the information of the RV.
[0442] For example, suppose the size of the first polarity code is N, and the number of bits representing the information of RV is b. In this case, one or more values determined based on the polarity code size associated with PDSCH can be determined as having The interval. If N is 32 and b is 2, then one or more values determined based on the size of the polar code associated with PDSCH can be determined as {0, 8, 16, 24}. {0, 8, 16, 24} can correspond to {RV0, RV1, RV2, RV3}.
[0443] According to an embodiment, PDSCH-based transmission is a retransmission, and one or more values determined based on the size of the polar code associated with the PDSCH may include 0 or at least one value based on the size N of the first polar code. This uses Figure 20 Let's use 20r2 as an example. The size N of the first polarity code is 32, while the size 2N of the second polarity code is 64. (See reference...) Figure 20 20r2, in the same manner as the initial transmission (20r1), corresponds to a value of 0 for RV0 and a value of 32 for RV2, which is based on the value of the size N of the first polarity code.
[0444] According to an embodiment, based on the fact that the size of the second polar code is greater than the size of the first polar code and the size of the data block is greater than or equal to a specific value, one or more second-bit channel indices may further include one or more fourth-bit channel indices.
[0445] According to an embodiment, a specific value can be determined based on the sorting of the bit channel indices with the highest reliability value among the bit channel indices belonging to the lower polarity subcode of the second polarity code.
[0446] The sorting can be defined as the order of reliability values within the range of all bit channel indices based on the second polarity code.
[0447] The above embodiments can be based on operations related to copying. Figure 15 The description is as follows. Specifically, when the size N of the second polarity code is 16, the bit channel indices belonging to the lower polarity subcode are 0 to 7. Among the bit channel indices 0 to 7, the bit channel index with the highest reliability is 7. All the bit channel indices of the second polarity code rearranged based on reliability (descending order) are as follows, based on the reverse order of 15d.
[0448] {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0}
[0449] The bit channel index 7, which has the highest reliability among the bit channel indices of the lower polarity subcode, is the fifth sorted bit channel index {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0} in a reliability-based (descending) rearrangement. Therefore, in this case, the specific value is 5.
[0450] If the size K of the data block associated with the first codeword is greater than or equal to 5, the second codeword generated for retransmission does not include the first codeword (15b). Therefore, one or more second-bit channel indices may further include one or more fourth-bit channel indices to satisfy the characteristics for supporting IR-HARQ.
[0451] According to an embodiment, one or more fourth-bit channel indices can be determined based on the number of one or more third-bit channel indices and the size of the data block.
[0452] One or more fourth-bit channel indices may be based on a specific number of bit channel indices determined within a specific range of the second polarity code.
[0453] A specific range can be excluded from the specific bit channel index determined based on the size and reliability order of the data block, based on the bit channel index of the second polarity code.
[0454] The following is for reference. Figure 17 The above embodiments are described. (Refer to...) Figure 17 17c, one or more third-bit channel indices are based on bit channel index 31 belonging to the lower polarity subcode (0 to 31). The data block size K is 7.
[0455] The specific bit channel index, determined based on the data block size (7) and the order (descending) of reliability, is {63, 62, 61, 59, 55, 47, 31} (see...). Figure 16(b) One or more fourth bit channel indices may be determined in the bit channel indices (0 to 63) of the second polarity code, excluding specific bit channel indices {63, 62, 61, 59, 55, 47, 31}.
[0456] According to an embodiment, a specific number of bit channel indices can be based on a specific number of bit channel indices determined by reliability order among bit channel indices based on a specific range of upper polarity subcodes. This specific number can also be based on the number of one or more third bit channel indices. Reference will be made below. Figure 17 This will be described in detail.
[0457] refer to Figure 17 In 17c, a specific number of bit channel indices is based on bit channel index 60. One or more third bit channel indices are based on bit channel index 31, therefore the specific number is 1.
[0458] As in Figure 17 As described in the relevant examples, the bit channel index based on a specific range of upper polarity subcodes can be a bit channel index that excludes bit channel indices {63, 62, 61, 59, 55, 47, 31} from the bit channel indices {32 to 63}.
[0459] Among the bit channel indices based on a specific range of upper polarity subcodes, the one with the highest reliability is bit channel index 60. Therefore, one or more fourth bit channel indices can be based on bit channel index 60.
[0460] According to step S2120, UE (e.g.) Figure 2 200a) Based on DCI from BS (e.g. Figure 2 The operation of receiving PDSCH in 200b) can be performed by Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2 One or more processors 202a can control one or more memories 204a and / or one or more transceivers 206a to receive PDSCH from BS200b based on DCI.
[0461] Figure 22 This is a flowchart illustrating a method for a base station to transmit a physical downlink shared channel according to another embodiment of the present disclosure.
[0462] refer to Figure 22 A method for a base station (BS) to transmit a physical downlink shared channel (PDSCH) according to another embodiment of the present disclosure includes step S2210 of transmitting a DCI for scheduling the PDSCH and step S2220 of transmitting the PDSCH based on the DCI.
[0463] In step S2210, the BS sends downlink control information (DCI) to the UE to schedule the Physical Downlink Shared Channel (PDSCH). The PDSCH can be associated with codewords generated based on polar codes.
[0464] According to step S2210, BS (e.g.) Figure 2 200b) to UE (e.g. Figure 2 In section 200a), the DCI operation for sending the PDSCH can be performed by... Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2 One or more processors 202b may control one or more memories 204a and / or one or more transceivers 206a to send DCIs of scheduled PDSCHs to the UE 200a.
[0465] In step S2220, the BS sends a PDSCH to the UE based on the DCI.
[0466] According to an embodiment, if the transmission of PDSCH is an initial transmission, then PDSCH can be associated with a first codeword generated based on a first polarity code.
[0467] The first codeword can be generated based on one or more first bit channel indices allocated to the data block associated with the PDSCH in the bit channel index of the first polarity code.
[0468] According to an embodiment, if the transmission of PDSCH is a retransmission, then PDSCH can be associated with a second codeword generated based on the second polarity code.
[0469] The second codeword can be generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code.
[0470] According to an embodiment, one or more second bit channel indices may include: i) one or more first bit channel indices, or ii) bit channel indices obtained by adding a second specific value to one or more first bit channel indices. See below for reference. Figure 16 To describe its detailed examples.
[0471] If the size of the first polarity code (e.g., the value of the mother code size N) is 32, then one or more first bit channel indices selected in the polarity encoder based on the size of the data block (K=4) associated with the first codeword in reliability order (e.g., descending order) can be 31, 30, 29, and 27 (see...). Figure 16 (a)
[0472] In i), one or more second-bit channel indices can be 31, 30, 29, and 27. In ii), one or more second-bit channel indices can be 63, 62, 61, and 59. In this case, the second specific value can be 32.
[0473] According to an embodiment, the second specific value may be based on the difference between the size of the second polarity code and the size of the first polarity code. This is described in detail with reference to examples related to one or more second bit channel indices.
[0474] If the size N of the second polarity code is 32, then the second specific value is 0 (=32-32). Therefore, one or more second-bit channel indices are the same as one or more first-bit channel indices.
[0475] If the size N of the second polarity code is 64, then the second specific value is 32 (=64-32). Therefore, one or more second bit channel indices can be bit channel indices (e.g., 63, 62, 61, and 59) obtained by adding 32 to one or more first bit channel indices (e.g., 31, 30, 29, and 27).
[0476] According to an embodiment, the size of the second polarity code is 2 times the size of the first polarity code. n The value of the second polar code can be multiplied by 1, where n is an integer equal to or greater than 0. In this case, considering the complexity, the maximum size of the second polar code can be limited to 2 or 4 times the size of the first polar code.
[0477] According to an embodiment, if one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, then the one or more second-bit channel indices may further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0478] To prevent repeated failures in decoding codewords associated with subsequent PDSCH retransmissions due to errors in the PDCCH of the initial PDSCH, the DCI may include the following information.
[0479] According to an embodiment, the DCI may include: i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH, and iii) information indicating the redundant version (RV) associated with the PDSCH.
[0480] According to an embodiment, the information representing RV can represent one of one or more values determined based on the size of the polar code associated with PDSCH. The one or more values determined based on the size of the polar code associated with PDSCH can be associated with at least one of i) the starting point of the lower polar code of the polar code associated with PDSCH or ii) the starting point of the upper polar code of the polar code associated with PDSCH. Reference will be made below. Figure 19 The 19r describes this. One or more values determined based on the size of the polar code associated with PDSCH can include {0, 8, 16, 24}, which are positions within the circular buffer. In this case, 0 and 16, corresponding to RV0 and RV2, respectively, correspond to the starting points of the lower polar code and the upper polar code.
[0481] According to an embodiment, one or more values determined based on the size of the polar code associated with PDSCH can be associated with one or more specific positions in the cyclic buffer where the PDSCH-associated codeword is input.
[0482] According to an embodiment, one or more specific positions may be associated with at least one of i) the first bit channel index of the lower polar subcode of the polar code associated with PDSCH or ii) the first bit channel index of the upper polar subcode of the polar code associated with PDSCH.
[0483] According to an embodiment, one or more values determined based on the size of the polar code associated with the PDSCH can be determined based on the size of the first polar code and the number of bits representing the information of the RV.
[0484] For example, suppose the size of the first polarity code is N, and the number of bits representing the information of RV is b. In this case, one or more values determined based on the polarity code size associated with PDSCH can be determined as having The interval. If N is 32 and b is 2, then one or more values determined based on the size of the polar code associated with PDSCH can be determined as {0, 8, 16, 24}. {0, 8, 16, 24} can correspond to {RV0, RV1, RV2, RV3}.
[0485] According to an embodiment, PDSCH-based transmission is a retransmission, and one or more values determined based on the size of the polar code associated with the PDSCH may include 0 or at least one value based on the size N of the first polar code. This is using Figure 20 The 20r2 is described as an example. The size N of the first polarity code is 32, while the size 2N of the second polarity code is 64. (See reference...) Figure 2020r2, in the same manner as the initial transmission (20r1), has a value of 0 corresponding to RV0, and a value of 32 corresponding to RV0, which is based on the size N of the first polarity code.
[0486] According to an embodiment, based on the fact that the size of the second polar code is greater than the size of the first polar code and the size of the data block is greater than or equal to a specific value, one or more second-bit channel indices may further include one or more fourth-bit channel indices.
[0487] According to an embodiment, a specific value can be determined based on the sorting of the bit channel indices with the highest reliability value among the bit channel indices belonging to the lower polarity subcode of the second polarity code.
[0488] The sorting can be defined as the order of reliability values within the range of all bit channel indices based on the second polarity code.
[0489] The above embodiments can be based on operations related to copying. Figure 15 The description is as follows. Specifically, when the size N of the second polarity code is 16, the bit channel indices belonging to the lower polarity subcode are 0 to 7. Among the bit channel indices 0 to 7, the bit channel index with the highest reliability is 7. All the bit channel indices of the second polarity code rearranged based on reliability (descending order) are as follows, based on the reverse order of 15d.
[0490] {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0}
[0491] The bit channel index 7, which has the highest reliability among the bit channel indices of the lower polarity subcode, is the fifth sorted bit channel index {15, 14, 13, 11, 7, 12, 10, 9, 6, 5, 3, 8, 4, 2, 1, 0} in a reliability-based (descending) rearrangement. Therefore, in this case, the specific value is 5.
[0492] If the size K of the data block associated with the first codeword is greater than or equal to 5, the second codeword generated for retransmission does not include the first codeword (15b). Therefore, one or more second-bit channel indices may further include one or more fourth-bit channel indices to satisfy the characteristics for supporting IR-HARQ.
[0493] According to an embodiment, one or more fourth-bit channel indices can be determined based on the number of one or more third-bit channel indices and the size of the data block.
[0494] One or more fourth-bit channel indices may be based on a specific number of bit channel indices determined within a specific range of the second polarity code.
[0495] A specific range can be determined based on the exclusion of the bit channel index of the second polarity code, which is based on the size of the data block and the reliability order of the specific bit channel index.
[0496] The following is for reference. Figure 17 The above embodiments are described. (Refer to...) Figure 17 17c, one or more third-bit channel indices are based on bit channel index 31 belonging to the lower polarity subcode (0 to 31). The data block size K is 7.
[0497] The specific bit channel index, determined based on the data block size (7) and the order (descending) of reliability, is {63, 62, 61, 59, 55, 47, 31} (see...). Figure 16 (b) One or more fourth bit channel indices can be determined within the range of specific bit channel indices {63, 62, 61, 59, 55, 47, 31} in the bit channel indices (0 to 63) of the second polarity code, excluding the range of specific bit channel indices {63, 62, 61, 59, 55, 47, 31}.
[0498] According to an embodiment, a specific number of bit channel indices can be based on a specific number of bit channel indices determined by reliability order among bit channel indices based on a specific range of upper polarity subcodes. This specific number can also be based on the number of one or more third bit channel indices. Reference will be made below. Figure 17 This will be described in detail.
[0499] refer to Figure 17 In 17c, a specific number of bit channel indices is based on bit channel index 60. One or more third bit channel indices are based on bit channel index 31, therefore the specific number is 1.
[0500] As in Figure 17 As described in the relevant examples, a bit channel index based on a specific range of upper polarity subcodes can be a bit channel index that excludes bit channel indices {63, 62, 61, 59, 55, 47, 31} from bit channel indices {32 to 63}.
[0501] Among the bit channel indices based on a specific range of upper polarity subcodes, the bit channel index with the highest reliability is bit channel index 60. Therefore, one or more fourth bit channel indices can be based on bit channel index 60.
[0502] According to step S2220, BS (e.g.) Figure 2 200b) Based on DCI to UE (e.g. Figure 2 The operation of sending PDSCH in 200a) can be performed by Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2One or more processors 202b may control one or more memories 204a and / or one or more transceivers 206a to send PDSCH to UE 200a based on DCI.
[0503] The embodiments described above have focused on the UE's DCI-based PDSCH reception operation (BS's PDSCH transmission operation). However, the embodiments disclosed herein are not limited to the UE's PDSCH reception operation (BS's PDSCH transmission operation) and can also be applied to the UE's PUSCH transmission operation (BS's PUSCH reception operation). Hereinafter, repeated descriptions will be omitted, and the above embodiments will be described focusing on the UE's PUSCH transmission operation (BS's PUSCH reception operation).
[0504] The UE receives downlink control information (DCI) from the BS to schedule the Physical Uplink Shared Channel (PUSCH). The PUSCH may be associated with codewords generated based on polar codes.
[0505] UE (e.g.) Figure 2 200a) from BS (e.g. Figure 2 In section 200b), the DCI operation for receiving and scheduling PUSCH can be performed by... Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2 One or more processors 202a may control one or more memories 204a and / or one or more transceivers 206a to receive DCIs of scheduled PUSCHs from BS200b.
[0506] The UE sends a PUSCH to the BS based on the DCI.
[0507] According to an embodiment, if the transmission of PUSCH is an initial transmission, then PUSCH can be associated with a first codeword generated based on a first polarity code.
[0508] The first codeword can be generated based on one or more first bit channel indices allocated to the data block associated with PUSCH in the bit channel index of the first polarity code.
[0509] According to an embodiment, if the transmission of PUSCH is a retransmission, then PUSCH can be associated with a second codeword generated based on the second polarity code.
[0510] The second codeword can be generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code.
[0511] According to an embodiment, if one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, then the one or more second-bit channel indices may further include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices.
[0512] To prevent repeated failures in decoding codewords associated with subsequent PUSCH retransmissions due to errors in the PDCCH of the initial PUSCH, the DCI may include the following information.
[0513] According to an embodiment, the DCI may include: i) information indicating the size of the polar code associated with the PUSCH, ii) information indicating whether one or more fourth-bit channel indices are used to generate the codeword associated with the PUSCH, and iii) information indicating the redundant version (RV) associated with the PUSCH.
[0514] According to an embodiment, the information representing RV can represent one of one or more values determined based on the size of the polar code associated with PUSCH. The one or more values determined based on the size of the polar code associated with PUSCH can be associated with at least one of i) the starting point of the lower polar code of the polar code associated with PUSCH or ii) the starting point of the upper polar code of the polar code associated with PUSCH.
[0515] According to an embodiment, one or more values determined based on the size of the polar code associated with the PUSCH can be associated with one or more specific positions in the cyclic buffer where the codeword associated with the PUSCH is input.
[0516] According to an embodiment, one or more specific positions may be associated with at least one of i) the first bit channel index of the lower polar subcode of the polar code associated with PUSCH or ii) the first bit channel index of the upper polar subcode of the polar code associated with PUSCH.
[0517] According to an embodiment, one or more values determined based on the size of the polar code associated with PUSCH can be determined based on the size of the first polar code and the number of bits representing the information of RV.
[0518] For example, suppose the size of the first polarity code is N, and the number of bits representing the information of RV is b. In this case, one or more values determined based on the polarity code size associated with PUSCH can be determined as having The interval. If N is 32 and b is 2, then one or more values determined based on the size of the polar code associated with PUSCH can be determined as {0, 8, 16, 24}. {0, 8, 16, 24} can correspond to {RV0, RV1, RV2, RV3}.
[0519] According to an embodiment, PUSCH-based transmission is a retransmission, and one or more values determined based on the size of the polar code associated with the PUSCH may include 0 or at least one value based on the size N of the first polar code. This is using Figure 20 The 20r2 is described as an example. The size N of the first polarity code is 32, while the size 2N of the second polarity code is 64. (See reference...) Figure 20 20r2, in the same manner as the initial transmission (20r1), corresponds to a value of 0 for RV0 and a value of 32 for RV2, which is based on the value of the size N of the first polarity code.
[0520] UE (e.g.) Figure 2 200a) Based on DCI to BS (e.g. Figure 2 The operation of sending PUSCH in 200b) can be performed by Figures 1 to 4 This is achieved using equipment. For example, refer to... Figure 2 One or more processors 202a may control one or more memories 204a and / or one or more transceivers 206a to transmit PUSCH to BS200b based on DCI.
[0521] For ease of explanation, the above operations have been described focusing on the UE's operations. However, the UE's DCI receive operation corresponds to the BS's DCI transmit operation, and the UE's PUSCH transmit operation corresponds to the BS's PUSCH receive operation.
[0522] The effects of the method and apparatus for transmitting and receiving physical shared channels based on HARQ in a wireless communication system according to embodiments of this disclosure are described below.
[0523] According to embodiments of this disclosure, if the PDSCH transmission is a retransmission, a second codeword associated with the PDSCH is generated based on one or more fourth-bit channel indices. Even if the data bits are arranged in the bit channel index of the lower polarity subcode, the second codeword is generated based on one or more fourth-bit channel indices, thus satisfying the support characteristics of IR-HARQ. As described above, since polarity-based IR HARQ can be used for data transmission, system performance can be improved in terms of reliability.
[0524] Furthermore, according to the polar code-based IR HARQ scheme, since the received bits are immediately combined without decoding, the performance of polar code-based HARQ operation can be further improved compared with the existing IF-HARQ scheme.
[0525] According to embodiments of this disclosure, the DCI for scheduling PDSCH includes information indicating whether one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH.
[0526] Therefore, even if the UE fails to receive the PDCCH of the initial scheduled transmission, it can still perform normal decoding of the codewords associated with the PDSCH based on the DCI of the subsequently retransmitted PDSCH. For polar code-based IR-HARQ applied to data transmission, this improves robustness against PDCCH errors.
[0527] Furthermore, it prevents erroneous operations caused by PDCCH detection failure (codeword decoding failure related to PDSCH). By preventing unnecessary PDSCH retransmissions, the signaling process for polar code-based IR-HARQ support can be improved in terms of signaling overhead and UE power consumption.
[0528] According to embodiments of this disclosure, the DCI includes information indicating a redundant version (RV) associated with the PDSCH, and the information indicating the RV represents one of one or more values determined based on the size of the polar code associated with the PDSCH. One of the one or more values determined based on the size of the polar code associated with the PDSCH may be associated with one or more specific locations within the circular buffer where the PDSCH-associated codeword is input. Furthermore, the one or more specific locations may be associated with at least one of i) a first-bit channel index of the lower polar code of the PDSCH-associated polar code, or ii) a first-bit channel index of the upper polar code of the PDSCH-associated polar code.
[0529] If the encoded bits in the circular buffer are selected and retransmitted based on the rate matching type, the starting point of the lower polarity subcode or the upper polarity subcode can be indicated within the circular buffer via RV. Therefore, decoding of the retransmission-related codeword can be performed based on a mother code size smaller than the mother code size used to generate the codeword. This offers advantages in terms of receiver implementation complexity.
[0530] Here, in the device disclosed herein (e.g., Figure 2The wireless communication technologies implemented in (200a / 200b) may include LTE, NR, and 6G, as well as Narrowband Internet of Things (NB-IoT) for low-power communication. For example, NB-IoT technology may be an example of LPWAN (Low Power Wide Area Network) technology and may be implemented in standards such as LTE Cat NB1 and / or LTE Cat NB2, and is not limited to the aforementioned names. Additionally or alternatively, in the devices disclosed herein (e.g., Figure 2 The wireless communication technology implemented in (200a / 200b) can perform communication based on LTE-M technology. For example, LTE-M technology can be an example of LPWAN technology and can be referred to by various names such as Enhanced Machine Type Communication (eMTC). For example, LTE-M technology can be implemented in at least one of various standards such as 1) LTE CAT 0, 2) LTE CAT M1, 3) LTE CAT M2, 4) LTE non-BL (non-bandwidth limited), 5) LTE-MTC, 6) LTE Machine Type Communication and / or 7) LTE M, and is not limited to the names mentioned above. Additionally or alternatively, considering low-power communication, the devices disclosed herein (e.g., Figure 2 The wireless communication technologies implemented in 200a / 200b) may include at least one of ZigBee, Bluetooth, and Low Power Wide Area Network (LPWAN), and are not limited to the names mentioned above. For example, ZigBee technology can generate PANs (Personal Area Networks) related to small / low power digital communication based on various standards such as IEEE 802.15.4, and can be referred to by various names.
[0531] The embodiments of this disclosure described above are combinations of elements and features of this disclosure. Unless otherwise stated, these elements or features may be considered optional. Each element or feature may be practiced without combination with other elements or features. Furthermore, embodiments of this disclosure may be constructed by combining portions of elements and / or features. The order of operations described in the embodiments of this disclosure may be rearranged. Some constructions of any embodiment may be included in another embodiment and may be replaced by corresponding constructions of another embodiment. It will be apparent to those skilled in the art that claims not expressly referenced in each other in the appended claims may be presented as a combination of embodiments of this disclosure or included as new claims by subsequent amendments after filing.
[0532] The embodiments of this disclosure can be implemented in various ways, such as hardware, firmware, software, or a combination thereof. In a hardware configuration, the methods according to the embodiments of this disclosure can be implemented using one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital information processing devices (DSPDs), programmable logic devices (PLDs), field-programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, etc.
[0533] In firmware or software configurations, embodiments of this disclosure can be implemented in the form of modules, programs, functions, etc. For example, software code can be stored in memory units and executed by a processor. The memory can be located inside or outside the processor and can send data to and receive data from the processor via various known methods.
[0534] Those skilled in the art will understand that this disclosure can be performed in other specific ways besides those described herein without departing from the spirit and essential characteristics of this disclosure. Therefore, the above embodiments are to be interpreted in all respects as illustrative and not restrictive. The scope of this disclosure should be determined by the appended claims and their legal equivalents, not by the foregoing description, and all variations in the meaning and equivalence of the appended claims are intended to be included therein.
Claims
1. A method for a user equipment (UE) to receive a physical downlink shared channel (PDSCH) in a wireless communication system, the method comprising: Receive downlink control information (DCI) that schedules the PDSCH, which is associated with codewords generated based on polar codes; as well as The PDSCH is received based on the DCI. The transmission based on the PDSCH is the initial transmission, and the PDSCH is associated with the first codeword generated based on the first polarity code. The first codeword is generated based on one or more first bit channel indices allocated to the data block associated with the PDSCH in the bit channel index of the first polarity code. In this case, the transmission based on the PDSCH is a retransmission, and the PDSCH is related to the second codeword generated based on the second polarity code. The second codeword is generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code. Specifically, the one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices also include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices. The DCI includes i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH, and iii) information indicating the redundancy version (RV) associated with the PDSCH. Wherein, the information representing the RV represents one of one or more values determined based on the size of the polar code associated with the PDSCH, and The one or more values determined based on the size of the polar code associated with the PDSCH are associated with at least one of i) the starting point of the lower polar subcode in the polar code associated with the PDSCH, or ii) the starting point of the upper polar subcode in the polar code associated with the PDSCH.
2. The method according to claim 1, wherein, The one or more values determined based on the magnitude of the polar code associated with the PDSCH are associated with one or more specific positions within the cyclic buffer, and the codeword associated with the PDSCH is input into the cyclic buffer.
3. The method according to claim 2, wherein, The one or more specific positions are associated with at least one of i) the first bit channel index of the lower polarity subcode of the polarity code associated with the PDSCH, or ii) the first bit channel index of the upper polarity subcode of the polarity code associated with the PDSCH.
4. The method according to claim 3, wherein, The one or more values determined based on the size of the first polar code and the number of bits representing the information of the RV are determined based on the size of the polar code associated with the PDSCH.
5. The method according to claim 1, wherein, Based on the fact that the size of the second polarity code is greater than the size of the first polarity code and the size of the data block is greater than or equal to a specific value, the one or more second-bit channel indices further include the one or more fourth-bit channel indices.
6. The method according to claim 5, wherein, The specific value is determined based on the order of the bit channel indices with the highest reliability among the bit channel indices belonging to the second polarity code. The sorting is defined as the order of the reliability values within the range of all bit channel indices of the second polarity code.
7. The method according to claim 1, wherein, The one or more fourth-bit channel indices are determined based on the number of the one or more third-bit channel indices and the size of the data block.
8. The method according to claim 7, wherein, The one or more fourth-bit channel indices are based on a specific number of bit channel indices determined within a specific range of the second polarity code, and The specific range is defined as the range within the bit channel index of the second polarity code, excluding the specific bit channel index determined based on the order of the data block size and reliability.
9. The method according to claim 8, wherein, The specific number of bit channel indices is determined based on the reliability order among the bit channel indices of the upper polarity subcode based on the specific range.
10. The method according to claim 9, wherein, The specific quantity is based on the number of the one or more third-bit channel indices.
11. A user equipment (UE) that receives a physical downlink shared channel (PDSCH) in a wireless communication system, the UE comprising: One or more transceivers; One or more processors, the one or more processors being configured to control the one or more transceivers; as well as One or more memories, operatively connected to the one or more processors. The one or more memories are configured to store instructions, which, based on execution by the one or more processors, allow the one or more processors to perform operations. The operation includes: Receive downlink control information (DCI) for scheduling the PDSCH, wherein the PDSCH is associated with codewords generated based on polar codes; and The PDSCH is received based on the DCI. The transmission based on the PDSCH is the initial transmission, and the PDSCH is associated with the first codeword generated based on the first polarity code. The first codeword is generated based on one or more first bit channel indices allocated to the data block associated with the PDSCH in the bit channel index of the first polarity code. In this case, the transmission based on the PDSCH is a retransmission, and the PDSCH is related to the second codeword generated based on the second polarity code. The second codeword is generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code. Specifically, the one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices also include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices. The DCI includes i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH, and iii) information indicating the redundancy version (RV) associated with the PDSCH. Wherein, the information representing the RV represents one of one or more values determined based on the size of the polar code associated with the PDSCH, and The one or more values determined based on the size of the polar code associated with the PDSCH are associated with at least one of i) the starting point of the lower polar subcode in the polar code associated with the PDSCH, or ii) the starting point of the upper polar subcode in the polar code associated with the PDSCH.
12. A base station (BS) for transmitting a physical downlink shared channel (PDSCH) in a wireless communication system, the BS comprising: One or more transceivers; One or more processors, the one or more processors being configured to control the one or more transceivers; as well as One or more memories, operatively connected to the one or more processors. The one or more memories are configured to store instructions, which, based on execution by the one or more processors, allow the one or more processors to perform operations. The operation includes: Sending downlink control information (DCI) to schedule the PDSCH, the PDSCH being associated with codewords generated based on polar codes; and The PDSCH is sent based on the DCI. The transmission based on the PDSCH is the initial transmission, and the PDSCH is associated with the first codeword generated based on the first polarity code. The first codeword is generated based on one or more first bit channel indices allocated to the data block associated with the PDSCH in the bit channel index of the first polarity code. In this case, the transmission based on the PDSCH is a retransmission, and the PDSCH is related to the second codeword generated based on the second polarity code. The second codeword is generated based on one or more second bit channel indices allocated to the data block from the bit channel index of the second polarity code. Specifically, the one or more second-bit channel indices include one or more third-bit channel indices belonging to the lower polarity subcode of the second polarity code, and the one or more second-bit channel indices also include one or more fourth-bit channel indices determined based on the one or more third-bit channel indices. The DCI includes i) information indicating the size of the polar code associated with the PDSCH, ii) information indicating whether the one or more fourth-bit channel indices are used to generate codewords associated with the PDSCH, and iii) information indicating the redundancy version (RV) associated with the PDSCH. Wherein, the information representing the RV represents one of one or more values determined based on the size of the polar code associated with the PDSCH, and The one or more values determined based on the size of the polar code associated with the PDSCH are associated with at least one of i) the starting point of the lower polar subcode in the polar code associated with the PDSCH, or ii) the starting point of the upper polar subcode in the polar code associated with the PDSCH.