Wireless communication method and apparatus, and non-transitory computer-readable medium

Abstract

Wireless communication methods and apparatus, and non-transitory computer-readable media are described. An exemplary method for wireless communication includes: transmitting, by a terminal, to a network node a first message, the first message including a first preamble sequence associated with a first index from a first half of a set of indices; and transmitting a second message including a second preamble sequence associated with a second index from a second half of the set of indices, wherein the first index and the second index satisfy a constraint relationship.

Description

[0001] This application is a divisional application of the application with application number 201880099547.8, application date November 14, 2018, and invention name “Wireless communication method and device and non-transitory computer-readable medium”. Technical Field

[0002] This document relates generally to wireless communications. Background Art

[0003] Wireless communication technologies are driving the world toward an increasingly interconnected and networked society. The rapid development of wireless communications and technological advancements are driving greater demands for capacity and connectivity. Other factors, such as energy consumption, device cost, spectrum efficiency, and latency, are also crucial for meeting the demands of various communication scenarios. Compared to existing wireless networks, next-generation systems and wireless communication technologies need to support more users and devices, as well as higher data rates, necessitating more efficient messaging and signaling mechanisms. Summary of the Invention

[0004] This document relates to methods, systems, and devices for generating random access signals with bearer information in mobile communication systems, such as fifth generation (5G) and new radio (NR) systems.

[0005] In one exemplary aspect, a wireless communication method is disclosed. The method includes: transmitting, by a terminal, to a network node a first message including a first preamble sequence associated with a first index from a first half of a set of indices; and transmitting a second message including a second preamble sequence associated with a second index from a second half of the set of indices, wherein the first index and the second index satisfy a constraint relationship.

[0006] In another exemplary aspect, a wireless communication method is disclosed. The method includes: receiving, via a network node, a first message from a terminal, the first message including a first preamble sequence associated with a first index from a first half of a set of indices; and receiving a second message including a second preamble sequence associated with a second index from a second half of the set of indices, wherein the first index and the second index satisfy a constraint relationship.

[0007] In yet another exemplary aspect, the above method is embodied in the form of processor-executable code and stored in a computer-readable program medium.

[0008] In yet another exemplary embodiment, an apparatus configured or operable to perform the above method is disclosed.

[0009] These and other aspects and embodiments thereof are described in more detail in the drawings, the description, and the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 Examples of a base station (BS) and a user equipment (UE) in wireless communications according to some embodiments of the disclosed technology are shown.

[0011] Figure 2 An example of a random access procedure between a UE and a BS is shown.

[0012] Figure 3 An example of implicit grouping using multiple Msg1 transmissions according to some embodiments of the disclosed technology is shown.

[0013] Figure 4 Another example of implicit grouping using multiple Msg1 transmissions according to some embodiments of the disclosed technology is shown.

[0014] Figure 5 A flow chart of an exemplary method of wireless communication is shown.

[0015] Figure 6 A flow chart of another exemplary method of wireless communication is shown.

[0016] Figure 7 is a block diagram representation of a portion of an apparatus according to some embodiments of the disclosed technology. DETAILED DESCRIPTION

[0017] Emerging mobile communication systems, such as fifth generation (5G) and new radio (NR), use constant amplitude zero autocorrelation (CAZAC) sequences (e.g., Zadoff-Chu (ZC) sequences) to generate random access signals (referred to as Msg1 in this document). These random access signals, along with the random access preamble index, can be detected by a base station (gNB, or network node). The base station can then send a random access response to the UE (or terminal, or mobile device) to continue the random access protocol.

[0018] Figure 1 An example of a wireless communication system (e.g., an LTE, 5G, or New Radio (NR) cellular network) is shown, including a base station (BS) 120 and one or more user equipment (UE) 111, 112, and 113. In some embodiments, and as described above, the UE may transmit a random access signal including a CAZAC sequence (131, 132, 133) and subsequently receive a random access response (141, 142, 143) transmitted by the BS. The UE may be, for example, a smartphone, a tablet, a mobile computer, a machine-to-machine (M2M) device, a terminal, a mobile device, an Internet of Things (IoT) device, or the like.

[0019] In some embodiments, and as Figure 2As shown, the UE (or terminal, or mobile device) selects a preamble sequence from group A or group B to carry 1 bit of additional information, which is used to inform the base station of the size of the subsequent Msg3 sent by the UE. Figure 2 As shown, after the random access signal Msg1, there is an uplink Msg3 to carry more data information to the base station to complete the entire random access process.

