Random access response with orthogonal cover code

Abstract

Example embodiments of the present disclosure relate to random access response (RAR) with orthogonal cover code (OCC). A first apparatus transmits a first message of a random access (RA) procedure using a random access preamble and a first OCC. Based on the first OCC, the first apparatus determines at least one parameter related to reception of a second message of the RA procedure. The first apparatus receives the second message of the RA procedure using the at least one parameter. The second message includes a first RAR corresponding to the RA preamble and the first OCC.

Description

Technical Field

[0001] Various example embodiments of this disclosure generally relate to the telecommunications field, and more particularly to apparatus, methods, and computer-readable storage media for random access response (RAR) utilizing orthogonal cover codes (OCC). Background Technology

[0002] In Releases 17 and 18, the 3rd Generation Partnership Project (3GPP) introduced satellite access for New Radio (NR) users, as well as enhanced machine-type communications (eMTC) and narrowband IoT (NB-IoT) devices. The technical specifications in Releases 17 and 18 are functional and support the deployment of operational satellite networks for these types of devices. However, due to the limited spectrum available for deployment and large satellite coverage areas (e.g., large cells), the system may quickly reach its capacity limits. Therefore, it has been recognized that NTN systems require solutions that can scale up system capacity.

[0003] The need for uplink capacity enhancements has been recognized in 3GPP Release 19. Orthogonal Cover Codes (OCCs) can be used for this enhancement during the Random Access (RA) process. However, implementing OCC on the Narrowband Physical Random Access Channel (NPRACH) requires navigating several challenges. Summary of the Invention

[0004] In a first aspect of this disclosure, a first apparatus is provided. The first apparatus includes: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the first apparatus to at least: transmit a first message of a random access procedure using a random access preamble and a first orthogonal cover code; determine at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the reception of a second message of the random access procedure; and receive the second message of the random access procedure using the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0005] In a second aspect of this disclosure, a second apparatus is provided. The second apparatus includes: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the second apparatus to at least: receive a first message of a random access procedure from a first apparatus, the first message being transmitted by the first apparatus using a random access preamble and a first orthogonal cover code; determine at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the transmission of a second message of the random access procedure; and transmit the second message of the random access procedure to the first apparatus based on the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0006] In a third aspect of this disclosure, a method is provided. The method includes: transmitting a first message of a random access procedure using a random access preamble and a first orthogonal cover code; determining at least one parameter based on the first orthogonal cover code, the at least one parameter relating to the reception of a second message of the random access procedure; and receiving the second message of the random access procedure using the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0007] In a fourth aspect of this disclosure, a method is provided. The method includes: receiving from a first device a first message of a random access procedure, the first message being transmitted by the first device using a random access preamble and a first orthogonal cover code; determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the transmission of a second message of the random access procedure; and transmitting the second message of the random access procedure to the first device based on the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0008] In a fifth aspect of this disclosure, a first apparatus is provided. The first apparatus includes: components for transmitting a first message of a random access procedure using a random access preamble and a first orthogonal cover code; components for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the reception of a second message of the random access procedure; and components for receiving the second message of the random access procedure using the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0009] In a sixth aspect of this disclosure, a second apparatus is provided. The second apparatus includes: components for receiving a first message of a random access procedure from a first apparatus, the first message being transmitted by the first apparatus using a random access preamble and a first orthogonal cover code; components for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the transmission of a second message of the random access procedure; and components for transmitting the second message of the random access procedure to the first apparatus based on the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0010] In a seventh aspect of this disclosure, a computer-readable medium is provided. The computer-readable medium includes instructions stored thereon for causing a device to at least execute the method according to a third aspect.

[0011] In an eighth aspect of this disclosure, a computer-readable medium is provided. The computer-readable medium includes instructions stored thereon for causing a device to at least execute the method according to the fourth aspect.

[0012] It should be understood that the summary portion is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0013] Some exemplary embodiments can now be described with reference to the accompanying drawings, in which: Figure 1 An example communication environment in which example embodiments of this disclosure may be implemented is shown; Figure 2 An example structure of a MAC Protocol Data Unit (PDU) including a Media Access Control (MAC) header and a MAC Random Access Response (RAR) is shown. Figures 3A to 3D An example structure of MACRAR is shown; Figure 4 A signaling diagram illustrating an example communication process between a first device and a second device according to some example embodiments of the present disclosure is shown; Figure 5 Signaling diagrams of RARs separated by different Random Access Radio Network Temporary Identifiers (RA-RNTI) are shown according to some example embodiments of the present disclosure; Figure 6 A flowchart illustrating a process for interleaving the Physical Downlink Control Channel (PDCCH) according to some example embodiments of this disclosure is shown; Figure 7 A flowchart is shown illustrating a method implemented at a first device according to some exemplary embodiments of the present disclosure; Figure 8 A flowchart is shown illustrating a method implemented at a second device according to some example embodiments of the present disclosure; Figure 9 A simplified block diagram of a device suitable for implementing example embodiments of the present disclosure is shown; and Figure 10 A block diagram of an example computer-readable medium according to some example embodiments of the present disclosure is shown.

[0014] In all the accompanying drawings, the same or similar reference numerals denote the same or similar elements. Detailed Implementation

[0015] The principles of this disclosure can now be described with reference to some exemplary embodiments. It should be understood that these embodiments are described for illustrative purposes only and to assist those skilled in the art in understanding and implementing this disclosure, and do not imply any limitation on the scope of this disclosure. The embodiments described herein can be implemented in various ways other than those described below.

[0016] In the following description and claims, unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains.

[0017] References to "an embodiment," "an embodiment," "an example embodiment," etc., in this disclosure indicate that the described embodiment may include a particular feature, structure, or characteristic, but not every embodiment must include that particular feature, structure, or characteristic. Furthermore, such phrases do not necessarily refer to the same embodiment. Moreover, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is claimed that, whether explicitly described or not, it is within the knowledge of those skilled in the art that such feature, structure, or characteristic may be affected by other embodiments.

[0018] It should be understood that although terms such as "first," "second," etc., preceding nouns (or similar terms) may be used herein to describe various elements, these elements are not limited by these terms. These terms are only used to distinguish one element from another, and they do not restrict the order of the nouns (or similar terms). For example, without departing from the scope of the exemplary embodiments, a first element may be referred to as a second element, and similarly, a second element may be referred to as a first element. As used herein, the term "and / or" includes any and all combinations of one or more of the listed terms.

[0019] As used herein, “at least one of the following: ” and “at least one of ” and similar wording (where the list of two or more elements is connected by “and” or “or”) means at least any one of the elements, or at least any two or more of the elements, or at least all of the elements.

[0020] As used herein, unless explicitly stated otherwise, the execution step “in response to A” does not indicate that the step is performed immediately after “A” occurs, and may include one or more intermediate steps.

[0021] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the exemplary embodiments. As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that, when used herein, the terms “comprising,” “including,” “having,” “possessing,” “containing,” and / or “covering” specify the presence of the stated features, elements, and / or components, but do not exclude the presence or addition of one or more other features, elements, components, and / or combinations thereof.

[0022] As used in this application, the term "circuit" may refer to one or more of the following: (a) Hardware circuit implementation only (such as implementation in analog and / or digital circuits only) and (b) A combination of hardware circuitry and software, such as (if applicable): (i) A combination of analog and / or (multiple) digital hardware circuits with software / firmware, and (ii) Any part of (multiple) hardware processors, together with software (including (multiple) digital signal processors), software, and (multiple) memories, which work together to enable a device such as a mobile phone or server to perform various functions, and (c) (Multiple) hardware circuits and / or (multiple) processors, such as (multiple) microprocessors or a portion thereof, which require software (e.g., firmware) to operate, but may be absent when the software is not required to operate.

[0023] This definition of "circuit" applies to all uses of the term in this application (including in any claim). As another example, as used herein, the term "circuit" also covers implementations of hardware circuitry or processors (or processors in general) or a portion thereof and their accompanying software and / or firmware. The term "circuit" also covers, for example and if applicable to a particular claim element, baseband integrated circuits or processor integrated circuits for mobile devices, or similar integrated circuits in servers, cellular network devices, or other computing or networking devices.

[0024] As used herein, the term "communication network" refers to a network that conforms to any suitable communication standard, such as New Radio (NR), Long Term Evolution (LTE), LTE-A Advanced (LTE-A), Wideband Code Division Multiple Access (WCDMA), High-Speed ​​Packet Access (HSPA), Narrowband Internet of Things (NB-IoT), etc. Furthermore, communication between terminal devices and network devices in a communication network can be performed according to any suitable generation of communication protocol, including but not limited to first-generation (1G), second-generation (2G), 2.5G, 2.75G, third-generation (3G), fourth-generation (4G), 4.5G, fifth-generation (5G), sixth-generation (6G) communication protocols and / or any other currently known or future-developed protocols. Embodiments of this disclosure can be applied to various communication systems. Given the rapid development of communications, there may also be communication technologies and systems that embody future types of this disclosure. This should not be construed as limiting the scope of this disclosure to only the aforementioned systems.

