CN113228786B - MSG3 transmission in unlicensed frequency bands - Google Patents

MSG3 transmission in unlicensed frequency bands Download PDF

Info

Publication number
CN113228786B
CN113228786B CN201980087551.7A CN201980087551A CN113228786B CN 113228786 B CN113228786 B CN 113228786B CN 201980087551 A CN201980087551 A CN 201980087551A CN 113228786 B CN113228786 B CN 113228786B
Authority
CN
China
Prior art keywords
random access
contention resolution
unsuccessful
trigger condition
computer program
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.)
Active
Application number
CN201980087551.7A
Other languages
Chinese (zh)
Other versions
CN113228786A (en
Inventor
S·图尔蒂南
B·塞比尔
吴春丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Shanghai Bell Co Ltd
Nokia Solutions and Networks Oy
Original Assignee
Nokia Shanghai Bell Co Ltd
Nokia Solutions and Networks 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 filed Critical Nokia Shanghai Bell Co Ltd
Publication of CN113228786A publication Critical patent/CN113228786A/en
Application granted granted Critical
Publication of CN113228786B publication Critical patent/CN113228786B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0808Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]

Landscapes

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

Abstract

According to some embodiments, an apparatus includes at least one processor and at least one memory including computer program code. The at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The apparatus also indicates at least one contention resolution as unsuccessful. The apparatus also initiates at least one random access resource selection procedure in response to at least one contention solution being designated as unsuccessful.

Description

