WO2020168469A1 - Communication entre un terminal et un nœud de réseau sans fil - Google Patents

Communication entre un terminal et un nœud de réseau sans fil Download PDF

Info

Publication number
WO2020168469A1
WO2020168469A1 PCT/CN2019/075493 CN2019075493W WO2020168469A1 WO 2020168469 A1 WO2020168469 A1 WO 2020168469A1 CN 2019075493 W CN2019075493 W CN 2019075493W WO 2020168469 A1 WO2020168469 A1 WO 2020168469A1
Authority
WO
WIPO (PCT)
Prior art keywords
pucch resource
identifier
message
dependent
index
Prior art date
Application number
PCT/CN2019/075493
Other languages
English (en)
Inventor
Samuli Turtinen
Kari Hooli
Sami Hakola
Chunli Wu
Original Assignee
Nokia Shanghai Bell Co., Ltd.
Nokia Solutions And Networks Oy
Nokia Technologies Oy
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nokia Shanghai Bell Co., Ltd., Nokia Solutions And Networks Oy, Nokia Technologies Oy filed Critical Nokia Shanghai Bell Co., Ltd.
Priority to EP19915996.3A priority Critical patent/EP3928572A4/fr
Priority to CN201980092440.5A priority patent/CN113439467B/zh
Priority to PCT/CN2019/075493 priority patent/WO2020168469A1/fr
Priority to TW109105026A priority patent/TWI745866B/zh
Priority to ARP200100451A priority patent/AR118135A1/es
Publication of WO2020168469A1 publication Critical patent/WO2020168469A1/fr

Links

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