[0020] In these systems, it would be beneficial if the random access signal could carry more information, if the random access delay could be shortened, and if the random access procedure could be accelerated. Figure 2 As shown, contention-based random access is completed in four steps. The embodiments of the disclosed technology construct a two-step random access by merging the first and third steps into one step, and the second and fourth steps into one step, which can carry more additional information in the first step, thereby speeding up the random access process. Since the amount of data uploaded by IoT terminals is usually small, carrying additional information in the first step is also beneficial to Internet of Things (IoT) applications. If this small amount of data can be transmitted through the additional information carried by the random access signal in the first step of random access, the IoT terminal can reduce power consumption, extend battery life, and reduce network load. In addition, the embodiments described in this document maintain backward compatibility; for example, the sequence of the random access signal is not modified, only the number of Msg1 transmissions is increased, and more random access sequence index groups are introduced to increase the information that can be carried.

[0021] This document uses section headings and subheadings to facilitate understanding, rather than to limit the scope of the disclosed techniques and embodiments to certain sections. Therefore, embodiments disclosed in different sections can be used interchangeably. In addition, this document uses examples from the 3GPP New Radio (NR) network architecture and 5G protocols only to facilitate understanding, and the disclosed techniques and embodiments can be implemented in other wireless systems that use communication protocols other than the 3GPP protocols.

[0022] An embodiment with increased number of Msg1 transmissions

[0023] To maintain backward compatibility with the NR system, a single UE can transmit multiple Msg1s within the framework allowed by the NR system. There are two ways to increase the number of times a single UE sends Msg1.

[0024] Method 1:By setting the ssb-perRACH-OccasionAndCB-PreamblesPerSSB parameter in ssb-perRACH-Occasion to less than 1 {e.g., 1 / 2, 1 / 4, 1 / 8}, it ensures that an SSB can be mapped to random access resources multiple times (e.g., multiple RACH occasions (ROs)). Normally, the UE randomly selects one of the multiple ROs or selects the RO based on the PRACH mask index parameter. However, in cases where more information needs to be conveyed, the UE can select all or part of the ROs associated with the SSB to transmit a Msg1, thereby increasing the number of Msg1 transmissions. This can be determined by the UE, for example, whether to transmit a single Msg1 as usual, or to transmit multiple Msg1 transmissions. The selection of transmission does not affect reception by the base station or network equipment, as it is either a result of the existing situation (based on the PRACH mask index) or, as described in this document, the base station detects that the SSB is mapped to multiple random access times. In either case, this does not increase the workload of the BS.

[0025] Method 2: When the ssb-perRACH-Occasion in the ssb-perRACH-OccasionAndCB-PreamblesPerSSB parameter is greater than or equal to 1 {e.g., 1, 2, 4, 8, 16}, the base station enables the multiple Msg1 transmission option and then uses multiple ROs to send Msg1.

[0026] In some embodiments, method 1 and method 2 may be used simultaneously. When ssb-perRACH-Occasion is less than 1, by enabling multiple Msg1 transmissions, more Ros than method 1 or method 2 may be used to send Msg1.

[0027] Embodiment with explicit grouping and multiple Msg1 transmissions

[0028] In some embodiments, the indices of available preamble sequences are divided into Group A and Group B. When the UE selects Group A, it represents information bit 0, and when the UE selects Group B, it represents information bit 1, thereby conveying 1 bit of information. However, in multiple Msg1 transmissions or multiple RO transmissions, the same UE can use multiple ROs, whose preamble sequence indices are selected from Group A to represent information bit 0, and from Group B to represent information bit 1. The preamble sequence indices selected from Group A and Group B should be consistent so that the base station can identify that multiple ROs are transmitted for the same UE.

[0029] For example, each RO can select a preamble sequence index from {0..63}, which can be divided into Group A including {0...31} and Group B including {32...63}. If the UE wants to transmit the bit sequence 01101100, it can select 8 ROs to transmit random access preamble sequence indices of {1, 33, 33, 1, 33, 33, 1, 1}. However, if the preamble sequence index selected by the UE changes, for example, {1, 33, 35, 2, 36, 37, 3, 4}, the base station cannot confirm that these are multiple Msg1 transmissions sent by the same UE, and the information (e.g., the bit sequence 01101100) cannot be correctly identified.

