CN113439467A - Communication between a terminal and a radio network node - Google Patents
Communication between a terminal and a radio network node Download PDFInfo
- Publication number
- CN113439467A CN113439467A CN201980092440.5A CN201980092440A CN113439467A CN 113439467 A CN113439467 A CN 113439467A CN 201980092440 A CN201980092440 A CN 201980092440A CN 113439467 A CN113439467 A CN 113439467A
- Authority
- CN
- China
- Prior art keywords
- pucch resource
- identifier
- index
- resource index
- random access
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title description 10
- 238000000034 method Methods 0.000 claims abstract description 55
- 238000004590 computer program Methods 0.000 claims description 28
- 230000004044 response Effects 0.000 claims description 23
- 238000012545 processing Methods 0.000 claims description 10
- 230000001419 dependent effect Effects 0.000 claims 7
- 230000005540 biological transmission Effects 0.000 description 24
- 125000004122 cyclic group Chemical group 0.000 description 15
- 230000006870 function Effects 0.000 description 11
- 102100036409 Activated CDC42 kinase 1 Human genes 0.000 description 9
- 230000001413 cellular effect Effects 0.000 description 9
- 238000010801 machine learning Methods 0.000 description 5
- 238000003860 storage Methods 0.000 description 5
- 230000007704 transition Effects 0.000 description 5
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 3
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 3
- 230000000977 initiatory effect Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 101100274486 Mus musculus Cited2 gene Proteins 0.000 description 2
- 101100533725 Mus musculus Smr3a gene Proteins 0.000 description 2
- 101150071746 Pbsn gene Proteins 0.000 description 2
- 101150096622 Smr2 gene Proteins 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000036541 health Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 125000002015 acyclic group Chemical group 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 238000007477 logistic regression Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000001404 mediated effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1854—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1864—ARQ related signaling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L2001/0092—Error control systems characterised by the topology of the transmission link
- H04L2001/0093—Point-to-multipoint
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
An apparatus comprising means for: sending an uplink message (MsgA) in a two-step random access procedure; receiving a downlink reply message (MsgB) in the two-step random access procedure, the received downlink reply message comprising an identifier for the device; and transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH Resource Indicator (PRI) and an identifier of the apparatus.
Description
Technical Field
Embodiments of the present disclosure relate to communications between a terminal and a radio network node.
Background
The wireless network includes a plurality of network nodes including a terminal node and an access node.
The terminal node and the access node communicate wirelessly with each other.
In some cases, it may be desirable to reduce power consumption at the terminal node.
Disclosure of Invention
According to various, but not necessarily all, embodiments, there are provided examples as claimed in the appended claims.
Drawings
Some example embodiments will now be described with reference to the accompanying drawings, in which:
FIG. 1 illustrates an example embodiment of the subject matter described herein;
FIG. 2 illustrates another example embodiment of the subject matter described herein;
FIG. 3 illustrates another example embodiment of the subject matter described herein;
FIG. 4 illustrates another example embodiment of the subject matter described herein;
FIG. 5A illustrates another example embodiment of the subject matter described herein;
figure 5B illustrates another example embodiment of the subject matter described herein.
Detailed Description
Definition of
ACK acknowledgement
BWP bandwidth portion
CCE control channel elements
CS cyclic shift
DCI downlink control information
HARQ hybrid acknowledgement request
NW network
PRB physical resource block
Physical RACH
PRI PUCCH resource indicator
PUCCH physical uplink control channel
RA random access
RA-RNTI random access radio network temporary identifier
RACH random access channel
RAR random access response
RO RACH occasion
UCI uplink control information
UE user equipment
Fig. 1 shows an example of a network 100, the network 100 comprising a plurality of network nodes including a terminal node 110, an access node 120 and one or more core nodes 1129. The end node 110 and the access node 120 communicate with each other. One or more core nodes 129 are in communication with access node 120.
In some examples, one or more core nodes 129 may communicate with each other. In some examples, one or more access nodes 120 may communicate with each other.
The access node 120 is a cellular radio transceiver. The terminal node 110 is a cellular radio transceiver.
In the illustrated example, the cellular network 100 is a third generation partnership project (3GPP) network, where the terminal node 110 is a User Equipment (UE) and the access node 120 is a base station.
In the particular example shown, the network 100 is an evolved universal terrestrial radio access network (E-UTRAN). The E-UTRAN consists of E-UTRAN NodeBs (eNBs) 120, providing E-UTRA user plane and control plane (RRC) protocol terminations towards the UE 110. The enbs 120 are interconnected to each other through an X2 interface 126. The eNB is also connected to a Mobility Management Entity (MME)129 through an S1 interface 128.
In another example, the network 100 is a next generation (or new radio NR) radio access network (NG-RAN). The NG-RAN consists of a gdnodeb (gnb)120, which provides user plane and control plane (RRC) protocol terminations towards the UE 110. The gNB 120 are interconnected to each other through an X2/Xn interface 126. The gNB is also connected to an access and mobility management function (AMF) through an N2 interface 128.
Current developments in radio access networks are focused on supporting a large number of delay tolerant, low data UEs 110. This enables Machine Type Communication (MTC) and cellular internet of things (IoT). MTC devices and IoT devices may only sporadically transmit data, and when UE 110 is in idle mode 130, the network needs to support sporadic data transmission for UE 110.
UE 110 may transmit to network 100 to enable the network to classify UE 110 for delay requirements, data bandwidth requirements, and mobility requirements. For example, a physical layer enhancement (eMTC) of a machine type communication protocol may use a reduced bandwidth of 1.4 MHz. For example, the narrowband internet of things (NB-IoT) protocol uses a reduced bandwidth of 200 kHz. The expected mobility of the UE 110 executing the NB-IoT protocol is very low. For the NB-IoT protocol, there is no handover (handover) in the connected mode 132.
UE 110 may operate at different coverage enhancement levels. This means that different UEs 110 may use the same logical channel in the same cell 122, but the characteristics of the respective physical channels (narrowband resources, repetition, etc.) may be completely different between UEs 110 operating at different coverage enhancement levels.
Fig. 2 shows examples of different modes 130, 132 of the UE 110 and transitions 131, 133 between the modes 130 and 132.
For example, a random access procedure is used for the transition 131 from idle mode (or inactive mode) 130 to connected mode, and is used in connected mode when the UE 110 is not UL synchronized, or is used to request UL resources when dedicated scheduling request resources are not configured, or is used to recover from beam failure. For example, the transition 133 from the connected mode 132 to the idle mode 130 may occur upon connection release or radio link failure.
In the NG-RAN network 100, the IDLE or INACTIVE mode 130 corresponds to RRC _ IDLE or RRC _ INACTIVE, respectively, and the CONNECTED mode corresponds to RRC _ CONNECTED. For example, transition 131 corresponds to RRC connection establishment, RRC connection reestablishment, RRC connection recovery, or Early Data Transfer (EDT). For example, the transition 133 corresponds to an RRC connection release (also corresponding to a radio link failure).
Hereinafter, the terminal node 110 will be referred to as a terminal 110.
The terminal 110 is a device on the cell side terminating the radio link. Which is a device that allows access to network services. The terminal 110 may be a mobile terminal. The terminal 110 may be a user equipment or a mobile device. The user equipment is a mobile device plus a Subscriber Identity Module (SIM).
The access node 120 is a network element in a radio access network responsible for radio transmission to the terminal 110 or radio reception from the terminal 110 in one or more cells 122. The access node 120 is the network termination of the radio link. The access node 120 operates as NodeB, eNodeB, gnnodeb.
Fig. 3 shows an example of a contention-based four-step random access procedure 200. An example of a contention-based random access procedure is described in section 10.1.5 of 3GPP TS 36.300(2018, release 15).
The contention-based random access procedure is a general procedure for Frequency Division Duplexing (FDD) and Time Division Duplexing (TDD). The contention-based random access procedure may be used for initial access from RRC IDLE, for example. This may be performed due to RRC connection establishment, RRC connection re-establishment, or Early Data Transfer (EDT), or other reasons.
The contention-based four-step random access procedure 200 begins in a first step when terminal node 110 sends an uplink initiation message (Msg1)202 to access node 120. This is the random access preamble in section 10.1.5 (2018, release 15) of 3GPP TS 36.300. Msg 1202 is sent in a logical Random Access Channel (RACH) and physically in a Physical Random Access Channel (PRACH). The terminal node 110 selects a random access resource including, for example, a random access opportunity (RO) and a preamble group within the selected RO based on testing system information broadcast conditions at the terminal node 110 and randomly selecting one preamble. Such conditions may include, for example, signal levels of beams (e.g., RSRP, RSRQ, SINR).
Next, in a second step, the access node 120 responds to receipt of the uplink initiation message (Msg1)202 by sending a downlink response (Msg2)204 from the access node 120 to the terminal node 110. The downlink response 204 includes an initial uplink grant. The downlink response 204 is a random access response in section 10.1.5 (2018, release 15) of 3GPP TS 36.300. The random access response also includes timing alignment information for determining the timing advance. RA-RNTI is addressed on PDCCH. The random access RNTI (RA-RNTI) explicitly identifies which time-frequency resources are used by the terminal node 110 to transmit the random access preamble 202 within a configured window (random access response window).
Next, in a third step, the terminal node 110 responds to receipt of a downlink response (Msg2)204 from the access node 120 by sending an uplink connection request (Msg3)206 from the terminal node 110 to the access node 120. Uplink connection request 206 may include an identifier of terminal node 110. The uplink connection request 206 is a scheduled transmission in section 10.1.5 (2018, release 15) of 3GPP TS 36.300. The identifier of the terminal node 110 is a UE identifier. The scheduled transmission 206 is sent according to the initial uplink grant provided in the random access response 204. The scheduled transmission may comprise an RRC connection request, an RRC connection reestablishment request, an RRC connection resumption request, or an RRC early data request if Early Data Transmission (EDT) is enabled, or in one possibility no RRC message but C-RNTI MAC CE (medium access control element) for the connected mode terminal node.
Next, in a fourth step, access node 120 responds to receiving uplink connection request 206 by sending a downlink response (Msg4)208 from access node 120 to terminal node 110. The downlink response 208 to the uplink connection request 206 includes the identifier of the terminal node 110 received in the uplink connection request 206. The downlink response 208 to the uplink connection request 206 is contention resolution in section 10.1.5 (2018, release 15) of 3GPP TS 36.300.
If the access node 120 is able to decode Msg 3206, contention resolution occurs in a fourth step by including the contention resolution ID of the terminal node into the contention resolution MAC PDU (idle/inactive mode terminal node) or by directly scheduling the C-RNTI of the terminal node (connected mode terminal node).
Focusing only on idle/inactive mode terminal nodes, a terminal node 110 decoding its contention resolution ID from a MAC PDU then sends a HARQ ACK to the access node 120 (no NACK is sent since the terminal node 110 obviously does not know whether a contention resolution message is for it).
Thus, in four-step random access process 200, terminal node 110 sends HARQ ACK/NACK feedback for Msg 4208. Providing a PUCCH-ResourceCommon signaled in RMSI by the index of table 9.2.1-1 rows in 3GPP TS 38.213(2018, Release 15) for use in a method of providing a PUCCH resource set in a mobile radio network
HARQ-ACK information is transmitted on PUCCH in initial uplink BWP of one PRB.
The PUCCH resource set includes 16 resources (16 index values), each resource corresponding to:
the format of the PUCCH is the format of the PUCCH,
the first symbol is a symbol of a first symbol,
the duration of the time period is such that,
PRB offset
And
cyclic shift index set for PUCCH transmission.
nCCE,0is an index of the first CCE for PDCCH reception, and
ΔPRIis the value of the PUCCH resource indicator field in DCI.
If it is not
Wherein N isCSIs the total number of initial cyclic shift indices in the initial cyclic shift index set,
-the terminal node 110 determines an initial cyclic shift index in the initial cyclic shift index set as rPUCCHmodNCS。
If it is not
-the terminal node 110 determines an initial cyclic shift index in the initial cyclic shift index set as (r)PUCCH-8)modNCS。
In addition to the PUCCH resource determination described above, PDCCH scheduling of PDSCH provides time domain allocation (PDSCH-to-HARQ feedback timing indicator) in DCI. This determines a slot for the determined PUCCH resource. The PDSCH-to-HARQ timing indicator field value is mapped to {1,2,3,4,5,6,7,8 }.
In 3GPP release 15, HARQ ACK/NACK feedback for the Msg4208 PDSCH is sent after collision resolution, i.e., only one terminal node 110 that decoded its contention resolution ID will send a HARQ ACK.
Fig. 4 shows an example of a contention-based two-step random access procedure 300. This procedure may be supported in addition to the four-step random access procedure 200.
The contention-based two-step random access procedure 300 begins in a first step when the terminal node 110 sends an uplink origination message (MsgA)302 of the two-step random access procedure to the access node 120. MsgA may comprise a randomly selected PRACH preamble over PRACH and a PUSCH data transmission over PUSCH, i.e. it may be 1 or 2 transmissions but is considered one step.
Next, in a second step, access node 120 responds to receipt of uplink initiation message (MsgA)302 of the two-step random access procedure by sending a downlink reply message (MsgB)304 from access node 120 to terminal node 110.
The contention-based two-step random access procedure 200 differs from the contention-based four-step random access procedure 200 in that the response to the random access request enables contention resolution without further messaging, e.g., without first providing an uplink grant for contention resolution.
Contention resolution in the two-step process 300 will be performed by including a terminal node identifier 310(UE identifier) in the first message MsgA 302, which terminal node identifier 310 is echoed (echo) in the second message MsgB 304. The type of end node identifier 310 may be, for example, an RRC connection setup message/RRC connection resume message/reestablishment request message containing the UE ID or the least/most significant digit (e.g., 48 MSBs or LSBs) of the RRC message sent thereto or C-RNTI MAC CE. The terminal node identifier 310 may be echoed in the second message MsbG 304 by using the UE contention resolution MAC-CE.
For the contention-based two-step random access procedure 300, the MsgB304 may include responses to multiple terminal nodes 110 (similar to Msg 2204 in the four-step procedure 200). The payload on the PUSCH resource may be different whenever multiple terminal nodes 110 send the preamble portion of MsgA 302 on the same or different PRACH resources. Thus, MsgB304 may include contention resolution IDs (echoed terminal node identifiers 310) for a plurality of terminal nodes 110 that were successful in MsgA 302 transmission.
Since a single MsgB304 may include contention resolution IDs 310 for several terminal nodes 110, the resources for acknowledgements (acknowledging receipt of HARQ ACKs for contention resolution message MsgB 304) for all terminal nodes 110 should be unique for each terminal node 110 sending the acknowledgement so that access node 120 can determine which terminal nodes 110 received message MsgB 304. For the transmission of the acknowledgement, the PUCCH resource set is provided, e.g., by PUCCH-ResourceCommon or some other information element signaled, e.g., in RMSI. Terminal node 110 may determine PUCCH resources for acknowledgement from the set of PUCCH resources, or in some examples PRBs other than the set of PUCCH resources, but using the PUCCH format, the first symbol, the duration, the PRB offset, and the set of cyclic shift indices indicated for the set of PUCCH resources.
In the following example, in the case where access node 120 sends in a single MsgB304 or can send multiple contention resolution IDs 310 for multiple terminal nodes 110, terminal node 110 determines the PUCCH resource for HARQ ACK transmission (acknowledgement 306 carries the PDSCH of MsgB 304).
Information distinguishing PUCCH resources between terminal nodes 110 is contained in MsgB304 and may be explicit and/or implicit, e.g., the index position of the echoed terminal node identifier 310 (contention resolution ID) in MsgB 304.
In the two-step process 300, multiple terminal nodes 110 may transmit acknowledgements 306 using orthogonal resources to confirm that the respective contention resolution was successful.
To this end, in addition to sending an uplink message (MsgA)302 in the two-step random access procedure 300 and receiving a downlink reply message (MsgB)304 in the two-step random access procedure 300, the method 300 further includes: the uplink acknowledgement message 306 is sent using PUCCH resources determined by a PUCCH resource index, where the PUCCH resource index depends at least on the identifier 310 and PUCCH Resource Indicator (PRI) of the device 110 received in the downlink reply message (MsgB) 304.
Receiving a PUCCH Resource Indicator (PRI) from Downlink Control Information (DCI) and/or from a downlink acknowledgement message (MsgB 304). Alternatively/additionally, a hybrid approach may be supported, where the first PUCCH Resource Indicator (PRI) is provided by DCI and if more resources are needed (e.g. in the resource domain), they are provided within the MsgB 304.
In some, but not necessarily all examples, terminal node 110 determines its valid PUCCH resource for sending acknowledgement 306 based on the PUCCH Resource Indicator (PRI) and the index position of terminal node's contention resolution ID 310 in MsgB 304.
The time slot for sending the acknowledgement 306 is determined based on the PDSCH-to-HARQ feedback timing indicator in the received scheduling DCI, or alternatively is provided within the MsgB 304.
In some, but not necessarily all, examples, the PUCCH resource index depends at least on: PUCCH resource index and identifier 310 of terminal node 110 applicable to four-step random access procedure 200. The PUCCH resource index applicable to the four-step random access procedure 200 depends on the PUCCH Resource Indicator (PRI):
in some, but not necessarily all, examples, the PUCCH resource index depends on the identifier 310 of terminal node 110, as the PUCCH resource index depends on the index position of the identifier 310 of terminal node 110 in the received downlink reply message (MsgB) 304.
In some, but not necessarily all, examples, the PUCCH resource index depends on the identifier 310 of the terminal node 110, as the PUCCH resource index depends on an offset associated with the identifier 310 of the terminal node 110. The offset is received from a received downlink response message (MsgB)304 or from Downlink Control Information (DCI).
In some, but not necessarily all, examples, PUCCH resources available for uplink acknowledgement message 306 are reserved via received Downlink Control Information (DCI).
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of the terminal node 110.
In some, but not necessarily all, examples, when the PUCCH resource index exceeds a maximum allowed value, additional processing is performed to determine a PUCCH resource for transmitting the uplink acknowledgement message 306.
In some, but not necessarily all, examples, the determined resource is determined from a seed received within a received downlink acknowledgement message (MsgB)304 or determined by applying a modulo-16 operation on a PUCCH resource index.
In some, but not necessarily all examples, the method 300 includes receiving another downlink acknowledgement message 304 specifying a new PUCCH Resource Indicator (PRI) and/or a new slot for the uplink acknowledgement message 306.
In some, but not necessarily all, examples, the PUCCH resource index is reset to the minimum allowed value when the PUCCH resource index exceeds the maximum allowed value.
In some, but not necessarily all examples, the uplink acknowledgement message 306 is transmitted in a time slot determined by an indicator received via Downlink Control Information (DCI) or in the received downlink acknowledgement message 304.
The method 300 may be implemented in a number of different ways, as will be better understood from the following examples.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of the terminal node 110.
The first index value depends at least on the PUCCH resource index suitable for the four-step random access procedure 200 and the identifier 310 of the terminal node 110. The PUCCH resource index suitable for the four-step random access procedure 200 depends on a PUCCH Resource Indicator (PRI). For example, the index positions of the contention resolution IDs of the terminal nodes (e.g., #0, #1, #2, etc.) may be added to the PUCCH resource index rPUCCH(determined by the index of the first CCE and the PRI).
When the PUCCH resource index exceeds the maximum allowed value, additional processing is performed to determine the PUCCH resource for sending the uplink acknowledgement message 306, e.g., to receive another downlink acknowledgement message 304 specifying a new PUCCH resource indicator and/or a new slot for the uplink acknowledgement message 306. In one example, network 100 should schedule another MsgB304 whenever the sum of PUCCH resource index and terminal node's index position reaches the maximum value of PUCCH resource index (15), where the PUCCH resource indicator and PDSCH-to-HARQ feedback timing indicator point to different UL slots. This allows the network 100 to reserve some PUCCH resources for other downlink transmissions.
The MsgB itself or the DCI schedule of MsgB may include an indication that there will be another MsgB transmission coming for the same RO (e.g., the same RA-RNTI within the same RAR window). This would allow the terminal node 110 to potentially ignore other MsgB304 for the same RO if the first detected MsgB304 did not include the contention resolution ID of the terminal node.
In some, but not necessarily all, examples, the determined resources are determined by applying a modulo-16 operation on the PUCCH resource index. For example, after the PUCCH resource index space is exhausted (up to 15), the next terminal node 110 indexes r from the PUCCH resourcePUCCHStarting at 0 and continuing until the first PUCCH resource index-1 value is reached.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of terminal node 110. For example, each index position of the contention resolution ID 310 provides its own resource offset value and is then used with the PUCCH Resource Indicator (PRI) given in the DCI (e.g., summing the resource offset value with the PUCCH Resource Indicator (PRI) in the PDCCH and applying modulo 16 arithmetic). This approach would provide a high degree of flexibility at the expense of increased MsgB304 payload.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of terminal node 110. For example, the scheduling DCI has a set of bits mapped to each index position of the contention resolution ID 310, where the set of bits serves as a relative value to be applied to the common PUCCH resource indicator in the DCI. For example, there may be up to 3 sets, each of which may be allocated 2 bits. Thus, in total 6 bits are required in the DCI to provide up to three PUCCH resources (and up to three terminal nodes 110) in addition to scheduling the first PUCCH resource indicated by the PRI in the DCI.
In some, but not necessarily all, examples, PUCCH resources available for uplink acknowledgement message 306 are reserved via received Downlink Control Information (DCI). For example, the network 100 configures the maximum value of PUCCH resource index that can be used by the terminal node 110, which terminal node 110 sends HARQ ACK for its contention resolution message; the lower limit of the PUCCH resource index is signaled by the first CCE of the scheduling DCI and the PUCCH resource indicator. This enables PUCCH resources to be reserved, e.g. indices 3-10 indicate PUCCH resources for contention resolution purposes, and other PUCCH resources may be used for any other purpose.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of terminal node 110. For example, the DCI may further include a step size per index position, which is summed to the PUCCH resource index rPUCCH(determined by the index of the first CCE and the PRI), for example, the DCI indicates a step size equal to 2, so terminal node 110 with index position #1 will add 2 and terminal node 110 with index position #2 will add 4. This would require, for example, 2 bits in the DCI to provide flexibility for the gNB (steps 1,2,3, 4). The step size may also be signaled as part of the MsgB304 content.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier 310 of terminal node 110. When the PUCCH resource index exceeds the maximum allowed value, additional processing is performed to determine a PUCCH resource for transmitting the uplink acknowledgement message 306. The determined resources are determined from a seed received within a received downlink reply message (MsgB) 304. For example, once a PUCCH resource is exhausted for one uplink slot, MsgB304 may indicate a new "seed" for another contention resolution message included in the same MsgB 304. This may include providing a first CCE index, a first PUCCH resource indicator (PIR), and a new CCE indexThe new PDSCH-to-HARQ timing indicator or PUCCH resource index offset used by the next terminal node 110 indexed in MsgB304 and the terminal node 110 thereafter using the method described above. PUCCH resource offset roffsetThe PUCCH resource index r determined by the method is compared with the index roffsetAnd summing to obtain the actual PUCCH resource index.
In some, but not necessarily all, examples, the PUCCH resource index depends on a first index value that depends on a PUCCH Resource Indicator (PRI) that is offset by a second value that depends on an identifier of terminal node 110. When the PUCCH resource index exceeds the maximum allowed value, additional processing is performed to determine a PUCCH resource for transmitting the uplink acknowledgement message 306. The determined resource is determined by applying a modulo-16 operation on the PUCCH resource index. For example, after the PUCCH resource index space is exhausted (up to 15) for the initial PUCCH resource set, the next terminal node 110 indexes r from the PUCCH resourcePUCCHStarting at 16. Then, for each subsequent terminal node 110 indexed in MsgB304, the PUCCH resource index is incremented by 1.
When the PUCCH resource index increases beyond the space of the PUCCH resource set, the PRB index determination needs to be modified to ensure non-segmented usage of UL PRBs. For example, r can be addressed in the following mannerPUCCH>15 to determine PRB index:
if it is not
the terminal node 110 determines the initial cyclic shift index in the initial cyclic shift index set as: r isPUCCHmodNCS。
If it is not
-the terminal node 110 determines an initial cyclic shift index in the initial cyclic shift index set as rPUCCHmodNCS。
Fig. 5A shows an example of the controller 500. The controller 500 may be implemented as a controller circuit. The controller 500 may be implemented solely in hardware, with certain aspects being implemented in software including firmware alone, or may be a combination of hardware and software (including firmware).
As shown in fig. 5A, the controller 500 may be implemented using instructions that implement hardware functionality, for example, by using executable instructions of a computer program 506 in a general-purpose or special-purpose processor 502, which instructions may be stored on a computer readable storage medium (disk, memory, etc.) for execution by the processor 502.
The processor 502 is configured to read data from the memory 504 and write data to the memory 504. The processor 502 may also include an output interface via which the processor 502 outputs data and/or commands and an input interface via which the processor 502 inputs data and/or commands to the processor 502.
The memory 504 stores a computer program 506, the computer program 506 comprising computer program instructions (computer program code) which, when loaded into the processor 502, control the operation of the apparatus 110, 120. The computer program instructions of the computer program 506 provide the logic and routines that enables the apparatus to perform the methods illustrated in fig. 3 and 4. The computer program 506 can be loaded and executed by the processor 502 by reading the memory 504.
Thus, the apparatus 110 comprises:
at least one processor 502; and
at least one memory 504 including computer program code,
the at least one memory 504 and the computer program code configured to, with the at least one processor 502, cause the apparatus 110 at least to perform:
sending an uplink message (MsgA) in a two-step random access procedure;
receiving a downlink reply message (MsgB) in the two-step random access procedure, the received downlink reply message comprising an identifier for the device; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on an identifier of the apparatus and a PUCCH Resource Indicator (PRI).
Thus, the apparatus 110 comprises:
at least one processor 502; and
at least one memory 504 including computer program code,
the at least one memory 504 and the computer program code configured to, with the at least one processor 502, cause the apparatus 110 at least to perform:
after the two-step random access procedure, transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index that depends at least on a PUCCH Resource Indicator (PRI) and an identifier of the apparatus.
As shown in fig. 5B, the computer program 506 may arrive at the apparatus 110, 120 via any suitable delivery mechanism 510. The delivery mechanism 510 may be, for example, a machine-readable medium, a computer-readable medium, a non-transitory computer-readable storage medium, a computer program product, a storage device, a recording medium such as a compact disc read only memory (CD-ROM) or Digital Versatile Disc (DVD) or solid state memory, an article of manufacture that contains or tangibly embodies the computer program 506. The delivery mechanism may be a signal configured to reliably deliver the computer program 506. The apparatus 110, 120 may propagate or transmit the computer program 506 as a computer data signal.
Computer program instructions for causing the apparatus 110 to perform at least the following or for performing at least the following:
sending an uplink message (MsgA) in a two-step random access procedure;
receiving a downlink reply message (MsgB) in the two-step random access procedure, the received downlink reply message comprising an identifier for the device; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH Resource Indicator (PRI) and an identifier of the apparatus.
The computer program instructions may be embodied in a computer program, a non-transitory computer readable medium, a computer program product, a machine readable medium. In some, but not necessarily all, examples, the computer program instructions may be distributed across multiple computer programs.
Although memory 504 is shown as a single component/circuit, it may be implemented as one or more separate components/circuits, some or all of which may be integrated/removable and/or may provide permanent/semi-permanent/dynamic/cached storage.
Although the processor 502 is shown as a single component/circuit, it may be implemented as one or more separate components/circuits, some or all of which may be integrated/removable. Processor 502 may be a single-core or multi-core processor.
References to "computer-readable storage medium", "computer program product", "tangibly embodied computer program", etc. or to a "controller", "computer", "processor", etc., are to be understood as encompassing not only computers having different architectures such as single/multi-processor architectures and sequential (von neumann)/parallel architectures, but also specialized circuits such as Field Programmable Gate Arrays (FPGA), application specific circuits (ASIC), signal processing devices and other processing circuits. References to computer program, instructions, code etc. should be understood to encompass software for a programmable processor or firmware such as the programmable content of a hardware device, whether instructions for a processor or configuration settings for a fixed-function device, gate array or programmable logic device etc.
As used in this application, the term "circuitry" may refer to one or more or all of the following:
(a) hardware-only circuit implementations (e.g., implementations in only analog and/or digital circuitry) and
(b) a combination of hardware circuitry and software, for example (as applicable):
(i) combinations of analog and/or digital hardware circuitry and software/firmware, and
(ii) any portion of hardware processor having software (including digital signal processor), software and memory that work together to cause a device (e.g., mobile phone or server) to perform various functions, and
(c) a hardware circuit and/or a processor, such as a microprocessor or a portion of a microprocessor, that requires software (e.g., firmware) for operation but may be absent when such software is not required for operation.
This definition of circuitry applies to all uses of this term in this application, including in any claims. As a further example, as used in this application, the term circuitry also encompasses implementations that are hardware-only circuits or processors and their (or their) accompanying software and/or firmware. The term circuitry also encompasses baseband integrated circuits for mobile devices or similar integrated circuits in servers, cellular network devices, or other computing or network devices, for example, if applied to a particular claim element.
The stages shown in fig. 4 may represent steps in a method and/or code portions in the computer program 506. The description of a particular order of the blocks does not necessarily imply a required or preferred order to the blocks and the order or arrangement of the blocks may be varied. Furthermore, some blocks may be omitted.
Where a structural feature has been described, it may be replaced by a means for performing one or more functions of the structural feature, whether such function or those functions are explicitly or implicitly described.
As can be appreciated from the foregoing, in some examples, there is provided a system comprising:
an apparatus comprising means for:
sending an uplink message (MsgA) in a two-step random access procedure;
receiving a downlink reply message (MsgB) in the two-step random access procedure, the received downlink reply message comprising an identifier for the device; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH Resource Indicator (PRI) and an identifier of the apparatus; and
an access node comprising means for:
receiving an uplink message (MsgA) in a two-step random access procedure;
sending a downlink reply message (MsgB) in a two-step random access procedure, the received downlink reply message comprising an identifier for the device; and
an uplink acknowledgement message is received.
In some, but not necessarily all, examples, the apparatus 110 is configured to transmit data from the apparatus 110, with or without the data being stored locally in the memory 504 at the apparatus 110 and processed locally or not by circuitry or a processor at the apparatus 110.
The data may be stored remotely on one or more devices in processed or unprocessed format. The data may be stored in the cloud.
The data may be processed remotely on one or more devices. The data may be partially processed locally or partially processed remotely at one or more devices.
The data may be wirelessly transmitted to the remote device via short-range radio communication, such as Wi-Fi or bluetooth, or over a long-range cellular radio link. The apparatus may comprise a communication interface, e.g. a radio transceiver for transmitting data.
The apparatus 110 may be part of an internet of things forming part of a larger distributed network.
The processing of this data, whether local or remote, may be used for health monitoring, data aggregation, patient monitoring, vital sign monitoring, or other purposes.
The processing of this data, whether local or remote, may involve artificial intelligence or machine learning algorithms. For example, the data may be used as a learning input to train a machine learning network, or may be used as a query input to a machine learning network that provides a response. The machine learning network may use, for example, linear regression, logistic regression, vector support machine, or acyclic machine learning networks, such as single or multi-hidden layer neural networks.
The processing of this data, whether local or remote, may produce an output. The output may be communicated to the device 110 where it may produce an output that is sensitive to the object, such as an audio output, a visual output, or a tactile output.
The examples described above may be applied as the following enabling means: an automotive system; a telecommunications system; electronic systems, including consumer electronics; a distributed computing system; a media system for generating or presenting media content including audio, video and audio-video content, and mixed reality, mediated reality, virtual reality and/or augmented reality; personal systems, including personal health systems or personal fitness systems; a navigation system; a user interface, also known as a human-machine interface; networks including cellular networks, non-cellular networks, and optical networks; an ad hoc network; an internet; the Internet of things; a virtualized network; and associated software and services.
The term "comprising" as used in this document has an inclusive rather than exclusive meaning. That is, any reference to X containing Y indicates that X may include only one Y or may include multiple ys. If "comprising" is intended to be used in an exclusive sense, then it will be clear from the context that "only one" is included or "consisting" is used.
In this specification, various examples are referenced. The description of features or functions relating to an example indicates the presence of such features or functions in the example. The use of the terms "example" or "exemplary" or "may" in this document indicates that these features or functions may, but need not, be present in some or all of the other examples, whether or not explicitly stated to be present in at least the described examples, and whether or not described as examples. Thus, "examples," e.g., "may" or "may" refer to particular instances of a class of examples. The property of an instance may be that of the instance only, may be that of the class, or may be that of a subclass containing some, but not all, of the instances in the class. Thus, it is implicitly disclosed that features described with reference to one example but not with reference to another may be used in said another example as part of a working combination where possible, but do not necessarily have to be used in said another example.
Although embodiments have been described in the preceding paragraphs with reference to various examples, it should be appreciated that modifications to the examples given can be made without departing from the scope of the claims.
The features described in the above description may be used in other combinations than the combinations explicitly described above.
Although functions have been described with reference to certain features, the functions may be performed by other features, whether described or not.
Although features have been described with reference to certain embodiments, the features may be present in other embodiments whether described or not.
The terms "a" and "an" or "the" as used in this document have an inclusive rather than exclusive meaning. That is, any reference to X containing one Y or the same Y means that X may contain only one Y or may contain multiple ys, unless the context clearly dictates otherwise. If the use of "a" or "the" is intended in an exclusive sense, this should be explicitly stated in the context. In some cases, "at least one" or "one or more" may be used to emphasize inclusive meanings, but the absence of such terms should not be taken to infer or exclude meanings.
The presence of a feature (or a combination of features) in a claim is a reference to that feature or to itself, and also to features which achieve substantially the same technical effect (equivalent features). For example, equivalent features include features that are variants and achieve substantially the same result in substantially the same way. For example, equivalent features include features that perform substantially the same function in substantially the same way to achieve substantially the same result.
In this specification, various examples using adjectives or adjective phrases to describe example features are referenced. Such characterization of examples indicates that the feature exists entirely as described in some examples, and substantially as described in other examples.
Whilst endeavoring in the foregoing specification to draw attention to those features believed to be of importance it should be understood that the applicant claims protection in respect of any patentable feature or combination of features hereinbefore referred to and/or shown in the drawings whether or not particular emphasis has been placed thereon.
Claims (15)
1. An apparatus comprising means for:
transmitting an uplink message in a two-step random access procedure;
receiving a downlink response message in the two-step random access procedure, the received downlink response message including an identifier of the apparatus; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH resource indicator and the identifier of the apparatus.
2. The apparatus of claim 1, wherein the PUCCH Resource Indicator (PRI) is received from Downlink Control Information (DCI) and/or from the downlink response message (MsgB).
3. The apparatus of claim 1 or 2, wherein the PUCCH resource index depends on at least a PUCCH resource index suitable for four-step random access and the identifier of the apparatus, wherein the PUCCH resource index suitable for four-step random access depends on the PUCCH resource indicator.
4. An apparatus as claimed in any preceding claim, wherein the PUCCH resource index is dependent on the identifier of the apparatus in that the PUCCH resource index is dependent on an index position of the identifier of the apparatus in the received downlink acknowledgement message.
5. The apparatus of any of claims 1-3, wherein the PUCCH resource index is dependent on the identifier of the apparatus in that the PUCCH resource index is dependent on an offset associated with the identifier of the apparatus.
6. The apparatus of claim 5, wherein the offset is received from the received downlink acknowledgement message or from Downlink Control Information (DCI).
7. The apparatus of any preceding claim, wherein the PUCCH resources available for the uplink acknowledgement message are indicated via the received Downlink Control Information (DCI).
8. An apparatus as claimed in any preceding claim, wherein the PUCCH resource index is dependent on a first index value dependent on the PUCCH Resource Indicator (PRI), the PUCCH Resource Indicator (PRI) being offset by a second value dependent on the identifier of the apparatus.
9. The apparatus of claim 8, comprising means for: performing additional processing to determine a PUCCH resource for transmitting the uplink acknowledgement message when the PUCCH resource index exceeds a maximum allowed value.
10. The apparatus of claim 9, wherein the determined resource is determined from a seed received within the received downlink acknowledgement message, or wherein the determined resource is determined by applying a modulo operation on the PUCCH resource index.
11. The apparatus of any preceding claim, comprising means for: receiving another downlink acknowledgement message specifying a new PUCCH resource indicator and/or a new slot for the uplink acknowledgement message.
12. An apparatus as claimed in any preceding claim, wherein the PUCCH resource index is reset to a minimum allowed value when the PUCCH resource index exceeds a maximum allowed value.
13. The apparatus of any preceding claim, wherein the uplink acknowledgement message is sent in a time slot determined by an indicator received via downlink control information or in the received downlink acknowledgement message.
14. Computer program instructions for causing an apparatus to perform at least the following or for performing at least the following:
transmitting an uplink message in a two-step random access procedure;
receiving a downlink response message in the two-step random access procedure, the received downlink response message including an identifier of the apparatus; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH resource indicator and the identifier of the apparatus.
15. A method, comprising:
transmitting an uplink message in a two-step random access procedure;
receiving a downlink response message in the two-step random access procedure, the received downlink response message including an identifier of the apparatus; and
transmitting an uplink acknowledgement message using a PUCCH resource determined by a PUCCH resource index, wherein the PUCCH resource index depends at least on a PUCCH resource indicator and the identifier of the apparatus.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2019/075493 WO2020168469A1 (en) | 2019-02-19 | 2019-02-19 | Communicating between a terminal and a wireless network node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113439467A true CN113439467A (en) | 2021-09-24 |
| CN113439467B CN113439467B (en) | 2024-03-19 |
Family
ID=72143912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201980092440.5A Active CN113439467B (en) | 2019-02-19 | 2019-02-19 | Communication between a terminal and a radio network node |
Country Status (5)
| Country | Link |
|---|---|
| EP (1) | EP3928572A4 (en) |
| CN (1) | CN113439467B (en) |
| AR (1) | AR118135A1 (en) |
| TW (1) | TWI745866B (en) |
| WO (1) | WO2020168469A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115733598A (en) * | 2021-09-01 | 2023-03-03 | 华为技术有限公司 | Communication method and communication device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016161629A1 (en) * | 2015-04-10 | 2016-10-13 | Mediatek Singapore Pte. Ltd. | Methods and apparatus for pucch resource allocation of mtc |
| CA3019611A1 (en) * | 2016-04-01 | 2017-10-05 | Huawei Technologies Co., Ltd. | Harq systems and methods for grant-free uplink transmissions |
| US20180103465A1 (en) * | 2016-10-07 | 2018-04-12 | Samsung Electronics Co., Ltd. | Method and apparatus for enhanced contention based random access procedure |
| US20180124822A1 (en) * | 2016-11-01 | 2018-05-03 | Qualcomm Incorporated | Two step random access procedure |
| CN108029120A (en) * | 2015-09-25 | 2018-05-11 | 索尼公司 | Method for the resource distributed for the instruction of low complex degree narrowband terminal the HARQ message in random access procedure |
| CN108282901A (en) * | 2017-01-06 | 2018-07-13 | 电信科学技术研究院 | A kind of random access response method and apparatus |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107889273B (en) * | 2016-09-30 | 2023-12-29 | 北京三星通信技术研究有限公司 | Random access method and corresponding equipment |
| BR112021016034A2 (en) * | 2019-02-13 | 2021-11-09 | Idac Holdings Inc | Method implemented by a wireless transmit/receive unit, and, wireless transmit/receive unit |
-
2019
- 2019-02-19 EP EP19915996.3A patent/EP3928572A4/en active Pending
- 2019-02-19 CN CN201980092440.5A patent/CN113439467B/en active Active
- 2019-02-19 WO PCT/CN2019/075493 patent/WO2020168469A1/en active Search and Examination
-
2020
- 2020-02-17 TW TW109105026A patent/TWI745866B/en active
- 2020-02-18 AR ARP200100451A patent/AR118135A1/en active IP Right Grant
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016161629A1 (en) * | 2015-04-10 | 2016-10-13 | Mediatek Singapore Pte. Ltd. | Methods and apparatus for pucch resource allocation of mtc |
| CN108029120A (en) * | 2015-09-25 | 2018-05-11 | 索尼公司 | Method for the resource distributed for the instruction of low complex degree narrowband terminal the HARQ message in random access procedure |
| CA3019611A1 (en) * | 2016-04-01 | 2017-10-05 | Huawei Technologies Co., Ltd. | Harq systems and methods for grant-free uplink transmissions |
| US20180103465A1 (en) * | 2016-10-07 | 2018-04-12 | Samsung Electronics Co., Ltd. | Method and apparatus for enhanced contention based random access procedure |
| US20180124822A1 (en) * | 2016-11-01 | 2018-05-03 | Qualcomm Incorporated | Two step random access procedure |
| CN108282901A (en) * | 2017-01-06 | 2018-07-13 | 电信科学技术研究院 | A kind of random access response method and apparatus |
Non-Patent Citations (2)
| Title |
|---|
| ERICSSON: ""R1-1803393 Outcome of offline session on RACH and DCI "", 3GPP TSG_RAN\\WG1_RL1 * |
| SAMSUNG: "Discussion on transmission in preconfigured UL resources for MTC", 3GPP TSG_RAN\\WG1_RL1 * |
Also Published As
| Publication number | Publication date |
|---|---|
| TWI745866B (en) | 2021-11-11 |
| TW202041087A (en) | 2020-11-01 |
| CN113439467B (en) | 2024-03-19 |
| EP3928572A4 (en) | 2022-08-24 |
| WO2020168469A1 (en) | 2020-08-27 |
| AR118135A1 (en) | 2021-09-22 |
| EP3928572A1 (en) | 2021-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11665694B2 (en) | Method and apparatus for enhanced contention based random access procedure | |
| US10779329B2 (en) | Random access response transmission method and device | |
| RU2739330C1 (en) | Random access with switching of parts of bandwidth | |
| CN112753274A (en) | Method and apparatus for supporting multiple message a sizes and uplink coverage for 2-step random access procedure | |
| EP2549822B1 (en) | Method of handling random access response | |
| CN110945957A (en) | Method and apparatus for performing random access procedure | |
| CN107624262B (en) | Method for assigning resources for dedicated scheduling requests using MAC messages, and related wireless terminal and base station | |
| KR20210131458A (en) | Method and apparatus for switching and contention resolution between two-step and four-step random access (RA) procedures | |
| CN110603887B (en) | Multiple PRACH preamble and random access response | |
| WO2020220306A1 (en) | Resource indication in random access | |
| US20220022265A1 (en) | Communicating between a terminal and a wireless network node | |
| WO2021057793A1 (en) | Method and apparatus for random access procedure | |
| KR20200076736A (en) | Method, apparatus, computer-readable storage and carrier for random access | |
| TWI511597B (en) | Method of preventing random access response collision | |
| CN113439467B (en) | Communication between a terminal and a radio network node | |
| JP2020505837A (en) | Control plane latency reduction in wireless communication networks | |
| WO2024077639A1 (en) | Hybrid automatic request (harq) feedback | |
| WO2019158096A1 (en) | Method and device for transmitting data during random access | |
| TW201911936A (en) | Apparatus and method for processing random access program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |