Method and apparatuses for random access channel (RACH) structure
The described method optimizes RACH structure by associating preambles with channel resource units and using a 'preamble + payload' configuration to enhance uplink synchronization and reduce signaling overhead in 3GPP wireless communication systems.
Patent Information
- Application Number
- KR1020267036864
- Authority / Receiving Office
- KR · KR
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2019-05-02
- Publication Date
- 2026-11-16
AI Technical Summary
Existing 3GPP wireless communication systems face challenges in achieving efficient uplink synchronization and reducing signaling overhead in RACH procedures, particularly in 4-step and 2-step RACH processes, due to issues with timing offset and resource unit allocation.
A method and apparatus for optimizing RACH structure by associating preambles with channel resource units, prioritizing mappings to different CDM groups, and using a 'preamble + payload' configuration for grant-free uplink data transmission, which includes specific mapping formulas to manage preambles and PUSCH resource units.
This approach enhances uplink synchronization, reduces signaling overhead, and improves power efficiency by simplifying the RACH procedure and optimizing resource allocation, particularly in 2-step RACH processes.
Smart Images

Figure PAT00015_ABST
Abstract
Description
Technology Field
[0001] The present disclosure generally relates to wireless communication, and more specifically to a method and apparatus for a random access channel (RACH) structure. Background Technology
[0002] In 3GPP (3rd Generation Partnership Project) standards (e.g., 4th generation (4G) and 5th generation (5G) NR (new radio) mobile networks), before a wireless communication device (e.g., user equipment (UE)) can transmit data to a base station (BS), the wireless communication device needs to perform uplink synchronization and downlink synchronization with the BS. Uplink timing synchronization can be achieved by performing a random access procedure through an appropriate RACH structure.
[0003] The exemplary embodiments disclosed herein relate to solving problems related to one or more problems presented in the prior art, as well as providing additional features that will become readily apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. According to various embodiments, exemplary systems, methods, devices, and computer program products are disclosed herein. However, it will be understood that these embodiments are presented as examples and are not limited, and that various modifications may be made to the disclosed embodiments while remaining within the scope of this disclosure.
[0004] In some embodiments, the method comprises the step of determining a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, and the step of determining the mapping comprises the step of determining that a plurality of channel resource units carry a plurality of payloads, the step of determining that a set of preambles among a plurality of preambles is associated with the same beam, and the step of prioritizing mapping a set of preambles to reference signals of a plurality of channel resource units corresponding to different code division multiplexing (CDM) groups.
[0005] In some embodiments, the device comprises at least one processor and memory, and at least one processor is configured to implement a method comprising the step of reading a code from memory and determining a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, wherein the step of determining the mapping comprises: determining that a plurality of channel resource units carry a plurality of payloads; determining that a set of preambles among a plurality of preambles is associated with the same beam; and prioritizing the mapping of a set of preambles to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0006] In some embodiments, the computer program product comprises a computer-readable program medium storing code that enables at least one processor, when executed by at least one processor, to implement a method for determining a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, wherein the step of determining the mapping comprises: determining that a plurality of channel resource units carry a plurality of payloads; determining that a set of preambles among a plurality of preambles is associated with the same beam; and prioritizing the mapping of a set of preambles to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0007] In some embodiments, the method comprises receiving data from a wireless communication device comprising a preamble among a plurality of preambles, a payload among a plurality of payloads, and a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with the plurality of preambles, and identifying a channel resource unit among the plurality of channel resource units based on the mapping. A channel resource unit is used to carry a payload. A set of preambles among the plurality of preambles is associated with the same beam. A set of preambles is prioritized to be mapped to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0008] In some embodiments, the device is configured to implement a method comprising at least one processor and memory, wherein the at least one processor reads a code from memory and receives data from a base station, from a wireless communication device, including a preamble among a plurality of preambles, a payload among a plurality of payloads, and a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, and a method comprising identifying a channel resource unit among a plurality of channel resource units based on the mapping. A channel resource unit is used to carry a payload. A set of preambles among a plurality of preambles is associated with the same beam. A set of preambles is prioritized to be mapped to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0009] In some embodiments, the computer program product includes computer-readable program medium code storing code that enables at least one processor to receive data from a wireless communication device via a base station, the data including a mapping that associates a plurality of preambles, a plurality of payloads, and a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, and a plurality of channel resource units based on the mapping. The channel resource units are used to carry payloads. A set of preambles among a plurality of preambles is associated with the same beam. A set of preambles is prioritized to be mapped to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0010] The above and other aspects and their implementations are described in more detail in the drawings, descriptions, and claims. Brief explanation of the drawing
[0011] Various exemplary embodiments of the present solution are described in detail below with reference to the drawings or designs below. The drawings are provided for illustrative purposes only and illustrate exemplary embodiments of the present solution to facilitate the reader's understanding of the present solution. Accordingly, the drawings should not be construed as limiting the breadth, scope, or applicability of the present solution. It should be noted that these drawings are not necessarily drawn to scale for the sake of clarity and ease of explanation. FIG. 1a is a signaling diagram illustrating an exemplary 4-step RACH procedure according to an embodiment of the present disclosure. FIG. 1b is a signaling diagram illustrating an exemplary two-step RACH procedure according to an embodiment of the present disclosure. FIG. 1c is a signaling diagram illustrating an exemplary grant-free uplink data transmission procedure according to an embodiment of the present disclosure. FIG. 2 illustrates a block diagram of a base station (BS) according to some embodiment of the present disclosure. FIG. 3 illustrates a block diagram of a wireless communication device according to some embodiments of the present disclosure. FIG. 4 illustrates a flowchart of a method for managing data transmission (including a preamble and a payload) between a wireless communication device and a BS according to some embodiments of the present disclosure. FIG. 5a illustrates an equidistant division scenario of an exemplary mapping method according to some embodiments of the present disclosure. FIG. 5b illustrates an equidistant division scenario of an exemplary mapping method according to some embodiments of the present disclosure. FIG. 5c illustrates an unequal partitioning scenario of an exemplary mapping method according to some embodiments of the present disclosure. FIG. 5cb illustrates an unequal partitioning scenario of an exemplary mapping method according to some embodiments of the present disclosure. FIG. 5d is a diagram (500d) illustrating the correspondence between RO and beams according to some embodiments of the present disclosure. FIG. 5e is a drawing illustrating the correspondence between a plurality of ROs (RO groups) and a beam according to some embodiments of the present disclosure. FIG. 5f is a diagram illustrating the association between a PO and a preamble index based on a CDM group (in relation to the second and third exemplary mapping schemes) according to some embodiments of the present disclosure. FIG. 5g is a diagram illustrating the association of PO and SSB sets based on CDM groups (in relation to second and third exemplary mapping schemes) according to some embodiments of the present disclosure. FIG. 6a is a drawing illustrating a frequency domain multiplexed (FDM) PO that occupies continuous time and frequency resources according to some embodiments of the present disclosure. FIG. 6b is a drawing illustrating time domain multiplexed (TDM) and frequency domain multiplexed (FDM) POs according to some embodiments of the present disclosure. FIG. 6c is a drawing illustrating a PO that occupies discontinuous time and frequency resources according to some embodiments of the present disclosure. FIG. 6d is a drawing illustrating a PO occupying a time / frequency resource indicated by a start offset and an end offset of the boundary of a discontinuous time / frequency resource according to some embodiment of the present disclosure. FIG. 6e is a drawing illustrating a PO that occupies a time / frequency resource indicated by a start offset together with a plurality of POs according to some embodiments of the present disclosure. FIG. 7 illustrates a flowchart of a method for managing data transmission (including a preamble and a payload) between a wireless communication device and a BS according to some embodiments of the present disclosure. Specific details for implementing the invention
[0012] Various exemplary embodiments of the present solution are described below with reference to the accompanying drawings to enable those skilled in the art to create and use the present solution. As will be apparent to those skilled in the art, after reading this disclosure, various changes or modifications may be made to the examples described herein without departing from the scope of the present solution. Accordingly, the present solution is not limited to the exemplary embodiments and applications described and illustrated herein. Additionally, the specific order or hierarchy of steps in the method disclosed herein is merely an exemplary approach. Based on design preferences, the specific order or hierarchy of steps in the disclosed method or process may be rearranged while remaining within the scope of the present solution. Accordingly, those skilled in the art will understand that the method and technique disclosed herein present various steps or actions in a sample order, and that the present solution is not limited to the specific order or hierarchy presented unless otherwise explicitly stated.
[0013] In 3GPP standards, the RACH procedure is used to achieve uplink timing synchronization between a radio communication device (e.g., UE) and a BS. The random access procedure may involve a 4-phase RACH or a 2-phase RACH.
[0014] FIG. 1a is a signaling diagram illustrating an exemplary four-step RACH procedure (100a) according to an embodiment of the present disclosure. In the four-step RACH procedure (100a), the BS (120) performs downlink synchronization for the wireless communication device (110) at 130a. The wireless communication device (110) transmits a RACH preamble of message 1 ("msg1") to the BS (120) at 140a. In response to the RACH preamble being received by the BS (120), the BS (120) transmits message 2 ("msg2") back to the wireless communication device (110) at 150a. msg2 includes at least a medium access control (MAC) random access response (RAR) as a response to the RACH preamble. In response to a MAC RAR having a corresponding random access preamble (RAP) identifier (ID) being received by a wireless communication device (110), the wireless communication device (110) transmits message 3 ("msg3") to the BS (120) at 160a. msg3 includes at least the grant carried in the MAC RAR, the identifier of the wireless communication device (110) (e.g., UE ID), control information, etc. In response to the BS (120) receiving msg3, the BS (120) transmits message 4 ("msg4") back to the wireless communication device (110) at 170a. msg4 includes at least a radio resource control (RRC) establishment message, a contention resolution ID for contention resolution, etc.
[0015] A two-stage RACH can be considered as a simplified RACH process. FIG. 1b is a signaling diagram illustrating an exemplary two-stage RACH procedure (100b) according to an embodiment of the present disclosure. In the two-stage RACH procedure (100b), the BS (120) performs downlink synchronization for the wireless communication device (110) in 130b.
[0016] The wireless communication device (110) transmits message A ("msgA") to the BS (120) at 145b. msgA includes msg1 and msg3 of at least a four-step RACH procedure (100a). msg1 includes at least a preamble carried through a physical RACH (PRACH). msg3 (e.g., including one or more of an acknowledgment, an identifier of the wireless communication device (110), control information, etc.) may be considered as a payload carried through a physical uplink shared channel (PUSCH). In response to the RACH preamble being received by the BS (120), the BS (120) transmits message B ("msgB") back to the wireless communication device (110) at 155b. msgB includes at least msg2 (e.g., MAC RAR) and / or msg4 (e.g., RRC establishment message, contention resolution ID, etc.) of the 4-step RACH procedure (100a). Thus, instead of the two interactions required by the 4-step RACH procedure (100a) (each interaction involves the transmission of two messages or steps), the 2-step RACH procedure (100b) requires only one interaction between the BS (120) and the wireless communication device (110) to establish an RRC connection. Accordingly, compared to the 4-step RACH procedure (100a), the 2-step RACH procedure (100b) has features such as simplifying the RACH procedure, saving signaling overhead, and reducing power consumption.
[0017] Each PUSCH resource unit corresponds to a resource used to carry a payload. Each PUSCH resource unit can be defined based on time, frequency, and a demodulation reference signal (DMRS). In some examples, a PUSCH resource unit includes a DMRS port and / or a DMRS sequence. The DMRS can be embedded in the payload transmission.
[0018] In the 2-step RACH procedure (100b), msgA contains a mapping between a preamble (carried via PRACH) and a PUSCH resource unit (used to carry a payload, e.g., msg3, but not limited thereto). The base station (120) can use the mapping contained in msgA to identify the PUSCH resource unit mapped to the preamble in response to successfully receiving and decoding the preamble.
[0019] Principles and detailed mapping formulas for mapping M preambles to PUSCH resource units associated with the M preambles are disclosed. This specification further provides a method for associating M preambles with PUSCH resource units as part of the mapping. This specification explicitly designates mapping relationships / association methods by means of formulas or by description of specific principles.
[0020] For each RACH occasion (RO), a specific number of preambles dedicated to the 2-stage RACH procedure (100b) is assigned. An RO represents the location of a preamble transmission resource in the time domain and the frequency domain. A specific number of preambles is identified using preamble index numbers arranged in ascending order. For example, M preambles (from one or more ROs) may be arranged or sorted according to the index-first, frequency-second, and time-third principles. PUSCH resource units may also be arranged or ordered according to appropriate criteria. Then, the mapping between the M preambles and the PUSCH resource units corresponds to associating / mapping the ordered preambles with the ordered PUSCH resource units. Depending on the mapping ratio (e.g., the ratio between M and the number of PUSCH resource units), the association / mapping between the PUSCH resource unit(s) associated with the preamble of each RO can be one-to-one or many-to-one.
[0021] To avoid the effect of timing offset on the splitting of orthogonal cover code (OCC) patterns and demodulation reference signal (DMRS) sequences between different wireless communication devices during the RACH procedure, PUSCH resource units associated with the same beam are assigned to different code division multiplexing (CDM) groups. In the case of a two-stage RACH procedure (100b), preambles associated with the same beam are sequentially ordered with increasing indices. According to the aforementioned ordering principle, since the number of CDM groups is smaller than the number of OCC patterns / DMRS sequences, PUSCH resource units associated with the same beam are more likely to be split into OCC patterns / DMRS sequences. A system and method for addressing this defect in a conventional system are described herein.
[0022] In some examples, a “preamble + payload” channel structure may also be implemented for grant-free uplink data transmission. FIG. 1c is a signaling diagram illustrating an exemplary grant-free uplink data transmission procedure (100c) according to an embodiment of the present disclosure. In the grant-free uplink data transmission procedure (100c), the BS (120) performs downlink synchronization for the wireless communication device (110) at 130c. The wireless communication device (110) transmits a message to the BS (120) on the uplink at 145c. The message includes a preamble and a payload. The BS (120) transmits a response back to the wireless communication device (155c) on the downlink at 155c, wherein the response includes an acknowledgment (ACK) or a negative acknowledgment (NACK). The payload of msgA of the 2-stage RACH procedure (100b) carries only control plane (CP) data. Meanwhile, the content of the payload for the unacknowledged uplink data transmission procedure (100c) (e.g., the message transmitted in 145c) may include some user plane (UP) data. In the uplink unacknowledged uplink data transmission procedure (100c), if the UP data is successfully decoded, an RRC connection does not need to be established. In response to the detection of the preamble of the message in 145c, the BS (120) identifies the PUSCH resource unit carrying the payload of the message in 145c. Therefore, for the uplink unacknowledged uplink data transmission procedure (100c), mapping between the preamble(s) and the PUSCH resource unit(s) is required. Thus, the mapping method described herein can be similarly implemented for the message transmitted in 145c (using the “preamble + payload” configuration).
[0023] FIG. 2 illustrates a block diagram of a BS (200) according to some embodiments of the present disclosure. Referring to FIG. 1a through 2, the BS (200) is an exemplary implementation of the BS (120). In some examples, the BS (200) is an example of a node that can be configured to implement the various methods described herein. As shown in FIG. 2, the BS (200) includes a housing (240) including a processor (204), a memory (206), a transceiver (210) including a transmitter (212) and a receiver (214), a power module (208), a communication module (216) including a mapping module (218), etc.
[0024] The processor (204) controls the general operation of the BS (200) and may include one or more processing circuits or modules, such as, for example, a central processing unit (CPU) and / or a general-purpose microprocessor, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), a programmable logic device (PLD), a controller, a state machine, gate logic, discrete hardware components, a dedicated hardware finite state machine, or any other suitable combination of circuits, devices and / or structures capable of performing calculations or other operations on data.
[0025] Memory (206), which may include both read-only memory (ROM) and random access memory (RAM), can provide instructions and data to the processor (204). A portion of the memory (206) may also include non-volatile random access memory (NVRAM). The processor (204) generally performs logical and arithmetic operations based on program instructions stored in the memory (206). Instructions (e.g., software) stored in the memory (206) may be executed by the processor (204) to perform the method described herein. The processor (204) and the memory (206) together form a processing system that stores and executes software. As used herein, "software" means any type of instruction referred to as software, firmware, middleware, microcode, etc., which can configure a machine or device to perform one or more desired functions or processes. Instructions may include code (e.g., in source code format, binary code format, executable code format, or any other appropriate format). When executed by one or more processors, instructions enable the processing system to perform the various functions described herein.
[0026] A transceiver (210) comprising a transmitter (212) and a receiver (214) enables the BS (200) to transmit and receive data with a remote device (e.g., another BS or wireless communication device). An antenna (250) is typically attached to a housing (240) and electrically coupled to the transceiver (210). In various embodiments, the BS (200) includes a plurality of transmitters, a plurality of receivers, and a plurality of transceivers (not shown). In one embodiment, the antenna (250) is replaced by a multi-antenna array capable of forming a plurality of beams, each pointing in a distinct direction. The transmitter (212) may be configured to wirelessly transmit packets having different packet types or functions, such as packets generated by a processor (204). Similarly, the receiver (214) is configured to receive packets having different packet types or functions, and the processor (204) is configured to process packets of a plurality of different packet types. For example, the processor (204) may be configured to determine the type of packet and process the packet and / or the fields of the packet accordingly.
[0027] The communication module (216) may be implemented with a processor (204) and a memory (206) and is configured to perform communication between the BS (200) and a wireless communication device (e.g., the wireless communication device (110) of FIGS. 1a through 1c and the wireless communication device (300) of FIG. 3). For example, the communication module (216) is configured to perform BS-side operations in relation to at least a 4-step RACH procedure (100a), a 2-step RACH procedure (100b), and an uplink unacknowledged uplink data transmission procedure (100c) as described herein.
[0028] In a communication system comprising a BS (200) capable of servicing one or more wireless communication devices, the BS (200) may receive a random access request or message from a wireless communication device for access to the BS (200) (e.g., in process (100a or 100b)). The BS (200) may also receive an unacknowledged uplink data transmission from a wireless communication device (e.g., in process (100c)).
[0029] In one embodiment, the communication module (216) can generate a message in response to data transmission received from a wireless communication device and transmit this message to the wireless communication device through the transmitter (212).
[0030] In connection with the 2-stage RACH procedure (100b) and the uplink unauthorized uplink data transmission procedure (100c) in which a "preamble + payload" configuration is used, the communication module (216) can receive data transmission including a preamble and a payload from a wireless communication device via a receiver (214). The mapping module (218) is used to determine / identify the location of a PUSCH resource unit carrying a payload based on information in the preamble (e.g., mapping information).
[0031] The power module (208) may include, for example, one or more power sources such as batteries and a power regulator to provide regulated power to each of the aforementioned modules of the BS (200). In some embodiments, when the BS (200) is coupled to a dedicated external power source (e.g., a wall electrical outlet), the power module (208) may include a transformer and a power regulator.
[0032] The various modules discussed above are combined together by a bus system (230). The bus system (230) may include a data bus and, in addition to the data bus, a power bus, a control signal bus, and / or a status signal bus, for example. It is understood that the modules of the BS (200) can be operably combined with each other using any suitable technology and medium.
[0033] Although a number of individual modules or components are illustrated in FIG. 2, those skilled in the art will understand that one or more modules may be combined or implemented in common. Conversely, each module illustrated in FIG. 2 may be implemented using a plurality of individual components or elements.
[0034] FIG. 3 illustrates a block diagram of a wireless communication device (300) according to some embodiments of the present disclosure. Referring to FIGS. 1a through 3, the wireless communication device (300) is an exemplary implementation of the wireless communication device (110). The wireless communication device (300) is an example of a device that can be configured to implement the various methods described herein. As illustrated in FIG. 3, the wireless communication device (300) includes a housing (340) including a processor (304), a memory (306), a transceiver (310) including a transmitter (312) and a receiver (314), a power module (308), a communication module (316) including a mapping module (318), etc.
[0035] The processor (304) controls the general operation of the wireless communication device (300) and may include one or more processing circuits or modules, such as, for example, a CPU and / or general-purpose microprocessor, a microcontroller, a DSP, an FPGA, a PLD, a controller, a state machine, gate logic, discrete hardware components, a dedicated hardware finite state machine, or any other suitable combination of circuits, devices and / or structures capable of performing calculations or other operations on data.
[0036] Memory (306), which may include both ROM and RAM, can provide instructions and data to the processor (304). A portion of the memory (306) may also include NVRAM. The processor (304) generally performs logical and arithmetic operations based on program instructions stored in the memory (306). Instructions (e.g., software) stored in the memory (306) may be executed by the processor (304) to perform the method described herein. The processor (304) and the memory (306) together form a processing system that stores and executes software.
[0037] A transceiver (310) comprising a transmitter (312) and a receiver (314) enables a wireless communication device (300) to transmit and receive data with a remote device (e.g., BS). An antenna (350) or a multiple antenna array is attached to a housing (340) and electrically coupled to the transceiver (310). In various embodiments, the wireless communication device (300) includes a plurality of transmitters, a plurality of receivers, and a plurality of transceivers (not shown). In one embodiment, the antenna (350) is replaced by a multiple antenna array capable of forming a plurality of beams, each pointing in a distinct direction. The transmitter (312) may be configured to wirelessly transmit packets having different packet types or functions, such as packets generated by a processor (304), for example. Similarly, the receiver (314) is configured to receive packets having different packet types or functions, and the processor (304) is configured to process packets of a plurality of different packet types. For example, the processor (304) may be configured to determine the type of packet and process the packet and / or the fields of the packet accordingly.
[0038] The communication module (316) may be implemented with a processor (304) and a memory (306) and is configured to perform communication between a wireless communication device (300) and a BS (e.g., BSs (120 and 200)). For example, the communication module (316) is configured to perform UE-side operations in relation to at least a 4-stage RACH procedure (100a), a 2-stage RACH procedure (100b), and an uplink unacknowledged uplink data transmission procedure (100c) as described herein.
[0039] In a communication system, a wireless communication device (300) may attempt to access the BS for data transmission. In one embodiment, the communication module (316) may generate a message including a preamble and a payload (e.g., in a two-stage RACH procedure (100b) and an uplink unacknowledged uplink data transmission procedure (100c)).
[0040] The communication module (316) can transmit a message (e.g., a message of the 2-stage RACH procedure (100b) and the uplink unacknowledged uplink data transmission procedure (100c)) to the BS through the transmitter (312). The communication module (316) can receive a message from the BS through the receiver (314) in response to any message transmitted by the wireless communication device (300).
[0041] In connection with the 2-stage RACH procedure (100b) and the uplink unacknowledged uplink data transmission procedure (100c) in which a "preamble + payload" configuration is used, the communication module (316) can transmit a data transmission including a preamble and a payload to the BS via the transmitter (312). The mapping module (318) maps a PUSCH resource unit carrying the payload to the preamble in the manner described.
[0042] The power module (308) may include, for example, one or more power sources such as batteries and a power regulator to provide adjusted power to each of the aforementioned modules of the wireless communication device (300). In some embodiments, when the wireless communication device (300) is connected to a dedicated external power source (e.g., a wall electrical outlet), the power module (308) may include a transformer and a power regulator.
[0043] The various modules discussed above are combined together by a bus system (330). The bus system (330) may include a data bus and, in addition to the data bus, a power bus, a control signal bus, and / or a status signal bus, for example. It is understood that the modules of the wireless communication device (300) can be operably combined with each other using any suitable technology and medium.
[0044] Although a number of individual modules or components are illustrated in FIG. 3, those skilled in the art will understand that one or more modules may be combined or implemented in common. Conversely, each module illustrated in FIG. 3 may be implemented using a plurality of individual components or elements.
[0045] FIG. 4 illustrates a flowchart for a method (400) for managing data transmission (including preamble and payload) between a wireless communication device (300) and a BS (200) according to some embodiments of the present disclosure. Referring to FIG. 1b through 4, the method (400) is performed by the wireless communication device (300). The method (400) involves prioritizing a preamble associated with the same Synchronization Signal Block (SSB) or beam to be associated with DMRS from different CDM groups. The remaining preambles and remaining PUSCH resource units may be associated in increasing order of index, frequency, and time.
[0046] In 405, the wireless communication device (300) (e.g., mapping module (318)) determines a mapping that associates multiple preambles with multiple channel resource units used to carry multiple payloads associated with multiple preambles. Examples of channel resource units include, but are not limited to, PUSCH resource units.
[0047] In some examples, the mapping module (318) may determine information regarding channel resource units based on the configured values of system information block 2 (SIB2) or RRC messages. The SIB2 and RRC messages may be broadcast or otherwise transmitted by the BS (200). The wireless communication device (200) receives the SIB2 and RRC messages from the BS (200).
[0048] Examples of configured values include, but are not limited to, one or more of the following: the number of frequency domain multiplexed PUSCH opportunities (Nfdm), the number of time domain multiplexed PUSCH opportunities (Ntdm), the number of physical uplink shared channel (PUSCH) opportunities (PO) with given time and frequency resources (Ni), the number of n demodulation reference signal (nDMRS) resources, the preamble to PUSCH resource unit mapping ratio (X), the offset for the associated RO, the offset configured for the PO according to the New Radio (NR) configuration acceptance principle, the time and frequency resource size of the PO, or the synchronization signal block (SSB) associated with the PUSCH resource unit. As described, Ni represents the number of POs of a given resource size.
[0049] Information regarding a set of channel resource units includes at least one of the number of demodulation reference signal (DMRS) ports, the number of DMRS sequences, or the number of physical uplink shared channel (PUSCH) occasions (PO) within the set of channel resource units.
[0050] Block (405) includes at least blocks (408, 410, and 420). In 408, the mapping module (318) determines that a plurality of channel resource units carry a plurality of payloads. In 410, the mapping module (318) determines that a set of preambles (including one or more preambles) among a plurality of preambles are associated with the same beam. A beam is defined based on an SSB. Thus, determining that a set of preambles among a plurality of preambles is associated with the same beam includes determining that a set of preambles among a plurality of preambles is associated with the same SSB.
[0051] In 420, the mapping module (318) prioritizes mapping a set of preambles (associated with the same beam) to reference signals of multiple channel resource units corresponding to different CDM groups. Examples of reference signals include, but are not limited to, DMRS. In some examples, prioritizing mapping a set of preambles to reference signals of multiple channel resource units corresponding to different CDM groups includes determining reference signals corresponding to different CDM groups based on the number of beams. In some examples, prioritizing mapping a set of preambles to reference signals of multiple channel resource units corresponding to different CDM groups includes converting a first preamble index identifying multiple preambles into a second preamble index identifying multiple preambles based on the number of beams, determining a CDM group index, and mapping a set of preambles to reference signals of multiple channel resource units corresponding to different CDM groups based on the second preamble index and the CDM group index. Mapping is described in more detail in relation to FIGS. 5a through 5c.
[0052] In some examples, prioritizing the mapping of a preamble set to reference signals of multiple channel resource units corresponding to different CDM groups refers to performing mapping based on different CDM groups before performing mapping based on one or more additional criteria. In some examples, one or more additional criteria include, for example, index, frequency, and time. After priority mapping based on CDM groups, additional preambles and channel resource units may be mapped according to additional criteria. Accordingly, the method (400) further includes the step of mapping additional preambles to additional channel resource units based on one or more of index, frequency, and time in 430. 430 is performed after determining additional preambles among multiple preambles other than the mapped preamble set, and after determining additional channel resource units among multiple channel resource units other than the mapped channel resource units.
[0053] In 440, the communication module (318) configures the transmitter (312) to transmit data including one of a plurality of preambles, a payload among a plurality of payloads, and a mapping to the BS (200).
[0054] In some examples, the data corresponds to the msgA of the 2-stage RACH procedure (100b). The msgA is transmitted to the BS (200) by the wireless communication device (300). The preamble corresponds to the RACH preamble. The payload contains CP data. In some examples, the payload contains an acknowledgment, an identifier of the wireless communication device (300), and control information.
[0055] In some examples, the data corresponds to a message of the uplink unacknowledged uplink data transmission procedure (100c). The message is transmitted to the BS (200) by the wireless communication device (300). The payload contains UP data.
[0056] In 450, the communication module (318) configures the receiver (314) to receive a response from the BS (200).
[0057] Various exemplary mapping methods are presented as non-limiting approaches for performing mapping in, for example, block (405). Exemplary mapping methods are described in detail with reference to FIGS. 5a through 5f and Tables 1 and 2.
[0058] For example, the first exemplary mapping method is one in which the configuration mapping ratio is, for example, greater than 1 and related to general ordering. FIGS. 5a through 5c illustrate scenarios for the first exemplary mapping method (evenly divided and unevenly divided). "PUSCH resource unit" or "PUSCH unit" refers to a channel resource carrying a payload.
[0059] FIG. 5a illustrates an equal partitioning scenario (500a) of a first exemplary mapping scheme according to some embodiments of the present disclosure. Referring to FIG. 1b through 5a, in the equal partitioning scenario (500a), preambles (511a-514a) having order indices 0-3 are mapped to or otherwise associated with a PUSCH resource unit (531a) having order index 0. Preambles (515a-518a) having order indices 4-7 are mapped to or otherwise associated with a PUSCH resource unit (532a) having order index 1. Preambles (519a-522a) having order indices 8-11 are mapped to or otherwise associated with a PUSCH resource unit (533a) having order index 2. Preambles (523a-526a) with order indices 12-15 are mapped to or otherwise associated with a PUSCH resource unit (534a) with order index 3. Thus, each PUSCH resource unit (531a-534a) is mapped to four preambles. An exemplary mathematical formula describing the equal partitioning scenario (500a) is:
[0060] PUSCH_unit_ordering_index = floor(preamble_ordering_index / X);
[0061] Here, PUSCH_unit_ordering_index represents the order index of the PUSCH resource unit (531a-534a), preamble_ordering_index represents the order index of the preamble (511a-526a), and X corresponds to the mapping ratio (greater than 1). Here, X is 4.
[0062] FIG. 5b illustrates an equal partitioning scenario (500b) of a first exemplary mapping scheme according to some embodiments of the present disclosure. Referring to FIG. 1b through 5b, in the equal partitioning scenario (500b), a preamble (523b) having order index 0 (511b), order index 4 (515b), order index 8 (519b), and order index 12 is mapped to or otherwise associated with a PUSCH resource unit (531b) having order index 0. A preamble having order index 1 (512b), order index 5 (516b), order index 9 (520b), and order index 13 (524b) is mapped to or otherwise associated with a PUSCH resource unit (532b) having order index 1. Preambles having order index 2 (513b), order index 6 (517b), order index 10 (521b), and order index 14 (525b) are mapped to or otherwise associated with a PUSCH resource unit (533b) having order index 2. Preambles (526b) having order index 3 (514b), order index 7 (518b), order index 11 (522b), and order index 15 are mapped to or otherwise associated with a PUSCH resource unit (534b) having order index 3. Thus, each PUSCH resource unit (531b-534b) is mapped to four preambles. An exemplary mathematical formula describing the equal partitioning scenario (500b) is:
[0063] PUSCH_unit_ordering_index = mod(preamble_ordering_index, Q);
[0064] Here, PUSCH_unit_ordering_index represents the order index of the PUSCH resource unit (531b-534b), preamble_ordering_index represents the order index of the preamble (511b-526b), and Q corresponds to the total number of POs within the PO group (e.g., multiple POs) associated with the preamble. In the example, Q = 12.
[0065] FIG. 5c illustrates an unequal partitioning scenario of a first exemplary mapping scheme according to some embodiments of the present disclosure. Referring to FIG. 1b through 5c, in an unequal partitioning scenario (500c), preambles (511c-512c) having order indices 0-1 are mapped to or otherwise associated with a PUSCH resource unit (531c) having order index 0. Preambles (513c-514c) having order indices 2-3 are mapped to or otherwise associated with a PUSCH resource unit (532c) having order index 1. Preambles (513c-514c) having order indices 2-3 are mapped to or otherwise associated with a PUSCH resource unit (532c) having order index 1. Preambles (515c-516c) with order indices 4-5 are mapped to or otherwise associated with a PUSCH resource unit (533c) with order index 2. Preambles (517c-518c) with order indices 6-7 are mapped to or otherwise associated with a PUSCH resource unit (534c) with order index 3. Preambles (519c-520c) with order indices 8-9 are mapped to or otherwise associated with a PUSCH resource unit (535c) with order index 4. Preambles (521c-522c) with order indices 10-11 are mapped to or otherwise associated with a PUSCH resource unit (536c) with order index 5. Preambles (523c-524c) with order indices 12-13 are mapped to or otherwise associated with a PUSCH resource unit (537c) with order index 6. Preambles (524c-525c) with order indices 13-14 are mapped to or otherwise associated with a PUSCH resource unit (538c) with order index 7. None of the preambles (511c-526c) are mapped to a PUSCH resource unit (539c-542c) with order indices 8-11, resulting in an uneven mapping.These PUSCH resource units will not be used with the preamble for 2-stage RACH transmission. An exemplary mathematical formula describing the unequal partitioning scenario (500c) is:
[0066] PUSCH_unit_ordering_index = floor(preamble_ordering_index, X);
[0067] Here, PUSCH_unit_ordering_index represents the order index of the PUSCH resource unit (531c-542c), preamble_ordering_index represents the order index of the preamble (511c-526c), and X corresponds to the mapping ratio (greater than 1). In one example, X is 2.
[0068] FIG. 5cb illustrates an unequal partitioning scenario of a first exemplary mapping scheme according to some embodiment of the present disclosure. Referring to FIG. 1b through 5cb, in the unequal partitioning scenario (500cb), a preamble (511cb) having order index 0 and a preamble (523cb) having order index 12 are mapped to or otherwise associated with a PUSCH resource unit (531cb) having order index 0. A preamble (512cb) having order index 1 and a preamble (524cb) having order index 1 are mapped to or otherwise associated with a PUSCH resource unit (532cb) having order index 1. A preamble (513cb) having order index 2 and a preamble (525cb) having order index 14 are mapped to or otherwise associated with a PUSCH resource unit (533cb) having order index 2. The preamble (514cb) with order index 3 and the preamble (526cb) with order index 15 are mapped to or otherwise associated with the PUSCH resource unit (534cb) with order index 3. The preambles (515cb-522cb) with order indices 4-11 are mapped to or otherwise associated with the PUSCH resource unit (535cb-542cb) with order indices 4-11. An example of an exemplary mathematical formula describing an unequal partitioning scenario (500cb) is:
[0069] PUSCH_unit_ordering_index = mod(preamble_ordering_index, Q);
[0070] Here, PUSCH_unit_ordering_index represents the order index of the PUSCH resource unit (531cb-542cb), preamble_ordering_index represents the order index of the preamble (511cb-526cb), and X corresponds to the mapping ratio (greater than 1). In one example, Q is 12.
[0071] In the first exemplary mapping scheme, the preamble order index and the PUSCH resource unit order index can be obtained according to the following principles:
[0072] In some examples, the preamble_ordering_index is obtained by rearranging preambles from an RO group or an RO group (including multiple ROs) according to the following ordering principles:
[0073] (1) In ascending order of preamble index within a single RO;
[0074] (2) Next, in ascending order of frequency resource indices for frequency multiplexed ROs;
[0075] (3) Next, in ascending order of the time resource index for the time multiplexed RO.
[0076] In some examples, the PUSCH_unit_ordering_index is obtained by rearranging PUSCH resource units according to the following ordering principles:
[0077] (1) In ascending order of DMRS index within a single PO;
[0078] (2) Next, in ascending order of frequency resource indices for frequency multiplexed POs;
[0079] (3) Next, in ascending order of time resource indices for time multiplexed POs;
[0080] Here, the DMRS index is a linear transformation of the DMRS port / sequence index.
[0081] FIG. 5d illustrates a second exemplary mapping scheme according to some embodiments of the present disclosure. FIG. 5d is a diagram (500d) illustrating a correspondence between an RO and beams according to some embodiments of the present disclosure. Referring to FIG. 1b through FIG. 5d, each SSB (501d-504d) corresponds to each of the beams (511d-514d). The beams (511d-514d) may differ from each other in direction as illustrated (beams (511d-514d) represent shaded beams). For example, the direction of beam (511d) corresponds to SSB0 (501d). The direction of beam (512d) corresponds to SSB1 (502d). The direction of beam (513d) corresponds to SSB2 (503d). The direction of beam (514d) corresponds to SSB3 (504d). For RO (520d), a specific number (e.g., M) of preambles dedicated to the 2-step RACH procedure (100b) is specified. In diagram (500d), a specific number (e.g., 4) of SSBs (e.g., SSBs (501d-504d)) are assigned to RO (520d) (e.g., SSBperRO = 4). In this way, the M preambles can be divided into 4 sets, where each set of preambles has consecutive preamble indices. The indices between different sets of preambles may not be consecutive. In one example where M is 48, the preamble index number for the first preamble set may be 0 to 11, the preamble index number for the second preamble set may be 16 to 27, the preamble index number for the third preamble set may be 32 to 43, and the preamble index number for the fourth preamble set may be 48 to 59.
[0082] FIG. 5e illustrates a third exemplary mapping scheme. FIG. 5d is a diagram (500e) illustrating a correspondence between an RO group (including a plurality of ROs) and beams according to some embodiments of the present disclosure. Referring to FIG. 1b through FIG. 5e, each of the SSBs (501e-504e) corresponds to each of the beams (511e-514e). The beams (511e-514e) may differ from one another in direction as illustrated (beams (511e-514e) represent shaded beams). For example, the direction of beam (511e) corresponds to SSB0 (501e). The direction of beam (512e) corresponds to SSB1 (502e). The direction of beam (513e) corresponds to SSB2 (503e). The direction of beam (514e) corresponds to SSB3 (504e). For RO group (530e), a specific number (e.g., M) of preambles are designated for the 2-stage RACH procedure (100b), where the preambles come from multiple ROs (520e-521e) within RO group (530e). In drawing (500e), a specific number (e.g., 4) of SSBs (e.g., SSBs (501e-504e)) are assigned to RO group (530e) (e.g., SSBperRO = 4). Thus, the M preambles can be divided into 4 sets, where each set of preambles has a consecutive preamble index. The indices between different sets of preambles are not consecutive and may come from different ROs. Thus, the indices can be the same for the sets of preambles corresponding to different beams. In one example where Q is 48 and there are 2 associated ROs, the preamble index number for the first preamble set may be 0 to 5, the preamble index number for the second preamble set may be 16 to 21, the preamble index number for the third preamble set may be 32 to 37, and the preamble index number for the fourth preamble set may be 48 to 53.
[0083] A wireless communication device (300) can determine a corresponding PUSCH resource unit using a preamble index, which can be used by the BS (200) to determine a payload corresponding to the preamble. Each PUSCH resource unit can be determined based on time, frequency, and DMRS. DMRS can be determined based on DMRS sequence, OCC, and CDM group. PUSCH resource units can be arranged to prioritize CDM groups, so that DMRSs from different CDM groups are assigned to preambles assigned to the same beam or SSB. In an example where 16 preambles are assigned to a given beam and 18 CDM groups exist, DMRSs from the 18 CDMs are assigned to PUSCH resource units corresponding to the 16 preambles. In another example where 16 preambles are assigned to a given beam and there are 12 CDM groups, DMRS from the 12 CDMs are assigned to PUSCH resource units corresponding to 12 of the 16 preambles. The remaining 4 preambles may be associated with the remaining PUSCH resource units according to additional criteria, such as time or frequency, for example.
[0084] FIG. 5f is a figure (500f) illustrating the association between a PO (520f) and a preamble index based on a CDM group according to some embodiments of the present disclosure (in relation to second and third exemplary mapping schemes). Referring to FIGS. 1b through 5f, the PO (520f) as illustrated forms a PO group. As described, the PO (520f) may be defined or otherwise determined based on frequency, time, and DMRS, and the DMRS may be defined or otherwise determined based on OCC, CDM group, and DMRS sequence. For example, the PO (520f) as illustrated may be defined based on sub-block AD on the frequency axis, where the sub-block is defined for frequency granularity. The PO (520f) as illustrated is defined based on slots A and B on the time axis. Additionally, all shaded components of PO (520f) correspond to the DMRS of the first CDM group, and all empty components of PO (520f) correspond to the DMRS of the second CDM group. Thus, PO (520f) can be defined based on the DMRS of the two CDM groups.
[0085] The preamble set (510f) includes the preamble index number of the RO (520d) or RO group (530e). As illustrated in diagram (500f), the preamble set (510f) for each SSB (e.g., for each i) is mapped to a PO (520f) having different CDM groups. The mapping or association between the preamble set (510f) and the PO (520f) may be based on a configurable mapping ratio.
[0086] With respect to the second exemplary mapping scheme (Fig. 5d), the configuration mapping ratio may be 1 without a sequence having a re-shuffled DMRS index that prioritizes, for example, a CDM group followed only by an OCC pattern. This association is constructed beam-by-beam. The preamble order index can be obtained by rearranging the 2-stage RACH preamble corresponding to a given beam according to the following exemplary ordering principle:
[0087] (1) In ascending order of preamble index within a single RACH chance;
[0088] (2) Next, in ascending order of frequency resource indices for frequency multiplexed PUSCH opportunities; and
[0089] (3) Next, in ascending order of the time resource index for time multiplexed RACH opportunities;
[0090] Here, the DMRS index corresponds to a linear transformation of the DMRS port / sequence index.
[0091] In some examples, the PUSCH resource unit order index is obtained by rearranging the PUSCH resource units corresponding to a given beam according to exemplary order principles, such as, for example, the first exemplary order principle, the second exemplary order principle, and the third exemplary order principle.
[0092] In the first exemplary order principle:
[0093] (1) In ascending order of the CDM group index of the DMRS of the PO within the PO group; and
[0094] (2) Next, in ascending order of the OCC pattern and / or DMRS sequence-related index of the POs within the PO group. The POs are first arranged in ascending order of the frequency resource index for frequency-multiplexed POs. Next, the POs are arranged in ascending order of the time resource index for time-multiplexed POs.
[0095] In the second principle of exemplary order:
[0096] (1) In ascending order of the CDM group index of the DMRS of the PO within the PO group;
[0097] (2) Next, in ascending order of frequency resource indices for frequency multiplexed POs;
[0098] (3) Next, in ascending order of the time resource index for the time multiplexed RO; and
[0099] (4) Next, in ascending order of the OCC pattern and / or DMRS sequence-related index of the DMRS of the PO within the PO group.
[0100] The third exemplary sequence principle is used for OCC patterns and / or DMRS sequences available for 2-phase RACH msgA transmission. In the third exemplary sequence principle:
[0101] (1) In ascending order of the CDM group index of the DMRS of the PO within the PO group;
[0102] (2) Next, in ascending order of frequency resource indices for frequency multiplexed POs; and
[0103] (3) Next, in ascending order of the time resource index for the time multiplexed RO.
[0104] For the remaining preambles and DMRS (not associated according to the above principles), association can be performed according to the ordering principle of the first example mapping method.
[0105] DMRS indices from one or more POs may be reshuffled to prioritize OCC patterns and / or DMRS sequences from different POs following CDM groups from different POs. In relation to a third exemplary mapping scheme (Figs. 5e, 5f), PUSCH units may be associated with a preamble using a configured mapping ratio including, for example, {1, 2, 3}.
[0106] FIG. 5g is a drawing (500g) illustrating the association between a PO (520g) and an SSB set (510g) based on a CDM group according to some embodiments of the present disclosure (in relation to second and third exemplary mapping schemes). Referring to FIGS. 1b through 5g, these figures illustrate an embodiment in which PO (520g) is independently configured based on SSB so that SSB (e.g., SSB set (510g)) is directly mapped to PUSCH resource units (e.g., PO (520g)). The mapping of preamble to PUSCH resource units is based on the use of the same beam, for example, PUSCH resource units and preambles mapped to the same beam are mapped together. PO (520g) as illustrated forms a PO group. As described, PO (520g) can be defined or otherwise determined based on frequency, time, and DMRS, and DMRS can be defined or otherwise determined based on OCC, CDM group, and DMRS sequence. For example, PO (520g) as illustrated can be defined based on subblock AD on the frequency axis, where the subblock is defined for frequency grain size. PO (520g) as illustrated has slot A and on the time axis and It is defined based on B. Also, all shaded components of PO (520g) correspond to the DMRS of the first CDM group, and all empty components of PO (520g) correspond to the DMRS of the second CDM group. Therefore, PO (520g) can be defined based on the DMRS of two CDM groups.
[0107] The SSB set (510g) includes the SSB and can be mapped to the PO (520g) based on the beam index i. As illustrated in FIG. 500g, the SSB set (510g) is mapped to different CDM groups of the PO (520g) (e.g., for each beam i).
[0108] In the fourth exemplary mapping scheme, it is assumed that SSBperRO = 4 and R preambles (e.g., M / 4=R) are associated with each SSB (501a-504a or 501b-504b). The R preambles are first mapped to DMRS from different CMD groups as the preamble index increases. An exemplary formula for the mapping can be based on the following:
[0109] (SSB, Preamble) (PO, DMRS pattern, CDM group) (k, r) (n,l,g)
[0110] The preamble index (preambleIdx) can be converted to an order index r within a given group, for example, using the following expression:
[0111] r = mod(preambleIdx, totalNumerof2stepRA_Preambles / K);
[0112] r = 0, 1, 2, ... R-1 and;
[0113] Here, preambleIdx represents the original preamble index number associated with RO (520a) or group RO (530b). The formula totalNumerof2stepRA_Preambles / K corresponds to the starting point. totalNumerof2stepRA_Preambles is determined by BS (200) and corresponds to M. K represents SSBperRO.
[0114] The CDM group index g can be determined based on r using, for example, the following mathematical formula.
[0115] g = mod(r, G);
[0116] Here: r = n * G + g;
[0117] G is the total number of CDM groups, and n is the index number for PO. In one example, n can be determined using the following formula.
[0118] n = floor(r, G);
[0119] n = 0, 1, 2 ..., N-1;
[0120] g = 0, 1, 2, ..., G-1;
[0121] l = k;
[0122] k = 0, 1, 2, ..., K-1;
[0123] The determination of l, g, and n can be used to determine the PUSCH resource unit or its location corresponding to the preamble. Thus, preambles associated with the same SSB (beam) can be prioritized to be associated with DMRS from different CDM groups. For the remaining preambles and PUSCH resource units, ascending order of index / frequency / time can be sought.
[0124] In the fifth exemplary mapping scheme, the mapping formula is used for the mapping described herein, wherein the mapping formula has an upper limit on the number of SSBs associated with a PO group. In the exemplary example, assuming ssbperRO = 4, R preambles (e.g., M / 4=R) are associated with each SSB (501a-504a or 501b-504b). R preambles are first mapped to DMRSs from different CMD groups as the preamble index increases. In the second example, due to delay requirements, a maximum of W beams (W SSBs) are allowed within the PO. An exemplary formulation for the mapping may be based on the following:
[0125] (SSB, Preamble) (PO, DMRS pattern, CDM group) (k, r) (n,l,g)
[0126] The preamble index (preambleIdx) can be converted into an order index r within a given group using, for example, the following mathematical formula:
[0127] r = mod (preambleIdx, totalNumerof2stepRA_Preambles / K);
[0128] r = 0, 1, 2, ... R-1 and;
[0129] Here, preambleIdx represents the original preamble index number associated with RO (520a) or group RO (530b). The formula totalNumerof2stepRA_Preambles / K corresponds to the starting point. totalNumerof2stepRA_Preambles is determined by BS (200) and corresponds to M.
[0130] The CDM group index g can be determined based on r using, for example, the following mathematical formula:
[0131] g = mod(r, G) and;
[0132] Here, r = n * G + g and;
[0133] G is the total number of CDM groups, and n is the index number for PO. In one example, n can be determined using the following mathematical formula:
[0134] n = floor(r, G);
[0135] n = 0, 1, 2 ..., N-1;
[0136] g = 0, 1, 2, ..., G-1;
[0137] l = k;
[0138] l = 0, 1, 2, ..., W-1.
[0139] The determination of l, g, and n can be used to define the PUSCH resource unit or its location corresponding to the preamble. Thus, preambles associated with the same SSB (beam) can be prioritized to be associated with DMRS from different CDM groups. For the remaining preambles and PUSCH resource units, ascending order of index / frequency / time can be sought.
[0140] In the 6th exemplary manner, PUSCH resource units having different CDM groups are associated with a given beam in the following order:
[0141] (1) In ascending order of the CDM group index of the DMRS of the PO within the PO group;
[0142] (2) Next, in ascending order of frequency resource indices for frequency multiplexed POs; and
[0143] (3) Next, in ascending order of the time resource index for the time multiplexed RO.
[0144] In principle, POs may be configured in accordance with NR configuration approvals. The mapping between preambles and PUSCH resource units may be based on the criterion that the same beam is used. The mapping ratio may be configured as a value from {1, 2, 3}. In some examples, M preambles and N tot Some variables are required to associate PUSCH resource units. Regarding the relationships between such variables, M preambles mapped to a PO or a PO group (containing multiple POs) can correspond to one or multiple ROs. Multiple consecutive POs in the time domain and frequency domain belong to a PO group. Multiple consecutive ROs in the time domain and frequency domain belong to an RO group. In some examples, multiple ROs belong to the same PUSCH slot.
[0145] In some examples, the number of preambles M can be determined using the following mathematical formula:
[0146] And;
[0147] Here, R is the number of preambles used in the 2-step RACH procedure (100b) per RO, and and are the number of time-multiplexed ROs and the number of frequency-multiplexed ROs configured in each RO group (including the PRACH slot).
[0148] In some examples, the number of POs associated with M preambles is referred to as Ng and can be determined using the following expression:
[0149] And;
[0150] Here is the number of PUSCH resource units per PO, and and is the number of time-multiplexed POs and frequency-multiplexed POs configured in each PO group.
[0151] In some examples, the total number of PUSCH resource units N tot can be determined using the following mathematical formula:
[0152]
[0153] Here, Ng = 1 is included, and N dmsr (i) can be determined using the following mathematical formula:
[0154] N dmsr (i)= N dmrs_cdm (i) * N dmrs_occ (i) * N dmrs_seq (i) is.
[0155] In some examples, N dmsr (i) can be the same for all I, and signaling overhead reduction can be achieved. N dmsr (i) In the same example for all i, N dmsr (i) is N dmrs It can be expressed as. The minimum value of Ng can be obtained from the following mathematical formula, where M and the mapping ratio r can be explained:
[0156] Ng = ceil( M / (N dmsr * r )) and;
[0157] Here, r can be broadcast as an SI or RRC message, and the value of r can be defined as r = {1, 2, 3}.
[0158] In some examples, Ng can be further defined using the following mathematical formula:
[0159] And;
[0160] Here r = ceil( M / (Ng * N dmsr ))am.
[0161] In some examples, r can be derived from Ng. Ni represents the number of POs of a given time and frequency resource size index f(i) that can be fixed or broadcast via SI (e.g., SIB2) or RRC messages. The value of Ni may be the same or different depending on the changing i. Alternatively, N fdm or N tdm Only can be composed.
[0162] An offset cannot be relative only to the associated RO. For example, a timing offset may be configured separately from the RO.
[0163] In some examples, the number of POs may be determined from the number of POs of any given time and frequency resource size, as illustrated in FIGS. 6a and 6b. FIGS. 6a is a drawing illustrating an FDM PO (600a) occupying a continuous time resource and a frequency resource according to some embodiment of the present disclosure. Referring to FIGS. 1b through 6a, the PO (600a) belongs to a PO group, or the PO (600a) includes one or more POs associated with an RO or an RO group. N1 represents the number of POs (e.g., 2) of a given time and frequency resource size index f (1) and corresponds to DMRS (601a and 602a). N2 represents the number of POs (e.g., 2) of a given time and frequency resource size index f (2) and corresponds to DMRS (603a and 604a). N3 represents the number of POs (e.g., 2) of a given time and frequency resource size index f (3), corresponding to DMRS (605a and 606a). PO (600a) is defined by the corresponding Nfdm and Ntdm values as illustrated. Thus, the PO pattern and the number of POs can be determined from Nfdm and Ntdm.
[0164] FIG. 6b is a drawing illustrating TDM and FDM POs (600b) according to some embodiments of the present disclosure. Referring to FIGS. 1b through 6b, PO (600b) belongs to a PO group, or PO (600b) includes one or more POs associated with an RO or an RO group. N1 represents the number of POs (e.g., 2) for a given time and frequency resource size index f (1) and corresponds to DMRS (601b and 602b). N2 represents the number of POs (e.g., 2) for a given time and frequency resource size index f (2) and corresponds to DMRS (603b and 604b). N3 represents the number of POs (e.g., 2) for a given time and frequency resource size index f (3) and corresponds to DMRS (605b and 606b). PO(600b) is defined by the corresponding Nfdm and Ntdm values as illustrated.
[0165] In some examples, the PO pattern and the number of POs may be determined from the start / end timing frequency / offset for each PO. FIG. 6c is a diagram illustrating a PO (600c) occupying discontinuous time and frequency resources according to some embodiments of the present disclosure. Referring to FIGS. 1b through 6c, as illustrated, discontinuous time and frequency resources are indicated only by offsets. The offset may follow a configured acceptance principle or a relative position of an associated RO (610c). As illustrated, ΔT and ΔF may be configured according to a configured acceptance principle or for one or more ROs (610c) associated with the PO (600c).
[0166] In some examples, the OCC pattern may be determined from start time / frequency offsets for consecutive POs. FIG. 6d is a diagram illustrating a PO (600d) occupying a time / frequency resource indicated by a start offset and an end offset of the boundary of a discontinuous time / frequency resource according to some embodiment of the present disclosure. Referring to FIGS. 1b through 6d, as illustrated, the offset may include the end portion of some boundary between discontinuous POs. As illustrated, ΔT and ΔF may be configured according to a configured acceptance principle or for one or more ROs (610d) associated with the PO (600d).
[0167] In some examples, the PO pattern and the number of POs may be determined from the sum of the start timing / frequency offset and the assigned Ni. FIG. 6e is a diagram illustrating POs (600e) occupying time / frequency resources indicated by the start offset, along with the number of POs (600e), according to some embodiments of the present disclosure. Referring to FIGS. 1b through 6e, in one example, the Ni assignment may follow the SSB to RO association rule of TR 38.213.
[0168] In some examples, when PO time / frequency resources are broadcast or fixed in this specification, an offset for the end point of each PO may be stored. In the case of a scenario where the PO is configured separately from the RO opportunity, the offset may, in principle, be configured according to the NR configuration approval. To conserve signaling, the number of each PO for different time and frequency resources may be fixed to be the same in the specification.
[0169] FIG. 7 illustrates a flowchart for a method (700) for managing data transmission (including a preamble and a payload) between a wireless communication device (300) and a BS (200) according to some embodiments of the present disclosure. Referring to FIGS. 1b through 7, the method (700) is performed by the BS (200) and corresponds to the UE-side method (400). The method (700) involves identifying a channel resource unit using a mapping determined by the wireless communication device (300) (e.g., in the method (400)).
[0170] In 710, the communication module (216) of the BS (200) receives data from a wireless communication device comprising one of a plurality of preambles, one of a plurality of payloads, and a mapping that associates the plurality of preambles with a plurality of channel resource units used to carry the plurality of payloads associated with the plurality of preambles. A set of preambles among the plurality of preambles is associated with the same beam. A set of preambles is prioritized to be mapped to reference signals of a plurality of channel resource units corresponding to different CDM groups.
[0171] In 720, the mapping module (218) identifies a channel resource unit among a plurality of channel resource units based on the mapping. The channel resource unit is used to carry the payload.
[0172] Although various embodiments of the present solution have been described above, they are presented merely as examples and should be understood not as limitations. Likewise, various diagrams may depict exemplary architectures or configurations, provided to enable those skilled in the art to understand the exemplary features and functions of the present solution. However, such a person will understand that the solution is not limited to the illustrated exemplary architectures or configurations and may be implemented using various alternative architectures and configurations. Furthermore, as understood by those skilled in the art, one or more features of one embodiment may be combined with one or more features of another embodiment described herein. Accordingly, the breadth and scope of the present disclosure should not be limited by any of the exemplary embodiments described above.
[0173] It is also understood that any reference to elements in this specification using designations such as "first," "second," etc., generally does not limit the quantity or order of such elements. Rather, these designations may be used as a convenient means of distinguishing two or more elements or instances of elements in this specification. Accordingly, references to the first and second elements do not imply that only two elements may be used or that the first element must precede the second element in any way.
[0174] Additionally, those skilled in the art will understand that information and signals may be represented using any of various different technologies and techniques. For example, data, instructions, commands, information, signals, bits, and symbols that may be referenced in the above description may be represented as voltage, current, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
[0175] Those skilled in the art will also recognize that any of the various exemplary logic blocks, modules, processors, means, circuits, methods, and functions described in connection with the aspects disclosed herein may be implemented by electronic hardware (e.g., digital implementation, analog implementation, or a combination of both), firmware, various forms of programs or design code including instructions (which may be referred to herein for convenience as “software” or “software modules”), or any combination of such technologies. To clearly illustrate such compatibility of hardware, firmware, and software, various exemplary components, blocks, modules, circuits, and steps have been described above in general terms of function. Whether such functions are implemented as hardware, firmware, or software, or a combination of these technologies, depends on the design constraints imposed on the overall system and the specific application. A person skilled in the art may implement the functions described in various ways for each specific application, but such implementation decisions do not depart from the scope of this disclosure.
[0176] Furthermore, those skilled in the art will understand that the various exemplary logic blocks, modules, devices, components, and circuits described herein may be implemented or performed within an integrated circuit (IC) that may include a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic, or any combination thereof. The logic blocks, modules, and circuits may further include antennas and / or transceivers to communicate with various components within a network or device. The general-purpose processor may be a microprocessor, but alternatively, the processor may be any conventional processor, controller, or state machine. The processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors with a DSP core, or any other suitable configuration for performing the functions described herein.
[0177] When implemented in software, the function may be stored as one or more instructions or code on a computer-readable medium. Accordingly, the steps of the method or algorithm disclosed herein may be implemented as software stored on a computer-readable medium. A computer-readable medium includes both communication media and computer storage media, comprising any medium that can be enabled to transmit a computer program or code from one place to another. A storage medium may be any available medium that can be accessed by a computer. By example, not by limitation, such a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and can be accessed by a computer.
[0178] As used herein in this document, the term "module" refers to software, firmware, hardware, and any combination of these elements for performing the associated functions described herein. Additionally, for the sake of discussion, various modules are described as individual modules; however, as will be apparent to those skilled in the art, two or more modules may be combined to form a single module that performs the associated functions according to an embodiment of the present solution.
[0179] Additionally, communication components, as well as memory or other storage devices, may be used in embodiments of the present solution. For clarity, it will be understood that the above description refers to embodiments of the present solution with reference to different functional units and processors. However, it will be apparent that any appropriate distribution of functions between different functional units, processing logic elements, or domains may be used without compromising the present solution. For example, functions exemplified as being performed by separate processing logic elements or controllers may be performed by the same processing logic elements or controllers. Therefore, references to specific functional units are merely references to appropriate means for providing the described functions, rather than representing a strict logical or physical structure or organization.
[0180] Various modifications to the implementations described in this disclosure will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other implementations without departing from the scope of this disclosure. Accordingly, this disclosure is not intended to be limited to the implementations shown herein, but should be given the broadest scope consistent with the novel features and principles disclosed herein as described in the claims below.
Claims
Claim 1 A wireless communication method comprises the step of determining a mapping that associates a plurality of preambles with a plurality of channel resource units used to carry a plurality of payloads associated with a plurality of preambles, and the step of determining the mapping comprises: A step of determining that the plurality of channel resource units are carrying the plurality of payloads; A step of determining that a set of preambles among the plurality of preambles is associated with the same beam; and A wireless communication method comprising the step of prioritizing mapping the set of preambles to reference signals of the plurality of channel resource units corresponding to different code division multiplexing (CDM) groups. Claim 2 A wireless communication method according to claim 1, further comprising the step of determining information about a set of channel resource units based on a value configured in a system information block 2 (SIB2) or a radio resource control (RRC) message. Claim 3 A wireless communication method according to claim 2, wherein the configured value comprises one or more of the following: the number of frequency domain multiplexed physical uplink shared channel (PUSCH) opportunities (Nfdm), the number of time domain multiplexed POs (Ntdm), the number of POs having any given time and frequency resources (Ni), the number of n demodulation reference signal (nDMRS) resources, the preamble to PUSCH resource unit mapping ratio X, the offset for the associated random access channel occasion (RO), the offset configured for the PO according to the new network (NR) configuration approval principle, the time and frequency resource size of the PO, or the number of synchronization signal blocks (SSB) associated with the PO / RO. Claim 4 A wireless communication method according to claim 1, wherein information regarding a set of channel resource units comprises at least one of the number of demodulation reference signal (DMRS) ports, the number of DMRS sequences, or the number of physical uplink shared channel (PUSCH) occasions (PO) within the set of channel resource units. Claim 5 A wireless communication method according to claim 1, wherein each of the plurality of channel resource units is a physical uplink shared channel (PUSCH) resource unit, and each of the reference signals is a demodulation reference signal (DMRS). Claim 6 A wireless communication method according to claim 1, wherein the step of determining that a set of preambles among the plurality of preambles is associated with the same beam includes the step of determining that a set of preambles among the plurality of preambles is associated with the same synchronization signal block (SSB). Claim 7 A wireless communication method according to claim 1, wherein the step of prioritizing mapping the set of preambles to reference signals of the plurality of channel resource units corresponding to different CDM groups corresponds to the step of mapping based on the different CDM groups before mapping based on one or more additional criteria. Claim 8 A wireless communication method according to claim 7, wherein one or more of the above additional criteria include an index, frequency, and time. Claim 9 A wireless communication method according to claim 1, further comprising: a step of determining an additional preamble among a plurality of preambles other than the set of mapped preambles; a step of determining an additional channel resource unit among a plurality of channel resource units other than the mapped channel resource unit; and a step of mapping the additional preamble to the additional channel resource unit based on one or more of an index, frequency, and time. Claim 10 A wireless communication method according to claim 1, wherein the step of prioritizing mapping the set of preambles to reference signals of the plurality of channel resource units corresponding to different CDM groups includes the step of determining the reference signals corresponding to the different CDM groups based on the number of beams. Claim 11 A wireless communication method according to claim 1, wherein the step of prioritizing mapping the set of preambles to reference signals of the plurality of channel resource units corresponding to different CDM groups comprises: a step of converting a first preamble index identifying the plurality of preambles into a second preamble index identifying the plurality of preambles based on the number of beams; a step of determining a CDM group index; and a step of mapping the set of preambles to reference signals of the plurality of channel resource units corresponding to the different CDM groups based on the second preamble index and the CDM group index. Claim 12 A wireless communication method according to claim 1, further comprising the step of transmitting data including one of the plurality of preambles, one of the plurality of payloads, and the mapping to a base station by means of a wireless communication device; and the step of receiving a response from the base station by means of the wireless communication device. Claim 13 A wireless communication method according to claim 12, wherein the data corresponds to a msgA of a 2-stage random access channel (RACH) procedure, the msgA is transmitted to the base station by the wireless communication device, the preamble corresponds to a RACH preamble, and the payload includes control plane (CP) data. Claim 14 A wireless communication method according to claim 12, wherein the payload comprises an approval, an identifier of the wireless communication device, and control information. Claim 15 A wireless communication method according to claim 12, wherein the data corresponds to a message of grant-free uplink data transmission, the message is transmitted to the base station by the wireless communication device, and the payload includes user plane (UP) data. Claim 16 In claim 1, the step of determining a mapping that associates the plurality of preambles with the plurality of channel resource units is: mathematical formula: A wireless communication method further comprising the step of determining the mapping based on PUSCH_unit_ordering_index = floor(preamble_ordering_index / X), wherein PUSCH_unit_ordering_index corresponds to the order index of the plurality of PUSCH resource units, preamble_ordering_index corresponds to the order index of the plurality of preambles, and X corresponds to the mapping ratio. Claim 17 In claim 1, the step of determining a mapping that associates the plurality of preambles with the plurality of channel resource units is: mathematical formula: A wireless communication method further comprising the step of determining the mapping based on PUSCH_unit_ordering_index = mod(preamble_ordering_index, Q), wherein PUSCH_unit_ordering_index corresponds to the order index of the plurality of PUSCH resource units, preamble_ordering_index corresponds to the order index of the plurality of preambles, and Q corresponds to the total number of the plurality of PUSCH resource units associated with the preambles. Claim 18 In claim 1, the step of determining a mapping that associates the plurality of preambles with the plurality of channel resource units is: mathematical formula: A wireless communication method further comprising the step of determining the mapping based on PUSCH_unit_ordering_index = floor(preamble_ordering_index, X), wherein PUSCH_unit_ordering_index corresponds to the order index of the plurality of PUSCH resource units, preamble_ordering_index corresponds to the order index of the plurality of preambles, and X corresponds to the mapping ratio. Claim 19 A wireless communication method according to claim 1, wherein the step of determining that the plurality of channel resource units are carrying the plurality of payloads comprises: the step of determining a channel structure resource for the plurality of channel resource units—the channel structure resource includes a time resource and a frequency resource—; and the step of determining the plurality of channel resource units to carry the plurality of payloads based on the time resource and frequency resource of the plurality of channel resource units. Claim 20 A wireless communication method according to claim 1, wherein the step of prioritizing mapping the set of preambles to a reference signal of the plurality of channel resource units corresponding to different code division multiplexing (CDM) groups comprises: a step of directly mapping one or more of the plurality of channel resource units to one or more synchronization signal blocks (SSBs); and a step of mapping the set of preambles to the reference signal based on mapping one or more of the plurality of channel resource units to the one or more synchronization signal blocks (SSBs). Claim 21 A wireless communication device comprising at least one processor and a memory, wherein the at least one processor is configured to read a code from the memory and implement a method described in any one of claims 1 to 20. Claim 22 A computer program product comprising a computer-readable program medium storing code that enables the at least one processor to implement the method described in any one of claims 1 to 19 when executed by at least one processor. Claim 23 A wireless communication method comprising: receiving from a wireless communication device data including, by a base station, one of a plurality of preambles, one of a plurality of payloads, and a mapping that associates the plurality of preambles with a plurality of channel resource units used to carry the plurality of payloads associated with the plurality of preambles; and identifying one of the plurality of channel resource units based on the mapping, wherein the channel resource unit is used to carry the payload, the set of preambles among the plurality of preambles is associated with the same beam, and the set of preambles is prioritized to be mapped to a reference signal of the plurality of channel resource units corresponding to different code division multiplexing (CDM) groups. Claim 24 A wireless communication method according to claim 23, wherein each of the plurality of channel resource units is a physical uplink shared channel (PUSCH) unit, and each of the reference signals is a demodulation reference signal (DMRS). Claim 25 A wireless communication method according to claim 23, wherein a set of preambles among the plurality of preambles is associated with the same Synchronization Signal Block (SSB). Claim 26 A wireless communication method according to paragraph 23, wherein the mapping based on the different CDM groups is performed prior to the mapping based on one or more additional criteria. Claim 27 A wireless communication method according to claim 23, wherein the reference signal corresponding to the different CDM groups is determined based on the number of beams. Claim 28 A wireless communication device comprising at least one processor and a memory, wherein the at least one processor is configured to read a code from the memory and implement a method described in any one of claims 23 to 27. Claim 29 A computer program product comprising a computer-readable program medium storing code that enables the at least one processor to implement the method described in any one of claims 23 to 27 when executed by at least one processor.