[0030] In some embodiments, when the amount of information transmitted is small (for example, two bits of information) and the random access preamble index of the two ROs is selected as {1, 33}, in some cases, the base station may not be able to correctly determine that the received information is from the same UE. For example, there may be missed detection, or the BS may actually have received Msg1 from two UEs. In these cases, false alarms may occur. In existing implementations, the sizes of Group A and Group B (currently defined in one implementation) are not necessarily the same, and therefore, it is difficult to further constrain the selection of preamble sequences to improve the detection rate and reduce the false alarm rate. In addition, when the existing definitions of Group A and Group B are used, the explicit grouping combined with multiple Msg1 transmissions overrides the original function of indicating the size of the subsequent Msg3 and may not be sufficient to convey the size of the subsequent Msg3.

[0031] Embodiment with Implicit Grouping and Multiple Msg1 Transmissions

[0032] In some embodiments, and in the case of implicit grouping, no reliance is placed on existing definitions of Group A and Group B. Instead, a mathematical relationship (or constraint) between the preamble sequence indices selected for the ROs is defined to convey information.

[0033] In one example, it can be assumed that 64 preamble sequences are available in a Ro and are implicitly and evenly allocated to two groups on the UE side, such as a low-order group {0...31} and a high-order group {32...63}, or an even-indexed group and an odd-indexed group. This grouping does not require the base station or network to explicitly signal or configure the UE, nor does it require the UE or base station to report this grouping. The UE configures and uses this universal predefined rule itself, so it is called implicit grouping.

[0034] A UE implementing multiple Msg1 or multiple RO transmissions may select a preamble sequence index from the low-order or even-index group to represent information bit 1, and may select an index from the high-order or odd-index group to represent information bit 0. In other embodiments, this rule may be reversed without affecting the efficacy of the embodiments of the disclosed technology described herein.

[0035] In addition to selecting the preamble sequence index from each group, the selection must also satisfy a predetermined mathematical relationship (or constraint). For example, the difference between the preamble sequence indices of the groups is fixed, for example, the selection of {low-order group, high-order group} can be {0, 32}, {1, 33}, ..., where the fixed difference is 32 (e.g. Figure 3 As shown in FIG. 1 ). In another example, the choices of {even array, odd array} can be {0, 1}, {2, 3}, ..., where the fixed difference is 1. The constraint can also be {0, 64}, {1, 63}, ..., where the sum of all choices of sequence indices is 64. Other constraints are also applicable.

[0036] The purpose is to enable the base station to identify Msg1 sequences that meet the predefined rules as the output of the same UE and distinguish the information content. In addition, the selection of the preamble code sequence index on each RO should be consistent, which can reduce false alarms and improve the detection rate.

[0037] It should be noted that the grouping described in this embodiment is independent of the Group A and Group B groupings in existing implementations (which are typically used to convey the size of Msg3). For example, whether the system enables Group B does not affect the described methods and implementations. Similarly, if the system has configured Group A to contain 48 preambles and Group B to contain 16 preambles (for example, in the case of a contention-based random access (CBRA) preamble sequence), the embodiments of the disclosed technology are still compatible within this framework.

[0038] In the case of contention-based random access (CBRA) (using 56 preamble sequences) or contention-free random access (CFRA) (using 8 sequences), the mathematical relationship (or constraint) defined between the preamble sequence indices can be implemented. Therefore, embodiments of the disclosed technology are compatible with both contention-based random access (e.g., CBRA) and contention-free random access (e.g., CFRA).

[0039] The ability to support multiple Msg1 transmissions is an enhanced capability that may not be available to every UE in the network. Therefore, a system may include some UEs that support only basic functionality and some that support enhanced functionality. In this case, the network needs to enable the above predefined rules based on the scenario and notify the UE in higher-layer signaling or system information.

[0040] Embodiments for increasing the number of packets carrying information

[0041] The embodiments of the disclosed technology described above (e.g., based on explicit grouping and implicit grouping) divide the available preamble indexes into two groups. However, the embodiments described herein are also applicable to situations where more information needs to be transmitted through Msg1 transmission. For example, the 64 available preamble sequence indexes can be divided into 4 groups, and the sequence indexes in the 4 groups represent {00, 01, 10, 11}, which now convey two bits of information instead of just one. And this can be further expanded to be divided into 8 groups to support 3 bits of information, and so on.