MSG3 transmission in unlicensed frequency bands
Technical Field
Some embodiments may relate to a communication system. For example, some embodiments may relate to random access procedures, in particular to msg3 transmission of new radios operating in unlicensed spectrum.
Background
3GPP Technical Report (TR) 38.889 describes 4-step and 2-step Random Access Channel (RACH) procedures, both of which will be supported in the new radio of the unlicensed spectrum (NR-U). The 2-step RACH refers to a procedure capable of completing contention-based RACH (CBRA) in two steps explained below. One example benefit of a 2-step RACH is to minimize the impact on LBT by reducing its number of messages. However, to mitigate the impact of LBT failure, additional opportunities for RACH messages may further be introduced for both 4-step RACH and 2-step RACH, e.g., in the time or frequency domain. Additional opportunities for the 4-step RACH may apply to both msg1 and msg3.
Disclosure of Invention
According to some embodiments, a method may include detecting, at a user equipment, at least one listen before talk failure associated with an initial transmission opportunity of a random access procedure message. The method may further include designating, by the user equipment, at least one contention resolution as unsuccessful. The method may also include initiating, by the user equipment, at least one random access resource selection procedure in response to the at least one contention resolution being designated as unsuccessful.
According to some examples, an apparatus may include means for detecting at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The apparatus may also include means for designating at least one contention resolution as unsuccessful. The apparatus may also include means for initiating at least one random access resource selection procedure in response to at least one contention solution being designated as unsuccessful.
According to some embodiments, an apparatus may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus at least to detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to designate at least one contention resolution as unsuccessful. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to initiate at least one random access resource selection procedure in response to the at least one contention resolution being designated as unsuccessful.
According to some embodiments, a non-transitory computer readable medium may be encoded with instructions that, when executed in hardware, may perform a method. The method may detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The method may also designate at least one contention resolution as unsuccessful. The method may also initiate at least one random access resource selection procedure in response to at least one contention solution being designated as unsuccessful.
According to some embodiments, a computer program product may perform a method. The method may detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The method may also designate at least one contention resolution as unsuccessful. The method may also initiate at least one random access resource selection procedure in response to at least one contention solution being designated as unsuccessful.
According to some embodiments, an apparatus may include circuitry configured to detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message. The circuitry may also designate at least one contention resolution as unsuccessful. The circuitry may also initiate at least one random access resource selection procedure in response to at least one contention resolution being designated as unsuccessful.
According to some embodiments, a method may include detecting, at a user equipment, at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may further include designating at least one contention resolution scheme as unsuccessful based on the trigger condition. The method may also include initiating at least one random access resource selection procedure in response to at least one contention resolution being designated as unsuccessful.
According to some embodiments, a method may include detecting, at a user equipment, at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may further comprise restarting, by the user equipment, at least one contention resolution timer. The method may further comprise decoding, by the user equipment, the at least one physical downlink control channel for further analysis.
According to some embodiments, an apparatus may include means for detecting at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The apparatus may also include means for designating at least one contention resolution solution as unsuccessful based on the trigger condition. The apparatus may also include means for initiating at least one random access resource selection procedure in response to at least one contention solution being designated as unsuccessful.
According to some embodiments, an apparatus may include means for detecting at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The apparatus may further comprise means for restarting at least one contention resolution timer. The apparatus may also include means for decoding the at least one physical downlink control channel for further analysis.
According to some embodiments, an apparatus may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus at least to detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to specify that the at least one contention resolution solution was unsuccessful based on the trigger condition. The at least one memory and the computer program may also be configured to, with the at least one processor, cause the apparatus at least to initiate at least one random access resource selection procedure in response to the at least one contention solution being designated as unsuccessful.
According to some embodiments, an apparatus may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus at least to detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to restart the at least one contention resolution timer. The at least one memory and the computer program may also be configured to, with the at least one processor, cause the apparatus at least to decode the at least one physical downlink control channel for further analysis.
According to some embodiments, a non-transitory computer readable medium may be encoded with instructions that, when executed in hardware, may perform a method. The method may detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may further include designating that at least one contention resolution solution was unsuccessful based on the trigger condition. The method may also include initiating at least one random access resource selection procedure in response to at least one contention resolution being designated as unsuccessful.
According to some embodiments, a non-transitory computer readable medium may be encoded with instructions that, when executed in hardware, may perform a method. The method may detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may also restart at least one contention resolution timer. The method may also decode the at least one physical downlink control channel for further analysis.
According to some embodiments, a computer program product may perform a method. The method may detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may further include designating at least one contention resolution scheme as unsuccessful based on the trigger condition. The method may also include initiating at least one random access resource selection procedure in response to at least one contention resolution being designated as unsuccessful.
According to some embodiments, a computer program product may perform a method. The method may detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The method may also restart at least one contention resolution timer. The method may also decode the at least one physical downlink control channel for further analysis.
According to some embodiments, an apparatus may include circuitry configured to detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The circuitry may also designate at least one contention resolution as unsuccessful. The circuitry may also initiate at least one random access resource selection procedure in response to at least one contention resolution being designated as unsuccessful.
According to some embodiments, an apparatus may include circuitry configured to detect at least one listen before talk failure associated with at least one retransmission random access channel transmission opportunity. The circuitry may also restart at least one contention resolution timer. The circuitry may also decode the at least one physical downlink control channel for further analysis.
Drawings
For a proper understanding of the present disclosure, reference should be made to the accompanying drawings, in which:
fig. 1 illustrates an example of a method performed by a user device in accordance with certain embodiments.
Fig. 2 illustrates another example of a method performed by a user device in accordance with certain embodiments.
Fig. 3 illustrates a system according to some embodiments.
Detailed Description
NR-U can support contention-free RACH (CFRA) and CBRD for both 2-step and 4-step RACH procedures. Regarding secondary cells, CFRA may be supported as a baseline, while both CBRA and CFRA may be supported on SpCells. Messages ordered in time may be described as msg1, msg2, msg3, msg4 for a 4-step RACH procedure, and as msgA and msgB for a 2-step RACH.
A single RACH procedure i may be used and thus multiple parallel RACH procedures may not be used to support NR-U. As a baseline, the random access response to msg1 may be on SpCell, and assume msg3 uses a predetermined HARQ ID.
In the conventional RACH, a counter for preamble transmission and power ramping (power ramping) may be increased with each attempt. In NR-U, no power ramping is applied when the preamble is not transmitted due to the possibility of LBT failure. Thus, this may require an indication from the physical layer to the MAC. In addition, ra-ResponseWindow may not be started when the preamble is not transmitted due to LBT failure. In addition, it is assumed that ra-contentioresolutiontimer may need to be extended with a larger value to overcome any impact of LBT.
For a 2-step RACH procedure, msgA may be a signal to detect UE and payload, while the second message is a contention resolution for CBRA in case of a possible payload. The MsgA may include at least information equivalent to the information transmitted in msg3 of the 4-step RACH procedure.
As a baseline, all triggers for the 4-step RACH may be applied to the 2-step RACH procedure. However, further analysis may be required on one or more SI requests and BFRs, and how to obtain time advance and grants for msgA. The contention resolution in the 2-step RACH procedure may include a UE identifier in the first message, which is then included in the second message. The type of UE identifier may include FFS.
Rollback from a 2-step RACH procedure to a 4-step RACH procedure may also be supported. The backoff after msgA transmission is only feasible if detection by the UE is possible without decoding the payload and thus depends on such support at the physical layer. If a 2-step RACH procedure is used for initial access, the parameters of the 2-step RACH procedure include resources for msgA that can be broadcasted. It should be noted that if the 2-step RACH procedure is applied to the grant operation, LBT may not be considered. Thus, some data transmissions may fail when the channel is busy due to a possible LBT failure. To this end, the MAC may receive an indication from L1 that LBT failure occurred.
Under 3GPP TR 38.889, a mechanism may be used for SS/PBCH block transmission to transmit SS/PBCH blocks that are discarded due to LBT failure. When the specification is developed for the UE to determine frame timing and QCL assumptions from the detected SS/PBCH blocks, a mechanism may be defined. For SS/PBCH blocks that are part of the DRS, it is beneficial to extend the maximum number of candidate SS/PBCH block locations within the DRS transmission window to Y (e.g., y.ltoreq.64), where the choice of Y may depend on the digital scheme of the SS/PBCH blocks. The SS/PBCH blocks transmitted may not overlap and the maximum number of SS/PBCH blocks transmitted may be represented as X within the DRS transmission window, where x+.8. The time domain position of the actually transmitted SS/PBCH block may be selected from the set of Y candidate SS/PBCH block positions.
From the user equipment's perspective, when the preamble transmission (msg 1) fails due to LBT, the preamble transmission can be retried without increasing the power ramping counter, since no transmission occurs. However, when LBT fails, various techniques may occur with respect to retransmission of the UE (msg 3). In contrast, from the point of view of the network entity, when msg3 is not received, the network entity does not know whether the failure is due to LBT failure or due to a retransmission grant for RAR/msg3 that cannot be received by the UE. For example, the downlink preferred beam may suddenly change between preamble transmission and RAR reception, e.g., due to a sudden obstacle, and DL scheduling (PDCCH) may not be decoded by the UE.
Certain embodiments described herein may support UE behavior for deterministic transmission of msg3 by the NW and may be considered as DTX by the NW in each failure to decode msg3 from the initial resources. For example, it may be known that either LBT failed or RAR was not received by the UE, and/or NW may know that the UE will re-attempt transmission immediately. Thus, when the UE fails to receive the RAR, the network entity may avoid sending useless retransmission grants and/or may reduce latency for the RA procedure. Accordingly, certain embodiments are directed to improvements in computer-related techniques, in particular, by blocking unnecessary retransmissions and allowing a UE to immediately re-attempt a transmission without waiting for a contention resolution timer to expire, e.g., in the event that a preferred beam indicated with a preamble of the transmission is blocked. Some embodiments may also preserve network resources and reduce power consumption of network entities and/or user equipment located within the network by reducing redundant operations.
Fig. 1 illustrates an example of a method performed by a user device, such as user device 310 in fig. 3. In step 101, the user equipment may detect at least one listen before talk failure associated with at least one initial transmission opportunity of a random access procedure message, such as msg3 of a 4-step RA procedure and/or msgA of a 2-step RA procedure. In step 103, the user equipment may designate at least one contention resolution as unsuccessful. In step 105, the user equipment may initiate at least one random access resource selection procedure in response to at least one contention resolution being specified as unsuccessful. For example, the user equipment may immediately retry transmission of at least one preamble, such as msg1.
In some embodiments, the user equipment may have multiple transmission opportunities for initial transmission of random access procedure messages, such as msg3 of a 4-step RA procedure and/or msgA of a 2-step RA procedure. For example, a plurality of transmission opportunities may be received from at least one Random Access Response (RAR) message sent by a network entity. In some embodiments, the RAR message may include at least one indication that the network entity is to schedule a further RAR message configured to provide a further transmission opportunity for initial transmission of the random access procedure message.
In some embodiments, the power ramp counter may remain unchanged. Alternatively, the counter may be decremented by at least one offset, e.g., the counter may be decremented by a fixed value, decremented by a value in a system information broadcast, and/or linked to an elapsed time between a failure and a new preamble transmission. In some embodiments, the at least one offset may instead be an increased power ramp counter, and/or may be a combination of at least one increased offset and at least one decreased offset. In some embodiments, the contention resolution timer may be stopped, not started, and/or immediately considered to expire, which may cause an increase in the preamble transmission counter. Alternatively, the preamble transmission counter may not be incremented.
Fig. 2 illustrates an example of a method performed by a user device, such as user device 310 in fig. 3. In step 201, the user equipment may detect at least one listen before talk failure associated with at least one retransmission opportunity of a random access procedure message. In step 203, the user equipment may designate at least one contention resolution solution as unsuccessful based on at least one trigger condition. In one non-limiting example, the user equipment may also restart the at least one contention resolution timer. In step 205, the user equipment may initiate at least one random access resource selection procedure in response to at least one contention resolution being specified as unsuccessful. In one non-limiting example, the user equipment may also decode the at least one physical downlink control channel for further analysis. The same non-limiting example as applied in fig. 1 may be applied to fig. 2 when applicable.
In some embodiments, at least one trigger condition may be configured. In the illustrated embodiment, the network entity may configure the user equipment with at least one trigger condition that is the maximum number of retransmission attempts due to LBT failure, after which the user equipment designates at least one contention solution as unsuccessful in response. In response to at least one trigger condition occurring, the user equipment may initiate a new random access resource selection procedure. In another sample embodiment, the at least one trigger condition may be based on an indication in a retransmission grant. For example, if LBT fails during re-authorization, the user equipment may initiate a new random access resource selection procedure. In some embodiments, the retransmission attempts associated with LBT failure may or may not be consecutive retransmission attempts.
In some embodiments, at least one preamble/power ramping counter may be incremented by one for each contention solution failure (e.g., due to a collision). Alternatively or additionally, the retransmission random access channel transmission opportunity may be applied to at least one msg3 retransmission failure due to LBT, such as in the case of a UE immediately retrying transmission of the preamble, whether or not there is a power ramp.
Fig. 3 illustrates a system according to some embodiments. It is to be understood that each signal or block in fig. 1-2 may be performed by various components or combinations thereof, such as hardware, software, firmware, one or more processors and/or circuitry. In one embodiment, the system may include several devices, such as, for example, user device 310 and/or network entity 320. The system may comprise more than one user equipment 310 and more than one network entity 320.
The user device 314 may be a Mobile Station (MS) such as a mobile phone or smart phone or multimedia device, an IoT cellular device, a computer (such as a tablet) provided with wireless communication capabilities, a personal data or digital assistant (PDA) provided with wireless communication capabilities, a portable media player, a digital camera, a pocket video camera, a navigation unit provided with wireless communication capabilities, or any combination thereof.
Network entity 320 may be a CBSD, a base station, an access point, an access node, an eNB, a gNB, a server, a host, an MME, an S-GW, a P-GW, PCRF, P-CSCF, an E/CSCF, or any other network entity that may communicate with user equipment 310.
Each of these devices may include at least one processor or control unit or module, indicated as 311 and 312, respectively. At least one memory may be provided in each device and indicated as 321 and 322, respectively. The memory may include computer program instructions or computer code embodied therein. One or more transceivers 313 and 323 may be provided and each device may also include an antenna, illustrated as 314 and 324, respectively. Although only one antenna is shown for each transceiver, each device may be provided with many antennas and multiple antenna elements. For example, other configurations of these devices may be provided. For example, user device 310 and/or network entity 320 may additionally be configured for wired communications in addition to wireless communications, and in such cases antennas 314 and 324 may be described in any form of communications hardware, not just antennas.
The transceivers 313 and 323 may each be separate transmitters and receivers, or both transmitters and receivers, or may be configured as units or devices for transmitting and receiving. For example, the transmitter and/or receiver (in the case of a part of the radio) may also be implemented as a remote radio head, which is not located in the device itself, but in the mast. For example, operations and functions may be performed in different entities (e.g., nodes, hosts, or servers) in a flexible manner. In other words, the labor division may be different from case to case. One possible use is for a network node to deliver local content. One or more of the functions may also be implemented as virtual application(s) in software that may run on a server.
In some embodiments, an apparatus, such as a user equipment or a network node, may comprise means for performing the above-described embodiments with respect to fig. 1-2. In some embodiments, at least one memory including computer program code may be configured to, with at least one processor, cause an apparatus to perform at least any of the processes described herein.
Processors 311 and 321 may be implemented by any computing or data processing device, such as a Central Processing Unit (CPU), digital Signal Processor (DSP), application Specific Integrated Circuit (ASIC), programmable Logic Device (PLD), field Programmable Gate Array (FPGA), digital enhancement circuit, or similar device or combination thereof. A processor may be implemented as a single controller, or as multiple controllers or processors.
For firmware or software, an implementation may include modules or units of at least one chipset (e.g., process, function, etc.). Memories 312 and 322 may independently be any suitable storage device, such as a non-transitory computer readable medium. A hard disk drive, random access memory, flash memory, or other suitable memory may be used. The memory may be combined onto a single integrated circuit as a processor or may be separate therefrom. Furthermore, the computer program instructions may be stored in a memory and the computer program instructions that may be processed by the processor may be any suitable form of computer program code, for example, a compiled or interpreted computer program written in any suitable programming language. The memory or data storage entity is typically internal, but may also be external or a combination thereof, such as where additional memory capacity is obtained from a service provider. The memory may be fixed or removable.
The memory and computer program instructions may be configured to, with the processor for a particular device, cause hardware apparatus, such as user device 310 and/or network entity 320, to perform any of the above-described processes (see, e.g., fig. 1-2). Thus, in certain embodiments, a non-transitory computer readable medium may be encoded with computer instructions or one or more computer programs (such as added or updated software histories, applets, or macros), which when executed in hardware, may perform one of the processes such as described herein. The computer program may be encoded by a programming language, which may be a high-level programming language such as object-oriented C, C, C ++, c#, java language, etc., or a low-level programming language such as machine language or assembly language. Alternatively, some embodiments may be implemented entirely in hardware.
Furthermore, while fig. 3 illustrates a system including user device 310 and/or network entity 320, certain embodiments may be applicable to other configurations as well as configurations including additional elements, as illustrated and discussed herein. For example, there may be a plurality of user equipment devices and a plurality of base stations, or other nodes providing similar functionality, such as nodes combining the functionality of user equipment and base stations, such as relay nodes. In addition to communicating with network entity 320, user device 310 may likewise be provided with various configurations for communication. For example, the user device 310 may be configured for device-to-device, machine-to-machine, or vehicle-to-vehicle communication.
As shown in fig. 3, transceivers 313 and 323 may be provided, and one or more devices may also include at least one antenna, illustrated as 314 and 324, respectively. The device may have many antennas, such as an antenna array configured for multiple-input multiple-output (MIMO) communication, or multiple antennas for multiple radio access technologies. For example, other configurations of these devices may be provided.
The transceivers 313 and 323 may be transmitters, receivers, or both transmitters and receivers, or may be units or devices configured for both transmission and reception.
The processors 311 and 321 may be implemented by any computing or data processing device, such as a Central Processing Unit (CPU), application Specific Integrated Circuit (ASIC), or the like. A processor may be implemented as a single controller, or as multiple controllers or processors.
Memories 312 and 322 may independently be any suitable storage device, such as a non-transitory computer readable medium. A Hard Disk Drive (HDD), random Access Memory (RAM), flash memory, or other suitable memory may be used. The memory may be incorporated into a single integrated circuit as a processor or may be separate therefrom. Furthermore, the computer program instructions may be stored in a memory and the computer program instructions that may be processed by the processor may be any suitable form of computer program code, for example, a compiled or interpreted computer program written in any suitable programming language. The memory may be fixed or removable.
The memory and computer program instructions may be configured to, with the processor for a particular device, cause hardware means, such as the user device, to perform any of the processes described below (see, e.g., fig. 1-2). Thus, in certain embodiments, a non-transitory computer readable medium may utilize computer instructions which, when executed in hardware, may perform a process such as one of the processes described herein. Alternatively, some embodiments may be implemented entirely in hardware.
In certain embodiments, an apparatus may comprise circuitry configured to perform any of the processes or functions illustrated in fig. 1-2. For example, the circuitry may be a hardware-based circuit implementation, such as analog and/or digital circuitry. In another example, the circuitry may be a combination of hardware circuitry and software, such as a combination of analog and/or digital hardware circuitry(s) and software or firmware, and/or any portion of a hardware processor(s) (including digital signal processor (s)) with software, and at least one memory that work together to cause the configuration to perform various processes or functions. In yet another example, the circuitry may be hardware circuit(s) and/or processor(s), such as microprocessor(s) or part of microprocessor(s), including software, such as firmware for operation. When software for hardware operations is not required, software in the circuitry may not be present.
The particular features, structures, or characteristics of some embodiments described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, use of the phrases "certain embodiments," "some embodiments," "other embodiments," or other similar language throughout this specification refers to the fact that a particular described feature, structure, or characteristic associated with an embodiment may be included in at least one embodiment of the present invention. Thus, appearances of the phrases "in certain embodiments," "in some embodiments," "in other embodiments," or other similar language throughout this specification do not necessarily refer to the same group of embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Those of ordinary skill in the art will readily appreciate that the present invention as discussed above may be implemented using different orders of steps, and/or hardware elements other than those disclosed. Thus, while the present invention has been described based upon these preferred embodiments, certain modifications, variations, and alternative constructions will be apparent to those skilled in the art without departing from the spirit and scope of the invention. The above embodiments may be applied to any communication network or wireless system. While many of the above embodiments relate to LTE or LTE-a, other embodiments may be used for 3GPP fifth generation (5G) technology, fourth generation (4G) technology, new Radio (NR) technology, and/or any wireless terrestrial service network (WLAN).
Part glossary
3GPP third Generation partnership project
5G fifth generation wireless system
BFR beam fault recovery
CBRA contention-based random access
CFRA contention-free random access
CSI-RS channel state information reference signal
DRS downlink reference signal
DTX discontinuous transmission
HO handover
eNBs evolved node B
E-UTRAN evolution type universal mobile telecommunication system land radio access network
gNB next generation node B
LBT listen before talk
LTE long term evolution
MAC medium access control
MIMO multiple input multiple output
NE network entity
NR new radio
PBCH physical broadcast channel
PRACH physical random access channel
QCL quasi co-location
RA random access
RAR random access response
RACH random access channel
RO random access channel occasion
RS reference signal
RSRP reference signal received power
RSRQ reference signal reception quality
RSSI received signal strength indicator
SINR signal to interference plus noise ratio
SS synchronization signal
SSB synchronization signal block
UE user equipment
UL uplink