Definitions

  • Embodiments of the present disclosure relate to communicating between a terminal and a wireless network node.
  • a wireless network comprises a plurality of network nodes including terminal nodes and access nodes.
  • the terminal nodes and access nodes communicate with each other wirelessly.
  • FIG. 1 shows an example embodiment of the subject matter described herein
  • FIG. 2 shows another example embodiment of the subject matter described herein
  • FIG. 3 shows another example embodiment of the subject matter described herein
  • FIG. 4 shows another example embodiment of the subject matter described herein
  • FIG. 5A shows another example embodiment of the subject matter described herein
  • FIG. 5B shows another example embodiment of the subject matter described herein
  • FIG 1 illustrates an example of a network 100 comprising a plurality of network nodes including terminal nodes 110, access nodes 120 and one or more core nodes 1129.
  • the terminal nodes 110 and access nodes 120 communicate with each other.
  • the one or more core nodes 129 communicate with the access nodes 120.
  • the one or more core nodes 129 may, in some examples, communicate with each other.
  • the one or more access nodes 120 may, in some examples, communicate with each other.
  • the network 100 may be a cellular network comprising a plurality of cells 122 each served by an access node 120.
  • the interface between the terminal nodes 110 and an access node 120 defining a cell 122 is a wireless interface 124.
  • the access node 120 is a cellular radio transceiver.
  • the terminal nodes 110 are cellular radio transceivers.
  • the cellular network 100 is a third generation Partnership Project (3GPP) network in which the terminal nodes 110 are user equipment (UE) and the access nodes 120 are base stations.
  • 3GPP third generation Partnership Project
  • the network 100 is an Evolved Universal Terrestrial Radio Access network (E-UTRAN) .
  • the E-UTRAN consists of E-UTRAN NodeBs (eNBs) 120, providing the E-UTRA user plane and control plane (RRC) protocol terminations towards the UE 110.
  • the eNBs 120 are interconnected with each other by means of an X2 interface 126.
  • the eNBs are also connected by means of the S1 interface 128 to the Mobility Management Entity (MME) 129.
  • MME Mobility Management Entity
  • the network 100 is a Next Generation (or New Radio, NR) Radio Access network (NG-RAN) .
  • the NG-RAN consists of gNodeBs (gNBs) 120, providing the user plane and control plane (RRC) protocol terminations towards the UE 110.
  • the gNBs 120 are interconnected with each other by means of an X2/Xn interface 126.
  • the gNBs are also connected by means of the N2 interface 128 to the Access and Mobility management Function (AMF) .
  • AMF Access and Mobility management Function
  • MTC machine type communications
  • IoT Internet of Things
  • a UE 110 may transmit to network 100 to enable the network to classify the UE 110 for latency requirements, data bandwidth requirements and mobility requirements.
  • a Physical Layer Enhancements for Machine Type Communications (eMTC) protocol may use a reduced bandwidth of 1.4MHz.
  • eMTC Machine Type Communications
  • a narrowband internet of things (NB-IoT) protocol uses a reduced bandwidth of 200kHz. The expected mobility of a UE 110 performing the NB-IoT protocol is very low. For NB-IoT protocol there is no handover in the connected mode 132.
  • UEs 110 can be operating at different coverage enhancement levels. This means, that in the same cell 122, different UEs 110 may be using the same logical channels but the characteristics (narrowband resources, repetitions, etc) of the corresponding physical channels can be very different between UEs 110 operating at different coverage enhancement levels.
  • FIG 2 illustrates an example of different modes 130, 132 of a UE 110 and transitions 131, 133 between the modes 130, 132.
  • the connected mode 132 is a mode that enables communication between the UE 110 and the network 100 at higher layers, for example to enable the communication of application data or higher layer signaling.
  • the Random Access procedure is used for transition 131 from the idle mode (or inactive mode) 130 to the connected mode, as well as in connected mode when the UE 110 is UL out-of-sync or to request UL resource when there is no dedicated scheduling request resource configured, or to recover from beam failure, for instance.
  • a transition 133 from the connected mode 132 to the idle mode 130 may, for example, occur on release of the connection or radio link failure.
  • the idle or inactive mode 130 corresponds to RRC_IDLE or RRC_INACTIVE, respectively, and the connected mode corresponds to RRC_CONNECTED.
  • the transition 131 corresponds to RRC Connection Establishment, RRC Connection Re-establishment, RRC Connection Resume or Early Data Transmission (EDT) , for instance.
  • the transition 133 corresponds to RRC Connection RELEASE (also Radio Link Failure) , for instance.
  • terminal node 110 In the following a terminal node 110 will be referred to as a terminal 110.
  • a terminal 110 is a device that terminates the cell side of the radio link. It is a device allowing access to network services.
  • the terminal 110 may be a mobile terminal.
  • the terminal 110 may be user equipment or mobile equipment.
  • User equipment is mobile equipment plus a subscriber identity module (SIM) .
  • SIM subscriber identity module
  • An access node 120 is a network element in radio access network responsible for radio transmission and reception in one or more cells 122 to or from terminals 110.
  • the access node 120 is the network termination of the radio link.
  • the access node 120 operates as a NodeB, eNodeB, gNodeB.
  • FIG 3 illustrates an example of a 4-step contention based random access procedure 200.
  • An example of a contention based random access procedure is described at section 10.1.5 of 3GPP TS 36.300 (2018, Rel15) .
  • the contention based random access procedure is a common procedure for frequency division duplex (FDD) and time division duplex (TDD) .
  • the contention based random access procedure can for example be used for initial access from RRC_IDLE. This may be performed for RRC Connection Establishment, RRC Connection Re-establishment or Early data Transmission (EDT) or other reasons.
  • the 4-step contention based random access procedure 200 starts, at the first step, when a terminal node 110 sends to an access node 120 an uplink initiation message (Msg1) 202.
  • Msg1 202 is sent in the logical Random Access Channel (RACH) and, physically, in the Physical Random Access Channel (PRACH) .
  • the terminal node 110 selects random access resources including e.g. random access occasions (ROs) and preamble group within the selected ROs based on testing at the terminal node 110 of conditions broadcast on system information and randomly selecting one preamble.
  • Such conditions may include a signal level (like RSRP, RSRQ, SINR) of a beam, for instance.
  • the access node 120 responds to receiving an 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 the Random Access Response in 3GPP TS 36.300 section 10.1.5 (2018, Rel 15) .
  • the Random Access Response additionally includes timing alignment information used to determine timing advance. It is addressed to RA-RNTI on PDCCH.
  • the Random Access RNTI (RA-RNTI) unambiguously identifies within a configured window (Random Access Response window) which time-frequency resource was utilized by the terminal node 110 to transmit the Random Access Preamble 202.
  • the terminal node 110 uses the timing advance to advance/delay its timings of transmissions to the access node 120 so as to compensate for propagation delay between the terminal node 110 and the access node 120.
  • the terminal node 110 responds to receiving the 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.
  • the uplink connection request 206 can comprise an identifier of the terminal node 110.
  • the uplink connection request 206 is the Scheduled Transmission in 3GPP TS 36.300 section 10.1.5 (2018, Rel 15) .
  • the identifier of the terminal node 110 is the UE identifier.
  • the Scheduled Transmission 206 is sent according to the initial uplink grant provided in the Random Access Response 204.
  • the Scheduled Transmission can include a RRC Connection Request, a RRC Connection Re-establishment Request, RRC Connection Resume Request or, if early data transmission (EDT) is enabled a RRC EarlyDataRequest, or in one possibility it does not include RRC message but C-RNTI MAC CE (Medium Access Control Control Element) for connected mode terminal nodes.
  • EDT early data transmission
  • C-RNTI MAC CE Medium Access Control Control Element
  • the access node 120 responds to receiving the uplink connection request 206 by sending a downlink response (Msg4) 208 from the access node 120 to the terminal node 110.
  • the downlink response 208 to the uplink connection request 206 includes an identifier of the terminal node 110 received in the uplink connection request 206.
  • the downlink response 208 to the uplink connection request 206 is the Contention Resolution in 3GPP TS 36.300 section 10.1.5 (2018, Rel 15) .
  • the contention resolution happens in the fourth step by including either the terminal node’s contention resolution ID into the contention resolution MAC PDU (IDLE/INACTIVE mode terminal nodes) or by scheduling directly with the terminal node’s C-RNTI (CONNECTED mode terminal nodes) .
  • the terminal node 110 Concentrating solely on the IDLE/INACTIVE mode terminal nodes, the terminal node 110 that decodes its contention resolution ID from the MAC PDU then sends a HARQ ACK to the access node 120 (NACK is not transmitted as the terminal node 110 does not obviously know if the contention resolution message was for it or not) .
  • a terminal node 110 transmits HARQ ACK/NACK feedback for the Msg4 208.
  • a PUCCH resource set is provided by pucch-ResourceCommon signalled in RMSI through an index to a row of Table 9.2.1-1 in 3GPP TS 38.213 (2018, Rel 15) for transmission of HARQ-ACK information on PUCCH in an initial uplink BWP of PRBs.
  • the PUCCH resource set includes sixteen resources (16 index values) , each corresponding to:
  • a cyclic shift index set for a PUCCH transmission is a cyclic shift index set for a PUCCH transmission.
  • the terminal node 110 transmits a PUCCH using frequency hopping.
  • An orthogonal cover code with index 0 is used for a PUCCH resource with PUCCH format 1 in Table 9.2.1-1.
  • the terminal node 110 determines a PUCCH resource with PUCCH resource index r PUCCH , 0 ⁇ r PUCCH ⁇ 15, as where N CCE is a number of CCEs in a CORESET of a PDCCH reception,
  • n CCE, 0 is the index of a first CCE for the PDCCH reception
  • ⁇ PRI is a value of the PUCCH resource indicator field in the DCI.
  • the terminal node 110 determines the PRB index of the PUCCH transmission in the first hop as and the PRB index of the PUCCH transmission in the second hop as
  • N CS is the total number of initial cyclic shift indexes in the set of initial cyclic shift indexes
  • the terminal node 110 determines the initial cyclic shift index in the set of initial cyclic shift indexes as r PUCCH modN CS .
  • the terminal node 110 determines the PRB index of the PUCCH transmission in the first hop as and the PRB index of the PUCCH transmission in the second hop as
  • the terminal node 110 determines the initial cyclic shift index in the set of initial cyclic shift indexes as (r PUCCH -8) modN CS .
  • PDCCH scheduling of PDSCH provides, in DCI, a time domain allocation (PDSCH-to-HARQ_feedback timing indicator) . This determines a time slot for the determined PUCCH resource.
  • the PDSCH-to-HARQ-timing-indicator field values map to ⁇ 1, 2, 3, 4, 5, 6, 7, 8 ⁇ .
  • HARQ ACK/NACK feedback for Msg4 208 PDSCH is transmitted after collision resolution, i.e. only one terminal node 110 which decodes its contention resolution ID would be transmitting the HARQ ACK.
  • FIG 4 illustrates an example of a 2-step contention based random access procedure 300. This can be supported in addition to the 4-step random access procedure 200.
  • the 2-step contention based random access procedure 300 starts, at the first step, when the terminal node 110 sends to the access node 120 an uplink initiation message (MsgA) 302 of the 2-step random access procedure.
  • the MsgA may comprise of a randomly selected PRACH preamble over PRACH and PUSCH data transmission over PUSCH, ie., it may be 1 or 2 transmissions but is considered as one step.
  • the access node 120 responds to receiving an uplink initiation message (MsgA) 302 of the 2-step random access procedure by sending a downlink reply message (MsgB) 304 from the access node 120 to the terminal node 110.
  • MsgA uplink initiation message
  • MsgB downlink reply message
  • the 2-step contention based random access procedure 200 differs from the 4-step contention based random access procedure 200 in that the response to the random access request enables contention resolution without further messaging, for example, without first providing an uplink grant for contention resolution.
  • MsgA 302 is a signal to detect the terminal node 110 and provides a Msg3 payload while MsgB 304 is for contention resolution for contention based random access (CBRA) with a possible payload.
  • MsgA 302 will at least include the equivalent information that is transmitted in Msg3 for the 4-step contention based random access procedure 200. All the triggers for the 4-step contention based random access procedure 200 are also applicable to the 2-step contention based random access procedure 300.
  • the contention resolution in the 2-step procedure 300 will be performed by including a terminal node identifier 310 (UE identifier) in the first message MsgA 302 which is echoed in the second message MsgB 304.
  • the type of terminal node identifier (s) 310 may be for example the RRC connection setup message/RRC connection resume message/re-establishment request message which contains the UE ID or number of least/most significant bits of the sent RRC message thereto (like 48 MSBs or LSBs) , or C-RNTI MAC CE.
  • the terminal node identifier (s) 310 may be echoed in the second message MsbG 304 by using a UE Contention Resolution MAC CE.
  • the MsgB 304 can include responses to multiple terminal nodes 110 (similarly to Msg2 204 in the 4-step procedure 200) .
  • the payload on PUSCH resource could be different.
  • MsgB 304 could include contention resolution ID (the echoed terminal node identifier 310) for multiple terminal nodes 110 which succeeded in the MsgA 302 transmission.
  • MsgB 304 can include contention resolution ID 310 of several terminal nodes 110, the acknowledgement (HARQ ACK acknowledging the reception of the contention resolution message MsgB 304) resources for all the terminal nodes 110 should be unique for each terminal node 110 that sends an acknowledgement so that the access node 120 can determine which terminal nodes 110 received the message MsgB 304.
  • a PUCCH resource set is provided e.g. by pucch-ResourceCommon or some other information element signalled e.g. in RMSI.
  • the terminal node 110 can determine PUCCH resource for acknowledgement from the PUCCH resource set or, in some examples, from PRBs outside the PUCCH resource set but using the PUCCH format, first symbol, duration, PRB offset, and a cyclic shift index set indicated for the PUCCH resource set.
  • the terminal node 110 determines PUCCH resource for the HARQ ACK transmission (acknowledging 306 the PDSCH carrying MsgB 304) in this case the access node 120 does or could transmit in a single MsgB 304 multiple contention resolution IDs 310 for multiple terminal nodes 110.
  • the terminal node 110 determines PUCCH transmission time and resource for HARQ ACK based on the information provided in DCI scheduling MsgB 304 as well as within the MsgB 304.
  • the information differentiating the PUCCH resources between terminal nodes 110 is contained in the MsgB 304 and may be explicit and/or implicit, e.g. the index position of the echoed terminal node identifier 310 (contention resolution ID) in the MsgB 304.
  • the acknowledgement 306 can be transmitted by multiple terminal nodes 110 using orthogonal resources to acknowledge individual contention resolution success.
  • the method 300 in addition to sending an uplink message (MsgA) 302 in a two-step random access procedure 300 and receiving a downlink reply message (MsgB) 304 in the two-step random access procedure 300 comprises: sending an uplink acknowledgement message 306 using a PUCCH resource determined by a PUCCH resource index wherein the PUCCH resource index is dependent upon, at least, a PUCCH resource indicator (PRI) and an identifier 310 of the apparatus 110 received in the downlink reply message (MsgB) 304.
  • MsgA uplink message
  • MsgB downlink reply message
  • the PUCCH resource indicator (PRI) is received from downlink control information (DCI) and/or from the downlink reply message (MsgB 304) .
  • DCI downlink control information
  • MsgB 304 downlink reply message
  • PRI first PUCCH resource indicator
  • the terminal node 110 determines its valid PUCCH resource for transmission of the acknowledgement 306 based on the PUCCH resource indicator (PRI) and the index position of the terminal node’s contention resolution ID 310 in the MsgB 304.
  • PRI PUCCH resource indicator
  • the slot for transmission of the acknowledgement 306 is determined based on the PDSCH-to-HARQ_feedback timing indicator in the received scheduling DCI or alternatively provided inside the MsgB 304.
  • the PUCCH resource index is dependent upon, at least, a 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 is dependent upon the PUCCH resource indicator (PRI) :
  • the PUCCH resource index is dependent upon the identifier 310 of the terminal node 110 because it is dependent upon an index position of the identifier 310 of the terminal node 110 in the received downlink reply message (MsgB) 304.
  • the PUCCH resource index is dependent upon the identifier 310 of the terminal node 110 because it is dependent upon an offset associated with the identifier 310 of the terminal node 110.
  • the offset is received from the received downlink reply message (MsgB) 304 or from downlink control information (DCI) .
  • the PUCCH resources available for the uplink acknowledgement message 306 are reserved via received downlink control information (DCI) .
  • DCI downlink control information
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • PRI PUCCH resource indicator
  • an additional process is performed to determine a PUCCH resource for sending the uplink acknowledgement message 306.
  • the determined resource is determined from a seed received within the received downlink reply message (MsgB) 304 or the determined resource is determined by applying a modulo 16 operation to the PUCCH resource index.
  • the method 300 comprises receiving a further downlink reply message 304 that specifies a new PUCCH resource indicator (PRI) and/or a new slot for the uplink acknowledgement message 306.
  • PRI PUCCH resource indicator
  • the PUCCH resource index exceeds a maximum permissible value, it is reset to a minimum permissible value.
  • the uplink acknowledgement message 306 is sent in a time slot determined by an indicator received via downlink control information (DCI) or in the received downlink reply message 304.
  • DCI downlink control information
  • the method 300 can be implemented in a variety of different ways, as will be better understood from the following examples.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • PRI PUCCH resource indicator
  • the first index value is dependent upon, at least, a 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 is dependent upon the PUCCH resource indicator (PRI) .
  • PRI PUCCH resource indicator
  • the index position (e.g., #0, #1, #2 and so on) of the terminal node’s contention resolution ID could be summed to the PUCCH resource index r PUCCH (determined by PRI and the index of the first CCE) .
  • an additional process is performed to determine a PUCCH resource for sending the uplink acknowledgement message 306, such as for example, receiving a further downlink reply message 304 that specifies a new PUCCH resource indicator and/or a new slot for the uplink acknowledgement message 306.
  • the network 100 should schedule another MsgB 304 with PUCCH resource indicator and PDSCH-to-HARQ_feedback timing indicator pointing to different UL slot. This gives the network 100 the possibility to reserve some of the PUCCH resources for other downlink transmissions.
  • DCI scheduling of MsgB or MsgB itself may include an indication that there will another MsgB transmission for the same RO (e.g., same RA-RNTI within the same RAR window) coming. That would allow terminal nodes 110 to potentially ignore other MsgBs 304 for the same RO in case the first detected MsgB 304 didn’t include terminal node’s contention resolution ID.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • each index position of contention resolution ID 310 provides its own resource offset value that is then used together with the PUCCH resource indicator (PRI) given in DCI (e.g. summing the resource offset value to PUCCH resource indicator (PRI) in PDCCH and applying modulo operation in base 16) .
  • This approach would provide high flexibility with the cost of increased MsgB 304 payload.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • scheduling DCI has a set of bits mapped to each index position of contention resolution ID 310 where the set of bits acts as a relative value to be applied to the common PUCCH resource indicator in the DCI.
  • altogether 6 bits would be needed in DCI for providing up to three PUCCH resources (and up to three terminal nodes 110) in addition to the first PUCCH resource indicated by the PRI in the scheduling DCI.
  • the PUCCH resources available for the uplink acknowledgement message 306 are reserved via received downlink control information (DCI) .
  • DCI downlink control information
  • the network 100 configures the maximum value of the PUCCH resource index that can be used by the terminal nodes 110 sending HARQ ACK for their contention resolution messages; the lower bound for PUCCH resource index is signaled by the PUCCH resource indicator and the first CCE of the scheduling DCI. This enables reservation of PUCCH resources, e.g. PUCCH resources indicated by indices 3-10 for the contention resolution purpose and other PUCCH resources are available for any other use.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • DCI may include also a step size per index position that is summed to the PUCCH resource index r PUCCH (determined by PRI and the index of the first CCE) E.g. DCI indicates step size equal to two, then terminal node 110 with index position #1 would add two and terminal node 110 with index position #2 would add four. This would require e.g. 2 bits in DCI to provide flexibility for the gNB (step sizes 1, 2, 3, 4. The step size could be signaled as part of MsgB 304 content as well.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier 310 of the terminal node 110.
  • PRI PUCCH resource indicator
  • an additional process is performed to determine a PUCCH resource for sending the uplink acknowledgement message 306.
  • the determined resource is determined from a seed received within the received downlink reply message (MsgB) 304. For example, once the PUCCH resources are exhausted for one uplink slot, the MsgB 304 could indicate a new “seed” for the further contention resolution messages included in the same MsgB 304.
  • This may include providing the first CCE index, first PUCCH resource indicator (PIR) and either new PDSCH-to-HARQ-timing-indicator or PUCCH resource index offset which are used by the next terminal node 110 indexed in the MsgB 304 and the terminal nodes 110 after that use the approaches described above.
  • PUCCH resources offset r offset would be summed on the PUCCH resource index r offset determined by the approaches above to obtain actual PUCCH resource index.
  • the PUCCH resource index is dependent upon a first index value dependent upon the PUCCH resource indicator (PRI) that is offset by a second value dependent upon the identifier of the terminal node 110.
  • PRI PUCCH resource indicator
  • an additional process is performed to determine a PUCCH resource for sending the uplink acknowledgement message 306.
  • the PRB index may e.g. be determined for r PUCCH > 15 by:
  • the terminal node 110 determines the PRB index of the PUCCH transmission in the first hop as and the PRB index of the PUCCH transmission in the second hop as where N CS is the total number of initial cyclic shift indexes in the set of initial cyclic shift indexes
  • the terminal node 110 determines the initial cyclic shift index in the set of initial cyclic shift indexes as
  • the terminal node 110 determines the PRB index of the PUCCH transmission in the first hop as and the PRB index of the PUCCH transmission in the second hop as
  • the terminal node 110 determines the initial cyclic shift index in the set of initial cyclic shift indexes as
  • Fig 5A illustrates an example of a controller 500.
  • Implementation of a controller 500 may be as controller circuitry.
  • the controller 500 may be implemented in hardware alone, have certain aspects in software including firmware alone or can be a combination of hardware and software (including firmware) .
  • controller 500 may be implemented using instructions that enable hardware functionality, for example, by using executable instructions of a computer program 506 in a general-purpose or special-purpose processor 502 that may be stored on a computer readable storage medium (disk, memory etc) to be executed by such a processor 502.
  • a general-purpose or special-purpose processor 502 may be stored on a computer readable storage medium (disk, memory etc) to be executed by such a processor 502.
  • the processor 502 is configured to read from and write to the memory 504.
  • the processor 502 may also comprise an output interface via which data and/or commands are output by the processor 502 and an input interface via which data and/or commands are input to the processor 502.
  • the memory 504 stores a computer program 506 comprising computer program instructions (computer program code) that controls the operation of the apparatus 110, 120 when loaded into the processor 502.
  • the computer program instructions, of the computer program 506, provide the logic and routines that enables the apparatus to perform the methods illustrated in Figs 3 and 4.
  • the processor 502 by reading the memory 504 is able to load and execute the computer program 506.
  • the apparatus 110 therefore comprises:
  • processor 502 At least one processor 502;
  • 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:
  • MsgA uplink message
  • MsgB downlink reply message
  • the apparatus 110 therefore comprises:
  • processor 502 At least one processor 502;
  • 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:
  • 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 memory device, a record medium such as a Compact Disc Read-Only Memory (CD-ROM) or a Digital Versatile Disc (DVD) or a solid state memory, an article of manufacture that comprises or tangibly embodies the computer program 506.
  • the delivery mechanism may be a signal configured to reliably transfer the computer program 506.
  • the apparatus 110, 120 may propagate or transmit the computer program 506 as a computer data signal.
  • MsgA uplink message
  • MsgB downlink reply message
  • the computer program instructions may be comprised 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 over more than one computer program.
  • memory 504 is illustrated as a single component/circuitry it may be implemented as one or more separate components/circuitry some or all of which may be integrated/removable and/or may provide permanent/semi-permanent/dynamic/cached storage.
  • processor 502 is illustrated as a single component/circuitry it may be implemented as one or more separate components/circuitry some or all of which may be integrated/removable.
  • the 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 a ‘controller’ , ‘computer’ , ‘processor’ etc. should be understood to encompass 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 circuitry.
  • References to computer program, instructions, code etc. should be understood to encompass software for a programmable processor or firmware such as, for example, 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.
  • circuitry may refer to one or more or all of the following:
  • circuitry also covers an implementation of merely a hardware circuit or processor and its (or their) accompanying software and/or firmware.
  • circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit for a mobile device or a similar integrated circuit in a server, a cellular network device, or other computing or network device.
  • the stages illustrated in the Figs 4 may represent steps in a method and/or sections of code in the computer program 506.
  • the illustration of a particular order to the blocks does not necessarily imply that there is a required or preferred order for the blocks and the order and arrangement of the block may be varied. Furthermore, it may be possible for some blocks to be omitted.
  • an apparatus comprising means for:
  • MsgA uplink message
  • MsgB downlink reply message
  • an access node comprising means for:
  • the apparatus 110 is configured to communicate data from the apparatus 110 with or without local storage of the data in a memory 504 at the apparatus 110 and with or without local processing of the data by circuitry or processors at the apparatus 110.
  • the data may be stored in processed or unprocessed format remotely at one or more devices.
  • the data may be stored in the Cloud.
  • the data may be processed remotely at one or more devices.
  • the data may be partially processed locally and partially processed remotely at one or more devices.
  • the data may be communicated to the remote devices wirelessly via shod range radio communications such as Wi-Fi or Bluetooth, for example, or over long range cellular radio links.
  • the apparatus may comprise a communications interface such as, for example, a radio transceiver for communication of data.
  • the apparatus 110 may be part of the Internet of Things forming part of a larger, distributed network.
  • the processing of the data may be for the purpose of health monitoring, data aggregation, patient monitoring, vital signs monitoring or other purposes.
  • the processing of the data may involve artificial intelligence or machine learning algorithms.
  • the data may, for example, be used as learning input to train a machine learning network or may be used as a query input to a machine learning network, which provides a response.
  • the machine learning network may for example use linear regression, logistic regression, vector support machines or an acyclic machine learning network such as a single or multi hidden layer neural network.
  • the processing of the data may produce an output.
  • the output may be communicated to the apparatus 110 where it may produce an output sensible to the subject such as an audio output, visual output or haptic output.
  • the above described examples find application as enabling components of: automotive systems; telecommunication systems; electronic systems including consumer electronic products; distributed computing systems; media systems for generating or rendering media content including audio, visual and audio visual content and mixed, mediated, virtual and/or augmented reality; personal systems including personal health systems or personal fitness systems; navigation systems; user interfaces also known as human machine interfaces; networks including cellular, non-cellular, and optical networks; ad-hoc networks; the internet; the internet of things; virtualized networks; and related software and services.
  • a property of the instance can be a property of only that instance or a property of the class or a property of a sub-class of the class that includes some but not all of the instances in the class. It is therefore implicitly disclosed that a feature described with reference to one example but not with reference to another example, can where possible be used in that other example as part of a working combination but does not necessarily have to be used in that other example.
  • the presence of a feature (or combination of features) in a claim is a reference to that feature or (combination of features) itself and also to features that achieve substantially the same technical effect (equivalent features) .
  • the equivalent features include, for example, features that are variants and achieve substantially the same result in substantially the same way.
  • the equivalent features include, for example, features that perform substantially the same function, in substantially the same way to achieve substantially the same result.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un appareil comprenant un moyen permettant : d'envoyer un message de liaison montante (MsgA) dans une procédure d'accès aléatoire en deux étapes; de recevoir un message de réponse de liaison descendante (MsgB) dans la procédure d'accès aléatoire en deux étapes, le message de réponse de liaison descendante reçu comprenant un identifiant pour l'appareil; et d'envoyer un message d'accusé de réception de liaison montante à l'aide d'une ressource PUCCH déterminée par un index de ressources PUCCH, l'index de ressource PUCCH dépendant, au moins, d'un indicateur de ressource PUCCH (PRI) et de l'identifiant de l'appareil.
PCT/CN2019/075493 2019-02-19 2019-02-19 Communication entre un terminal et un nœud de réseau sans fil WO2020168469A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP19915996.3A EP3928572A4 (fr) 2019-02-19 2019-02-19 Communication entre un terminal et un noeud de réseau sans fil
CN201980092440.5A CN113439467B (zh) 2019-02-19 2019-02-19 在终端和无线网络节点之间的通信
PCT/CN2019/075493 WO2020168469A1 (fr) 2019-02-19 2019-02-19 Communication entre un terminal et un nœud de réseau sans fil
TW109105026A TWI745866B (zh) 2019-02-19 2020-02-17 終端與無線網路節點之間的通訊技術
ARP200100451A AR118135A1 (es) 2019-02-19 2020-02-18 Comunicación entre un terminal y un nodo de red inalámbrica

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/075493 WO2020168469A1 (fr) 2019-02-19 2019-02-19 Communication entre un terminal et un nœud de réseau sans fil

Publications (1)

Publication Number Publication Date
WO2020168469A1 true WO2020168469A1 (fr) 2020-08-27

Family

ID=72143912

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/075493 WO2020168469A1 (fr) 2019-02-19 2019-02-19 Communication entre un terminal et un nœud de réseau sans fil

Country Status (5)

Country Link
EP (1) EP3928572A4 (fr)
CN (1) CN113439467B (fr)
AR (1) AR118135A1 (fr)
TW (1) TWI745866B (fr)
WO (1) WO2020168469A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023030134A1 (fr) * 2021-09-01 2023-03-09 华为技术有限公司 Procédé de communication et appareil de communication

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016161629A1 (fr) * 2015-04-10 2016-10-13 Mediatek Singapore Pte. Ltd. Procédés et appareil destinés à l'attribution d'une ressource pucch dans une mtc
CN107889273A (zh) * 2016-09-30 2018-04-06 北京三星通信技术研究有限公司 随机接入的方法及相应设备
US20180103465A1 (en) * 2016-10-07 2018-04-12 Samsung Electronics Co., Ltd. Method and apparatus for enhanced contention based random access procedure

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP7010212B2 (ja) * 2015-09-25 2022-02-10 ソニーグループ株式会社 低複雑度の狭帯域端末のためのランダムアクセス手順でのｈａｒｑメッセージに割り当てられたリソースを示すための方法
CA3019611C (fr) * 2016-04-01 2024-05-28 Huawei Technologies Co., Ltd. Systemes et procedes d'execution de harq pour transmissions de liaison montante sans octroi
US10405342B2 (en) * 2016-11-01 2019-09-03 Qualcomm Incorporated Two step random access procedure
CN108282901B (zh) * 2017-01-06 2019-08-09 电信科学技术研究院 一种随机接入响应方法和装置
JP2022520590A (ja) * 2019-02-13 2022-03-31 アイディーエーシー ホールディングス インコーポレイテッド ２ステップｒａｃｈにおけるｍｓｇ－ｂのための方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016161629A1 (fr) * 2015-04-10 2016-10-13 Mediatek Singapore Pte. Ltd. Procédés et appareil destinés à l'attribution d'une ressource pucch dans une mtc
CN107889273A (zh) * 2016-09-30 2018-04-06 北京三星通信技术研究有限公司 随机接入的方法及相应设备
US20180103465A1 (en) * 2016-10-07 2018-04-12 Samsung Electronics Co., Ltd. Method and apparatus for enhanced contention based random access procedure

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Overall description; Stage 2 (Release 15)", 3GPP STANDARD; TECHNICAL SPECIFICATION; 3GPP TS 36.300, 3RD GENERATION PARTNERSHIP PROJECT (3GPP),, vol. RAN WG2, no. V15.1.0, 31 March 2018 (2018-03-31), Mobile Competence Centre ; France, pages 1 - 341, XP051450927 *
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical layer procedures for control (Release 15)", 3GPP STANDARD; TECHNICAL SPECIFICATION; 3GPP TS 38.213, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), vol. RAN WG1, no. V15.0.0, 3 January 2018 (2018-01-03), Mobile Competence Centre ; France, pages 1 - 56, XP051392263 *
3GPP TS 36.300
3GPP TS 38.213
ERICSSON: "Random Access enhancements", 3GPP DRAFT; R2-168665 - RANDOM ACCESS ENHANCEMENTS, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), vol. RAN WG2, no. Reno, Nevada, USA; 20161114 - 20161118, 13 November 2016 (2016-11-13), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, XP051178221 *
MEDIATEK INC: "3GPP DRAFT; R2-1816687 2-STEP RACH MSGB ADDRESSING AND HARQ, 3RD GENERATION", vol. RAN WG2, 12 November 2018, MOBILE COMPETENCE CENTRE, article "2-step RACH msgB addressing and HARQ"
See also references of EP3928572A4
ZTE CORPORATION, ZTE MICROELECTRONICS: "On 2-step RACH procedure in NR", 3GPP DRAFT; R1-1611274, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), 18 November 2016 (2016-11-18), Mobile Competence Centre ; France, pages 1 - 4, XP051189838 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023030134A1 (fr) * 2021-09-01 2023-03-09 华为技术有限公司 Procédé de communication et appareil de communication