[0042] For example, and as Figure 4 As shown, the four groups of indexes can be {0...15}, {16...31}, {32...47}, {48...63}, and the UE uses {1}, {17}, {33}, {49} to represent {00, 01, 10, 11} respectively, and the difference of the selected indexes is 49-33=33-17=17-1=16=64 / 4.

[0043] Effects of multiple Msg1 transmissions on Msg2

[0044] As described above, embodiments of the disclosed technology consider using multiple Msg1s or multiple RO transmissions to carry additional information, and subsequent downlink signal random access responses also need to support this functionality. This is achieved by the base station responding to the UE only after all multiple Msg1s or multiple RO transmissions have been received. If the UE receives a response before it is configured to transmit all Msg1s, it knows that the response received from the BS is incorrect and assumes that the BS has not received all Msg1 transmissions. The BS can correctly confirm that it has received all multiple Msg1s or multiple RO transmissions, and an exemplary method is as follows:

[0045] (1) The base station may insert all data received in multiple Msg1 transmissions into the Random Access Preamble (RAP) Identification (ID) (RAPID) field of the Random Access Response (RAR).

[0046] (2) After receiving all Msg1 transmissions, the base station can correctly identify the UE and therefore can insert the UE identity (UEID) into the random access response (RAR) to inform the UE that multiple Msg1 transmissions have been received and correctly decoded.

[0047] (3) The base station can use the decoded information content to scramble the control channel of the random access response (RAR). Therefore, the UE descrambles the control channel using its own information embedded in the preamble index, and if successful, it determines that the BS received and correctly decoded the multiple Msg1 transmissions.

[0048] In some embodiments, the number of information bits transmitted and the number of multiple Msg1 transmissions are predefined and known to both the BS and the UE. This enables the BS to immediately transmit a random access response upon receiving multiple Msg1 transmissions. For example, using eight Msg1 transmissions, which can transmit 8, 16, or more bits of information, the BS decodes the 8, 16, or more bits of information, confirming that the first step of the multiple Msg1 reception has been completed. This is an implicit trigger condition for interrupting reception.

[0049] In some embodiments, if the number of bits conveyed by multiple Msg1 transmissions is determined solely by the UE, but the base station is unaware of this information, the base station needs to continuously monitor Msg1 transmissions and terminate message decoding when an abnormal preamble is detected. It then attempts to transmit to the UE using the decoded information previously obtained in the RAR. This approach may result in a higher false alarm rate but increases the UE's flexibility in transmitting messages of varying bit lengths.

[0050] Exemplary Methods of the Disclosed Technology

[0051] The embodiments of the disclosed technology as described in various embodiments advantageously enable random access signals to carry more information, shorten random access delays, and speed up random access procedures.

[0052] Method of network node (or gNB or base station)

[0053] (1) In some embodiments, and based on a predefined configuration, a base station detects random access preamble sequence indices on multiple random access channel (RACH) occasions (ROs) and identifies information carried on the multiple ROs. The received random access preamble sequence indices on the multiple ROs are independently selected for each individual RO by UEs on the multiple ROs from even numbers of different preamble sequence indices (e.g., 2, 4, 6, ...), where the even numbers of the different preamble sequence indices are from a set of selectable preamble sequence indices on the ROs.

[0054] (2) In some embodiments, the base station identifies information carried on multiple ROs by indexing between two or more even numbers of different preamble sequences, where the number of different preamble sequences is based on the amount of information that needs to be conveyed (e.g., 1 bit or more).

[0055] (3) In some embodiments, the base station may identify that multiple ROs belong to the same UE based on continuous detection of preamble sequence indices selected from two or more of the same number of different preamble sequence indices and detection of relationships (or constraints) between the indices.

[0056] (4) In some embodiments, the mathematical relationship (or constraint) may include:

[0057] (i) Adjacent preamble sequence indices are sorted from large to small, and the difference between adjacent preamble sequence indices is fixed.

[0058] (ii) The index values ​​of adjacent preamble sequences are fixed.

[0059] (iii) Two or more even-numbered different preamble code indices are obtained by grouping the indices in the set of available preamble code sequence indices; for example, when there are two indices, the two different preamble code sequence indices are from two different groups, or when there are four indices, the four different preamble code indices are from four different groups, and so on, and there is no overlap between the groups.

[0060] (iv) other similarly derived mathematical relationships (or constraints).