[0025] As used herein, the term "network device" refers to a node in a communications network through which terminal devices access the network and receive services. Depending on the terminology and technologies employed, network devices may include base stations (BS) or access points (APs), such as xNodeBs (xNBs), such as NodeBs (NodeBs or NBs), evolved NodeBs (eNodeBs or eNBs) and NRNBs (also known as gNBs), remote radio units (RRUs), radio heads (RHs), remote radio heads (RRHs), relays, integrated access and backhaul (IAB) nodes, low-power nodes (such as femtonodes, piconodes), non-terrestrial network (NTN) or non-terrestrial network equipment (such as satellite network equipment, low Earth orbit (LEO) satellites, and geostationary Earth orbit (GEO) satellites), spacecraft network equipment, etc. In some example embodiments, the radio access network (RAN) split architecture includes a centralized unit (CU) and a distributed unit (DU) at the IAB host node. The IAB node includes a mobile terminal (IAB-MT) portion that behaves like a UE towards the parent node; the DU portion of the IAB node behaves like a base station towards the next-hop IAB node.

[0026] The term "terminal device" refers to any terminal device capable of wireless communication. By way of example and not limitation, a terminal device may also be referred to as a communication device, user equipment (UE), subscriber station (SS), portable subscriber station, mobile station (MS), or access terminal (AT). Terminal devices may include, but are not limited to, mobile phones, cellular phones, smartphones, Voice over IP (VoIP) phones, wireless local loop phones, tablet computers, wearable terminal devices, personal digital assistants (PDAs), portable computers, desktop computers, image capture terminal devices such as digital cameras, gaming terminal devices, music storage and return devices, in-vehicle wireless terminal devices, wireless endpoints, mobile stations, laptop embedded devices (LEEs), laptop mounted devices (LMEs), USB dongles, smart devices, wireless customer premises equipment (CPEs), Internet of Things (IoT) devices, watches or other wearable devices, head-mounted displays (HMDs), vehicles, drones, medical devices and applications (e.g., remote surgery), industrial devices and applications (e.g., robots and / or other wireless devices operating in the context of industrial and / or automated processing chains), consumer electronics devices, devices operating on commercial and / or industrial wireless networks, etc. The terminal device may also correspond to the mobile terminal (MT) portion of an IAB node (e.g., a relay node). In the following description, the terms "terminal device," "communication device," "terminal," "user equipment," and "UE" are used interchangeably.

[0027] As used herein, the terms “resource,” “transmission resource,” “resource block,” “physical resource block” (PRB), “uplink resource,” or “downlink resource” can refer to any resource used to perform communication, such as communication between a terminal device and a network device, including resources in the time domain, frequency domain, spatial domain, code domain, or any other combination of time, frequency, spatial, and / or code domain resources used to achieve communication. In the following, unless explicitly stated otherwise, resources in both the frequency and time domains may be used as examples of transmission resources used to describe some exemplary embodiments of this disclosure. Note that the exemplary embodiments of this disclosure are equally applicable to other resources in other domains.

[0028] As mentioned above, the need for enhanced uplink capacity in NB-IoT NTN has been recognized in 3GPP Release 19. For example, NB-IoT NTN has already been deployed in practice. In these early and upcoming deployments, it has become clear that IoT-NTN (especially NB-IoT) must support ultra-high capacity in terms of the number and type of UEs, some of which have inferior characteristics compared to other UEs (e.g., low-cost devices, wearables, etc.). Therefore, it is necessary to investigate UE multiplexing using orthogonal coverage codes (OCC) of Narrowband Physical Uplink Shared Channel (NPUSCH) format 1 and Narrowband Physical Random Access Channel (NPRACH). Therefore, to unlock additional UL capacity potential, it is necessary to identify as many methods as possible to decouple UL from DL.

[0029] Objectives for uplink capacity enhancement may include supporting uplink capacity enhancements. Where beneficial, this study could specify enhancements to support multiplexing of multiple UEs (e.g., up to 4, the smaller of the maximum allowed by existing UL and DL signaling) in a single 3.75kHz or 15kHz subcarrier via orthogonal coverage codes (OCC) for NPUSCH format 1 and NPRACH. Multi-tone support for 15kHz subcarrier spacing (SCS) is also considered. The impact of impairments needs to be taken into account.

[0030] There are several issues in the random access (RA) process that need to be circumvented to implement OCC on the NPRACH. Version 19 NRNTN also defines a study on the use of OCC. However, in NR, this study is currently limited to the PUSCH, but in future versions it may also include the Physical Random Access Channel (PRACH).

[0031] According to the random access procedure, as specified in 3GPP standards (such as 3GPP TS36.331 and TS36.321), the network can configure multiple random access opportunities and random access preambles in the system information. A UE attempting to access the system (or making a request) can begin the random access procedure as follows: Regarding Message 1 (MSG1) from the UE to the base station (BS), the UE randomly selects one of the subsets of available random access preambles (when using contention-based RA) and transmits the preamble in one of the UL resources reserved for the RA opportunity. The UE begins monitoring the Physical Downlink Control Channel (PDCCH) resource scrambled with a Random Access Radio Network Temporary Identifier (RA-RNTI), which allocates a Physical Downlink Shared Channel (PDSCH) with RAR. Since the RA-RNTI depends only on its corresponding RACH opportunity (e.g., the system frame number (SFN) of the opportunity to transmit the preamble), multiple UEs can monitor and decode the same RA-RNTI.

[0032] Regarding Message 2 (MSG2) from the base station to the UE, the network (NW) sends a Random Access Response (RAR) to the received random access attempt, which includes: power control information, timing advance command, uplink (UL) scheduling of MSG3, and a temporary cell radio network temporary identifier (C-RNTI) (e.g., temporary UE identifier (ID)). As mentioned above, multiple UEs can monitor the same RA-RNTI. Several UEs can attempt RA at the same RA timing and wait for RAR. To separate its RAR from the RARs sent to other UEs attempting different preambles at the same RA timing, the UE needs to identify in the Media Access Control (MAC) subheading carrying the RAR whether the Random Access Preamble ID (RAPID) is the same as the one selected by the UE when sending MSG1. When reading the MAC subheading with the corresponding RAPID, the UE locates the corresponding MAC payload (i.e., MACRAR) and reads the corresponding fields. If the UE is already in connected mode, for example, if the UE has already been assigned a C-RNTI, it ignores the temporary C-RNTI field and continues with the next steps (or continues the connection in the case of contention-free RA). RAR content can vary depending on the device type and PRACH format.

[0033] Regarding Message 3 (MSG3) from the UE to the base station, when MSG3 (contention-based RA) is needed, the UE uses the information contained in the scheduling provided in MSG2 to send Message 3. This message is scrambled by the UE's temporary C-RNTI (or T-CRNTI). Message 4 (MSG4) from the BS to the UE is used to resolve the contention-based procedure when needed. If the UE's contention is successfully resolved in MSG4, the UE uses the T-CRNTI as the C-RNTI to identify the UL / DL resource addressed / from the UE and scrambles the information.

[0034] Regarding the PDCCH search space used for scheduling RAR, for eMTCUE, 3GPP standards such as TS36.321 define a Type-2 common search space for the MPDCCH scrambled by RA-RNTI. During the RA process, the UE monitors the MPDCCH used for RAR at the timing defined for the Type-2 common search space, starting from subframe K.

[0035] If the UE is configured by a higher layer to decode a Machine Class Communication (MTC) PDCCH (MPDCCH) with a CRC scrambled by a Random Access Radio Network Temporary Identifier (RA-RNTI), the UE decodes the MPDCCH and the corresponding PDSCH according to any combination defined in Table 1 (as specified in Table 7.1-3A of TS36.321). The scrambling initialization of the PDSCH corresponding to these MPDCCHs uses RA-RNTI.

[0036] Table 1 MPDCCH and PDSCH configured by RA-RNTI

[0037] For the MPDCCHUE specific search space, type 0-MPDCCH common search space, type 1A-MPDCCH common search space, type 2-MPDCCH common search space, and type 2A-MPDCCH common search space, the starting subframe k The position is determined by k =k b Given, among which k b It comes from a subframe k0 The b Each continuous bandwidth reduces low complexity (BL) / coverage enhancement (CE) downlink (DL) subframes, and b=u·rj , ,and Subframe k0 It meets the conditions subframes, where .