Also Published As

Publication number Publication date
EP3928572A1 (fr) 2021-12-29
EP3928572A4 (fr) 2022-08-24
AR118135A1 (es) 2021-09-22
CN113439467A (zh) 2021-09-24
TWI745866B (zh) 2021-11-11
CN113439467B (zh) 2024-03-19
TW202041087A (zh) 2020-11-01

Similar Documents

Publication Publication Date Title
US20230300842A1 (en) Method and apparatus for enhanced contention based random access procedure
US9253802B2 (en) Method and apparatus for random access in multicarrier wireless communications
EP2549822B1 (fr) Procédé de gestion de réponse d'accès aléatoire
CN107624262B (zh) 使用mac消息指配用于专用调度请求的资源的方法以及相关无线终端和基站
CN110603887B (zh) 关于多prach前导码和随机接入响应
US9706578B2 (en) Scheduling signaling transmission method and device
WO2020220306A1 (fr) Indication de ressource en accès aléatoire
US20170135132A1 (en) Method, system and apparatus
WO2021057793A1 (fr) Procédé et appareil destinés à une procédure d'accès aléatoire
KR20200076736A (ko) 랜덤 액세스를 위한 방법, 장치, 컴퓨터-판독가능 스토리지 및 캐리어
TW201340759A (zh) 防止隨機存取回應碰撞的方法
WO2020168469A1 (fr) Communication entre un terminal et un nœud de réseau sans fil
WO2020140248A1 (fr) Communication entre un terminal et un nœud de réseau sans fil
US12028909B2 (en) Communicating between a terminal and a wireless network node
US20240114471A1 (en) Facilitating timing advance operations for multiple uplink transmissions
CN113228766B (zh) 终端与无线网络节点之间的通信
JP7443503B2 (ja) リソース決定方法および通信機器
WO2022237439A1 (fr) Procédé et appareil de communication
WO2021159335A1 (fr) Transmission d'accusés de réception (ack) de demande de répétition automatique hybride (harq)
WO2023160677A1 (fr) Procédé de communication et appareil associé
WO2022127898A1 (fr) Procédé et appareil de transmission de message et dispositif
WO2023155995A1 (fr) Gestion d'états d'indicateur de configuration de transmission
CN117178613A (zh) Pucch传输的增强
CN114073162A (zh) 用于随机接入过程的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19915996

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019915996

Country of ref document: EP

Effective date: 20210920