[0061] (5) In some embodiments, the system notifies the UE to enable multiple Msg1 bearer information by using higher layer signaling or system messages.

[0062] (6) In some embodiments, the base station uses the decoded information or part of the information content in the random access response, for example, for control channel scrambling. In other embodiments, the base station is configured to insert all received multiple MSG1 preamble indices or variations of the preamble sequence into the Random Access Preamble Identifier (RAPID) field of the random access response. In other embodiments, the base station inserts the received information into the random access response.

[0063] Method for terminal (or mobile device, or UE)

[0064] (1) The UE sends multiple preamble code sequences on multiple ROs; for example, the UE independently selects one of two or more even-numbered different preamble code sequence indexes for each individual RO and sends it on the RO, where the two or more even-numbered different preamble code sequence indexes are obtained from a set of preamble code sequence indices selectable on the RO.

[0065] (2) In some embodiments, two or more different preamble sequence indices and mathematical relationships (or constraints) are predefined.

[0066] (3) In some embodiments, the mathematical relationship (or constraint) may include:

[0067] (i) Adjacent preamble sequence indices are sorted from large to small, and the difference between adjacent preamble sequence indices is fixed.

[0068] (ii) The index values ​​of adjacent preamble sequences are fixed.

[0069] (iii) Two or more even-numbered different preamble code indices are obtained by grouping the indices in the set of available preamble code sequence indices; for example, when there are two indices, the two different preamble code sequence indices are from two different groups, or when there are four indices, the four different preamble code sequence indices are from four different groups, and so on, and there is no overlap between the groups.

[0070] (iv) other similarly derived mathematical relationships (or constraints).

[0071] (4) In some embodiments, the UE selects two or more even-numbered different preamble sequences based on the number of information bits to be transmitted.

[0072] (5) In some embodiments, when the UE can support more Msg1 bearer information, multiple ROs can be selected to send Msg1 and bearer information.

[0073] (6) In some embodiments, and when the parameter ssb-perRACH-Occasion notified by the system is less than 1 or when the UE enables multiple Msg1 transmissions, multiple ROs may be selected to send Msg1.

[0074] Figure 5 An example of a wireless communication method 500 for generating a random access signal carrying information is shown. The method 500 includes, in step 510, transmitting a first message by a terminal to a network node, the first message including a first preamble sequence associated with a first index from a first half of an index set.

[0075] The method 500 includes, at step 520, transmitting a second message including a second preamble sequence associated with a second index from a second half of the set of indices, wherein the first index and the second index satisfy a constraint relationship.

[0076] In some embodiments, the terminal communicates the first information bit value by transmitting the first message and the second message on the first resource and the second resource, respectively, and communicates the second information bit value by transmitting the first message and the second message on the second resource and the first resource, respectively.

[0077] In some embodiments, the index set can be divided into more groups (e.g., 4, 8, ...) to convey a larger number of bits, as described in the exemplary embodiments of this document. For example, the index set can be divided into four groups, which can then be used to convey two bits of information.

[0078] Figure 6 Another example of a wireless communication method 600 for generating a random access signal with information bearing is shown. This example includes some Figure 5 Similar features and / or steps shown in and described above. At least some of these features and / or components may not be described separately in this section.

[0079] The method 600 includes, in step 610 , receiving, by a network node, a first message from a terminal, the first message including a first preamble sequence associated with a first index from a first half of a set of indices.

[0080] The method 600 includes, at step 620 , receiving a second message including a second preamble sequence associated with a second index from a second half of the set of indices, wherein the first index and the second index satisfy a constraint relationship.

[0081] In some embodiments, the method 600 further includes the step of transmitting a random access response including the first index and the second index. This is a method for the network node (or base station, or gNB) to verify that all multiple Msg1 or multiple RO transmissions have been received and correctly decoded.

[0082] In some embodiments, the method 600 further includes the following steps: determining an identity of the terminal based on the first index and the second index, and transmitting a random access response including the terminal identity, which is another method for verifying that the network node receives multiple Msg1s.

[0083] In some embodiments, method 600 further includes transmitting a random access response and scrambling a control channel associated with the random access response based on at least a portion of the first index, which is another method for the UE to know that multiple Msg1s were successfully received at the base station. In one example, the scrambling is further based on at least a portion of the second index.