Claims (14)

1. An apparatus for communication, comprising:
at least one processor; and
at least one memory including computer program code;
wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to:
detecting at least one listen-before-talk failure associated with at least one initial transmission opportunity of the random access procedure message;
designating at least one contention resolution as unsuccessful; and
responsive to at least one contention resolution being designated as unsuccessful, initiating at least one random access resource selection procedure;
wherein the designation is based on at least one trigger condition comprising at least one contention resolution timer stopping, not starting, and/or being immediately considered to expire.
2. The apparatus of claim 1, wherein at least one power ramp counter remains unchanged.
3. The apparatus of claim 1, wherein at least one power ramp counter is reduced by an offset.
4. The apparatus of claim 3, wherein at least one offset is reduced by a fixed value, by a value in a system information broadcast, and/or linked to an elapsed time between failure and new preamble transmission.
5. The apparatus according to any of claims 1 to 4, wherein the random access procedure message is msg3 of the random access procedure.
6. An apparatus for communication, comprising:
at least one processor; and
at least one memory including computer program code;
wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to:
detecting at least one listen before talk failure associated with at least one retransmission opportunity of at least one random access procedure message;
designating at least one contention resolution scheme as unsuccessful based on at least one trigger condition; and
responsive to at least one contention resolution being designated as unsuccessful, initiating at least one random access resource selection procedure;
wherein the at least one trigger condition includes a maximum number of retransmission attempts due to LBT failure.
7. The apparatus of claim 6, wherein the at least one trigger condition is in a retransmission grant and indicates that a contention resolution was unsuccessful if at least one listen-before-talk failure is associated with the retransmission opportunity.
8. The apparatus of any of claims 6 to 7, wherein for each contention solution failure, a preamble/power ramping counter is incremented by one.
9. The apparatus of any of claims 6-7, wherein the at least one trigger condition comprises at least one contention resolution timer stopping, not starting, and/or being immediately considered to expire.
10. A method for communication, comprising:
detecting at least one listen-before-talk failure associated with at least one initial transmission opportunity of the random access procedure message;
designating at least one contention resolution as unsuccessful; and
responsive to at least one contention resolution being designated as unsuccessful, initiating at least one random access resource selection procedure;
wherein the designation is based on at least one trigger condition comprising at least one contention resolution timer stopping, not starting, and/or being immediately considered to expire.
11. A method for communication, comprising:
detecting at least one listen before talk failure associated with at least one retransmission opportunity of at least one random access procedure message;
designating at least one contention resolution scheme as unsuccessful based on at least one trigger condition; and
responsive to at least one contention resolution being designated as unsuccessful, initiating at least one random access resource selection procedure;
wherein the at least one trigger condition includes a maximum number of retransmission attempts due to LBT failure.
12. A non-transitory computer readable medium encoded with instructions that, when executed in hardware, perform the process according to any of claims 1 to 9.
13. An apparatus for communication comprising means for performing the process according to any one of claims 1 to 9.
14. An apparatus for communication comprising circuitry configured to cause the apparatus to perform the process of any one of claims 1 to 9.
CN201980087551.7A 2019-02-14 2019-02-14 MSG3 transmission in unlicensed frequency bands Active CN113228786B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/075119 WO2020164074A1 (en) 2019-02-14 2019-02-14 Msg3 transmission in unlicensed band