[0038] For the MPDCCHUE-specific search space and the type 0-MPDCCH common search space, G is determined by high-level parameters. mPDCCH- startSF-UESS Given, in addition to the MPDCCH candidate associated with PUR-RNTI, in this case, it is... PUR-Config High-level parameters in mpdcch-startSF-UESS-r16 Given. For the common search space of type 1A-MPDCCH, G is determined by high-level parameters. mpdcch-startSF-SC-MCCH Given. For the common search space of type 2-MPDCCH, G is determined by high-level parameters. mPDCCH-startSF-CSS-RA-r13 Given. For the common search space of type 2A-MPDCCH, G is determined by high-level parameters. mpdcch-startSF-SC-MTCH Provided.

[0039] α offset High-level parameters for the common search space of type 2A-MPDCCH mpdcch-Offset-SC-MTCH Given, and for MPDCCH candidates associated with PUR-RNTI, by PUR-Config High-level parameters in mpdcch- Offset-PUR-SS-r16 Give it, otherwise . r max High-level parameters of the MPDCCHUE-specific search space and the type 0-MPDCCH common search space mPDCCH-NumRepetitionThe following are given, except for MPDCCH candidates associated with PUR-RNTI, in which case they are given by PUR-Config High-level parameters in mpdcch-NumRepetition-r16 Given; for the common search space of type 2-MPDCCH, by mPDCCH-NumRepetition-RA Given; for the common search space of type 1A-MPDCCH, by mpdcch-NumRepetitions-SC-MCCH Given; for the common search space of type 2A-MPDCCH, by mpdcch-NumRepetitions-SC-MTCH Give; and r 1, r 2, r 3, r 4 is given in Table 9.1.5-3 of TS36.321.

[0040] For NB-IoT UEs, similarly, a Type 2-NPDCCH common search space for RAR is defined in TS36.213. During the RA process, the UE monitors the NPDCCH for RAR at the timing defined for the Type-2 common search space, starting from subframe K.

[0041] If the UE is configured by a higher layer to decode an NPDCCH with a CRC scrambled by RA-RNTI, the UE decodes the NPDCCH and the corresponding NPDSCH according to any combination defined in Table 2, such as that specified in Table 16.4.1-3 of TS36.213. The scrambling initialization of the NPDSCH corresponding to these NPDCCHs uses RA-RNTI.

[0042] Table 2 NPDCCH and NPDSCH configured by RA-RNTI

[0043] For the common search spaces of Type 2-NPDCCH and Type 2A-NPDCCH, the search spaces and the corresponding aggregation and repetition levels of the monitored NPDCCH candidates are defined and listed in Table 16.6-3. R max The value is replaced with the high-level configuration parameter of the type 2-NPDCCH public search space. npdcch-NumRepetitions-RA Alternatively, replace it with the high-level configuration parameters of the Type 2A-NPDCCH public search space. npdcch-NumRepetitions-SC-MTCH .

[0044] Start subframe k The position is determined by k=k b Given, among which k b It comes from a subframe k0 The bA series of consecutive NB-IoTDL subframes, excluding subframes used for SI message transmission, and b=u·R and Subframe k0 It meets the conditions subframes, where , T≥4.

[0045] For the NPDCCHUE-specific search space, G is determined by high-level parameters. npdcch-StartSF-USS In addition to the NPDCCH candidates associated with PUR-RNTI, in this case, it is given by PUR-Config-NB High-level parameters in npdcch- StartSF-USS Provided. α offset From high-level parameters npdcch-Offset-USS Given, in addition to the candidate NPDCCH associated with PUR-RNTI, in this case, it is... PUR-Config-NB High-level parameters npdcch-Offset-USS Given. For the NPDCCH type 2-NPDCCH common search space, G is determined by high-level parameters. npdcch-StartSF-CSS-RA Give, and α offset From high-level parameters npdcch-Offset-RA Given. For the common search space of type 2A-NPDCCH, G is determined by high-level parameters. npdcch-startSF-SC-MTCH Give, and α offset From high-level parameters npdcch-Offset-SC-MTCH Provided.

[0046] Downlink Control Information (DCI) can be used to schedule RAR. For eMTC Coverage Enhancement (CE) Mode A and CE Mode B, DCI formats 6-1A and 6-1B can be used to schedule RAR. For NB-IoT, DCI format N1 can be used to schedule RAR. In DCI formats 6-1A / 1B and N1, some DCI fields are retained when using RA-RNTI scrambling. This means that fields can be redefined when OCC is supported in PRACH.

[0047] Regarding DCI format 6-1A, as specified in 3GPP standards (such as TS36.212), when format 6-1A Cyclic Redundancy Check (CRC) is scrambled with RA-RNTI, the following fields are retained: Hybrid Automatic Repeat Request (HARQ) procedure number, New Data Indicator, Downlink Allocation Index, and HARQ Acknowledgment (HARQ-ACK) resource offset. Regarding DCI format 6-1B, as specified in TS36.212, when format 6-1B CRC is scrambled with RA-RNTI, the following fields are retained: HARQ procedure number, New Data Indicator, and HARQ-ACK resource offset. Regarding DCI format N1, as specified in TS36.212, when format N1 CRC is scrambled with RA-RNTI or Group Radio Network Temporary Identifier (G-RNTI), the following fields are retained for RA-RNTI but not for G-RNTI: New Data Indicator and HARQ-ACK resource.

[0048] By applying OCC on NPRACH, multiple UEs can utilize the same RA resource (and the same RAPID) in parallel, allowing NW to distinguish between attempts made by different UEs by decoding the coverage code, thus reusing users using the same preamble. However, as mentioned above, in the current configuration of the 3GPP standard, it is not possible to distinguish RARs for UEs with the same RAPID but different coverage codes.

[0049] For example, the MAC header lacks spare bits to indicate which overlay code a particular RAR corresponds to. The 6 bits of RAPID are currently in use because 64 different preamble IDs are allowed in the 3GPP standard. Modifications to the RAR payload (e.g., MAC Protocol Data Units (PDUs)) may not be backward compatible. A legacy UE that does not use overlay codes may have already sent a RAR with the same preamble as other UEs using OCC. However, the legacy UE is unaware of the modifications in the RAR content. Therefore, these UEs may misunderstand attempts to differentiate responses via OCC in the payload.

[0050] One possible solution is to divide the allowed preambles (or RA timings) into resources where the UE is expected to use the coverage code (legacy UEs cannot access) and resources where a traditional RA is expected. However, this solution presents the problem of further segmenting preambles and resources that have already been divided into multiple subgroups for different purposes, such as contention-free random access (CFRA) preambles and contention-based random access (CBRA) preambles, as well as different coverage enhancements (e.g., CE level). A method is needed to transmit RAR to UEs attempting RA using the same preamble and OCC on the same RACH resource.

[0051] This disclosure presents an example embodiment of a solution for RAR utilizing OCC. In this solution, a first device (e.g., a terminal device or UE) uses a random access preamble and a first OCC to transmit a first message (e.g., MSG1) of the random access procedure. Based on the first OCC, the first device determines at least one parameter relating to the reception of a second message of the random access procedure. The first device receives the second message of the random access procedure based on this at least one parameter. The second message includes a first random access response corresponding to the random access preamble and a first orthogonal overlay code.

[0052] In this way, the second message carrying the RAR can be enhanced to help some UEs apply OCC when sending the same RACH preamble. This solution enables the coexistence of legacy UEs and UEs that apply OCC to the same RA preamble.

[0053] Figure 1 An example communication environment 100 in which example embodiments of the present disclosure may be implemented is shown.

[0054] The communication environment 100 includes a first device 110 and a second device 120 that can communicate with each other. In some example embodiments, the first device 110 may operate as a terminal device (such as a UE), and the second device 120 may operate as a network device (e.g., a gNB).

[0055] It should be understood that, for the purpose of explanation, Figure 1 The number and type of devices are shown without implying any limitations. For example, communication environment 100 may include any suitable number of first and second devices.

[0056] In some example embodiments, the link from the first device 110 to the second device 120 may be referred to as an uplink (UL), and the link from the second device 120 to the first device 110 may be referred to as a downlink (DL). In the UL, the second device 120 is an RX device (or receiver), and the first device 110 is a TX device (or transmitter). In the DL, the second device 120 is a transmit (TX) device (or transmitter), and the first device 110 is a receive (RX) device (or receiver).

[0057] In the following description, for illustrative purposes, some example embodiments are depicted in which the first device 110 operates as a terminal device and the second device 120 operates as a network device. However, in some example embodiments, the operations described with respect to the terminal device may be implemented at the network device or other devices, and the operations described with respect to the network device may be implemented at the terminal device or other devices.