[0084] In some embodiments, the methods 500 and 600 may further include the step of avoiding communicating the constraint relationship. In other words, some embodiments are based on network nodes and terminals having prior knowledge of group partitions and mathematical relationships (or constraints).

[0085] In some embodiments, the constraint relationship includes that the sum of the first index and the second index is equal to a fixed value. In one example, the first half of the index set includes {0, 1, ..., 2N-1 -1}, where the second half of the index set includes {2 N-1 , 2 N-1 +1,…,2 N -1}, where the fixed value is 2 N -1, N is a positive integer, the first index is j and the second index is 2 N -1-j, and 0≤j<2 N-1 An integer.

[0086] In some embodiments, the constraint relationship includes that the difference between the first index and the second index is equal to a fixed value. In one example, the first half of the index set includes {0, 1, ..., 2 N-1 -1}, where the second half of the index set includes {2 N-1 , 2 N-1 +1,…,2 N-1 -1}, where the fixed value is 2 N-1 , N is a positive integer, the first index is 2 N-1 +j, the second index is j, and 0≤j<2 N-1 is an integer. In another example, the first half of the index set includes {0, 2, 4, 6, 8, ..., 2 N -2}, where the second half of the index set includes {1, 3, 5, 7, ..., 2 N -1}, where the fixed value is 1, N is a positive integer, where the first index is j+1 and the second index is j, and 0≤j≤2 N -2 is an integer.

[0087] Implementation Methods of the Disclosed Technology

[0088] Figure 7 is a block diagram representation of a portion of an apparatus according to some embodiments of the disclosed technology. An apparatus 705, such as a base station or wireless device (or UE), may include processor electronics 710, such as a microprocessor that implements one or more of the techniques presented in this document. The apparatus 705 may include transceiver electronics 715 to send and / or receive wireless signals through one or more communication interfaces (such as one or more antennas 720). The apparatus 705 may include other communication interfaces for sending and receiving data. The apparatus 705 may include one or more memories (not explicitly shown) configured to store information such as data and / or instructions. In some embodiments, the processor electronics 710 may include at least a portion of the transceiver electronics 715. In some embodiments, the apparatus 705 is used to implement at least some of the disclosed techniques, modules, or functions.

[0089] It is intended that this instruction manual together with the attached Figure 1It is to be construed as illustrative only, where exemplary means an example and does not imply an ideal or preferred embodiment unless otherwise specified. As used herein, the use of "or" is intended to include "and / or" unless the context clearly dictates otherwise.

[0090] Some embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by a computer in a network environment. Computer-readable media may include removable and non-removable storage devices, including but not limited to read-only memory (ROM), random access memory (RAM), compact discs (CD), digital versatile discs (DVD), etc. Therefore, computer-readable media may include non-transitory storage media. Typically, program modules may include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. Computer or processor executable instructions, associated data structures, and program modules represent examples of program code for executing the steps of the methods disclosed herein. A specific sequence of such executable instructions or associated data structures represents an example of corresponding actions for implementing the functions described in these steps or processes.

[0091] Some disclosed embodiments can be implemented as devices or modules using hardware circuits, software or a combination thereof. For example, a hardware circuit implementation may include discrete analog and / or digital components that are, for example, integrated as a part for a printed circuit board. Alternatively or additionally, disclosed components or modules may be implemented as application specific integrated circuits (ASICs) and / or as field programmable gate arrays (FPGAs). Some embodiments may additionally or alternatively include a digital signal processor (DSP), which is a dedicated microprocessor having an optimized architecture for the operational requirements of the digital signal processing associated with the disclosed functions of the present application. Similarly, various components or subcomponents within each module may be implemented in software, hardware or firmware. Connectivity between modules and / or components within the modules may be provided using any of connection methods and media known in the art, including but not limited to communications performed over the Internet, wired or wireless networks using appropriate protocols.

[0092] Although this document contains many details, these details should not be interpreted as limitations on the scope of the claimed invention or the invention that may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features described in this document in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented separately in multiple embodiments or in any suitable subcombination. Moreover, although features may be described above as working in certain combinations and even initially claimed as such, in some cases one or more features in the claimed combination may be cut out of the combination, and the claimed combination may be directed to a subcombination or variations of the subcombination. Similarly, although operations are depicted in a particular order in the accompanying drawings, this should not be understood as requiring that such operations be performed in the particular order shown or in a continuous order, or that all shown operations be performed to achieve the desired result.

