Method and device for applying orthogonal covering code to non-terrestrial network uplink channel in wireless communication system
By applying orthogonal covering codes to uplink channels in NTN systems, particularly for PUSCH and iterative transmissions, the method addresses capacity and reliability issues, enhancing transmission efficiency in satellite communications.
Patent Information
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- HYUNDAI MOTOR CO LTD
- Filing Date
- 2025-10-15
- Publication Date
- 2026-05-07
AI Technical Summary
Existing wireless communication systems face challenges in enhancing uplink capacity and reliability for non-terrestrial networks (NTNs), particularly in scenarios involving satellite communications, where orthogonal covering codes (OCC) are not effectively applied to improve transmission efficiency.
The application of orthogonal covering codes (OCC) to uplink channels, specifically for physical uplink shared channels (PUSCH) and iterative transmissions in NTN systems, utilizing redundancy version (RV) cycling patterns to optimize signal mapping across multiple slots.
This approach enhances uplink capacity and improves transmission reliability in NTN systems by effectively utilizing OCCs, enabling efficient signal transmission and reception in non-terrestrial environments.
Smart Images

Figure KR2025095655_07052026_PF_FP_ABST
Abstract
Description
Method and apparatus for applying an orthogonal covering code to a non-terrestrial network uplink channel in a wireless communication system
[0001] The present disclosure relates to a non-terrestrial network (NTN) in a wireless communication system, and more specifically, to a method and apparatus for applying an orthogonal covering code (OCC) to an uplink channel.
[0002] Communication networks (e.g., 5G communication networks, 6G communication networks, etc.) are being developed to provide communication services that are improved over existing communication networks (e.g., LTE (long term evolution), LTE-A (advanced), etc.). 5G communication networks (e.g., NR (new radio) communication networks) can support frequency bands above 6 GHz as well as frequency bands below 6 GHz. That is, 5G communication networks can support the FR1 band and / or FR2 band. 5G communication networks can support a wider variety of communication services and scenarios compared to LTE communication networks. For example, usage scenarios for 5G communication networks may include eMBB (enhanced Mobile BroadBand), URLLC (Ultra Reliable Low Latency Communication), mMTC (massive Machine Type Communication), etc.
[0003] 6G communication networks can support a wider variety of communication services and scenarios compared to 5G communication networks. 6G communication networks can meet the requirements for ultra-high performance, ultra-bandwidth, ultra-spatial, ultra-precision, ultra-intelligence, and / or ultra-reliability. 6G communication networks can support a wide range of frequency bands and can be applied to various usage scenarios (e.g., terrestrial communication, non-terrestrial communication, sidelink communication, etc.).
[0004] 6G communication networks can support a wider variety of communication services and scenarios compared to 5G communication networks. 6G communication networks can meet the requirements for ultra-high performance, ultra-bandwidth, ultra-spatial, ultra-precision, ultra-intelligence, and / or ultra-reliability. 6G communication networks can support a wide range of frequency bands and can be applied to various usage scenarios (e.g., terrestrial communication, non-terrestrial communication, sidelink communication, etc.).
[0005] Communication networks (e.g., 5G communication networks, 6G communication networks, etc.) can provide communication services to terminals located on the ground. There is an increasing demand for communication services for aircraft, drones, satellites, and other non-terrestrial entities as well as those located on the ground, and to meet this demand, technologies for non-terrestrial networks (NTNs) are being discussed. NTNs can be implemented based on 5G communication technologies, 6G communication technologies, etc. For example, in an NTN, communication between a satellite and a communication node located on the ground or a communication node located non-terrestrial (e.g., an aircraft, a drone, etc.) can be performed based on 5G communication technologies, 6G communication technologies, etc. In an NTN, a satellite can perform the function of a base station in a communication network (e.g., 5G communication networks, 6G communication networks, etc.).
[0006] Meanwhile, the technology forming the background of the invention is written to enhance understanding of the background of the invention and may include content that is not prior art already known to a person with ordinary knowledge in the field to which this technology belongs.
[0007] The present disclosure may provide a method and apparatus for applying an orthogonal covering code (OCC) to an uplink channel in a wireless communication system supporting a non-terrestrial network (NTN).
[0008] The present disclosure may provide a method and apparatus for applying OCC to repeated transmission of a PUSCH (physical uplink shared channel) in a wireless communication system.
[0009] The present disclosure may provide a method and apparatus for applying OCC to TBoMS iterative transmission in a wireless communication system.
[0010] The present disclosure may provide a method and apparatus for arranging multiple slots included in TBoMS in a wireless communication system in a plurality of slots.
[0011] The present disclosure may provide a method and apparatus for applying OCC based on a redundancy version (RV) cycling pattern in a wireless communication system.
[0012] The present disclosure may provide a method and apparatus for placing an OCC block based on the RV value of slots containing UL (uplink) data in a wireless communication system.
[0013] The present disclosure may provide a method and apparatus for transmitting configuration information for applying OCC to PUSCH repetitive transmission in a wireless communication system.
[0014] The technical objectives to be achieved in this disclosure are not limited to those mentioned above, and other unmentioned technical problems may be considered by those skilled in the art to which the technical configuration of this disclosure applies, based on the embodiments of this disclosure described below.
[0015] According to one embodiment of the present disclosure, a method of operation of a terminal in a wireless communication system comprises receiving configuration information for the application of an orthogonal covering code (OCC) in an uplink (UL), generating UL data, mapping signals including the UL data to a plurality of slots based on a physical uplink shared channel (PUSCH) repetition, applying the OCC to the signals, and transmitting the signals in the plurality of slots, wherein the signals may include signals generated according to at least one RV value by applying a redundancy version (RV) cycling.
[0016] According to one embodiment of the present disclosure, a method of operation of a non-terrestrial network (NTN) base station in a wireless communication system comprises transmitting configuration information for the application of an orthogonal covering code (OCC) in an uplink (UL) and receiving signals to which the OCC is applied, wherein the signals may include signals generated according to at least one RV value by applying a redundancy version (RV) cycling.
[0017] According to one embodiment of the present disclosure, a terminal in a wireless communication system comprises at least one transceiver, at least one processor, and at least one memory connected to the at least one processor to be operable and storing instructions that control the terminal to perform operations when executed by the processor, wherein the operations include receiving configuration information for the application of an orthogonal covering code (OCC) in an uplink (UL), generating UL data, mapping signals containing the UL data to a plurality of slots based on a physical uplink shared channel (PUSCH) iteration, applying the OCC to the signals, and transmitting the signals in the plurality of slots, wherein the signals may include signals generated according to at least one RV value by applying a redundancy version (RV) cycling.
[0018] According to one embodiment of the present disclosure, a base station in a wireless communication system comprises at least one transceiver, at least one processor, and at least one memory connected to the at least one processor to be operable and storing instructions that control the terminal to perform operations when executed by the processor, wherein the operations include transmitting configuration information for the application of an orthogonal covering code (OCC) in an uplink (UL) and receiving signals to which the OCC is applied, and wherein the signals may include signals generated according to at least one RV value by the application of redundancy version (RV) cycling.
[0019] The proposed technology enables the improvement of uplink capacity in wireless communication systems supporting non-terrestrial networks (NTN) and can contribute to the practical application of OCC.
[0020] The effects obtainable from the embodiments of the present disclosure are not limited to those mentioned above, and other unmentioned effects can be clearly derived and understood by a person skilled in the art to which the technical configuration of the present disclosure applies from the description of the embodiments of the present disclosure below. That is, unintended effects resulting from implementing the configuration described in the present disclosure can also be derived by a person skilled in the art from the embodiments of the present disclosure.
[0021] FIGS. 1a and 1b illustrate the structure of a transparent-based non-terrestrial network (NTN) according to an embodiment of the present disclosure.
[0022] FIGS. 2a to 2c illustrate the structure of a regenerative-based NTN according to an embodiment of the present disclosure.
[0023] FIG. 3 illustrates a block diagram of a communication node constituting an NTN according to an embodiment of the present disclosure.
[0024] FIG. 4 illustrates a block diagram of a communication node according to an embodiment of the present disclosure.
[0025] FIGS. 5A and 5B illustrate block diagrams of a transmission path and a reception path of a communication node according to an embodiment of the present disclosure.
[0026] FIG. 6 illustrates an example of a system frame in a wireless communication system according to an embodiment of the present disclosure.
[0027] FIG. 7 illustrates an example of a subframe in a wireless communication system according to an embodiment of the present disclosure.
[0028] FIG. 8 illustrates an example of a slot in a wireless communication system according to an embodiment of the present disclosure.
[0029] FIG. 9 illustrates the timing relationship between the uplink and downlink in a wireless communication system according to an embodiment of the present disclosure.
[0030] FIGS. 10a and FIG. 10b illustrate examples of protocol stacks of the user plane and control plane in a transparent payload-based NTN in a wireless communication system according to an embodiment of the present disclosure.
[0031] FIGS. 11a and 11b illustrate examples of protocol stacks of the user plane and the control plane in a regenerated payload-based NTN in a wireless communication system according to an embodiment of the present disclosure.
[0032] FIG. 12 illustrates an example of an NTN that provides non-terrestrial NR access to a UE through an NTN payload and an NTN gateway.
[0033] Figure 13 illustrates the timing relationship between objects included in NTN.
[0034] FIG. 14 illustrates an example of repetitive transmission and OCC application in a wireless communication system according to one embodiment of the present disclosure.
[0035] FIG. 15 illustrates examples of OCC application techniques in a wireless communication system according to one embodiment of the present disclosure.
[0036] Figure 16 illustrates examples of non-TBoMS iterative transmission and TBoMS iterative transmission.
[0037] FIG. 17 illustrates an example of a procedure for transmitting a PUSCH with OCC applied in a wireless communication system according to an embodiment of the present disclosure.
[0038] FIG. 18 illustrates an example of a procedure for receiving a PUSCH with OCC applied in a wireless communication system according to an embodiment of the present disclosure.
[0039] FIG. 19 illustrates an example of a procedure for determining the slot location of TBoMS in a wireless communication system according to one embodiment of the present disclosure.
[0040] FIG. 20 illustrates an example of the arrangement of each part of TBoMS based on a continuous arrangement length in a wireless communication system according to one embodiment of the present disclosure.
[0041] FIG. 21 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=2.
[0042] FIG. 22 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=3.
[0043] FIG. 23 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=4.
[0044] FIG. 24 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=7.
[0045] FIG. 25 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=8.
[0046] FIG. 26 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=12.
[0047] FIG. 27 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=16.
[0048] FIG. 28 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=2.
[0049] FIG. 29 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=3.
[0050] FIG. 30 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=4.
[0051] FIG. 31 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=7.
[0052] FIG. 32 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=8.
[0053] FIG. 33 illustrates an example of a configuration method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=2.
[0054] FIG. 34 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=3.
[0055] FIG. 35 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=4.
[0056] FIG. 36 illustrates an example of a procedure for placing an OCC block in a wireless communication system according to one embodiment of the present disclosure.
[0057] FIG. 37 illustrates an example of an OCC block placement method in a wireless communication system according to one embodiment of the present disclosure.
[0058] FIG. 38 illustrates another example of an OCC block placement method in a wireless communication system according to one embodiment of the present disclosure.
[0059] FIG. 39 shows the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having RV and RV is 2.
[0060] FIG. 40 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 4.
[0061] FIG. 41 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 6.
[0062] FIG. 42 shows the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 8.
[0063] FIG. 43 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having RV is 12.
[0064] FIG. 44 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having RVs is 16.
[0065] FIG. 45 illustrates an example of the transmission and agreement procedure of information for applying slot-unit OCC in TBoMS iterative transmission in a wireless communication system according to one embodiment of the present disclosure.
[0066] FIG. 46 illustrates examples of repeated TBoMS transmissions of a legacy terminal in a wireless communication system according to one embodiment of the present disclosure.
[0067] FIG. 47 illustrates an example of determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure.
[0068] FIG. 48 illustrates another example of a method for determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure.
[0069] FIG. 49 illustrates another example of a method for determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure.
[0070] The present disclosure is capable of various modifications and may have various embodiments, and specific embodiments are illustrated in the drawings and described in detail. However, this is not intended to limit the present disclosure to specific embodiments and should be understood to include all modifications, equivalents, and substitutions that fall within the spirit and scope of the present disclosure.
[0071] Terms such as "first," "second," etc., may be used to describe various components, but said components should not be limited by said terms. Such terms are used solely for the purpose of distinguishing one component from another. For example, without departing from the scope of the present disclosure, the first component may be named the second component, and similarly, the second component may be named the first component. The term "and / or" may mean a combination of a plurality of related described items or any of a plurality of related described items.
[0072] In the present disclosure, "at least one of A and B" may mean "at least one of A or B" or "at least one of one or more combinations of A and B". Additionally, in the present disclosure, "at least one of A and B" may mean "at least one of A or B" or "at least one of one or more combinations of A and B".
[0073] In the present disclosure, (re)transmission may mean "transmission," "retransmission," or "transmission and retransmission"; (re)setting may mean "setting," "resetting," or "setting and resetting"; (re)connection may mean "connection," "reconnection," or "connection and reconnection"; and (re)connection may mean "connection," "reconnection," or "connection and reconnection".
[0074] When it is stated that one component is "connected" or "connected" to another component, it should be understood that while it may be directly connected or connected to that other component, there may also be other components in between. On the other hand, when it is stated that one component is "directly connected" or "directly connected" to another component, it should be understood that there are no other components in between.
[0075] The terms used in this disclosure are used merely to describe specific embodiments and are not intended to limit this disclosure. The singular expression includes the plural expression unless the context clearly indicates otherwise. In this disclosure, terms such as “comprising” or “having” are intended to specify the existence of the features, numbers, steps, actions, components, parts, or combinations thereof described in the specification, and should be understood as not precluding the existence or addition of one or more other features, numbers, steps, actions, components, parts, or combinations thereof.
[0076] Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as generally understood by those skilled in the art to which this disclosure pertains. Terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant technology, and should not be interpreted in an ideal or overly formal sense unless explicitly defined in this disclosure.
[0077] Hereinafter, preferred embodiments of the present disclosure will be described in more detail with reference to the attached drawings. To facilitate overall understanding in describing the present disclosure, the same reference numerals are used for identical components in the drawings, and redundant descriptions of identical components are omitted. Operations according to combinations of embodiments, extensions of embodiments, and / or modifications of embodiments may be performed, as well as the embodiments explicitly described in the present disclosure. The performance of some operations may be omitted, and the order of operations may be changed.
[0078] In the embodiments, even when a method performed at a first communication node among the communication nodes (e.g., transmission or reception of a signal) is described, the corresponding second communication node may perform a method corresponding to the method performed at the first communication node (e.g., reception or transmission of a signal). That is, when the operation of a UE (user equipment) is described, the corresponding base station may perform an operation corresponding to the operation of the UE. Conversely, when the operation of a base station is described, the corresponding UE may perform an operation corresponding to the operation of the base station.
[0079] A base station may be referred to as Node B, evolved Node B, gNode B (next generation node B), gNB, device, apparatus, node, communication node, BTS (base transceiver station), RRH (radio remote head), TRP (transmission reception point), RU (radio unit), RSU (road side unit), radio transceiver, access point, access node, etc. A UE may be referred to as terminal, device, apparatus, node, communication node, end node, access terminal, mobile terminal, station, subscriber station, mobile station, portable subscriber station, OBU (on-broad unit), etc.
[0080] In the present disclosure, signaling may be at least one of upper-layer signaling, MAC signaling, or PHY (physical) signaling. A message used for upper-layer signaling may be referred to as an "upper-layer message" or an "upper-layer signaling message." A message used for MAC signaling may be referred to as a "MAC message" or a "MAC signaling message." A message used for PHY signaling may be referred to as a "PHY message" or a "PHY signaling message." Upper-layer signaling may refer to the transmission and reception operations of system information (e.g., MIB (master information block), SIB (system information block)) and / or RRC messages. MAC signaling may refer to the transmission and reception operations of MAC CE (control element). PHY signaling may refer to the transmission and reception operations of control information (e.g., DCI (downlink control information), UCI (uplink control information), SCI (sidelink control information)).
[0081] In the present disclosure, "setting an operation (e.g., transmission operation)" may mean that "setting information for said operation (e.g., information element, parameter)" and / or "information directing the performance of said operation" is signaled. "Setting an information element (e.g., parameter)" may mean that said information element is signaled. In the present disclosure, "signal and / or channel" may mean signal, channel, or "signal and channel," and signal may be used to mean "signal and / or channel."
[0082] A communication system may include at least one of a terrestrial network (TN), an NTN, a 4G communication network (e.g., an LTE (long-term evolution) communication network), a 5G communication network (e.g., an NR (new radio) communication network), or a 6G communication network. Each of the 4G communication network, the 5G communication network, and the 6G communication network may include a terrestrial network and / or an NTN. The NTN may be operated based on at least one of LTE communication technology, 5G communication technology, or 6G communication technology. The NTN may provide communication services in various frequency bands.
[0083] The communication networks to which the embodiments of the present disclosure are applied are not limited to those described below, and the embodiments may be applied to various communication networks (e.g., 4G communication networks, 5G communication networks, and / or 6G communication networks). Here, the term "communication network" may be used interchangeably with "communication system."
[0084] FIGS. 1a and 1b illustrate the structure of a transparent-based non-terrestrial network (NTN) according to an embodiment of the present disclosure.
[0085] Referring to FIG. 1a, the NTN may include a satellite (110), a communication node (120), a gateway (130), a data network (140), etc. A unit including the satellite (110) and the gateway (130) may be referred to as a remote radio unit (RRU). The satellite (110) may be a low earth orbit (LEO) satellite, a medium earth orbit (MEO) satellite, a geostationary earth orbit (GEO) satellite, a high elliptical orbit (HEO) satellite, or an unmanned aircraft system (UAS) platform. A UAS platform may include a high altitude platform station (HAPS). A non-GEO satellite may be a LEO satellite and / or an MEO satellite.
[0086] The communication node (120) may include a communication node located on the ground (e.g., UE, terminal) and a communication node located off the ground (e.g., airplane, drone). A service link may be established between the satellite (110) and the communication node (120), and the service link may be a radio link. The satellite (110) may be referred to as an NTN payload. The gateway (130) may support multiple NTN payloads. The satellite (110) may provide communication services to the communication node (120) using one or more beams. The shape of the receiving range (footprint) of the satellite (110) beam may be elliptical or circular.
[0087] In NTN, three types of service links can be supported as follows.
[0088] - Earth-fixed: Service links can be provided by beam(s) that always continuously cover the same geographic area (e.g., GSO (Geosynchronous Orbit) satellites)
[0089] - Quasi-earth-fixed: Service links may be provided by beam(s) that cover one geographic area for a limited period and another geographic area for a different period (e.g., NGSO (non-GSO) satellites generating steerable beams).
[0090] - Earth-moving: Service links may be provided by beam(s) moving across the Earth's surface (e.g., NGSO satellites generating fixed beams or non-steeringable beams)
[0091] A communication node (120) can communicate with a satellite (110) (e.g., downlink communication, uplink communication) using 4G communication technology, 5G communication technology, and / or 6G communication technology. Communication between the satellite (110) and the communication node (120) can be performed using an NR-Uu interface and / or a 6G-Uu interface. If dual connectivity (DC) is supported, the communication node (120) can be connected to the satellite (110) as well as other base stations (e.g., base stations supporting 4G functions, 5G functions, and / or 6G functions), and can perform DC operations based on the technology defined in the 4G specifications, 5G specifications, and / or 6G specifications.
[0092] The gateway (130) may be located on the ground, and a feeder link may be established between the satellite (110) and the gateway (130). The feeder link may be a wireless link. The gateway (130) may be referred to as an 'NTN gateway'. Communication between the satellite (110) and the gateway (130) may be performed based on an NR-Uu interface, a 6G-Uu interface, or a satellite radio interface (SRI). The gateway (130) may be connected to a data network (140). A "core network" may exist between the gateway (130) and the data network (140). In this case, the gateway (130) may be connected to the core network, and the core network may be connected to the data network (140). The core network may support 4G communication technology, 5G communication technology, and / or 6G communication technology. For example, the core network may include an access and mobility management function (AMF), a user plane function (UPF), a session management function (SMF), etc. Communication between the gateway (130) and the core network may be performed based on an NG-C / U interface or a 6G-C / U interface.
[0093] As shown in FIG. 1b, in a transparent payload-based NTN, a base station and a core network may exist between the gateway (130) and the data network (140).
[0094] Referring to FIG. 1b, the gateway can be connected to a base station, the base station can be connected to a core network, and the core network can be connected to a data network. Each of the base station and the core network can support 4G communication technology, 5G communication technology, and / or 6G communication technology. Communication between the gateway and the base station can be performed based on an NR-Uu interface or a 6G-Uu interface, and communication between the base station and the core network (e.g., AMF, UPF, SMF) can be performed based on an NG-C / U interface or a 6G-C / U interface.
[0095] FIGS. 2a to 2c illustrate the structure of a regenerative-based NTN according to an embodiment of the present disclosure.
[0096] Referring to FIG. 2a, the NTN may include a first satellite (211), a second satellite (212), a communication node (220), a gateway (230), a data network (1240), etc. Each of the first satellite (211) and the second satellite (212) may perform a regeneration operation (e.g., demodulation operation, decoding operation, re-encoding operation, re-modulation operation, and / or filtering operation) on a payload received from other entities constituting the NTN (e.g., communication node (220), gateway (230)), and may transmit the regenerated payload.
[0097] Each of the first satellite (211) and the second satellite (212) may be an LEO satellite, MEO satellite, GEO satellite, HEO satellite, or UAS platform. The UAS platform may include HAPS. Satellite #1 (211) may be connected to the second satellite (212), and an inter-satellite link (ISL) may be established between the first satellite (211) and the second satellite (212). The ISL may operate in a radio frequency (RF) frequency or optical band. The ISL may be established optionally. Communication nodes (220) may include communication nodes located on the ground (e.g., UE, terminal) and communication nodes located off the ground (e.g., airplane, drone). A service link (e.g., wireless link) may be established between satellite #1 (211) and the communication nodes (220). The first satellite (211) may be referred to as an NTN payload. The first satellite (211) can provide communication services to the communication node (220) using one or more beams.
[0098] The communication node (220) can communicate (e.g., downlink communication, uplink communication) with the first satellite (211) using 4G communication technology, 5G communication technology, and / or 6G communication technology. Communication between the first satellite (211) and the communication node (220) can be performed using an NR-Uu interface or a 6G-Uu interface. If DC is supported, the communication node (220) can be connected to the first satellite (211) as well as other base stations (e.g., base stations supporting 4G functions, 5G functions, and / or 6G functions), and can perform DC operations based on the technology defined in the 4G specifications, 5G specifications, and / or 6G specifications.
[0099] The gateway (230) may be located on the ground, and a feeder link may be established between the first satellite (211) and the gateway (230), and a feeder link may be established between the second satellite (212) and the gateway (230). The feeder link may be a wireless link. If an ISL is not established between the first satellite (211) and the second satellite (212), a feeder link between the first satellite (211) and the gateway (230) may be established mandatorily. Communication between the gateway (230) and each of the first satellite (211) and satellite #2 (212) may be performed based on an NR-Uu interface, a 6G-Uu interface, or SRI. The gateway (230) may be connected to a data network (240).
[0100] As in the embodiments of FIGS. 2b and 2c, a core network may exist between the gateway (230) and the data network (240).
[0101] Referring to FIGS. 2b and 2c, the gateway can be connected to a core network, and the core network can be connected to a data network. The core network can support 4G communication technology, 5G communication technology, and / or 6G communication technology. For example, the core network may include an AMF, UPF, SMF, etc. Communication between the gateway and the core network may be performed based on an NG-C / U interface or a 6G-C / U interface. The functions of a base station may be performed by a satellite. That is, the base station may be located on a satellite. The payload may be processed by the base station located on the satellite. Base stations located on different satellites may be connected to the same core network. A single satellite may have one or more base stations. In the NTN of FIG. A-2b, an ISL between satellites may not be established, while in the NTN of FIG. A-2c, an ISL between satellites may be established.
[0102] Meanwhile, entities constituting the NTN illustrated in FIG. 1a, FIG. 1b, FIG. 2a, FIG. 2b, and / or FIG. 2c (e.g., satellite, base station, UE, communication node, gateway, etc.) may be configured as follows. In the present disclosure, an entity may be referred to as a communication node.
[0103] FIG. 3 illustrates a block diagram of a device according to an embodiment of the present disclosure. The structure exemplified in FIG. 3 may be understood as the structure of at least part of a communication node, base station, satellite, or core network entity. The wireless device (300) exemplified in FIG. A-3 may be a mobile terminal such as a smartphone, tablet PC, or wearable device, but is not limited thereto.
[0104] FIG. 3 illustrates an example of a wireless device (300) in a wireless communication system according to one embodiment of the present disclosure. The wireless device (300) according to an embodiment of the present disclosure may be a mobile terminal such as a smartphone, tablet PC, or wearable device, but is not limited thereto.
[0105] Referring to FIG. 3, the wireless device (300) may include at least one control unit (310), at least one memory (320), at least one power supply unit (330), at least one transceiver unit (340), at least one input unit (350), at least one output unit (360) and / or at least one antenna (370).
[0106] The control unit (310) can control the memory (320) and / or the transmission / reception unit (340) and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operation sequences disclosed in this disclosure. The memory (320) may be connected to the control unit (310) and may store various information related to the operation of the control unit (310). For example, the memory (320) may store software code including instructions for performing some or all of the controls controlled by the control unit (310) or for performing the descriptions, functions, procedures, proposals, methods, and / or operation sequences disclosed in this disclosure. The configuration of the memory is not limited in a particular way. For example, it may be configured as at least one of read-only memory (ROM) and random access memory (RAM).
[0107] At least one control unit (310) may be referred to as a processor, microcontroller, microprocessor, or microcomputer. The descriptions, functions, procedures, proposals, methods, and / or flowcharts of operations disclosed in this disclosure may be implemented using firmware or software in the form of code, instructions, and / or sets of instructions. Here, the firmware or software may execute other programs stored in memory (320), such as an OS. The control unit (310) may be implemented to support differently weighted beamforming or directional routing operations to effectively control the outgoing signal from at least one antenna (370) to a desired direction.
[0108] Additionally, at least one control unit (310) may be coupled with a backhaul or network interface. The wireless device (300) may communicate with other wireless devices through the backhaul or network interface. The control unit (310) may include at least one processor. The processor may mean a central processing unit (CPU), a graphics processing unit (GPU), or a dedicated processor on which the methods according to embodiments of the present disclosure are performed.
[0109] At least one transceiver (340) may be connected to a control unit (310) and may transmit and / or receive a wireless signal through at least one antenna (370). The transceiver (340) may include a transmitter and / or a receiver. At least one transceiver (340) may transmit user data, control information, wireless signals / channels, etc., as described in the methods and / or operation flowcharts of the present disclosure to at least one other device. For example, at least one transceiver (340) may be connected to at least one control unit (310) and may transmit and receive wireless signals. Additionally, at least one control unit (310) may control at least one transceiver (340) to transmit user data, control information, or wireless signals to at least one other device. At least one transmitter (340) may receive a signal transmitted by another wireless device from at least one antenna (370). Additionally, at least one transceiver (24) can down-convert or up-convert the received signal to generate a baseband signal. At least one antenna (370) may be a plurality of physical antennas or a plurality of logical antennas (e.g., antenna ports).
[0110] The input unit (350) can acquire information such as user input, video, and audio, and may include various input means such as various mechanical / electronic input means, cameras, and microphones. The output unit (360) is intended to provide information to a user by generating output related to sight, hearing, or touch, and may include a display, speaker, vibration module, etc. The wireless device (300) supplies power through the power unit (330), and the power unit (330) may include a wired / wireless charging circuit, battery, etc.
[0111] A more detailed example of the structure of the control unit (310) and / or the transceiver unit (340) is shown in FIG. 4. FIG. 4 illustrates a block diagram of devices performing communication according to an embodiment of the present disclosure. FIG. 4 illustrates the structure of a first communication node (400a) and a second communication node (400b) that transmit and / or receive a signal. In FIG. 4, each of the first communication node (400a) and the second communication node (400b) may be a base station or a UE.
[0112] Referring to FIG. 4, the first communication node (400a) can transmit a signal to the second communication node (400b). The transmission processor (411) included in the first communication node (400a) can receive data (e.g., data unit) from the data source (410). The transmission processor (411) can receive control information from the controller (416). The control information may include at least one of system information, RRC setting information (e.g., information set by RRC signaling), MAC control information (e.g., MAC CE), or PHY control information (e.g., DCI, SCI).
[0113] The transmitting processor (411) can generate data symbol(s) by performing processing operations on data (e.g., encoding operations, symbol mapping operations, etc.). The transmitting processor (411) can generate control symbol(s) by performing processing operations on control information (e.g., encoding operations, symbol mapping operations, etc.). Additionally, the transmitting processor (411) can generate synchronization / reference symbol(s) for synchronization signals and / or reference signals.
[0114] The Tx MIMO processor (412) can perform spatial processing operations (e.g., precoding operations) on data symbol(s), control symbol(s), and / or synchronization / reference symbol(s). The output (e.g., symbol stream) of the Tx MIMO processor (412) can be provided to modulators (MODs) included in transceivers (413a to 413t). The modulators (MODs) can perform processing operations on the symbol stream to generate modulated symbols and perform additional processing operations on the modulated symbols (e.g., analog conversion operations, amplification operations, filtering operations, up-conversion operations) to generate signals. The signals generated by the modulators (MODs) of the transceivers (413a to 413t) can be transmitted through antennas (414a to 414t).
[0115] Signals transmitted by the first communication node (400a) can be received at the antennas (464a to 464r) of the second communication node (400b). Signals received at the antennas (464a to 464r) can be provided to demodulators (DEMODs) included in the transceivers (463a to 463r). The demodulators (DEMODs) can obtain samples by performing processing operations on the signals (e.g., filtering operation, amplification operation, down-conversion operation, digital conversion operation). The demodulators (DEMODs) can obtain symbols by performing additional processing operations on the samples. The MIMO detector (462) can perform MIMO detection operations on the symbols. The receiving processor (461) can perform processing operations on the symbols (e.g., deinterleaving operation, decoding operation). The output of the receiving processor (461) can be provided to the data sink (460) and the controller (466). For example, data can be provided to the data sink (460), and control information can be provided to the controller (466).
[0116] Meanwhile, the second communication node (400b) can transmit a signal to the first communication node (400a). The transmission processor (468) included in the second communication node (400b) can receive data (e.g., data unit) from the data source (467) and can generate data symbol(s) by performing a processing operation on the data. The transmission processor (468) can receive control information from the controller (466) and can generate control symbol(s) by performing a processing operation on the control information. Additionally, the transmission processor (468) can generate reference symbol(s) by performing a processing operation on a reference signal.
[0117] The Tx MIMO processor (469) can perform spatial processing operations (e.g., precoding operations) on data symbol(s), control symbol(s), and / or reference symbol(s). The output (e.g., symbol stream) of the Tx MIMO processor (469) can be provided to modulators (MODs) included in transceivers (463a to 463t). The modulators (MODs) can perform processing operations on the symbol stream to generate modulated symbols and perform additional processing operations on the modulated symbols (e.g., analog conversion operations, amplification operations, filtering operations, up-conversion operations) to generate signals. The signals generated by the modulators (MODs) of the transceivers (463a to 463t) can be transmitted through antennas (464a to 464t).
[0118] Signals transmitted by the second communication node (400b) can be received at the antennas (414a to 414r) of the first communication node (400a). Signals received at the antennas (414a to 414r) can be provided to demodulators (DEMODs) included in the transceivers (413a to 413r). The demodulators (DEMODs) can obtain samples by performing processing operations on the signals (e.g., filtering operation, amplification operation, down-conversion operation, digital conversion operation). The demodulators (DEMODs) can obtain symbols by performing additional processing operations on the samples. The MIMO detector (420) can perform MIMO detection operations on the symbols. The receiving processor (419) can perform processing operations on the symbols (e.g., deinterleaving operation, decoding operation). The output of the receiving processor (419) can be provided to the data sink (418) and the controller (416). For example, data can be provided to the data sink (418), and control information can be provided to the controller (416).
[0119] The memories (415 and 465) may store data, control information, and / or program code. The scheduler (417) may perform scheduling operations for communication. The processors (411, 412, 419, 461, 468, 469) and controllers (416, 466) shown in FIG. 4 may be the processor (310) shown in FIG. 3 and may be used to perform the methods described in this disclosure.
[0120] FIGS. 5A and 5B illustrate block diagrams of a transmission path and a reception path of a communication node according to an embodiment of the present disclosure.
[0121] Referring to FIGS. 5a and 5b, a transmission path (510) may be implemented at a communication node that transmits a signal, and a reception path (520) may be implemented at a communication node that receives a signal. The transmission path (510) may include a channel coding and modulation block (511), an S-to-P (serial-to-parallel) block (512), an N IFFT (Inverse Fast Fourier Transform) block (513), a P-to-S (parallel-to-serial) block (514), a CP (cyclic prefix) addition block (515), and an UC (up-converter) (UC) (516). The reception path (520) may include a DC (down-converter) (521), a CP removal block (522), an S-to-P block (523), an N FFT block (524), a P-to-S block (525), and a channel decoding and demodulation block (526). Here, N can be a natural number.
[0122] Information bits in the transmission path (510) can be input to a channel coding and modulation block (511). The channel coding and modulation block (511) can perform coding operations (e.g., LDPC (low-density parity check) coding operations, polar coding operations, etc.) and modulation operations (e.g., QPSK (Quadrature Phase Shift Keying), QAM (Quadrature Amplitude Modulation), etc.) on the information bits. The output of the channel coding and modulation block (511) can be a sequence of modulation symbols.
[0123] The S-to-P block (512) can convert modulated symbols in the frequency domain into parallel symbol streams to generate N parallel symbol streams. N can be the IFFT size or the FFT size. The N IFFT block (513) can generate signals in the time domain by performing an IFFT operation on the N parallel symbol streams. The P-to-S block (514) can convert the output of the N IFFT block (513) (e.g., parallel signals) into a serial signal to generate a serial signal.
[0124] The CP addition block (515) can insert CP into the signal. The UC (516) can up-convert the frequency of the output of the CP addition block (515) to an RF (radio frequency) frequency. Additionally, the output of the CP addition block (515) can be filtered in the baseband before up-conversion.
[0125] A signal transmitted from the transmission path (510) can be input to the reception path (520). The operation in the reception path (520) may be the inverse operation of the operation in the transmission path (510). The DC (521) may down-convert the frequency of the received signal to a baseband frequency. The CP removal block (522) may remove CP from the signal. The output of the CP removal block (522) may be a serial signal. The S-to-P block (523) may convert the serial signal into parallel signals. The NFFT block (524) may generate N parallel signals by performing an FFT algorithm. The P-to-S block (525) may convert the parallel signals into a sequence of modulation symbols. The channel decoding and demodulation block (526) may perform a demodulation operation on the modulation symbols and restore data by performing a decoding operation on the result of the demodulation operation.
[0126] In FIGS. 5A and 5B, Discrete Fourier Transform (DFT) and Inverse DFT (IDFT) may be used instead of FFT and IFFT. In FIGS. 5A and 5B, each of the blocks (e.g., components) may be implemented by at least one of hardware, software, or firmware. For example, in FIGS. 5A and 5B, some blocks may be implemented by software, and the remaining blocks may be implemented by hardware or a "combination of hardware and software." In FIGS. 5A and 5B, one block may be subdivided into multiple blocks, multiple blocks may be integrated into one block, some blocks may be omitted, and blocks supporting other functions may be added.
[0127] FIG. 6 illustrates an example of a system frame in a wireless communication system according to an embodiment of the present disclosure.
[0128] Referring to FIG. 6, time resources in a communication system can be divided into frames. For example, system frames can be set consecutively in the time domain of the communication system. The length of a system frame can be 10 ms (millisecond). The system frame number (SFN) can be set from #0 to #1023. In this case, 1024 system frames can be repeated in the time domain of the communication system. For example, the SFN of a system frame after system frame #1023 can be #0.
[0129] A single system frame may contain two half frames. The length of a single half frame may be 5ms. A half frame located at the beginning of the system frame may be referred to as "Half Frame #0", and a half frame located at the end of the system frame may be referred to as "Half Frame #1". A system frame may contain 10 subframes. The length of a single subframe may be 1ms. Within a single system frame, the 10 subframes may be referred to as "Subframe #0-9".
[0130] FIG. 7 illustrates an example of a subframe in a wireless communication system according to an embodiment of the present disclosure.
[0131] Referring to FIG. 7, one subframe may contain n slots, where n is a natural number. Thus, one subframe may consist of one or more slots.
[0132] FIG. 8 illustrates an example of a slot in a wireless communication system according to an embodiment of the present disclosure.
[0133] Referring to FIG. 8, a slot may contain one or more symbols. A slot illustrated in FIG. A-8 may contain 14 symbols. The length of the slot may vary depending on the number of symbols included in the slot and the length of the symbols. Alternatively, the length of the slot may vary depending on the numerology.
[0134] Numerals applied to physical signals and channels in a communication system may be variable. Numerals may be variable to meet various technical requirements of the communication system. In a communication system where CP (cyclic prefix) based OFDM waveform technology is applied, numerals may include subcarrier spacing and CP length (or CP type). [Table 1] may be an example of a method for configuring numerals for a CP-OFDM based communication system. Depending on the frequency band in which the communication system operates, at least some of the numerals in [Table 1] may be supported. Additionally, numerals not listed in [Table 1] may be further supported in the communication system.
[0135] Subcarrier Spacing 15kHz 30kHz 60kHz 120kHz 240kHz 480kHz OFDM Symbol Length [μs] 66.733.316.78.34.22.1 CP Length [us] 4.762.381.190.600.300.151 OFDM Symbols within ms 142856112224448
[0136] When the subcarrier interval is 15 kHz (e.g., μ=0), the slot length may be 1 ms. In this case, one system frame may contain 10 slots. When the subcarrier interval is 30 kHz (e.g., μ=1), the slot length may be 0.5 ms. In this case, one system frame may contain 20 slots. When the subcarrier interval is 60 kHz (e.g., μ=2), the slot length may be 0.25 ms. In this case, one system frame may contain 40 slots. When the subcarrier interval is 120 kHz (e.g., μ=3), the slot length may be 0.125 ms. In this case, one system frame may contain 80 slots. When the subcarrier interval is 240 kHz (e.g., μ=4), the slot length may be 0.0625 ms. In this case, one system frame can include 160 slots.
[0137] The symbol can be set as a downlink (DL) symbol, a flexible (FL) symbol, or an uplink (UL) symbol. A slot consisting only of DL symbols may be referred to as a "DL slot," a slot consisting only of FL symbols may be referred to as a "FL slot," and a slot consisting only of UL symbols may be referred to as a "UL slot."
[0138] FIG. 9 illustrates the timing relationship between the uplink and downlink in a wireless communication system according to an embodiment of the present disclosure.
[0139] There is one frame set in the forward link, and there is also one frame set in the downlink of each carrier. The uplink frame number i for transmission from the UE is It must start previously, and this must coincide with the start of the corresponding downlink frame observed by the UE.
[0140] Here, and This can be provided by adjusting the transmission timing of the synchronization procedure. However, for msgA transmission in PUSCH (physical uplink shared channel), NTA = 0.
[0141] It is derived from the upper layer parameters ta-Common, ta-CommonDrift, and ta-CommonDriftVariant, in the case where it is not configured am.
[0142] is calculated by the UE only when the UE's position and related upper-layer parameters are configured according to the transmission timing adjustment of the synchronization procedure, and otherwise, am.
[0143] As described above, the timing of the downlink and uplink can be adjusted based on the transmission timing adjustment of the synchronization procedure. For example, the terminal receives the value of at least one TA (timing advance) offset for a serving cell and can adjust the timing based on the received at least one TA offset value. Here, the at least one TA offset value may be configured differently depending on the TCI state, the carrier, or the TRP.
[0144] The aforementioned timing advance (TA) can be determined based on the signal transmission and reception times of a random access procedure. Specifically, the terminal can identify uplink resources and determine uplink transmission power based on control information and / or configuration information received from the base station. Then, the terminal can transmit PUSCH using the determined power through the identified resources. As an example, the base station can determine the TA based on the arrival time of the preamble transmitted by the terminal.
[0145] A terminal that has performed a random access procedure may receive configuration information from a base station and transmit a PUSCH based on the configuration information. Specifically, the terminal may identify uplink resources and determine uplink transmit power based on control information and / or configuration information received from the base station. Then, the terminal may transmit a PUSCH using the determined power through the identified resources. Section 7.11 of 3GPP TS 38.213 defines the PUSCH transmission procedure of a terminal as follows.
[0146]
[0147] The aforementioned PUSCH transmission can be controlled via a physical uplink control channel (PUCCH). In NR, the terminal transmits uplink control information (UCI) to the base station via the PUCCH. The control information may include at least one of a HARQ-ACK indicating whether demodulation / decoding of a transport block (TB) received by the terminal via PDSCH was successful, a scheduling request (SR) in which the terminal requests resource allocation from the PUSCH base station for uplink data transmission, and channel state information (CSI), which is information for reporting the terminal's channel status. The PUCCH may be transmitted repeatedly, and the repeated transmission procedure may be performed based on Section 9.2.6 of 3GPP TS 38.213 as follows.
[0148]
[0149] Meanwhile, NTN reference scenarios can be defined as shown in [Table 4] below.
[0150] NTN shown in Fig. 1, NTNGEO shown in Fig. 2, Scenario A, BLEO (Adjustable Beam) Scenario C1, Scenario D1, LEO (Beam Moving with Satellite) Scenario C2, Scenario D2
[0151] In the NTN depicted in FIG. 1a and / or FIG. 1b, if the satellite (110) is a GEO satellite (e.g., a GEO satellite supporting transparent functions), this may be referred to as "Scenario A". In the NTN depicted in FIG. 2a, FIG. 2b, and / or FIG. 2c, if the first satellite (211) and the second satellite (212) are each GEO satellites (e.g., GEO supporting regeneration functions), this may be referred to as "Scenario B". In the non-ground network depicted in FIG. 1a and / or FIG. 1b, if the satellite (110) is an LEO satellite having steerable beams, this may be referred to as "Scenario C1". In the non-ground network depicted in FIG. 1a and / or FIG. 1b, if the satellite (110) is an LEO satellite having beams that move with the satellite, this may be referred to as "Scenario C2". In the non-ground network depicted in FIG. 2a, FIG. 2b, and / or FIG. 2c, if satellite #1 (211) and satellite #2 (212) are each LEO satellites having adjustable beams, this may be referred to as “Scenario D1”. In the non-ground network depicted in FIG. 2a, FIG. 2b, and / or FIG. 2c, if satellite #1 (211) and satellite #2 (212) are each LEO satellites having beams that move with the satellite, this may be referred to as “Scenario D2”.
[0152] The parameters for the NTN reference scenarios defined in [Table 4] can be defined as shown in [Table 5] below.
[0153] Scenarios A and B Scenarios C and D Elevation 35,786 km 600 km 1,200 km Spectrum (Service Link) <6 GHz (e.g., 2 GHz) > 6 GHz (e.g., DL 20 GHz, UL 30 GHz) Maximum Channel Bandwidth Capacity (Service Link) 30 MHz for band < 6 GHz 1 GHz for band > 6 GHz Maximum Distance between Satellite and Communication Node (e.g., UE) at Minimum Elevation Angle 40,581 km 1,932 km (600 km altitude) 3,131 km (1,200 km altitude) Maximum RTD (Round Trip Delay) (Propagation Delay Only) Scenario A: 541.46 ms (Service and Feeder Links) Scenario B: 270.73 ms (Service Link Only) Scenario C: (Transparent Payload: Service and Feeder Links) -25.77 ms (600 km Altitude) -41.77ms (1200km altitude) Maximum differential delay within a single cell 10.3ms 3.12ms (600km altitude) 3.18ms (1200km altitude) Service Link NR or 6G Feeder Link 3GPP or non-3GPP defined radio interface
[0154] In addition, in the NTN reference scenario defined in [Table 4], the delay constraint can be defined as shown in [Table 6] below.
[0155] Scenario A Scenario B Scenario C1-2 Scenario D1-2 Satellite Altitude 35,768 km 600 km Maximum RTD at radio interface between base station and UE 541.75 ms (Worst case) 270.57 ms 28.41 ms 12.88 ms Minimum RTD at radio interface between base station and UE 477.14 ms 238.57 ms 8 ms 4 ms
[0156] FIGS. 10a and FIG. 10b illustrate examples of protocol stacks of the user plane and control plane in a transparent payload-based NTN in a wireless communication system according to an embodiment of the present disclosure.
[0157] Referring to FIGS. 10a and 10b, user data may be transmitted and / or received between the UE and a core network (e.g., UPF), and control data (e.g., control information) may be transmitted and / or received between the UE and a core network (e.g., AMF). Each of the user data and control data may be transmitted and / or received via a satellite and / or gateway. The protocol stack of the user plane illustrated in FIG. 10a may be applied to a 6G communication network in the same or similar manner. The protocol stack of the control plane illustrated in FIG. 10b may be applied to a 6G communication network in the same or similar manner.
[0158] FIGS. 11a and 11b illustrate examples of protocol stacks of the user plane and the control plane in a regenerated payload-based NTN in a wireless communication system according to an embodiment of the present disclosure.
[0159] Referring to FIGS. 11a and 11b, user data and control data (e.g., control information), respectively, can be transmitted and / or received through an interface between the UE and a satellite (e.g., a base station). User data may include a user protocol data unit (PDU). A protocol stack of the satellite radio interface (SRI) can be used to transmit and / or receive user data and / or control data between the satellite and the gateway. User data can be transmitted and / or received through a General Packet Radio Service (GPRS) tunneling protocol (GTP)-U tunnel between the satellite and the core network.
[0160] Regarding NTN communication, an NTN may be configured to provide non-terrestrial NR access to a UE through an NTN payload and an NTN gateway. A service link refers to a connection between the NTN payload and the UE, and a feeder link may refer to a link between the NTN gateway and the NTN payload. Configuration and procedures for the NTN, service link, and feeder link may be implemented in combination with, or partially performed or modified from, the configuration and procedures disclosed in Section 16.14 of 3GPP TS 38.300.
[0161] FIG. 12 illustrates an example of an NTN that provides non-terrestrial NR access to a UE through an NTN payload and an NTN gateway. FIG. 12 shows a service link between the NTN payload and the UE and a feeder link between the NTN gateway and the NTN payload.
[0162] The NTN payload transparently transmits the wireless protocol received from the UE via the service link to the NTN gateway via the feeder link, or vice versa. Here, the connectivity supported by the NTN payload is as follows.
[0163] - An NTN gateway can provide multiple NTN payloads.
[0164] - A single NTN payload can be provided by multiple NTN gateways.
[0165] - The NTN payload can change the carrier frequency before retransmission on the service link, or vice versa (at each feeder link).
[0166] In NTN, the following may apply in addition to the network identifier.
[0167] - A tracking area corresponds to a fixed geographical area. Each mapping is configured in the RAN.
[0168] - Mapped cell ID defined in Section 16.14.5.
[0169] Three types of service links are supported.
[0170] - Earth-fixed: Service links can be provided by beam(s) that always continuously cover the same geographic area (e.g., GSO (Geosynchronous Orbit) satellites).
[0171] - Quasi-earth-fixed: Service links may be provided by beam(s) that cover one geographic area for a limited period and another geographic area for a different period (e.g., NGSO (non-GSO) satellites generating steerable beams).
[0172] - Earth-moving: Service links may be provided by beam(s) moving across the Earth's surface (e.g., NGSO satellites generating fixed beams or non-steeringable beams).
[0173] A gNB operating as an NGSO satellite can provide a quasi-Earth fixed service link or an Earth moving service link, and a gNB operating as a GSO satellite can provide an Earth fixed service link.
[0174] Timing and synchronization are as follows.
[0175] Regarding scheduling and timing, downlink and uplink frames are aligned using an offset given by NTA,offset (see Section 4.2 of TS 38.213) at the uplink time synchronization reference point (RP). To accommodate the propagation delay of NTN, some timing relationships are reinforced by a common timing advance (TA) and two offsets, K_offset and k_mac.
[0176] - Common TA is a timing offset configured to be equal to the round trip time (RTT) between the RP and NTN payloads.
[0177] - K offset is a configured scheduling offset that must be greater than or equal to the sum of the service link RTT and the common TA.
[0178] - k mac is an offset configured to be approximately equal to the RTT between RP and gNB.
[0179] Scheduling offset K offset is used to allow the UE sufficient processing time between downlink reception and uplink transmission (see TS 38.213). Offset k mac It is used to delay the application of the downlink configuration dictated by the MAC CE instruction in PDSCH (see TS 38.213) and for estimating the UE-gNB RTT (see TS 38.321). If downlink and uplink frame timings are not aligned at the gNB, offset k mac It can be provided by the network. Also, offset k mac It is used to determine the RAR window / MsgB window start time after Msg1 / MsgA transmission in random access procedures (see TS 38.213). Service link RTT, feeder link RTT, RP, common TA, k mac and TTA are as shown in FIG. 13. FIG. 13 illustrates the timing relationship between objects included in NTN.
[0180] The network can configure HARQ operations as follows.
[0181] - For downlinks, HARQ feedback can be enabled or disabled on a per-HARQ process basis. Disabling HARQ feedback allows scheduling the HARQ process before one HARQ RTT has elapsed since the last scheduling.
[0182] - For uplinks, a HARQ mode (e.g., HARQ Mode A or HARQ Mode B) can be configured per HARQ process. HARQ Mode B allows scheduling a HARQ process before one HARQ RTT has elapsed since the last scheduling.
[0183] For HARQ processes configured to enable / disable HARQ feedback, it depends on the network implementation to ensure the appropriate HARQ feedback configuration (e.g., enable all or disable all) for the HARQ processes used in the SPS configuration. For HARQ processes configured in HARQ mode, it depends on the network implementation to ensure the appropriate HARQ mode configuration (e.g., all HARQ modes A or all HARQ modes B) for the HARQ processes used in the CG (configured grant) configuration.
[0184] Meanwhile, in NTN, a base station may transmit system information (e.g., SIB19) containing satellite assistance information for NTN access. A UE may receive system information (e.g., SIB19) from a base station, verify the satellite assistance information included in the system information, and perform communication (e.g., non-terrestrial communication) based on the satellite assistance information. SIB19 may include information element(s) defined in [Table 7] below.
[0185] SIB19-r17 :: = SEQUENCE {ntn-Config-r17 NTN-Config-r17 OPTIONAL,t-service-r17 INTEGER(1..549755813887) OPTIONAL,referenceLocation-r17 ReferenceLocation-r17 OPTIONAL,distanceThresh-r17 INTEGER(1..65525) OPTIONAL,ntn-NeighCellConfigList-r17 NTN-NeighCellConfigList-r17 OPTIONAL,lateNonCRiticalExtension OCTET STRING...,[[ntn-NeighCellConfigListExt-v1720 NTN-NeighCellConfigList-r17 OPTIONAL,]],[[movingReferenceLocation-r18 ReferenceLocation-r17 OPTIONAL,satSwitchWithReSync-r18 SatSwitchWithReSync-r18 OPTIONAL,]]}NTN-NeighCellConfigList-r17 :: = SEQUENCE (SIZE(1..maxCellNTN-r17)) OFNTN-NeighCellConfig-r17NTN-NeighCellConfig-r17 :: = SEQUENCE {ntn-Config-r17 NTN-Config-r17 OPTIONAL,carrierFreq-r17 ARFCN-ValueNR OPTIONAL,physCellId-r17 PhysCellId OPTIONAL}SatSwitchWithReSync-r18 :: = SEQUENCE {ntn-Config-r18 NTN-Config-r17,t-ServiceStart-r18 INTEGER(1..549755813887) OPTIONAL,ssb-TimeOffset-r18 INTEGER(1..159) OPTIONAL}
[0186] The NTN-Config defined in [Table 7] may include the information element(s) defined in [Table 8] below.
[0187] NTN-Config-r17 ::= SEQUENCE {epochTime-r17 EpochTime-r17ntn-UISyncValidityDuration-r17 ENUMERATED {s5, s10, s15, s20, s25, s30, s35, s40, s45, s50, s55, s60, s120, s180, s240, s900}cellSpecificKoffset-r17 INTEGER(1..1023)kmac-r17 INTEGER(1..512)ta-Info-r17 TA-Info-r17ntn-PolarizationDL-r17 ENUMERATED {rhcp, lhcp, linear}ntn-PolarizationUL-r17 ENUMERATED {rhcp, lhcp, linear}ephemerisInfo-r17 EphemerisInfo-r17ta-Report-r17 ENUMERATED {enabled}...}EpochTime-r17 ::= SEQUENCE {sfn-r17 INTEGER(1..1023)subFrameNR-r17 INTEGER(1..9)}TA-Info-r17 ::= SEQUENCE {ta-Common-r17 INTEGER(1..66485757)ta-CommonDrift-r17 INTEGER(-257303..257303)ta-CommonDriftVarant-r17 INTEGER(0..28949)}
[0188] EphemerisInfo defined in [Table 8] may include the information element(s) defined in [Table 9] below.
[0189] EphemerisInfo-r17 ::= CHOICE {positionVelocity-r17 PositionVelocity-r17,orbital-r17 Orbital-r17}PositionVelocity-r17 ::= SEQUENCE {positionX-r17 PositionStateVector-r17,positionY-r17 PositionStateVector-r17,positionZ-r17 PositionStateVector-r17, velocity V INTEGER (0..1048575),periapsis-r17 INTEGER (0..268435455),longitude-r17 INTEGER (0..268435455),incliating-r17 INTEGER (-67108864..67108863),meanAnomaly-r17 INTEGER (0..268435455)}PositionStateVector-r17 ::= INTEGER (-33554432..33554431)VelocityStateVector-r17 ::= INTEGER (-131072..131071)
[0190] In addition, if there is a difference in NTN connection settings compared to TN connection, NTN-parameter may include information elements defined in [Table 10] below to convey UE wireless connection capability parameters applied to NTN connection.
[0191] NTN-parameters-r17 ::= SEQUENCE {inactiveStateNTN-r17 ENUMERATED {supported} OPTIONAL,ra-SDT-NTN-r17 ENUMERATED {supported} OPTIONAL,srb-SDT-NTN-r17 ENUMERATED {supported} OPTIONAL,measAndMobParametersNTN-r17 MeasAndMobParameters OPTIONAL,mac-ParametersNTN-r17 Mac-Parameters OPTIONAL,phy-ParametersNTN-r17 Phy-Parameters OPTIONAL,fdd-ADD-UE-NR-CapabilitiesNTN-r17 UE-NR-CapabilityNTNAddXDD-Mode OPTIONAL,frl-ADD-UE-NR-CapabilitiesNTN-r17 UE-NR-CapabilityNTNAddFRX-Mode OPTIONAL,ue-BasedPerfMeas-ParametersNTN-r17 UE-BasedPerfMeas-Parameters-r16 OPTIONAL,son-ParametersNTN-r17 SON-Parameters-r16 OPTIONAL}
[0192] Typically, cells supported by NTN base stations have a wider radius compared to cells supported by TN. Additionally, the distance from a terminal to a base station in NTN, or the distance from a terminal to a satellite relaying signals between the base station and the terminal, is significantly longer than the distance from a terminal to a base station in TN. Accordingly, techniques to improve the transmission signal power and coverage of a terminal are being proposed for uplink signal transmission from a terminal that has limitations on transmission power in the uplink environment of an NTN cell. For example, a repetition method is proposed in which a terminal transmits a specific symbol multiple times over several times and / or frequency resources.
[0193] The repetitive transmission method is a technique that transmits the same signal using more time and / or frequency resources compared to cases where repetitive transmission is not applied. Consequently, the repetitive transmission by a specific terminal may reduce the time and / or frequency resources available to other terminals. In particular, since NTN cells have a very wide radius, a very large number of potentially serviceable terminals exist within the cell. However, repetitive transmission aimed at increasing the transmission power of a specific terminal may result in a decrease in the total number of terminals capable of connecting to that NTN base station. Therefore, a method capable of increasing uplink capacity is required to address these issues.
[0194] Orthogonal Cover Code (OCC) can be applied to increase capacity during uplink repetitive transmission in NTN. OCC is a method used for the transmission of certain PUCCH formats in Release-18, in which signals from multiple terminals sharing the same time and / or frequency resources are distinguished by orthogonal codes such as Hadamard sequences or DFT sequences. That is, the symbols that each terminal intends to transmit are spread by different sequences, and the spread symbols can be mapped to the same time and / or frequency resources for transmission. Upon receiving this, the base station can detect the signals transmitted by each terminal by performing despreading on all signals transmitted via OCC across all time and / or frequency resources.
[0195] FIG. 14 illustrates an example of repeated transmission and OCC application in a wireless communication system according to one embodiment of the present disclosure. FIG. 14 is an example of using an Hadamard sequence of length 4 as the OCC sequence. In FIG. 14, some blocks are obtained by multiplying the transmitted symbol prior to the repetition by +1, and other blocks are obtained by multiplying the transmitted symbol prior to the repetition by -1.
[0196] Referring to FIG. 14, case 1 is an example of conventional repetitive transmission, and case 2 is an example of repetitive transmission using an OCC sequence. In the case of repetitive transmission using an OCC sequence, each terminal obtains spread symbols for a symbol to be transmitted by applying an OCC sequence of length 4 to a symbol to be transmitted, and transmits the spread symbols. At this time, the spread symbols refer to the repetitive symbols obtained using the OCC sequence. For example, UE1 may apply the OCC sequence '+1 -1 -1 +1' to a transmitted symbol, UE2 may apply the OCC sequence '+1 -1 +1 -1' to a transmitted symbol, UE3 may apply the OCC sequence '+1 +1 -1 -1' to a transmitted symbol, and UE4 may apply the OCC sequence '+1 +1 +1 +1' to a transmitted symbol. Each UE may obtain spread symbols for a symbol to be transmitted using different OCC sequences. At this time, the base station can obtain the symbol of UE1 by performing inverse spreading using the OCC sequence '+1 -1 -1 +1'.
[0197] Among the OCC techniques described above, OCC within symbol, OCC across symbols, and OCC across slots are being considered. OCC within symbol is a method in which each element of the OCC sequence is applied to a part of a symbol through a Pre-DFT method, where OCC is assigned to each resource prior to the Discrete Fourier Transform (DFT). OCC across symbols is a method in which each element of the OCC sequence is applied to individual symbols, while OCC across slots is a method in which each element of the OCC sequence is applied to individual slots, that is, commonly to the symbols within the corresponding slot.
[0198] FIG. 15 illustrates examples of OCC application techniques in a wireless communication system according to one embodiment of the present disclosure. FIG. 15 shows three types of techniques for OCC application, where case a is an example of in-symbol OCC application, case b is an example of symbol-unit OCC application, and case c is an example of slot-unit OCC application. FIG. 15 is an example where an Hadamard sequence of length 2 is used as the OCC sequence and the number of repetitions is 2. Here, the first blocks among blocks with the same pattern are obtained by multiplying the transmitted symbol prior to the repetition by an element of the Hadamard sequence +1, and the second blocks among blocks with the same pattern are obtained by multiplying the transmitted symbol prior to the repetition by an element of the Hadamard sequence -1. In the present disclosure, symbol-unit OCC can be understood as inter-symbol OCC, and slot-unit OCC can be understood as inter-slot OCC.
[0199] Meanwhile, to expand terminal coverage, PUSCH repetitions may be performed with a narrow bandwidth considering transmission power limitations. In this case, depending on the situation, the size of the TB (transport block) applied to the PUSCH may be insufficient. To address this, PUSCH transmitted or processed over two or more slots has been discussed and is referred to as TBoMS (TB processing over multiple slots). According to current standard specifications, TBoMS can be composed of 1, 2, 4, or 8 slots. For example, a single TB can be transmitted over N slots, where N can be 1, 2, 4, or 8.
[0200] Figure 16 illustrates examples of non-TBoMS iterative transmission and TBoMS iterative transmission. Case a in Figure 16 is an example of non-TBoMS iterative transmission with a repetition factor of 8, and case b is an example of TBoMS iterative transmission with a repetition factor of 2 and a TBoMS unit of 4 slots. Referring to case a, slot-unit iterative transmission in the non-TBoMS case (e.g., iterative transmission according to PUSCH iterative type A) is performed in units of one slot. On the other hand, conventional TBoMS iterative transmission is performed in units of N slots belonging to one TBoMS. In case b, square blocks of the same pattern indicate the same data transmitted at the same relative slot position within one TBoMS.
[0201] In non-TBoMS, slot-based iterative transmission is performed on the information contained in a single slot, so OCC placement can be performed relatively freely within the total iterative transmission interval. On the other hand, TBoMS iterative transmission requires OCC placement to be carried out considering the arrangement structure of the slots belonging to a single TBoMS. Therefore, it is necessary to introduce a TBoMS iterative transmission structure that considers uplink performance when applying OCC. For example, OCC placement within the NK, which is the total iterative transmission interval of N slots belonging to a single TBoMS, needs to be considered.
[0202] Accordingly, the present disclosure proposes a TBoMS iterative transmission structure, a slot-unit OCC arrangement method according to the TBoMS iterative transmission structure, and related procedures and / or signaling. Terms and symbols mentioned in the present disclosure are defined as follows.
[0203] - OCC block: An OCC block indicates a basic unit for spreading / despreading in which an OCC sequence is multiplied by the symbol that each user intends to transmit. For example, in case b of FIG. 15, there are a total of two OCC blocks for UE1 and UE2, namely [Symbol 12 / 13 in Slot 0] and [Symbol 12 / 13 in Slot 1]. Also, in case c of FIG. 15, there are a total of two OCC blocks for UE1 and UE2, namely [Symbol 12 in Slot 0 / 1] and [Symbol 13 in Slot 0 / 1].
[0204] - OCC group: An OCC group refers to UEs included in the same OCC block. For example, in each case of FIG. 15, UE1 and UE2 form an OCC group for each OCC block.
[0205] - M: M is the length of the OCC sequence, indicating the length of each OCC block. For example, in all cases of Fig. 15, M=2.
[0206] - K: K is a repetition factor that indicates the number of repetitions for slot-unit repeated transmission. For example, in all cases of FIG. 15, K=2. Also, in case a of FIG. 16, K=8, and in case b, K=2. According to the current specification, K can be set to one of the values {1, 2, 3, 4, 7, 8, 12, 16, 20, 24, 28, 32}.
[0207] - N: N is the number of slots for TBoMS, indicating the total number of slots belonging to a single TBoMS. According to the current specification, N can be set to one of the values {1, 2, 4, 8}, provided that N·K ≤ 32 is satisfied. For non-TBoMS, N can be interpreted as 1. Slots included in TBoMS where N is 2 or greater may be referred to as multi-slots.
[0208] - Tn : T n indicates the n-th (1≤n≤N)-th part of a single TB transmitted through TBoMS. That is, for a TB transmitted through TBoMS of length N, the information transmitted across each slot is T1, T2, ..., T, respectively. N It can be denoted as such. For example, in case b of Fig. 16, the TBs of each TBoMS consist of {T1, T2, T3, T4}. Therefore, the T from slot 1 to slot 8 n It is expressed as {T1, T2, T3, T4, T1, T2, T3, T4}.
[0209] - R: R indicates the number of redundancy versions (RV) applied in the slot interval where repeated transmissions for a total of NK single TBoMSs are performed. For example, if the RV value is fixed at [0], R=1; if the RV cycling pattern of [0, 3] is applied, R=2; or if the RV cycling pattern of [0, 2, 3, 1] is applied, R=4. Therefore, if NK / MR is a positive integer, the value indicates the number of OCC blocks for which slot-unit OCC can be applied with an OCC sequence length M for each RV value when all RV values are applied the same number of times, i.e., with the same value, in the slot interval where repeated transmissions for a total of NK single TBoMSs are performed. Additionally, if K / MR is a positive integer, the value indicates T repeated K times n For all RV values, if they are applied the same number of times, that is, with the same value, the number of OCC blocks that can apply slot-unit OCC with an OCC sequence length M for each RV value can be indicated.
[0210]
[0211] FIG. 17 illustrates an example of a procedure for transmitting a PUSCH with OCC applied in a wireless communication system according to an embodiment of the present disclosure. FIG. 17 illustrates a method performed by a terminal.
[0212] Referring to FIG. 17, in step S1701, the terminal receives configuration information. The terminal receives configuration information for OCC application. The configuration information for OCC application may include information necessary for the terminal to apply OCC to the repeated transmission of PUSCH. For example, the configuration information for OCC application may include at least one of information regarding the number of repetitions of PUSCH, information regarding the number of RVs to be used in a plurality of slots for the repetition of PUSCH, information for determining RVs, information regarding the length of the OCC sequence, information regarding the number of slots for TBoMS, or information regarding the arrangement of signals containing UL data in a plurality of slots. The information regarding the arrangement of signals containing UL data may include at least one of the continuous arrangement length for the slots included in TBoMS, or information regarding the spacing of slots to be included in the same OCC block. The listed configuration information for OCC application is merely an example for illustrative purposes, and the embodiments of the present disclosure are not limited thereto. For example, the configuration information for OCC application may further include at least one other piece of information necessary for slot-unit OCC application in TBoMS iterative transmission. According to one embodiment, some of the configuration information for OCC application may be determined based on preset rules without signaling from the base station.
[0213] In step S1703, the terminal generates UL data. The terminal generates signals containing the UL data to be transmitted through PUSCH iterations. The terminal maps the signals containing the UL data to a plurality of slots based on PUSCH iterations. At this time, the signals include signals generated according to at least one RV value by applying RV cycling. According to one embodiment, the number of iterations for PUSCH iterations may be greater than or equal to the length of the sequence used in OCC. According to one embodiment, to perform TBoMS iterative transmission through PUSCH iterations, the terminal may generate symbols mapped to multiple slots containing UL data, and iteratively map signals containing the generated symbols to a plurality of slots. At this time, the plurality of slots may include a number of slots that is a multiple of the number of slots included in the multiple slots.
[0214] In step S1705, the terminal applies OCC. The terminal applies OCC to signals mapped to multiple slots based on PUSCH iterations. The terminal may apply OCC based on configuration information for OCC application. For example, the terminal may apply an OCC sequence to at least one OCC block for slot-based OCC. That is, the terminal may multiply the signals included in each slot by each weight of the OCC sequence. According to one embodiment, each OCC block may include slots having the same part of TBoMS and the same RV. According to one embodiment, slots having the same part of TBoMS and the same RV included in the same OCC block may have a spacing configured by configuration information.
[0215] In step S1707, the terminal transmits a signal. The terminal transmits signals with OCC applied to the base station. The terminal can map the signals multiplied by the OCC sequence to multiple slots, perform OFDM modulation, and transmit OFDM symbols.
[0216]
[0217] FIG. 18 illustrates an example of a procedure for receiving a PUSCH with OCC applied in a wireless communication system according to one embodiment of the present disclosure. FIG. 18 illustrates a method performed by a base station.
[0218] Referring to FIG. 18, in step S1801, the base station transmits configuration information. The base station transmits configuration information for OCC application. The configuration information for OCC application may include information necessary to apply OCC to the repeated transmission of PUSCH at the terminal. For example, the configuration information for OCC application may include at least one of information regarding the number of repetitions of PUSCH, information regarding the number of RVs to be used in a plurality of slots for PUSCH repetition, information for determining RVs, information regarding the length of the OCC sequence, information regarding the number of slots for TBoMS, or information regarding the arrangement of signals containing UL data in a plurality of slots. The information regarding the arrangement of signals containing UL data may include at least one of the continuous arrangement length for the slots included in TBoMS, or information regarding the spacing of slots to be included in the same OCC block. The listed configuration information for OCC application is merely an example for illustrative purposes, and the embodiments of the present disclosure are not limited thereto. For example, the configuration information for OCC application may further include at least one other piece of information necessary for slot-unit OCC application in TBoMS iterative transmission. According to one embodiment, some of the configuration information for OCC application may be determined based on preset rules without signaling from the base station.
[0219] In step S1803, the base station receives a signal. The base station may receive a signal with OCC applied based on configuration information for OCC application. The signals may be contained in multiple slots containing symbols containing data. The base station may obtain the terminal's transmitted symbol by performing despreading on the multiple slots based on the configuration information for OCC application transmitted to the terminal.
[0220]
[0221] [Example #1: Determination of TBoMS Iterative Transfer Structure]
[0222] Example #1 proposes a TBoMS iterative transmission structure for OCC application. Specifically, when a terminal iteratively transmits a single TBoMS across multiple slots, for OCC application, each part T of the TBoMS based on the continuous allocation length n (1≤n≤N) can be placed in multiple slots.
[0223] FIG. 19 illustrates an example of a procedure for determining slot locations of TBoMS in a wireless communication system according to one embodiment of the present disclosure. FIG. 19 illustrates a method performed by a terminal.
[0224] Referring to FIG. 19, in step S1901, the terminal determines a continuous batch length. If a single TBoMS is to be transmitted K times repeatedly across N slots, the terminal may determine a continuous batch length P for placing each part of the TBoMS in the NK slots. Here, the continuous batch length P is for each part of the TBoMS, i.e., each T which is the nth part of the single TB transmitted through the TBoMS. nThis indicates the number of slots that are arranged consecutively. According to one embodiment, the consecutive arrangement length may be determined based on a predefined rule or signaled by a base station and / or a network. For example, the consecutive arrangement length may be determined by the rule or signaling as 1, OCC length M, repetition factor K, or the number of slots N of a single TBoMS. According to one embodiment, the consecutive arrangement length is such that all T during the repeated transmission of TBoMS n These can be set to values that can be transmitted the same number of times.
[0225] In step S1903, the terminal T based on the continuous batch length n The terminal can sequentially place each of the N parts of TBoMS into NK slots based on the continuous placement length. For example, the terminal can place all parts of TBoMS into NK slots by placing the first part T1 of TBoMS consecutively into the first P slots among the NK slots, and then placing the second part T2 of TBoMS consecutively into the next P slots. In this way, based on the continuous placement length, T n By arranging it, the terminal can apply slot-unit OCC in TBoMS iterative transmission.
[0226]
[0227] As mentioned above, in the case where a single TBoMS spanning N slots is to be transmitted K times repeatedly, the positions of the slots included in the TBoMS within the total NK slots for TBoMS repeated transmission, i.e., each T of the TBoMS n The positions of the slots to be transmitted (1≤n≤N) can be determined. Each T of TBoMS in a total of NK slots n Once the slot location for is determined, the locations of each OCC block can be determined based on this. At this time, T nThe RV values of can be considered. For example, T included in a single OCC block n Constraints or conditions may be applied that the RV values of the items must be the same.
[0228] Example #1 describes each part of TBoMS (T1, ..., T) based on a continuous allocation length P. n We propose methods for determining the slot positions of ). Here, P is a single T n Indicates the number of items arranged consecutively.
[0229] FIG. 20 illustrates an example of the arrangement of each part of TBoMS based on a continuous arrangement length in a wireless communication system according to one embodiment of the present disclosure. Here, blocks of the same pattern are the same T n This indicates the arranged slots. Cases a, b, and c illustrate examples for different P values.
[0230] Referring to Fig. 20, starting from the case where n=1, each T n These are arranged continuously across P slots, and T n When the batch of is finished, T n+1 This is arranged consecutively across P slots starting from the next slot. For example, T1 can be arranged consecutively across P slots, and T2 can be arranged consecutively across P slots starting from the next slot. N If there are additional slots available for placement after the placement up to is finished, return n=1 and repeat T n This T N After the placement of is completed, it can be placed continuously across P slots starting from the next slot. By repeating this process, the position of each part of TBoMS in a total of NK slots, that is, the slot to which each part will be transmitted, can be determined.
[0231] The arrangement method described above can be expressed as [Equation 1]. For example, when the entire set of slots where TBoMS iterative transfers are performed is referred to as the NK-th slots from the first slot, T placed in the i-th slot (1 ≤ i ≤ NK) is n n (1 ≤ n ≤ N) of can be calculated through [Equation 1] below.
[0232]
[0233] In [Mathematical Equation 1], mod(a,b) is the remainder when an integer a is divided by b, The operation is a ceiling operation, N is the number of slots included in a single TBoMS, and P is the sequence length. Here, P can be set to 1, OCC length M, iteration factor K, or the number of slots N of a single TBoMS. Alternatively, P can be set to a value other than the aforementioned values.
[0234] FIGS. 21 to 35 show each part (T) of TBoMS in the iterative transmission of TBoMS according to P, N, and K as described above. n Layout examples for ) are illustrated. Specifically, FIGS. 21 through 35 illustrate layout examples in a TBoMS iterative transmission environment supported by current standards (N·K≤32, N∈{2, 4, 8}, K∈{2, 3, 4, 7, 8, 12, 16, 20, 24, 28, 32}). In FIGS. 21 through 35, blocks having the same pattern are identical T n Indicates these deployed slots.
[0235] FIG. 21 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=2. Here, case a is an example where the continuous placement length P is 1, and case b is an example where the continuous placement length P is 2. Referring to FIG. 21, slots 1 through 4 corresponding to the NK slots, T nIt can be seen that this is arranged continuously for a continuous arrangement length P. For example, when the continuous arrangement length P is 1, {T1, T2, T1, T2} is arranged from slot 1 to slot 4, and when the continuous arrangement length P is 2, {T1, T1, T2, T2} can be arranged from slot 1 to slot 4.
[0236] FIG. 22 illustrates an example of a placement method in a wireless communication system according to an embodiment of the present disclosure when N=2 and K=3. Here, case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 3. Referring to FIG. 22, slots 1 through 6 corresponding to the NK slots, T n It can be seen that this is placed continuously for a continuous placement length P. For example, if the continuous placement length P is 1, {T1, T2, T1, T2, T1, T2} can be placed from slot 1 to slot 6, and if the continuous placement length P is 2, {T1, T1, T2, T2, T1, T1} can be placed from slot 1 to slot 6. If the continuous placement length P is 3, {T1, T1, T1, T2, T2, T2} can be placed from slot 1 to slot 6.
[0237] FIG. 23 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=4. Here, case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 4. Referring to FIG. 23, slots 1 through 8 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0238] FIG. 24 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=7. Here, case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 7. Referring to FIG. 24, slots 1 through 14 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0239] FIG. 25 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=8. Here, case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, case c is an example where the continuous placement length P is 4, and case d is an example where the continuous placement length P is 8. Referring to FIG. 25, slots 1 through 16 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0240] FIG. 26 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=12. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, case c is an example where the continuous placement length P is 3, case d is an example where the continuous placement length P is 4, case e is an example where the continuous placement length P is 6, and case f is an example where the continuous placement length P is 12. Referring to FIG. 26, slots 1 through 24 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0241] FIG. 27 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=2 and K=16. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, case c is an example where the continuous placement length P is 4, case d is an example where the continuous placement length P is 8, and case e is an example where the continuous placement length P is 16. Referring to FIG. 27, slots 1 through 32 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0242] FIG. 28 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=2. Case a is an example where the continuous placement length P is 1, and case b is an example where the continuous placement length P is 2. Referring to FIG. 28, slots 1 through 8 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0243] FIG. 29 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=3. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 3. Referring to FIG. 29, slots 1 through 12 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0244] FIG. 30 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=4. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 4. Referring to FIG. 30, slots 1 through 16 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0245] FIG. 31 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=7. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, case c is an example where the continuous placement length P is 4, and case d is an example where the continuous placement length P is 7. Referring to FIG. 31, slots 1 through 28 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0246] FIG. 32 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=4 and K=8. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, case c is an example where the continuous placement length P is 4, and case d is an example where the continuous placement length P is 8. Referring to FIG. 32, slots 1 through 32 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0247] FIG. 33 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=2. Case a is an example where the continuous placement length P is 1, and case b is an example where the continuous placement length P is 2. Referring to FIG. 32, slots 1 through 16 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0248] FIG. 34 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=3. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 3. Referring to FIG. 34, slots 1 through 24 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0249] FIG. 35 illustrates an example of a placement method in a wireless communication system according to one embodiment of the present disclosure when N=8 and K=4. Case a is an example where the continuous placement length P is 1, case b is an example where the continuous placement length P is 2, and case c is an example where the continuous placement length P is 4. Referring to FIG. 35, slots 1 through 32 corresponding to the NK slots, T n It can be seen that this is arranged continuously for a continuous arrangement length P.
[0250] Referring to FIGS. 21 to 35 as described above, when the continuous batch length P is not a divisor of the repetition factor K, each T constituting a single TBoMS n The number of repetitions of may differ within the NK slot. For example, as illustrated in case b of FIG. 22, case b of FIG. 24, case b of FIG. 29, case b and case c of FIG. 31, when P is not a divisor of K, each T within the NK slot n The number of times this is repeated may vary.
[0251]
[0252] [Example #2: TBoMS iterative transfer batch and OCC block batch method considering RV]
[0253] Example #1 proposes a method for arranging OCC blocks within the repetitive transmission of TBoMS, taking into account the repetitive transmission arrangement and RV of TBoMS.
[0254] FIG. 36 illustrates an example of a procedure for placing an OCC block in a wireless communication system according to one embodiment of the present disclosure. FIG. 36 illustrates a method performed by a terminal.
[0255] Referring to FIG. 36, in step S3601, the terminal has T of the slots for repeated transmission. n and check RV. The terminal is the T of the slots for TBoMS iterative transmission. n By verifying and RV, the same Tn and slots with the same RV value can be identified.
[0256] In step S3603, the terminal places the OCC block. The terminal, among the slots for repeated transmission, the same T n And OCC blocks can be arranged so that slots having the same RV value are included in the same OCC block. According to one embodiment, the terminal is the same T n An OCC block may be arranged by considering the relative spacing between slots having the same RV value. The relative spacing indicates the spacing between slots when slots having Tn and the same RV are arranged in chronological order. The terminal may allow slots having a specific relative spacing among slots having the same Tn and the same RV to be included in a single OCC block. Here, the specific relative spacing may be determined by a specified rule or by signaling of a base station and / or network. According to one embodiment, the relative spacing may be set to a number smaller than the repetition factor. For example, the relative spacing may be set to a divisor of the repetition factor K. In the present disclosure, the relative spacing may be referred to as the spacing.
[0257] As described above, based on the given TBoMS iterative transmission layout and RV (redundancy version), an OCC block for performing slot-unit OCC within the iterative transmission can be arranged. When performing TBoMS iterative transmission, slots in which the same signals are transmitted are identical T so that they can operate in OCC spreading / de-spreading units. n and can have the same RV value. Therefore, the diffusion of slot-unit OCC is the same T n and can be performed on slots having the same RV value.
[0258] According to Example #2, the same T nand slots having L intervals among slots having the same RV value may be included in the same OCC block. In other words, the present disclosure is the same T n and after sorting slots with the same RV value in chronological order, the chronologically sorted order (e.g., same T n A method is proposed in which slots having L order differences are included in the same OCC block according to the relative order between slots having the same RV value. FIGS. 37 and FIGS. 38 illustrate examples for Example #2.
[0259] In FIGS. 37 and FIGS. 38, T n Silver is distinguished by a pattern, and RV is indicated to be distinguished by a number. Example #2 is an identical portion of a single TBoMS as shown in FIGS. 37 and 38. n T, that is, T with the same n value n Among these, parts having the same RV can be separated into a single OCC block based on L. In this case, the smaller L is (e.g., L=1), the more effective it is in reducing problems (e.g., TA (timing advanced) errors) caused by increased spacing between slots within an OCC block in slot-unit OCC. Conversely, as L increases, it is effective in achieving time diversity effects. Meanwhile, L must be set to a value smaller than the repetition factor. For example, L can be set as a divisor of K.
[0260] FIG. 37 illustrates an example of an OCC block arrangement method in a wireless communication system according to an embodiment of the present disclosure. Here, it is assumed that N=4, K=4, P=1, and the RV pattern is fixed. For example, it is assumed that the RV pattern is [0, 0, … , 0] and the number of RVs is 1 (R=1). Referring to case a of FIG. 37, when the length M of the OCC block is 2 and the OCC block arrangement interval L is 1, the same Tn And among slots having the same RV, two slots with a slot spacing of 1 can be placed in a single OCC block. At this time, the same T n and 16 slots having the same RV can be placed in 8 OCC blocks belonging to each of the 8 OCC groups. Referring to Case b, when the length M of the OCC block is 2 and the OCC block placement interval L is 2, the same T n and among slots having the same RV, two slots with a slot spacing of 2 can be placed in a single OCC block. At this time, the same T n and 16 slots having the same RV can be placed in 8 OCC blocks belonging to each of the 8 OCC groups. Referring to case c, when the length M of the OCC block is 4 and the OCC block placement interval L is 1, the same T n And among the slots having the same RV, four slots with a slot spacing of 1 can be placed in a single OCC block. At this time, the same T n 16 slots having the same RV can be placed in 4 OCC blocks belonging to each of the 4 OCC groups.
[0261] FIG. 38 illustrates another example of an OCC block arrangement method in a wireless communication system according to one embodiment of the present disclosure. Here, it is assumed that N=4, K=4, and P=4, and that the RV pattern is a cycling pattern that cycles through [0,3]. For example, it is assumed that the RV pattern has a cycling pattern of [0,3] and the number of RVs is 2 (R=2). Referring to FIG. 38, when the length M of the OCC block is 2 and the OCC block arrangement interval L is 1, the same T n And among slots having the same RV, two slots with a slot spacing of 1 can be placed in a single OCC block. At this time, the same T nAnd 16 slots having the same RV can be placed in 8 OCC blocks belonging to each of the 8 OCC groups.
[0262] FIGS. 39 to 44 are the same T n The possible OCC length M, OCC block placement spacing L, and OCC block placement type are illustrated according to the number of slots having the same RV. Here, for convenience, it is assumed that the OCC length M is a power of 2. In FIGS. 39 to 44, the dotted lines indicate the candidate sets of M, L, and OCC block placements possible under the given conditions.
[0263] FIG. 39 shows the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having and RV is 2. Referring to FIG. 39, the same T n And if there are 2 slots with the same RV, an OCC block with M=2 and L=1 can be placed.
[0264] FIG. 40 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 4. Referring to FIG. 40, the same T nAnd if the number of slots having the same RV is 4, OCC blocks with M=2, L=1, OCC blocks with M=2, L=2, or OCC blocks with M=4, L=1 may be arranged. For example, in the case of M=2, L=1, slots 1 and 2 may be arranged to be included in one OCC block, and slots 3 and 4 may be arranged to be included in another OCC block. As another example, in the case of M=2, L=2, slots 1 and 3 may be arranged to be included in one OCC block, and slots 2 and 4 may be arranged to be included in another OCC block. As yet another example, in the case of M=4, L=1, slots 1, 2, 3, and 4 may be arranged to be included in one OCC block. Case
[0265] FIG. 41 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 6. Referring to FIG. 41, the same T n And when the number of slots having the same RV is 6, OCC blocks with M=2, L=1 and OCC blocks with M=2, L=3 can be arranged. For example, in the case of M=2, L=1, slots 1 and 2 can be included in one OCC block, slots 3 and 4 can be included in another OCC block, and slots 5 and 6 can be included in yet another OCC block. As another example, in the case of M=2, L=3, slots 1 and 4 can be included in one OCC block, slots 2 and 5 can be included in another OCC block, and slots 3 and 6 can be included in yet another OCC block.
[0266] FIG. 42 shows the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having the same RV is 8. Referring to FIG. 42, the same T nAnd when the number of slots having the same RV is 8, OCC blocks with M=2, L=1, OCC blocks with M=2, L=2, OCC blocks with M=2, L=4, OCC blocks with M=4, L=1, OCC blocks with M=4, L=2, and OCC blocks with M=8, L=1 can be arranged. Here, it can be seen that M slots with an L interval are included in each OCC block.
[0267] FIG. 43 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having RV is 12. Referring to FIG. 43, the same T n And when the number of slots having the same RV is 12, OCC blocks with M=2, L=1, OCC blocks with M=2, L=2, OCC blocks with M=2, L=3, OCC blocks with M=2, L=6, OCC blocks with M=4, L=1, and OCC blocks with M=4, L=3 can be arranged. Here, it can be seen that M slots with an L interval are included in each OCC block.
[0268] FIG. 44 illustrates the same T in a wireless communication system according to one embodiment of the present disclosure. n An example of the arrangement of an OCC block is illustrated when the number of slots having and RV is 16. Referring to FIG. 44, the same T n And when the number of slots having the same RV is 16, OCC blocks with M=2, L=1, OCC blocks with M=2, L=8, OCC blocks with M=4, L=1, OCC blocks with M=4, L=4, OCC blocks with M=8, L=1, OCC blocks with M=8, L=2, and OCC blocks with M=16, L=1 can be arranged. Here, it can be seen that M slots with an L interval are included in each OCC block.
[0269] In the embodiment described with reference to FIGS. 39 to 44, each OCC block may belong to a different OCC group.
[0270]
[0271] [Example #3: Related Signaling and Application Procedures]
[0272] For slot-unit OCC and OCC block placement in TBoMS iterative transmission such as Example #1 and / or Example #2, a repetition factor K, the number of slots N of TBoMS, the number of RVs R for NK slots, information for determining RVs, OCC sequence length M, consecutive placement length P for each part of TBoMS, and / or the same T belonging to the OCC block n and L, which is the relative spacing between identical RV slots, needs to be predefined, transmitted from the base station and / or network to the terminal, or agreed upon.
[0273] FIG. 45 illustrates an example of a transmission and consensus procedure for information for applying slot-unit OCC in TBoMS iterative transmission in a wireless communication system according to one embodiment of the present disclosure. Here, a base station may be understood as a base station and / or network. In FIG. 46, the order of each step, i.e., the order of the consensus and / or transmission procedure for information, may be changed.
[0274] Referring to FIG. 45, in step S4501, the base station and the terminal may agree on and / or transmit information for determining the number of slots N for TBoMS, the repetition factor K, the number of RVs R, or the RV pattern. According to one embodiment, the repetition factor K is transmitted through a field related to repetition of an RRC message (e.g., the numberOfRepetitions field, or the numberOfRepetitionsExt field), and the number of slots N for TBoMS may be transmitted through a field related to TBoMS slots of an RRC message (e.g., the numberOfSlotsTBoMS field). Additionally, according to current standard specifications, in the case of CG (configured grant)-PUSCH, R and / or the RV pattern may be configured as [0, 0, 0, 0, …] or [0, 3, 0, 3, …], and in the case of DG (dynamic grant), rv of DCI (downlink control information) id Information for determining R and RV can be determined through this. In other words, K, N, and information for determining R and / or RV can be agreed upon between the base station and the terminal according to the definition of existing standards.
[0275] In step S4503, the base station and terminal have a continuous placement length P for each part of the TBoMS, and the same T belonging to the same OCC block. n Determine L, which is the relative spacing between the RV slots, and M, the length of the OCC sequence. Here, P, L, and / or M may be agreed upon and determined by a preset rule with explicit signaling, implicit signaling, or without signaling.
[0276] In step S4505, the base station and the terminal may agree on and / or transmit other necessary information for slot-unit OCC application. Other necessary information is information required for slot-unit OCC regardless of whether TBoMS is applied, and may include, for example, an OCC sequence ID. Other necessary information may be provided through separate signaling.
[0277] When information as described above is received from a base station / network or verified through a prior definition in the standard, the terminal can initiate slot-unit OCC transmission in TBoMS repetitive transmission.
[0278] According to one embodiment, the continuous placement length P for each part of the TBoMS may be defined in the specification to use a specific value without signaling. For example, the terminal may always use a value P=1 according to the specification, use a value equal to M as the P value when using slot-unit OCC, always use a value equal to M as the P value regardless of the OCC application technique, or always use a value equal to N as the P value. Alternatively, P may be transmitted via signaling. If transmitted via signaling, the absolute value of P may be transmitted from the base station / network to the terminal. For example, values corresponding to 1 through N It may be transmitted to the terminal via bits. Alternatively, the base station and / or network may transmit information to the terminal that can identify the corresponding P value among a given group of candidates. For example, the base station may assign P=1 to bit 0 and P=N to bit 1, and transmit information to the terminal indicating the value to be used as P among 1 and N through 1-bit signaling. Alternatively, the base station may assign P=1 to bit 0 and P=M to bit 1, and transmit information to the terminal indicating the value to be used as P among 1 and M through 1-bit signaling. Alternatively, the base station may assign P=1 to bit 0 and P=min(M,N) to bit 1, and transmit information to the terminal indicating the value to be used as P among 1 and min(M,N) through 1-bit signaling. Alternatively, the base station may assign P=1 to bit 00, P=M to bit 01, P=K to bit 10, and P=N to bit 11, and transmit information to a terminal indicating the value to be used as P among 1, M, K, and N using 2-bit signaling. According to one embodiment, P may be transmitted to an individual terminal through UE-specific signaling such as DCI, MAC CE, RRC messages, etc., or transmitted to multiple terminals through cell-specific signaling such as SIB or group signaling.
[0279] [Table 11] shows all T during repeated transmission n These represent a group of candidates for P that can be transmitted the same number of times.
[0280] KNPossible PAll values1{1}12{1}22{1, 2}32{1, 3}42{1, 2}72{1, 7}82{1, 2, 4, 8}122{1, 2, 3, 4, 6, 12}162{1, 2, 4, 8, 16}14{1}24{1, 2}34{1, 3}44{1, 2, 4}74{1, 7}84{1, 2, 4, 8}18{1}28{1, 2}38{1, 3}48{1, 2, 4}
[0281] [Table 11] shows all T's belonging to a specific TB according to the combination of K and N. n Represents a set of candidates for P such that they are transmitted the same number of times during the repeated transmission of a single TBoMS. For example, in a situation where K is 2 and N is 2, if P is 1 or 2, all T belonging to a specific TB n They can be transmitted the same number of times during TBoMS iterative transmissions. As another example, in a situation where K is 8 and N is 2, if P is 1, 2, 4, or 8, all T belonging to a specific TB n These can be transmitted the same number of times during repeated TBoMS transmissions.
[0282] Therefore, P can be indicated through a separate indicator that indicates one of the possible candidate values depending on the given combination of K and N. For example, P is a set containing the candidate set of P according to the given K and N. N,K When represented as such, P∈P N,K is,P N,K Among the elements of a(1≤a≤|P N,K For the element with the |)th size, indicator X a It can be assigned. The base station and / or network X through signaling a It instructs the terminal, and the terminal receives X through signaling. a Based on P N,K The element with the size a-th can be determined as P. In this case, the order of the elements by size can be determined as ascending or descending.
[0283] According to one embodiment, a set P including a group of candidates for P according to given K and N. N,K can be defined in advance through specifications. Also, P N,K is all T belonging to a specific TB n It can be determined to include values other than those in [Table 11] that ensure they are transmitted the same number of times during a single TBoMS iteration. Additionally, P can always be indicated through an indicator capable of 1-bit signaling. N,K , that is, a candidate set of P can be established. For example, the candidate set of P is P N,K By being composed of ={1, K}, P can be indicated in the form of On / Off or Enable / Disable. In this case, values other than 1 can be set to values other than K. For example, the candidate set of P can be defined as M, which is the minimum value greater than 1 among the divisors of K, the maximum M applicable considering RV, or the minimum value greater than 1 applicable considering RV.
[0284] In this case, when there is only one candidate for P (i.e., |P N,K |=1), the terminal may not expect signaling indicating P.
[0285] As mentioned above, the terminal, by definition in the standard specification or by instructions (e.g., signaling) from the base station and / or network, each part of the TBoMS (T n It can be confirmed that the placement of ) may change. In this case, the terminal, depending on its capabilities, T during repeated TBoMS transmission based on P confirmed by specifications or instructions. n The arrangement of may or may not be changed. That is, depending on its capability, the terminal can perform multiple T for TBoMS repetitive transmissions. n It does not support batch methods, and a single T for TBoMS iterative transmission such as legacy methodsn It may support only batch methods (e.g., support only for cases corresponding to a specific P value). Therefore, the terminal supports multiple T for TBoMS iterative transmission. n A capability report containing information indicating support for deployment methods may be transmitted. The base station and / or network may perform configuration according to the capability of each terminal based on the terminal's capability report. In this case, if K > RN is satisfied for a legacy UE, the legacy UE [requires] the same T in its TBoMS iterations. n and it can be determined that there is more than one slot with the same RV. Therefore, the base station / network can determine that the legacy UE can be included in the OCC group for the repeated transmission of TBoMS of non-legacy UEs.
[0286] In the iterative transmission of TBoMS where P=1, each part of TBoMS (T n The layout of ) is identical to the layout of a legacy UE that does not support OCC. This can be confirmed by comparing the examples in Fig. 46 and Fig. 25.
[0287] FIG. 46 illustrates examples of TBoMS repetitive transmission of a legacy terminal in a wireless communication system according to one embodiment of the present disclosure. Here, case a is an example of TBoMS repetitive transmission when the RV value is 1, case b is an example of TBoMS repetitive transmission when the RV value is 2, and case c is an example of TBoMS repetitive transmission when the RV value is 4. For example, the case where the RV value is 1 is a case where the RV value is fixed at 0, which can be expressed as an RV pattern of [0 0 …]. Also, the case where the RV value is 2 is a case where the RV values are 0 and 3, which can be expressed as having a cycling pattern of [0 3 0 3 …], and the case where the RV value is 4 is a case where the RV values are 0, 1, 2, and 3, which can be expressed as having a cycling pattern of [0 2 3 1 …]. Referring to Fig. 30, although the R value differs for each case, the T of TBoMS n It can be seen that the arrangement method of these is identical. In addition, the T of these TBoMS n It can be seen that the arrangement method of the items is the same as in case a of Fig. 25.
[0288] Therefore, the case where P=1 can be used to inform non-legacy UEs that a legacy UE is included in the same spread / respread unit, i.e., within the OCC group, in a slot-unit OCC. For example, if a base station and / or network intends to form an OCC group containing legacy UEs capable of respreading through OCC with consideration of RV, they can use 1-bit signaling to assign either 0 or 1 as P=1 and the other as P≠1 (e.g., M, N, mim(M,N), etc.), and inform non-legacy UEs included in the OCC group that a legacy UE is included in the OCC group by signaling the bit corresponding to P=1. If a legacy UE is not included in the OCC group, the bit corresponding to the P value selected by the base station judgment can be signaled to the UEs included in the OCC group.
[0289] According to one embodiment, L can be defined by a standard so that it is agreed to use a specific value without signaling. For example, the terminal may always use L=1, always use L=K / MR, or always use L=NK / MR according to the standard. Alternatively, L may be transmitted via signaling. When transmitted via signaling, the absolute value of L may be transmitted from the base station and / or network to the terminal. For example, a value ranging from 1 to K / MR It may be transmitted to a terminal via bits. Alternatively, the base station and / or network may transmit information to the terminal indicating a value of L among a given group of candidates. For example, the base station may assign L=1 to bit 0 and L=K / MR to bit 1, and transmit the value of L to be used by the terminal through 1-bit signaling. According to one embodiment, L may be transmitted to each terminal via UE-specific signaling such as DCI, MAC CE, RRC messages, etc. Alternatively, L may be transmitted to multiple terminals via cell-specific signaling or group signaling via SIB, etc. In this case, if only one candidate for L exists, the terminal may not expect a signaling indicating L.
[0290] M is defined by a standard, so that it can be agreed to use a specific value based on conditions without signaling. Alternatively, M may be transmitted via signaling. When transmitted via signaling, the absolute value of M may be transmitted from the base station and / or network to the terminal. For example, values corresponding to 1 through K It may be transmitted to the terminal via bits. Alternatively, the base station and / or network may transmit information to the terminal indicating a value of M from a given set of candidates. For example, the base station may assign M=1 to bit 0 and M=2 to bit 1, and transmit information indicating the M that the terminal will use using 1-bit signaling. Alternatively, the base station may assign M=1 to bit 00, M=2 to bit 01, M=4 to bit 10, and M=8 to bit 11, and transmit information indicating the M that the terminal will use using 2-bit signaling. M may be transmitted to each terminal via UE-specific signaling, such as DCI, MAC CE, RRC messages, etc. Alternatively, M may be transmitted to multiple terminals via cell-specific signaling or group signaling, such as SIB.
[0291] Given K, R, and N for a specific terminal, K / RN are the same T n and can indicate the number of slots having the same RV. Accordingly, K / RN can indicate the maximum OCC sequence length of the OCC block included in the TBoMS repeated transmission of the terminal, i.e., maximum M.
[0292] [Table 12] shows the maximum possible M and the corresponding possible candidates for M depending on the combination of K, R, and N. [Table 12] assumes that the candidates for M are exponents of 2.
[0293] KRNK / RNPossible M2112{1,2}2121{1}4114{1,2,4}4122{1,2}4141{1}4212{1,2}4221{1}8118{1,2 ,4,8}8124{1,2,4}8142{1,2}8214{1,2,4}8222{1,2}8241{1}8412{1,2}8421{1}
[0294] Based on [Table 12], the base station / network and the terminal may determine and / or agree on M based on the following methods. In method c) below, if the candidate for M is unique, the terminal may not expect signaling indicating M.
[0295] - Method a) Given K, R, and N, the base station / network and terminal can determine and / or agree on whether to apply OCC and M without signaling through a criterion for selecting the maximum or minimum value among the possible candidate Ms corresponding to the given K, R, and N.
[0296] - Method b) (1) K, R, N are given, and (2) when the application of OCC is confirmed through other OCC-related signaling such as an OCC sequence ID or a standard definition, the base station / network and terminal can determine and / or agree on M without signaling by selecting the maximum or minimum value from a group of possible M candidates corresponding to the given K, R, N when applying OCC.
[0297] - Method c) Given K, R, and N, and a set of possible M candidates corresponding to the given K, R, and N is determined, the base station / network may transmit only the information regarding the values corresponding to the set of possible M candidates to the terminal via signaling to reduce signaling overhead.
[0298] FIGS. 47, FIGS. 48, and FIGS. 49 illustrate examples of methods a), b), and c) as described above.
[0299] FIG. 47 illustrates an example of determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure. FIG. 48 illustrates examples of method a of determining whether to apply OCC and M without signaling based on N, R, and K.
[0300] Referring to Fig. 47, case a is an example where the length M of the OCC sequence is determined without signaling when K=4, R=2, and N=2. When K=4, R=2, and N=2, the candidate for M is {1}. In this case, the terminal can perform TBoMS iterations without OCC.
[0301] Case b is an example where the length M of an OCC sequence is determined without signaling when K=8, R=1, and N=4 are given. When K=8, R=1, and N=4, the candidates for M are {1,2}. The terminal determines the value of M to be 2 based on the criterion of selecting the maximum value, and can perform TBoMS iterations based on the slot-unit OCC where M=2.
[0302] Case c is an example where the length M of an OCC sequence is determined without signaling when K=8, R=1, and N=2. When K=8, R=1, and N=2, the candidates for M are {1, 2, 4}. The terminal determines the value of M to be 4 based on the criterion of selecting the maximum value, and can perform TBoMS iterations based on the slot-unit OCC where M=4.
[0303] FIG. 48 illustrates another example of a method for determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure. FIG. 49 illustrates examples of method b for determining whether to apply OCC and M without other signaling based on N, R, K and OCC application instructions.
[0304] Referring to Fig. 48, case a is an example where the length M of the OCC sequence is determined when K=4, R=1, and N=1, and there is no instruction to apply OCC. When K=4, R=1, and N=1, the candidates for M are {1, 2, 4}. When no instruction to apply OCC is received from the base station, the terminal determines the value of M to 1 and can perform TBoMS iteration without OCC.
[0305] Case b is an example where K=8, R=1, N=2, and the length M of the OCC sequence is determined without additional signaling when there is an instruction to apply OCC. When K=8, R=1, N=2, the candidate set of M is {1, 2, 4}. When an instruction to apply OCC is received from the base station, the terminal determines the value of M to be 2 based on the criteria for selecting the minimum value for which OCC is possible, and can perform TBoMS iterations based on the slot-unit OCC where M=2. Here, since M=1 corresponds to the case where OCC is not applied, the terminal can select the smallest value among values greater than 1 as the value of M according to the criteria for selecting the minimum value for which OCC is possible.
[0306] Case c is an example where K=8, R=1, N=2, and the length M of the OCC sequence is determined without additional signaling when there is an instruction to apply OCC. When K=8, R=1, N=2, the candidates for M are {1, 2, 4}. When an instruction to apply OCC is received from the base station, the terminal determines the value of M to be 4 based on the criteria for selecting the maximum possible value for OCC, and can perform TBoMS iterations based on the slot-unit OCC with M=4.
[0307] FIG. 49 illustrates another example of a method for determining the length of an OCC sequence in a wireless communication system according to one embodiment of the present disclosure. FIG. 50 illustrates examples of a method c for determining whether to apply OCC and M based on instructions for N, R, K and whether to apply OCC and / or M.
[0308] Referring to FIG. 49, case a is an example in which the length M of an OCC sequence is determined when K=8, R=2, N=2 and M and whether OCC is applied are indicated by 1-bit signaling. When K=8, R=2, N=2, the candidate set of M is {1, 2}. The base station can transmit whether OCC is applied and the value of M to the terminal through 1-bit signaling.
[0309] Case b is an example where K=8, R=1, and N=2 are given, and the length M of the OCC sequence is determined when M and whether OCC is applied are indicated through 1-bit signaling. The base station can transmit whether OCC is applied and the value of M to the terminal through 1-bit signaling. At this time, the base station can indicate 1 or 4 among the candidates for M based on the selection criteria for the maximum or minimum value.
[0310] Case c is an example where the length M of an OCC sequence is determined when K=8, R=2, and N=1, and M and whether OCC is applied are indicated by 1-bit signaling. The base station can transmit the OCC application instruction and transmit the value of M through a separate 1-bit signaling.
[0311] When operating as described above, the signaling overhead for determining whether to apply OCC and the value of M can be reduced. On the other hand, when not operating as described above, 2 bits of signaling may be required. For example, referring to Table 12, when the candidate group is {1, 2, 4, 8}, 2 bits of signaling overhead may be required to indicate the value of M to be used by the terminal. However, when operating as described above in methods a, b, or c, whether to apply OCC and the value of M can be determined without signaling or with only 1 bit of signaling.
[0312]
[0313] The methods according to the present disclosure may be implemented in the form of program instructions that can be executed through various computer means and recorded on a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, etc., alone or in combination. The program instructions recorded on the computer-readable medium may be those specifically designed and configured for the present disclosure, or they may be those known and available to those skilled in the art of computer software.
[0314] Examples of computer-readable media include hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, and flash memory. Examples of program instructions include machine code, such as that produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter, etc.
[0315] Some aspects of the present disclosure have been described in the context of a device, but may also be described according to a corresponding method, wherein a block or device corresponds to a method step or a feature of a method step. Similarly, aspects described in the context of a method may also be described according to a corresponding block or item or a feature of a corresponding device. Some or all of the method steps may be performed by (or using) a hardware device, such as, for example, a microprocessor, a programmable computer, or an electronic circuit. In some embodiments, at least one of the most important method steps may be performed by such a device.
[0316] A programmable logic device (e.g., a field-programmable gate array) may be used to perform some or all of the functions of the methods described in this disclosure. A field-programmable gate array may operate with a microprocessor to perform one of the methods described in this disclosure. Generally, it is preferable that the methods be performed by some hardware device.
[0317] Although the present invention has been described with reference to the embodiments above, those skilled in the art will understand that various modifications and changes can be made to the present disclosure without departing from the spirit and scope of the disclosure as set forth in the following claims.
Claims
1. In a method of operation of a terminal in a wireless communication system, Receiving configuration information regarding the application of OCC (orthogonal covering code) in the UL (uplink); Generating UL data; Mapping signals including the above UL data to multiple slots based on PUSCH (physical uplink shared channel) repetition; Applying OCC to the above signals; and It includes transmitting the signals in the plurality of slots mentioned above, The above signals include signals generated according to at least one RV value by applying RV (redundancy version) cycling, a method.
2. In Claim 1, A method in which the number of repetitions for the above PUSCH repetition is greater than or equal to the length of the sequence used in the above OCC.
3. In Claim 1, Applying OCC to the above signals is, It includes applying an OCC sequence to an OCC block for slot-unit OCC, and A method in which the above OCC block includes some slots among the plurality of slots to which signals generated based on the same RV value are mapped.
4. In Claim 3, The above-mentioned slots have a spacing configured by the above-mentioned configuration information, and A method comprising the interval having some slots in a state in which slots having the same part of a TB (transport block) containing UL data and the same RV among the plurality of slots are aligned based on time.
5. In Claim 3, The above-mentioned slots have a spacing configured by the above-mentioned configuration information, and A method in which the above interval is determined based on at least one of the number of repetitions for the PUSCH repetition, the length of the OCC sequence, or the number of RVs applied in the plurality of slots.
6. In Claim 1, Mapping symbols containing the above UL data to multiple slots based on PUSCH (physical uplink shared channel) repetition is, Generating symbols mapped to multiple slots containing the above UL data; and It includes repeatedly mapping signals including the above symbols to the plurality of slots, The plurality of slots above include a number of slots that is a multiple of the number of slots included in the multi-slots, and The above configuration information includes information regarding the arrangement of the signals in the plurality of slots, and A method in which information regarding the above arrangement includes information regarding the continuous arrangement length for each slot included in the multi-slots.
7. In Claim 6, A method in which the above continuous batch length is determined based on at least one of the length of the sequence used in the OCC, the number of repetitions for the repetition of the PUSCH, or the number of slots included in multiple slots.
8. In Claim 6, A method in which the above continuous arrangement length is a value such that signals including the symbols are repeatedly mapped to the plurality of slots the same number of times.
9. In Claim 6, A method comprising at least one of the above configuration information, information regarding the number of repetitions, information regarding the number of slots included in the multi-slots, information regarding the number of RVs for the plurality of slots, information for determining the RVs, or information regarding the length of the OCC sequence.
10. In Claim 6, A method in which the length of the sequence used in the above OCC is determined based on at least one of the number of repetitions for the above PUSCH repetition, the number of slots included in the above multi-slots, or the number of RVs applied in the above plurality of slots.
11. A method of operation of a non-terrestrial network (NTN) base station in a wireless communication system, Transmitting configuration information regarding the application of OCC (orthogonal covering code) in the UL (uplink); and It includes receiving signals to which the above OCC is applied, The above signals include signals generated according to at least one RV value by applying RV (redundancy version) cycling, a method.
12. In Claim 11, A method in which the above configuration information includes information on the continuous placement length for each slot included in the multi-slots to which UL data is mapped.
13. In Claim 11, A method in which the above configuration information includes information regarding the spacing of slots included in an OCC block to which the sequence of the OCC is to be applied.
14. In Claim 11, A method comprising at least one of the above configuration information, which includes information on the number of repetitions, information on the number of slots included in the multi-slots to which UL data is mapped, information on the number of RVs for a plurality of slots to be used for PUSCH (physical uplink shared channel) repeated transmission, information for determining the RVs, or information on the length of the sequence used in the OCC.
15. In a terminal of a wireless communication system, At least one transmitter / receiver; At least one processor; and It includes at least one memory connected to the above-mentioned at least one processor to enable operation, and storing instructions that control the terminal to perform operations when executed by the processor, and The above operations are, Receiving configuration information regarding the application of OCC (orthogonal covering code) in the UL (uplink); Generating UL data; Mapping signals including the above UL data to multiple slots based on PUSCH (physical uplink shared channel) repetition; Applying OCC to the above signals; and It includes transmitting the signals in the plurality of slots mentioned above, The above signals include signals generated according to at least one RV value by applying RV (redundancy version) cycling, a terminal.
16. In a non-terrestrial network (NTN) base station in a wireless communication system, At least one transmitter / receiver; At least one processor; and It includes at least one memory connected to the above-mentioned at least one processor to enable operation, and storing instructions that control the terminal to perform operations when executed by the processor, and The above operations are, Transmitting configuration information regarding the application of OCC (orthogonal covering code) in the UL (uplink); and It includes receiving signals to which the above OCC is applied, The above signals include signals generated according to at least one RV value by applying RV (redundancy version) cycling, a base station.
Citation Information
Patent Citations
Uplink Transmission Method and Terminal
US20210068130A1
Method for performing random access procedure and apparatus therefor
US20210112590A1
Confirmatory signaling for multi-pusch and multi-pdsch scheduling
US20230217450A1
Uplink Designs For New Radio Unlicensed Spectrum
US20230262762A1