[0058] Communication in communication environment 100 can be implemented according to any suitable communication protocol(s), including but not limited to cellular communication protocols such as first-generation (1G), second-generation (2G), third-generation (3G), fourth-generation (4G), fifth-generation (5G), and sixth-generation (6G), wireless local area network communication protocols such as IEEE 802.11, and / or any other currently known or future-developed protocols. Furthermore, communication can utilize any suitable wireless communication technology, including but not limited to: Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Frequency Division Duplex (FDD), Time Division Duplex (TDD), Multiple-Input Multiple-Output (MIMO), Orthogonal Frequency Division Multiplexing (OFDM), Discrete Fourier Transform Extended OFDM (DFT-s-OFDM), and / or any other currently known or future-developed technologies.

[0059] In the communication environment 100, the first device 110 can initiate a random access procedure to the second device 120. For example, the first device 110 can send MSG1 (or MsgA) and then receive MSG2 (or MsgB) from the second device 120. Via MSG2, the second device 120 can send a RAR that can be carried in a MAC message such as a MACPDU.

[0060] Figure 2 An example structure of MACPDU200, including the MAC header and MACRAR, is shown.

[0061] In this example, MACPDU200 includes a MAC header 205, which includes multiple MAC subheaders 210-1, 210-2, ..., 210-n, where n represents a positive integer. The information in the MAC subheaders consists of the following fields: The E field is an extension field, indicating whether there are additional fields in the MAC header. The E field is set to "1" to indicate that at least another set of E / T / RAPID fields follows. The E field is set to "0" to indicate that MACRAR or padding begins at the next byte. The T field is a type field, indicating whether the MAC subheader contains a random access ID or a backoff indicator. The T field is set to "0" to indicate the presence of a backoff indicator field in the subheader (BI). The T field is set to "1" to indicate the presence of a random access preamble ID field in the subheader (RAPID). The R field is a reserved bit, set to "0". The BI field is the backoff indicator field, which identifies the overload condition in the cell. The BI field is 4 bits in size. The RAPID field is the random access preamble identifier field that identifies the transmitted random access preamble (see Clause 5.1.3). The RAPID field is 6 bits in size.

[0062] MACPDU200 also includes a MAC payload 215 carrying multiple MACRARs 220-1, 220-2, ..., 220-n. Each MAC subheader 210-1, 210-2, ..., 210-n (individually or collectively referred to as (multiple) MAC subheaders 210) indicates MACRARs 220-1, 220-2, ..., 220-n (individually or collectively referred to as (multiple) MACRARs 220). A first device 110 can identify the RAPID in the MAC subheaders 210-1, 210-2, ..., 210-n to determine whether its RAR is included in the MACPDU200. Some example structures of MACRAR 220 are shown in... Figures 3A to 3D As shown in the figure, Figure 3A The example general architecture 300A of MACRAR220 is shown. Figure 3B An example architecture 300B for MACRAR220 is shown for PRACH enhanced coverage levels 2 or 3. Figure 3C An example structure 300C of MACRAR220 for NB-IoT UE is shown, and Figure 3D An example structure 300D of MACRAR220 for NB-IoT UE using PRACH preamble format 2 is shown.

[0063] During random access, the first device 110 sends a first message (e.g., MSG1 or MsgA) to the second device 120 using a random access preamble and an OCC (referred to as a first OCC). The first device 110 then receives a second message (e.g., MSG2 or MsgB) from the second device 120, the second message including a first random access response corresponding to the random access preamble and the first orthogonal overlay code. The first device 110 may randomly select (at least) an OCC from a configured code pool for a contention-based RA.

[0064] In various example embodiments, the first device 110 determines at least one parameter related to the reception of the second message based on a first OCC. The first device 110 uses this at least one parameter to receive the second message. See below for further details. Figures 4 to 6 Describe some example implementations.

[0065] Figure 4 This is a signaling diagram illustrating an example communication process 400 between a first device 110 and a second device 120 according to some example embodiments of the present disclosure.

[0066] like Figure 4As shown, in process 400, the first device 110 uses a random access preamble from one or more random access preambles and an orthogonal cover code from one or more orthogonal cover codes to send (405) a first message for the random access procedure. After the second device 120 receives (410) the first message, the second device 120 sends (425) a second message for the random access procedure. Accordingly, the first device 110 receives (430) the second message. The second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code used by the first device. For example, if the first message indicates a first OCC, the second message may only include a RAR for that specific OCC.

[0067] The first message and the second message can be any message that can be communicated between the first device 110 and the second device 120 during the RA process. In some example embodiments, the first message can be MSG1 to carry an RA preamble for initiating the RA process, and the second message can be MSG2 to carry the corresponding RAR.

[0068] According to embodiments of this disclosure, such as Figure 4 As shown, the second device 120 determines (415) at least one parameter related to receiving the second message. Then, the second device 120 sends (425) the second message based on the determined parameter. Accordingly, the first device 110 determines (420) the at least one parameter and then receives (430) the second message based on the determined parameter.

[0069] In this way, RARs dedicated to users with the same RAPID but different OCCs can be distinguished. Therefore, the second device 120 can respond unambiguously to both the first device 110, which applies the OCC to the RA preamble, and conventional devices using the same RA preamble, allowing these devices to coexist during the RA process. This improves RA efficiency and network capacity.

[0070] At least one parameter may include any parameter related to communication of the second message. In some example embodiments, at least one parameter may include a scrambling code associated with the second message. In some example embodiments, the scrambling code may include a scrambling code of a first scheduling message used to schedule the second message. Examples of the first scheduling message may include a downlink control information (DCI) message or a physical downlink control channel (PDCCH) message.

[0071] In some example embodiments, the scrambling code may include a Random Access Radio Network Temporary Identifier (RA-RNTI) modified based on a first OCC. For example, the OCC identifier (ID) can be used as a modifier to select the RA-RNTI sequence corresponding to the OCC-ID. This supports the transmission of RARs specific to transmissions based on a given combination of preamble and OCC. In this way, the OCCID can be used to modify the scrambling mode associated with the RAR, thereby modifying the readability of the RAR.

[0072] In an embodiment, the first device 110 (e.g., UE) and the second device 120 (e.g., network) may perform operations using a modified version of the RA-RNTI instead of the conventional RA-RNTI used for scrambling traditional PDCCH messages containing RARDCI. This new OCC-RA-RNTI (O-RA-RNTI) can be obtained based on the OCCID used by the UE, such that the OCCID maps to a different RA-RNTI (i.e., combined with the RACH timing).

[0073] For example, 3GPP standards (such as TS36.321) define (for NB-IoT): RA-RNTI=1+floor(SFN_id / 4)+256 carrier_id (1) Where SFN_id represents the identifier (ID) of the system frame number (SFN) used by the first device 110, and carrier_id represents the ID of the carrier used by the first device 110. Equation (1) can be updated to: OCC-RA-RNTI=1+floor(SFN_id / 4)+256 carrier_id+mapping(OCC index)(2) The mapping could be, for example, "offset + OCC index", where the offset is used to ensure that a 256 miss is avoided. The range of carrier_id and floor (SFN_id / 4); or alternatively, X. OCC index. X can be any positive integer. For example, if X=1, then the OCC index = 1, 2, 3, 4. If X=2, then the OCC index = 2, 4, 6, 8, and so on.

[0074] In some example implementations, a single distinct sequence (rather than multiple sequences) can be used to distinguish between a new RAR message (as an example of a second message) and a traditional RAR message. For instance, a UE using OCC in NPRACH can expect to read the new O-RA-RNTI, while a UE using traditional NPRACH will read the traditional RA-RNTI.

[0075] Figure 5 Signaling diagram 500 of RARs separated by different RA-RNTIs according to some example embodiments of the present disclosure is shown. UE1505 and UE2510 may serve as examples of the first device 110, and base station 515 may serve as an example of the second device 120.

[0076] like Figure 5 As shown, during the RA timing, UE1505 initiates (520) RA attempt using, for example, RAPID #7 and OCCID #0, and UE2510 initiates (522) RA attempt using, for example, RAPID #7 and OCCID #1. The random access preamble can be an example of the first message. Base station 515 decodes (524) the RA attempt. Base station 515 sends (526) the RAR scheduled by RA-RNTI to both UE1505 and UE2510. This RA-RNTI is a version of RA-RNTI modified based on OCCID #1.