[0093] Only a few implementations and examples are described, and other implementations, enhancements, and variations can be implemented based on what is described and illustrated in this disclosure.

Claims

1. A wireless communication method for a network node, comprising: The network node detects a random access preamble sequence index on a plurality of random access channel (RACH) occasions (RO) based on a predefined configuration, and The network node identifies information carried on multiple ROs, The random access preamble sequence indexes on the multiple ROs are independently selected by terminals on multiple ROs from an even number of different preamble sequence indexes for each individual RO, wherein the even number of different preamble sequence indexes are from a set of selectable preamble sequence indexes on the multiple ROs. When the parameter ssb-perRACH-Occasion notified by the system is less than 1 or when the terminal enables multiple Msg1 transmissions, the multiple ROs are selected to send Msg1, and The number of the even number of different preamble code sequences is selected based on the number of bits of information to be transmitted.

2. The wireless communication method according to claim 1, wherein: The network node identifies information carried on the plurality of ROs by indexing among the even number of different preamble sequences.

3. The wireless communication method according to claim 1 or 2, wherein: The network node identifies that the multiple ROs belong to the same terminal based on continuous detection of preamble sequence indices selected from the even number of different preamble sequence indices and detection of a constraint condition between the indices.

4. The wireless communication method according to claim 3, wherein: The constraints include: (i) adjacent preamble code sequence indexes are sorted from large to small, and the difference between the adjacent preamble code sequence indexes is fixed; (ii) the values ​​of the adjacent preamble code sequence indexes are fixed; and (iii) the even number of different preamble code sequence indexes is obtained by grouping the indexes in the available preamble code sequence index set.

5. A wireless communication method for a terminal, comprising: The terminal independently selects one of an even number of different preamble sequence indices for each separate random access channel (RACH) occasion (RO), and The terminal sends multiple preamble sequences on multiple ROs, The even number of different preamble sequence indexes is obtained from a set of preamble sequence indexes selectable from the multiple ROs. When the parameter ssb-perRACH-Occasion notified by the system is less than 1 or when the terminal enables multiple Msg1 transmissions, the multiple ROs are selected to send Msg1, and The multiple ROs carry information, and the number of the even-numbered different preamble code sequences is selected based on the number of bits of information to be transmitted. The wireless communication method according to claim 5 , wherein: The even number of different preamble code sequence indexes and constraint conditions are predefined.

7. The wireless communication method according to claim 6, wherein: The constraints include: (i) adjacent preamble code sequence indexes are sorted from large to small, and the difference between the adjacent preamble code sequence indexes is fixed; (ii) the values ​​of the adjacent preamble code sequence indexes are fixed; and (iii) the even number of different preamble code indexes is obtained by grouping the indexes in the available preamble code sequence index set.

8. A wireless communication method for a network node, comprising: The network node transmits a random access response to the terminal after receiving all the multiple Msg1 transmissions, wherein the network node confirms that all the multiple Msg1 transmissions have been received based on the following manner: The network node inserts all data received in the multiple Msg1 transmissions into a random access preamble (RAP) identification (ID) (RAPID) field of a random access response (RAR), After receiving all Msg1 transmissions, the network node correctly identifies the terminal and inserts the terminal identifier (UEID) into the random access response (RAR) to inform the terminal that the multiple Msg1 transmissions have been received and correctly decoded, and The network node scrambles a control channel of the random access response (RAR) using the decoded information content.

9. A wireless communication method for a terminal, comprising: After the terminal transmits all of the multiple Msg1 transmissions, receiving a random access response from the network node, wherein transmitting all of the multiple Msg1 transmissions is confirmed based on the following manner: All data received in the multiple Msg1 transmissions are inserted into the Random Access Preamble (RAP) Identification (ID) (RAPID) field of the Random Access Response (RAR), After all the multiple Msg1 transmissions are transmitted, the terminal is correctly identified and the terminal identity (UEID) is inserted into the random access response (RAR) so that the terminal is informed that the multiple Msg1 transmissions have been transmitted and correctly decoded, and The decoded information content is used to scramble the control channel of the random access response (RAR).

10. A wireless communication device comprising a processor and a memory, wherein: The processor is configured to read code from the memory and implement the method according to any one of claims 1 to 9.

11. A non-transitory computer readable medium having stored thereon codes which, when executed by a processor, cause the processor to implement the method according to any one of claims 1 to 9.

Images