Publications (2)

Publication Number Publication Date
CN113228786A CN113228786A (en) 2021-08-06
CN113228786B true CN113228786B (en) 2024-03-19

Family

ID=72045473

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201980087551.7A Active CN113228786B (en) 2019-02-14 2019-02-14 MSG3 transmission in unlicensed frequency bands

Country Status (2)

Country Link
CN (1) CN113228786B (en)
WO (1) WO2020164074A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101919298A (en) * 2008-01-04 2010-12-15 交互数字专利控股公司 Method and apparatus for performing an enhanced random access channel procedure in a CELL_FACH state
WO2016163845A1 (en) * 2015-04-10 2016-10-13 Lg Electronics Inc. Method and apparatus for performing contention based random access procedure over contention free random access procedure in wireless communication system
WO2017097582A1 (en) * 2015-12-09 2017-06-15 Nokia Solutions And Networks Oy Random access enhancement for unlicensed access
WO2017136458A2 (en) * 2016-02-02 2017-08-10 Intel IP Corporation Listen-before-talk (lbt) failure during a random access procedure
CN108781463A (en) * 2016-03-02 2018-11-09 英特尔Ip公司 Low latency PRACH designs in unlicensed spectrum

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016163709A1 (en) * 2015-04-09 2016-10-13 삼성전자 주식회사 Method for allocating resources in cellular network using unlicensed band and device therefor
CN107517501A (en) * 2016-06-15 2017-12-26 北京智讯伙伴科技有限公司 A kind of accidental access method and device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101919298A (en) * 2008-01-04 2010-12-15 交互数字专利控股公司 Method and apparatus for performing an enhanced random access channel procedure in a CELL_FACH state
WO2016163845A1 (en) * 2015-04-10 2016-10-13 Lg Electronics Inc. Method and apparatus for performing contention based random access procedure over contention free random access procedure in wireless communication system
WO2017097582A1 (en) * 2015-12-09 2017-06-15 Nokia Solutions And Networks Oy Random access enhancement for unlicensed access
WO2017136458A2 (en) * 2016-02-02 2017-08-10 Intel IP Corporation Listen-before-talk (lbt) failure during a random access procedure
CN108476532A (en) * 2016-02-02 2018-08-31 英特尔Ip公司 Listem-before-talk (LBT) failure during random access procedure
CN108781463A (en) * 2016-03-02 2018-11-09 英特尔Ip公司 Low latency PRACH designs in unlicensed spectrum

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
Ericsson.R2-1814797 "Configured Scheduling during Random Access Procedure".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_103bis),全文全文. *
Huawei, HiSilicon.R2-1816616 "Four-step RACH procedure for NR-U".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_104),全文. *
Intel Corporation.R2-1807355 "Random access procedure for NR-u".3GPP tsg_ran\WG2_RL2.2018,(TSGR2_102),全文. *
Intel Corporation.R2-1809788 "Random Access procedure enhancmeent for NR-u".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_ahs),全文. *
Nokia, Nokia Shanghai Bell.R2-1814291 "On the selection of PRACH resources for transmission of Msg1/MsgA in NR-U RA procedure".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_103bis),全文. *
Samsung R amp ; amp ; D Institute India.R2-1809918 "Random Access Procedure for NR-U Operation".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_ahs),全文. *
ZTE Corporation.R2-1811281 "considerations on random access procedure for NR-U".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_103),全文. *
ZTE Corporation.R2-1816829 "Considerations on 4-step RACH procedure for NR-U".3GPP tsg_ran\wg2_rl2.2018,(tsgr2_104),全文. *

Also Published As

Publication number Publication date
CN113228786A (en) 2021-08-06
WO2020164074A1 (en) 2020-08-20

Similar Documents

Publication Publication Date Title
US11751245B2 (en) Method and wireless communication system for handling timer operation
US11424810B2 (en) Method and device for random access for beam failure recovery
CN111357227B (en) Method, apparatus, computer readable medium for bandwidth partial handover
US20230189078A1 (en) Use of wait period to obtain on-demand system information for wireless networks
KR20170137051A (en) Random Access Procedure for Improved Coverage Support
CN112655270A (en) LBT monitoring failure processing method, device and system
AU2018435963B2 (en) Link recovery in wireless communications
US11202322B2 (en) Random access method and terminal device
EP3952121A1 (en) Random access method and device, and storage medium
US20210136833A1 (en) Random access method and data reception method, apparatuses thereof and communication system
CN113228786B (en) MSG3 transmission in unlicensed frequency bands
WO2024093246A1 (en) Terminal device, network device and methods for communications
WO2022040870A1 (en) Method and apparatus for beam failure detection and recovery in sidelink
CN112703793B (en) Method, apparatus and computer readable medium for early data transmission

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