[0077] UE1505 decodes (528) the RAR to look for RAPID #7 in the RAR. In this example, UE2510 is unable to decode the RAR scrambled with RA-RNTI and remains monitoring the RAR within the RAR window. Base station 515 sends (530) the RAR scheduled by RA-RNTIY to UE2510, where RA-RNTIY is a version of RA-RNTI modified by OCCID #1. UE2510 decodes (532) the RAR to look for RAPID #7 in the RAR.

[0078] In addition to the RA-RNTI, or as an alternative, in some example embodiments, the scrambling code based on the first OCC can be a group radio network temporary identifier (group RNTI or G-RNTI) determined based on a first message sent using the first OCC. In an example, the OCCID of the first OCC can be used to select the G-RNTI corresponding to the OCC-ID for the PDCCH message allocating the RAR (as an example of a first scheduling message). In this way, the G-RNTI (group RNTI) previously configured by the network in the system information can be reused to provide the RARPDCCH.

[0079] In some example embodiments, the scheduling availability of the RAR can be modified based on a first OCC used by the first device 110. For example, the OCCID can be used to modify scheduling availability / information.

[0080] In some example embodiments, at least one parameter determined based on the first OCC (415, 420) may include resources for sending / receiving the second message. For example, a RAR message for a given OCCID may be sent only in certain resources. In this way, the availability of resources for allocating RARs by the network can be modified.

[0081] The resources may include any resources associated with communication of the second message. In some example embodiments, the resources may include a first time window for sending / receiving the second message. In some example embodiments, the first time window may be different from a second time window for receiving another second message (e.g., a conventional RAR message) that includes a second random access response independent of the orthogonal overlay code. Typically, RARs can be scheduled anywhere within the entire duration of the RAR window. According to some example embodiments, some modifications may be applied to differentiate RARs addressed to UEs with different OCCs. In one embodiment, the network (NW) may indicate a dedicated RAR window for OCC UEs (as an example of the first device 110), where only UEs using the OCC will be scheduled.

[0082] In some example implementations, the start point of the first time window may be after the end point of the second time window. In one example, the NW can split the RAR window for legacy UEs and OCCUEs by indicating a dedicated RAR window for OCCUEs. The OCCUE's RAR is not scheduled within the legacy UE's RAR window, but rather within the OCCUE's dedicated RAR window (i.e., there is no time overlap). The legacy UE's RAR is only scheduled within the legacy RAR window, so there are no interoperability issues even if the OCCUE is scheduled in a dedicated RAR window using the new RAR format.

[0083] In some example embodiments, the first time window may be an extension of the second time window. In some example embodiments, the second device 120 may send a factor for extending the second time window to determine the first time window. Accordingly, the first device 110 may receive the factor and then use the factor to determine the first time window.

[0084] In one example, NW can broadcast a factor n to expand the RAR window for OCCUE. n represents any number. The traditional RAR window for legacy UEs can be defined using the legacy parameter ra-ResponseWindow. The dedicated RAR window for OCCUE can be defined as (n-1). ra-ResponseWindow, where a dedicated window can begin when a traditional RAR window expires. Alternatively, a dedicated RAR window can be defined as n `ra-ResponseWindow` can start like a traditional window (e.g., after a `PRACH` transfer + offset). However, OCCUE only expects it to start at the last (n-1)th position. RAR scheduling is performed during the duration of ra-ResponseWindow. Alternatively, the new RAR can be scheduled using the traditional parameter ra-ResponseWindow, but only for the new OCCRAR window information element read by the new UE.

[0085] In some example embodiments, resources may include time and / or frequency resources for sending / receiving a second message. In some example embodiments, time and / or frequency resources for receiving a second message may include at least one of a time slot, frame, superframe, or physical resource block. In one embodiment, RAR resources for OCCUE may be defined by an SFN (System Frame Number) and / or a time slot number.

[0086] In the example, consider four OCCIDs available for the UE to choose for NPRACH, with indices from 0 to 3. In this case, the NW (as an example of the second device 120) can apply modulo operations to the slot indices, so that the UE (as an example of the first device 110) can expect the RARPDCCH to arrive only at slot X (within the RAR window, possibly the dedicated window mentioned above), where X is given by X = mod_4 (slot index). In this example, other network parameters (such as SFN, HFN, PRB, etc.) can be used instead of slot indices to perform the operation. This also applies to modulo operations that can be replaced by different operations.

[0087] In some example embodiments, resources may include a first search space for receiving a first scheduling message for scheduling a second message. In one embodiment, the NW may indicate a dedicated PDCCH search space for OCC UEs, where only UEs using OCC will be scheduled.

[0088] In one example, NW can split the PDCCH search space for legacy UEs and OCCUEs by indicating a dedicated search space for OCCUEs. RARs for OCCUEs can be scheduled only when PDCCHs appear in the dedicated search space, and legacy UEs can be scheduled outside of that search space. Therefore, there are no interoperability issues even when scheduling OCCUEs using the new RAR format. In one example, the dedicated search space can be defined by a set of parameters such as pdcch-StartSF-CSS-RA, pdcch-Offset-RA, and pdcch-NumRepetitions-RA.

[0089] In some example embodiments, resources may be associated with a second orthogonal overlay code (e.g., DLOCC) associated with the first orthogonal overlay code and / or a set of orthogonal overlay codes associated with the first orthogonal overlay code. In some example embodiments, the second device 120 may send an indication of a resource to the first device 110. Accordingly, the first device 110 may receive the indication. In the example, the indication may be for each OCCID or for a set of OCCIDs.

[0090] In some example embodiments, the second message can be identified based on a first scheduling message for scheduling the second message, which includes an indication associated with a first orthogonal overlay code. In the example, the OCCID can be included in the DCI for scheduling the RAR. The RAR is then provided for each OCC. The scheduling DCI for the RAR has reserved bits as described above. Therefore, a field can be used to enhance the DCI, which explicitly defines which OCC the RAR is for. For example, if a new field in the DCI defines '3', then the RAR is used as a preamble sent using OCC code #3. Such an indication can be used with different RNTIs and / or search space / time domain scheduling to ensure that a legacy UE does not receive a RAR for a specific OCCID.

[0091] In some example embodiments, at least one parameter based on the first OCC may include the interleaving mode of the first scheduling message used to schedule the second message. For example, different interleaving modes may be applied to PDCCH messages that include RAR message scheduling in the DL. The PDCCH (e.g., the transport block (TB) or CRC of the PDCCH) may be interleaved according to a function based on the OCCID used by the first device 110 in the NPRACH transmission.

[0092] In the example, an interleaved sequence can be generated for the NW to use in sending the PDCCH for scheduling message 2. This sequence can be obtained from a function associated with the OCCID. On the UE side, the UE that initiated the RA attempt can then decode the PDCCH by deinterleaving the message using the appropriate sequence. This forces the UE not to decode RARs dedicated to other UEs (because they are interleaved with different sequences).

[0093] In some example embodiments, the corresponding interleaving mode for each of the one or more orthogonal coverage codes is predefined, or pre-configured or configured for the first device. For example, interleaving modes corresponding to different OCCs can be predefined (e.g., hard-coded in hardware as a standardization in the specification) or configured from the network to the UE.

[0094] In some example embodiments, the interleaving mode is used to interleave at least one of the following: the encoded bits of the first scheduling message or the cyclic redundancy check (CRC) code of the first scheduling message. For example, interleaving can be cyclic, such as a cyclic PDCCH bit. Alternatively or additionally, interleaving can be used for encoded bits or can be used for CRC.

[0095] In some example embodiments, the first scheduling message includes a physical downlink control channel (PDCCH) message for scheduling the second message, and an interleaving mode is applied to one of the following: the PDCCH message for scheduling the second message, and multiple PDCCH messages during the random access procedure, the multiple PDCCH messages corresponding to a second orthogonal covering code associated with a first orthogonal covering code. For example, interleaving can be used for the PDCCH during the random access procedure, such as the PDCCH for RAR, or all PDCCHs during the random access procedure.

[0096] Figure 6 A flowchart of a process 600 for interleaving PDCCH is shown according to some example embodiments of the present disclosure.

[0097] like Figure 6 As shown, in block 605, the interleaving mode for each OCC code is defined and configured for the UE (as an example of the first device 110). In block 610, the UE transmits a PRACH with the OCC and detects the PDCCH / RAR. In block 615, the UE performs CRC de-CRC on the PDCCH according to the interleaving (i.e., decoding using CRC as an example). In block 620, it is determined whether the CRC de-CRC result was successful. If yes, then in block 625, the UE performs the following random access procedure steps. If no, then in block 630, the UE receives other PDCCH / RARs corresponding to the other OCC codes.

[0098] Since an OCC code corresponds to a specific interleaving pattern, the original PDCCH bits can be generated and CRC processing can succeed using only the same interleaving pattern corresponding to the OCC. An example interleaving process will be described below.

[0099] The OCC code is represented as (1,1,1,1), (-1,-1,1,1), (-1,1,-1,1), (1,-1,1,-1). Then, the interleaving of OCC (1) can be: F(1): Divide the PDCCH into 4 parts, numbered 1, 2, 3, and 4, and collect bits as part 1, part 2, part 3, and part 4; F(2): Divide the PDCCH into 4 parts, numbered 1, 2, 3, and 4, and collect bits as part 3, part 4, part 1, and part 2; F(3): Divide the PDCCH into 4 parts, numbered 1, 2, 3, and 4, and collect bits as part 2, part 4, part 1, and part 3; and F(4): Divide the PDCCH into 4 parts, numbered 1, 2, 3, and 4, and collect bits as part 1, part 3, part 2, and part 4.

[0100] As an example, the PDCCH bit is 1111100000001000. Then, after interleaving F(1), it becomes 1111100000001000; after interleaving F(2), it becomes 0000100011111000; after interleaving F(3), it becomes 1000100011110000; after interleaving F(4), it becomes 1111000010001000.

[0101] Then, only by using the same interleaving mode to perform interleaving and deinterleaving can the PDCCH be recovered and a successful CRC be achieved; otherwise, the CRC will fail. This interleaving will not be understood by traditional UEs, and therefore this proposal may need to be combined with other means (e.g., different RNTIs known only to new UEs).

[0102] In some example embodiments, at least one parameter is associated with a second orthogonal covering code mapped from the first orthogonal covering code. In some example embodiments, the second orthogonal covering code may be the same as the first orthogonal covering code.

[0103] For example, OCCID can be used to modify DLOCC (as an example of a second OCC). In one example, different DLOCCIDs can be applied to different RAR messages, where the DLOCCID can be obtained based on the ULOCCID.

[0104] In one embodiment, the network is able to provide DLOCC. Since the UE attempting RACH may be from an idle / inactive mode, the network may not be able to indicate to these UEs which OCCID they will utilize in the RAR response. In this case, the network can pre-configure (in system information or hard-coded in the specification) the DLOCCID to be mapped from the ULOCCID used by the UE. In some example embodiments, the DLOCCID may be equal to the applied ULOCCID.

[0105] In some example embodiments, the second message may include a field indicating both the random access preamble and the second orthogonal overlay code. In some example embodiments, this field may be carried in the header of the second message.

[0106] For example, the RAPID field in the MAC sub-header can be extended to cover a combination of the preamble and OCCID. Currently, the RAPID field is 6 bits. If it were extended to 8 bits, for example, it could accommodate the 2 bits defining the OCCID applied by the UE. This would allow the UE to identify the corresponding MACRAR payload.

[0107] Combinations of the above solutions can provide additional options. For example, given that OCCID has 2 bits, one bit can be used to modify the RNTI, and the other bit can be used to modify the resource. As an alternative, some of the bits(s) of OCCID can be used to modify parameters related to the second message, while the other bits of OCCID can be used to modify another parameter related to the second message.

[0108] Figure 7 A flowchart of an example method 700 implemented at a first device according to some example embodiments of the present disclosure is shown. For the purposes of discussion, [the following will be discussed]. Figure 1 Method 700 is described by the angle of the first device 110 in the middle.

[0109] In frame 710, the first device 110 sends the first message of the random access procedure using a random access preamble and a first orthogonal overlay code.

[0110] In block 720, the first device 110 determines at least one parameter based on a first orthogonal overlay code, the at least one parameter being related to the reception of a second message in the random access procedure.

[0111] At block 730, the first device 110 uses at least one parameter to receive a second message of the random access procedure, wherein the second message includes a first random access response corresponding to a random access preamble and a first orthogonal cover code.

[0112] In some example embodiments, at least one parameter includes a scrambling code associated with the second message.

[0113] In some example embodiments, the scrambling code includes a scrambling code for a first scheduling message used to schedule a second message.

[0114] In some example embodiments, the scrambling code includes at least one of the following: a random access radio network temporary identifier modified based on a first orthogonal overlay code, or a group radio network temporary identifier determined based on a first message sent using the first orthogonal overlay code.

[0115] In some example embodiments, at least one parameter includes a resource for receiving the second message, which is associated with at least one of the following: a second orthogonal overlay code associated with the first orthogonal overlay code, or a set of orthogonal overlay codes associated with the first orthogonal overlay code.

[0116] In some example embodiments, at least one memory and at least one processor further enable the first means to receive instructions on resources.

[0117] In some example embodiments, the resources include at least one of the following: a first time window for receiving the second message, time and / or frequency resources for receiving the second message, or a first search space for receiving a first scheduling message used to schedule the second message.

[0118] In some example embodiments, the first time window is different from the second time window used to receive an additional second message, which includes a second random access response independent of the orthogonal overlay code.

[0119] In some example implementations, the start point of the first time window is after the end point of the second time window.

[0120] In some example implementations, the first time window is an extension of the second time window.

[0121] In some example embodiments, at least one memory and at least one processor further enable a first means: a receiving factor, which is used to extend a second time window to determine a first time window.

[0122] In some example embodiments, the first search space is different from the second search space used to receive the second scheduling message, which is used to schedule another second message, which includes a second random access response that is independent of the orthogonal cover code.

[0123] In some example embodiments, the second message is identified based on a first scheduling message used to schedule the second message, the first scheduling message including an indication associated with a first orthogonal overlay code.

[0124] In some example embodiments, at least one parameter includes the interleaving mode of the first scheduling message used to schedule the second message.

[0125] In some example embodiments, the corresponding interleaving mode of each of the one or more orthogonal overlay codes is predefined or pre-configured or configured for the first device.

[0126] In some example embodiments, the interleaving mode is used to interleave at least one of the following: the encoded bits of the first scheduling message or the cyclic redundancy check code of the first scheduling message.

[0127] In some example embodiments, the first scheduling message includes a physical downlink control channel message for scheduling the second message, and an interleaving mode is applied to one of the following: the physical downlink control channel message for scheduling the second message, and a plurality of physical downlink control channel messages during a random access procedure, the plurality of physical downlink control channel messages corresponding to a second orthogonal cover code associated with a first orthogonal cover code.

[0128] In some example embodiments, at least one parameter is associated with a second orthogonal cover code mapped from a first orthogonal cover code.

[0129] In some example embodiments, the second orthogonal overlay code is the same as the first orthogonal overlay code.

[0130] In some example embodiments, the second message includes a field indicating both the random access preamble and the second orthogonal overlay code.

[0131] In some example implementations, this field is carried in the header of the second message.

[0132] Figure 8 A flowchart of an example method 800 implemented at a second device according to some example embodiments of the present disclosure is shown. For the purposes of discussion, [the following will be discussed]. Figure 1 Method 800 is described by the angle of the second device 120 in the middle.

[0133] In box 810, the second device 120 receives a first message of the random access procedure from the first device, the first message being sent by the first device using a random access preamble and a first orthogonal overlay code.

[0134] In block 820, the second device 120 determines at least one parameter based on the first orthogonal overlay code, the at least one parameter being related to the transmission of the second message of the random access procedure.

[0135] At box 830, the second device 120 sends a second message of the random access procedure to the first device based on at least one parameter, wherein the second message includes a first random access response corresponding to a random access preamble and a first orthogonal cover code.

[0136] In some example embodiments, at least one parameter includes a scrambling code associated with the second message.

[0137] In some example embodiments, the scrambling code includes a scrambling code for a first scheduling message used to schedule a second message.

[0138] In some example embodiments, the scrambling code includes at least one of the following: a random access radio network temporary identifier modified based on a second orthogonal cover code associated with a first orthogonal cover code, or a group radio network temporary identifier determined based on a first message sent using the first orthogonal cover code.

[0139] In some example embodiments, at least one parameter includes a resource for sending a second message, which is associated with at least one of the following: a second orthogonal overlay code associated with a first orthogonal overlay code, or a set of orthogonal overlay codes associated with a first orthogonal overlay code.

[0140] In some example embodiments, at least one memory and at least one processor also enable a second device to send instructions on resources to the first device.

[0141] In some example embodiments, the resources include at least one of the following: a first time window for sending a second message, time and / or frequency resources for sending the second message, or a first search space for sending a first scheduling message for scheduling the second message.

[0142] In some example embodiments, the first time window is different from the second time window used to send an additional second message, which includes a second random access response independent of the orthogonal overlay code.

[0143] In some example implementations, the start point of the first time window is after the end point of the second time window.

[0144] In some example implementations, the first time window is an extension of the second time window.

[0145] In some example embodiments, at least one memory and at least one processor further enable a second means: a transmission factor, which is used to extend a second time window to determine a first time window.

[0146] In some example embodiments, the first search space is different from the second search space used to send a second scheduling message for scheduling another second message, which includes a second random access response independent of the orthogonal cover code.

[0147] In some example embodiments, at least one parameter is indicated in a first scheduling message for scheduling a second message, the first scheduling message including an indication of a second orthogonal overlay code associated with a first orthogonal overlay code.

[0148] In some example embodiments, at least one parameter includes the interleaving mode of the first scheduling message used to schedule the second message.

[0149] In some example embodiments, the corresponding interleaving mode of each of the one or more orthogonal overlay codes is predefined or pre-configured or configured by the second device for the first device.

[0150] In some example embodiments, the interleaving mode is used to interleave at least one of the following: the encoded bits of the first scheduling message or the cyclic redundancy check code of the first scheduling message.

[0151] In some example embodiments, the first scheduling message includes a physical downlink control channel message for scheduling the second message, and an interleaving mode is applied to one of the following: the physical downlink control channel message for scheduling the second message, and a plurality of physical downlink control channel messages during a random access procedure, the plurality of physical downlink control channel messages corresponding to a second orthogonal cover code associated with a first orthogonal cover code.

[0152] In some example embodiments, at least one parameter is associated with a second orthogonal cover code mapped from a first orthogonal cover code.

[0153] In some example embodiments, the second orthogonal overlay code is the same as the first orthogonal overlay code.

[0154] In some example embodiments, the second message includes a field indicating both the random access preamble and the second orthogonal overlay code.

[0155] In some example implementations, this field is carried in the header of the second message.

[0156] As referenced above Figures 1 to 6 All operations and features described in relation to the first device 110 and the second device 120 are equally applicable to methods 700 and 800 and have similar effects.

[0157] In some example embodiments, a first device capable of performing method 700 (e.g., Figure 1The first device 110 may include components for performing the corresponding operations of method 700. These components may be implemented in any suitable form. For example, these components may be implemented by circuitry or software modules. The first device may be implemented as... Figure 1 The first device 110 may be included in the first device 110.

[0158] In some example embodiments, the first apparatus includes: components for transmitting a first message of a random access procedure using a random access preamble and a first orthogonal cover code; components for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the reception of a second message of the random access procedure; and components for receiving a second message of the random access procedure using the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0159] In some example embodiments, a second means capable of performing method 800 (e.g., Figure 1 The second device 120 may include components for performing the corresponding operations of method 800. These components may be implemented in any suitable form. For example, these components may be implemented by circuitry or software modules. The second device may be implemented as... Figure 1 The second device 120 may be included in the second device 120.

[0160] In some example embodiments, the second apparatus includes: components for receiving a first message of a random access procedure from a first apparatus, the first message being sent by the first apparatus using a random access preamble and a first orthogonal cover code; components for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the transmission of a second message of the random access procedure; and components for sending the second message of the random access procedure to the first apparatus based on the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

[0161] Figure 9 This is a simplified block diagram of a device 900 suitable for implementing an example embodiment of the present disclosure. The device 900 can be provided to implement a communication device, for example, such as... Figure 1 The first device 110 or the second device 120 shown. As shown, the device 900 includes one or more processors 910, one or more memories 920 coupled to the processors 910, and one or more communication modules 940 coupled to the processors 910.

[0162] Communication module 940 is used for bidirectional communication. Communication module 940 has one or more communication interfaces to facilitate communication with one or more other modules or devices. The communication interface can represent any interface required for communication with other network elements. In some example embodiments, communication module 940 may include at least one antenna.

[0163] As a non-limiting example, processor 910 can be any type suitable for a local technology network and can include one or more of the following: general-purpose computer, special-purpose computer, microprocessor, digital signal processor (DSP), and processor based on a multi-core processor architecture. Device 900 can have multiple processors, such as application-specific integrated circuit chips that are time-dependent on a clock of a synchronous main processor.

[0164] Memory 920 may include one or more non-volatile memories and one or more volatile memories. Examples of non-volatile memories include, but are not limited to, read-only memory (ROM) 924, electrically programmable read-only memory (EPROM), flash memory, hard disk, optical disc (CD), digital video disc (DVD), optical disc, laser disc, and other magnetic and / or optical storage. Examples of volatile memories include, but are not limited to, random access memory (RAM) 922 and other volatile memories that cannot be retained during power outages.

[0165] Computer program 930 includes computer-executable instructions that are executed by an associated processor 910. The instructions of program 930 may include instructions for performing operations / actions of some example embodiments of this disclosure. Program 930 may be stored in memory (e.g., ROM 924). Processor 910 can perform any suitable actions and processes by loading program 930 into RAM 922.

[0166] The exemplary embodiments of this disclosure can be implemented by program 930, enabling device 900 to perform as described in the reference. Figures 1 to 6 Any process discussed in this disclosure. Exemplary embodiments of this disclosure may also be implemented by hardware or by a combination of software and hardware.

[0167] In some example embodiments, program 930 may be tangibly contained in a computer-readable medium, which may be included in device 900 (such as memory 920) or other storage devices accessible by device 900. Device 900 may load program 930 from the computer-readable medium into RAM 922 for execution. In some example embodiments, the computer-readable medium may include any type of non-transitory storage medium, such as ROM, EPROM, flash memory, hard disk, CD, DVD, etc. As used herein, the term "non-transitory" is a limitation on the medium itself (i.e., tangible, not tactile) rather than on the persistence of data storage (e.g., RAM and ROM).

[0168] Figure 10 An example of a computer-readable medium 1000 is shown, which may be in the form of a CD, DVD, or other optical storage disc. Program 930 is stored on the computer-readable medium 1000.

[0169] Generally, the various embodiments of this disclosure can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. Some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device. Although various aspects of the embodiments of this disclosure are illustrated and described as block diagrams, flowcharts, or using some other graphical representation, it should be understood that, as non-limiting examples, the blocks, apparatuses, systems, techniques, or methods described herein can be implemented in hardware, software, firmware, dedicated circuitry or logic, general-purpose hardware or controllers or other computing devices, or some combination thereof.

[0170] Some exemplary embodiments of this disclosure also provide at least one computer program product tangibly stored on a computer-readable medium, such as a non-transitory computer-readable medium. The computer program product includes computer-executable instructions that execute on a target physical or virtual processor in a device, such as those included in a program module, to perform any of the methods described above. Typically, a program module includes routines, programs, libraries, objects, classes, components, data structures, etc., that perform a particular task or implement a particular abstract data type. In various embodiments, the functionality of a program module can be combined or split among program modules as needed. The machine-executable instructions for a program module can execute within a local or distributed device. In a distributed device, the program module can reside on both local and remote storage media.

[0171] Program code used to perform the methods of this disclosure may be written in any combination of one or more programming languages. The program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a machine, partially on a machine, as a stand-alone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0172] In the context of this disclosure, computer program code or related data may be carried by any suitable carrier to enable a device, apparatus, or processor to perform the various processes and operations described above. Examples of carriers include signals, computer-readable media, etc.

[0173] Computer-readable media can be computer-readable signal media or computer-readable storage media. Computer-readable media can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatuses, or devices, or any suitable combination thereof. More specific examples of computer-readable storage media will include electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable optical disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0174] Furthermore, although operations are described in a specific order, this should not be construed as requiring that such operations be performed in the specific order shown or sequentially, or that all shown operations be performed to achieve the desired result. In some cases, multitasking and parallel processing may be advantageous. Similarly, although several specific implementation details are included in the discussion above, these details should not be construed as limiting the scope of this disclosure, but rather as descriptions of features that may be specific to particular embodiments. Unless explicitly stated otherwise, certain features described in the context of a single embodiment may also be implemented in combination in a single embodiment. Conversely, unless explicitly stated otherwise, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments.

[0175] Although this disclosure has been described in language specific to structural features and / or methodological actions, it should be understood that the disclosure as defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are disclosed as exemplary forms for implementing the claims.

Claims

1. A first device, comprising: At least one processor; as well as At least one memory, the at least one memory storing instructions, the instructions which, when executed by the at least one processor, cause the first device to at least: The first message of the random access procedure is sent using the random access preamble and the first orthogonal cover code. At least one parameter is determined based on the first orthogonal coverage code, and the at least one parameter is related to the reception of the second message of the random access procedure; as well as The second message of the random access procedure is received using the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

2. The first apparatus of claim 1, wherein the at least one parameter includes a scrambling code associated with the second message.

3. The first apparatus according to claim 2, wherein the scrambling code includes a scrambling code for a first scheduling message used to schedule the second message.

4. The first apparatus according to claim 2 or 3, wherein the scrambling code comprises at least one of the following: The temporary identifier of the random access radio network modified based on the first orthogonal overlay code, or A temporary identifier for the group radio network determined based on the first message sent using the first orthogonal overlay code.

5. The first apparatus according to any one of claims 1 to 4, wherein the at least one parameter includes a resource for receiving the second message, the resource being associated with at least one of the following: The second orthogonal covering code associated with the first orthogonal covering code, or A set of orthogonal cover codes associated with the first orthogonal cover code.

6. The first apparatus according to claim 5, wherein the at least one memory and the at least one processor further enable the first apparatus to: Receive instructions for the resource.

7. The first apparatus according to claim 5 or 6, wherein the resource comprises at least one of the following: The first time window used to receive the second message. Time and / or frequency resources used to receive the second message, or A first search space for receiving a first scheduling message, wherein the first scheduling message is used to schedule the second message.

8. The first apparatus of claim 7, wherein the first time window is different from the second time window for receiving a further second message, the further second message including a second random access response independent of the orthogonal overlay code.

9. The first apparatus according to claim 8, wherein the starting point of the first time window is after the ending point of the second time window.

10. The first apparatus according to any one of claims 8 to 9, wherein the first time window is an extension of the second time window.

11. The first apparatus of claim 10, wherein the at least one memory and the at least one processor further enable the first apparatus to: A receiving factor is used to expand the second time window to determine the first time window.

12. The first apparatus of claim 7, wherein the first search space is different from the second search space for receiving a second scheduling message, the second scheduling message being used to schedule another second message, the other second message including a second random access response independent of the orthogonal cover code.

13. The first apparatus according to any one of claims 1 to 12, wherein the second message is identified based on a first scheduling message for scheduling the second message, the first scheduling message including an indication associated with the first orthogonal overlay code.

14. The first apparatus according to any one of claims 1 to 13, wherein the at least one parameter includes an interleaving mode of a first scheduling message for scheduling the second message.

15. The first apparatus of claim 14, wherein the corresponding interleaving mode of each of the one or more orthogonal covering codes is predefined, or pre-configured or configured for the first apparatus.

16. The first apparatus according to claim 14 or 15, wherein the interlacing mode is used to interlace at least one of the following: The encoded bits of the first scheduling message, or The cyclic redundancy check code of the first scheduling message.

17. The first apparatus according to any one of claims 14 to 16, wherein the first scheduling message includes a physical downlink control channel message for scheduling the second message, and the interleaving mode is applied to one of the following: The physical downlink control channel message used for scheduling the second message, and Multiple physical downlink control channel messages during the random access procedure, the multiple physical downlink control channel messages corresponding to the second orthogonal coverage code associated with the first orthogonal coverage code.

18. The first apparatus according to any one of claims 1 to 17, wherein the at least one parameter is associated with a second orthogonal cover code mapped from the first orthogonal cover code.

19. The first apparatus of claim 18, wherein the second orthogonal overlay code is the same as the first orthogonal overlay code.

20. The first apparatus according to any one of claims 18 to 19, wherein the second message includes a field indicating both the random access preamble and the second orthogonal overlay code.

21. The first apparatus of claim 20, wherein the field is carried in the header of the second message.

22. A second device, comprising: At least one processor; as well as At least one memory, the at least one memory storing instructions, the instructions, when executed by the at least one processor, cause the second device to at least: The first device receives a first message for the random access procedure, the first message being sent by the first device using a random access preamble and a first orthogonal cover code; At least one parameter is determined based on the first orthogonal coverage code, and the at least one parameter is related to the transmission of the second message of the random access procedure; as well as The second message of the random access procedure is sent to the first device based on the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

23. The second apparatus of claim 22, wherein the at least one parameter includes a scrambling code associated with the second message.

24. The second apparatus of claim 23, wherein the scrambling code includes a scrambling code for a first scheduling message used to schedule the second message.

25. The second apparatus according to claim 23 or 24, wherein the scrambling code comprises at least one of the following: A temporary identifier for random access radio networks modified based on a second orthogonal cover code associated with the first orthogonal cover code, or A temporary identifier for the group radio network determined based on the first message sent using the first orthogonal overlay code.

26. The second apparatus according to any one of claims 22 to 25, wherein the at least one parameter includes resources for transmitting the second message, said resources being associated with at least one of the following: The second orthogonal covering code associated with the first orthogonal covering code, or A set of orthogonal cover codes associated with the first orthogonal cover code.

27. The second apparatus of claim 26, wherein the at least one memory and the at least one processor further enable the second apparatus to: Send an instruction for the resource to the first device.

28. The second apparatus according to claim 26 or 27, wherein the resource comprises at least one of the following: The first time window used to send the second message. Time and / or frequency resources used to send the second message, or A first search space for sending a first scheduling message, the first scheduling message being used to schedule the second message.

29. The second apparatus of claim 28, wherein the first time window is different from the second time window for sending a further second message, the further second message including a second random access response independent of the orthogonal overlay code.

30. The second apparatus of claim 29, wherein the starting point of the first time window is after the ending point of the second time window.

31. The second apparatus according to any one of claims 29 to 30, wherein the first time window is an extension of the second time window.

32. The second apparatus of claim 31, wherein the at least one memory and the at least one processor further enable the second apparatus to: A sending factor is used to expand the second time window to determine the first time window.

33. The second apparatus of claim 29, wherein the first search space is different from the second search space used to send a second scheduling message, the second scheduling message being used to schedule another second message, the other second message including a second random access response independent of the orthogonal cover code.

34. The second apparatus according to any one of claims 22 to 33, wherein the at least one parameter is indicated in a first scheduling message for scheduling the second message, the first scheduling message including an indication of a second orthogonal cover code associated with the first orthogonal cover code.

35. The second apparatus according to any one of claims 22 to 34, wherein the at least one parameter includes an interleaving mode of a first scheduling message for scheduling the second message.

36. The second apparatus of claim 35, wherein the corresponding interleaving mode of each of the one or more orthogonal covering codes is predefined, or pre-configured or configured by the second apparatus for the first apparatus.

37. The second apparatus according to claim 35 or 36, wherein the interlacing mode is used to interlace at least one of the following: The encoded bits of the first scheduling message, or The cyclic redundancy check code of the first scheduling message.

38. The second apparatus according to any one of claims 35 to 37, wherein the first scheduling message includes a physical downlink control channel message for scheduling the second message, and the interleaving mode is applied to one of the following: The physical downlink control channel message used for scheduling the second message, and Multiple physical downlink control channel messages during the random access procedure, the multiple physical downlink control channel messages corresponding to the second orthogonal coverage code associated with the first orthogonal coverage code.

39. The second apparatus according to any one of claims 22 to 38, wherein the at least one parameter is associated with a second orthogonal cover code mapped from the first orthogonal cover code.

40. The second apparatus of claim 39, wherein the second orthogonal overlay code is the same as the first orthogonal overlay code.

41. The second apparatus according to any one of claims 39 to 40, wherein the second message includes a field indicating both the random access preamble and the second orthogonal overlay code.

42. The second apparatus of claim 41, wherein the field is carried in the header of the second message.

43. A method comprising: The first message of the random access procedure is sent using a random access preamble and a first orthogonal overlay code. At least one parameter is determined based on the first orthogonal cover code, and the at least one parameter is related to the reception of the second message of the random access procedure. The second message of the random access procedure is received using the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

44. A method comprising: The first device receives a first message for the random access procedure, the first message being sent by the first device using a random access preamble and a first orthogonal cover code. At least one parameter is determined based on the first orthogonal cover code, and the at least one parameter is related to the transmission of the second message of the random access procedure. The second message of the random access procedure is sent to the first device based on the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

45. A first device, comprising: A component for sending the first message of the random access procedure using a random access preamble and a first orthogonal cover code; A component for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the reception of a second message of the random access procedure; as well as A component for receiving a second message of the random access procedure using the at least one parameter, wherein the second message includes a first random access response corresponding to the random access preamble and the first orthogonal cover code.

46. ​​A second device, comprising: A component for receiving a first message of a random access procedure from a first device, the first message being sent by the first device using a random access preamble and a first orthogonal overlay code; A component for determining at least one parameter based on the first orthogonal cover code, the at least one parameter being related to the transmission of a second message in the random access procedure; as well as A component for sending a second message of the random access procedure to the first device based on the at least one parameter, wherein the second message includes a first random access response, the first random access response corresponding to the random access preamble and the first orthogonal cover code.

47. A computer-readable medium comprising instructions stored thereon for causing a device to perform at least the method of claim 43 or the method of claim 44.

Images