[go: up one dir, main page]

WO2025131609A1 - Indice dans une liste d'occasions d'accès aléatoire - Google Patents

Indice dans une liste d'occasions d'accès aléatoire Download PDF

Info

Publication number
WO2025131609A1
WO2025131609A1 PCT/EP2024/083888 EP2024083888W WO2025131609A1 WO 2025131609 A1 WO2025131609 A1 WO 2025131609A1 EP 2024083888 W EP2024083888 W EP 2024083888W WO 2025131609 A1 WO2025131609 A1 WO 2025131609A1
Authority
WO
WIPO (PCT)
Prior art keywords
rach
occasions
list
occasion
rach occasions
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.)
Pending
Application number
PCT/EP2024/083888
Other languages
English (en)
Inventor
Thomas DEISS
Oleksandr ANDRYEYEV
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 Technologies Oy
Original Assignee
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 Technologies Oy filed Critical Nokia Technologies Oy
Publication of WO2025131609A1 publication Critical patent/WO2025131609A1/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Definitions

  • This description relates to wireless communications.
  • a communication system may be a facility that enables communication between two or more nodes or devices, such as fixed or mobile communication devices. Signals can be carried on wired or wireless carriers.
  • LTE Long Term Evolution
  • APs base stations or access points
  • eNBs enhanced Node AP
  • UE user equipments
  • LTE has included a number of improvements or developments. Aspects of LTE are also continuing to improve.
  • 5G New Radio (NR) development is part of a continued mobile broadband evolution process to meet the requirements of 5G, similar to earlier evolution of 3G and 4G wireless networks.
  • 5G is also targeted at the new emerging use cases in addition to mobile broadband.
  • a goal of 5G is to provide significant improvement in wireless performance, which may include new levels of data rate, latency, reliability, and security.
  • 5GNR may also scale to efficiently connect the massive Internet of Things (loT) and may offer new types of mission-critical services. For example, ultra-reliable and low- latency communications (URLLC) devices may require high reliability and very low latency.
  • URLLC ultra-reliable and low- latency communications
  • 6G and other networks are also being developed.
  • a method may include determining a list of random access (RACH) occasions distributed within one or more RACH periods, wherein the list of RACH occasions includes a subset of available RACH occasions; generating an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN); identifying one of the RACH occasions of the list of RACH occasions based on the generated index; and, transmitting or receiving a random access preamble via the identified RACH occasion.
  • RACH random access
  • An apparatus may include means for determining a list of random access (RACH) occasions distributed within one or more RACH periods, wherein the list of RACH occasions includes a subset of available RACH occasions; means for generating an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN); means for identifying one of the RACH occasions of the list of RACH occasions based on the generated index; and, means for transmitting or receiving a random access preamble via the identified RACH occasion.
  • RACH random access
  • 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 configured to, with the at least one processor, cause the apparatus at least to: determine a list of random access (RACH) occasions distributed within one or more RACH periods, wherein the list of RACH occasions includes a subset of available RACH occasions; generate an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN); identify one of the RACH occasions of the list of RACH occasions based on the generated index; and transmit or receive a random access preamble via the identified RACH occasion.
  • RACH random access
  • a method may include selecting a plurality of random access (RACH) occasions to be on a list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period; generating an index into the list of RACH occasions; identifying one of the RACH occasions of the list of RACH occasions based on the generated index; and transmitting or receiving a random access preamble via the identified RACH occasion.
  • RACH random access
  • 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 configured to, with the at least one processor, cause the apparatus at least to: select a plurality of random access (RACH) occasions to be on a list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period; generate an index into the list of RACH occasions; identify one of the RACH occasions of the list of RACH occasions based on the generated index; and transmit or receive a random access preamble via the identified RACH occasion.
  • RACH random access
  • An apparatus may include means for selecting a plurality of random access (RACH) occasions to be on a list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period; means for generating an index into the list of RACH occasions; means for identifying one of the RACH occasions of the list of RACH occasions based on the generated index; and means for transmitting or receiving a random access preamble via the identified RACH occasion.
  • RACH random access
  • FIG. l is a block diagram of a wireless network.
  • FIG. 2A is a flow chart illustrating operation according to an example embodiment.
  • FIG. 2B is a flow chart illustrating operation according to an example embodiment.
  • FIG. 3 is a flow chart illustrating operation of a user device (or UE) and network node (or gNB) according to an example embodiment.
  • FIG. 4 is a diagram illustrating possible RACH occasions.
  • FIG. 5 is a diagram that illustrates remaining RACH occasions after some RACH occasions have been eliminated from the list of RACH occasions based on SSB period being greater than a threshold.
  • FIG. 6 is a diagram illustrating the list 610 of (e.g., ordered) RACH occasions that includes the first RACH occasion on the list 610.
  • FIG. 8 is a diagram illustrating a list 610 of RACH occasions that includes four RACH occasions (1.0.9, 3.0.9, 1.1.9, 3.1.9) according to an example embodiment.
  • FIGs. 10A and 10B illustrate possible RACH occasions within a RACH period of 8 radio frames for cells with PCI 100, 101, 102 and 103 according to another example embodiment.
  • FIG. 11 is a diagram illustrating a list 1110 of RACH occasions that were selected based on the second example.
  • FIG. 12 is a block diagram of a wireless station or node (e.g., UE, user device, AP, BS, eNB, gNB, RAN node, network node, TRP, or other node) 1300 according to an example embodiment.
  • a wireless station or node e.g., UE, user device, AP, BS, eNB, gNB, RAN node, network node, TRP, or other node
  • FIG. 1 is a block diagram of a wireless network 130.
  • user devices 131, 132, 133 and 135, which may also be referred to as mobile stations (MSs) or user equipment (UEs) may be connected (and in communication) with a base station (BS) 134, which may also be referred to as an access point (AP), an enhanced Node B (eNB), a gNB or a network node.
  • BS base station
  • AP access point
  • eNB enhanced Node B
  • gNB giga network node
  • UE user device and user equipment (UE) may be used interchangeably.
  • a BS may also include or may be referred to as a RAN (radio access network) node, and may include a portion of a BS or a portion of a RAN node, such as (e.g., such as a centralized unit (CU) and/or a distributed unit (DU) in the case of a split BS or split gNB).
  • a BS e.g., access point (AP), base station (BS) or (e)Node B (eNB), gNB, RAN node
  • AP access point
  • BS base station
  • eNB evolved Node B
  • gNB gNode B
  • RAN node may also be carried out by any node, server or host which may be operably coupled to a transceiver, such as a remote radio head.
  • BS (or AP) 134 provides wireless coverage within a cell 136, including to user devices (or UEs) 131, 132, 133 and 135. Although only four user devices (or UEs) are shown as being connected or attached to BS 134, any number of user devices may be provided.
  • BS 134 is also connected to a core network 150 via a SI interface 151. This is merely one simple example of a wireless network, and others may be used.
  • a base station (e.g., such as BS 134) is an example of a radio access network (RAN) node within a wireless network.
  • a BS (or a RAN node) may be or may include (or may alternatively be referred to as), e.g., an access point (AP), a gNB, an eNB, or portion thereof (such as a central/centralized unit (CU) and/or a distributed unit (DU) in the case of a split BS or split gNB), or other network node.
  • Some functionalities of the communication network may be carried out, at least partly, in a central/centralized unit, CU, (e.g., server, host or node) operationally coupled to distributed unit, DU, (e.g., a radio head/node).
  • CU central/centralized unit
  • DU distributed unit
  • 5G networks architecture may be based on a so-called CU-DU split.
  • the gNB-CU central node
  • the gNB-CU central node
  • the gNB-DUs may comprise e.g., a radio link control (RLC), medium access control (MAC) layer and a physical (PHY) layer
  • the gNB- CU also referred to as a CU
  • RLC radio link control
  • MAC medium access control
  • PHY physical
  • the gNB- CU also referred to as a CU
  • PDCP packet data convergence protocol
  • RRC radio resource control
  • IP internet protocol
  • a BS node e.g., BS, eNB, gNB, CU/DU, . . .
  • a radio access network may be part of a mobile telecommunication system.
  • a RAN radio access network
  • the RAN (RAN nodes, such as BSs or gNBs) may reside between one or more user devices or UEs and a core network.
  • each RAN node e.g., BS, eNB, gNB, CU/DU, . . .
  • BS may provide one or more wireless communication services for one or more UEs or user devices, e.g., to allow the UEs to have wireless access to a network, via the RAN node.
  • Each RAN node or BS may perform or provide wireless communication services, e.g., such as allowing UEs or user devices to establish a wireless connection to the RAN node, and sending data to and/or receiving data from one or more of the UEs.
  • a RAN node or network node may forward data to the UE that is received from a network or the core network, and/or forward data received from the UE to the network or core network.
  • RAN nodes or network nodes e.g., BS, eNB, gNB, CU/DU, . . .
  • RAN node or BS may perform a wide variety of other wireless functions or services, e.g., such as broadcasting control information (e.g., such as system information or on-demand system information) to UEs, paging UEs when there is data to be delivered to the UE, assisting in handover of a UE between cells, scheduling of resources for uplink data transmission from the UE(s) and downlink data transmission to UE(s), sending control information to configure one or more UEs, and the like.
  • broadcasting control information e.g., such as system information or on-demand system information
  • paging UEs when there is data to be delivered to the UE, assisting in handover of a UE between cells, scheduling of resources for uplink data transmission from the UE(s) and downlink data transmission to UE(s), sending control information to configure one or more UEs, and the like.
  • control information e.g., such as system information or on-demand system information
  • paging UEs when there
  • a user device or user node may refer to a portable computing device that includes wireless mobile communication devices operating either with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (MS), a mobile phone, a cell phone, a smartphone, a personal digital assistant (PDA), a handset, a device using a wireless modem (alarm or measurement device, etc.), a laptop and/or touch screen computer, a tablet, a phablet, a game console, a notebook, a vehicle, a sensor, and a multimedia device, as examples, or any other wireless device.
  • SIM subscriber identification module
  • a user device may also be (or may include) a nearly exclusive uplink only device, of which an example is a camera or video camera loading images or video clips to a network.
  • a user node may include a user equipment (UE), a user device, a user terminal, a mobile terminal, a mobile station, a mobile node, a subscriber device, a subscriber node, a subscriber terminal, or other user node.
  • a user node may be used for wireless communications with one or more network nodes (e.g., gNB, eNB, BS, AP, CU, DU, CU/DU) and/or with one or more other user nodes, regardless of the technology or radio access technology (RAT).
  • RAT radio access technology
  • core network 150 may be referred to as Evolved Packet Core (EPC), which may include a mobility management entity (MME) which may handle or assist with mobility /handover of user devices between BSs, one or more gateways that may forward data and control signals between the BSs and packet data networks or the Internet, and other control functions or blocks.
  • EPC Evolved Packet Core
  • MME mobility management entity
  • gateways may forward data and control signals between the BSs and packet data networks or the Internet, and other control functions or blocks.
  • 5G which may be referred to as New Radio (NR)
  • NR New Radio
  • New Radio (5G) development may support a number of different applications or a number of different data service types, such as for example: machine type communications (MTC), enhanced machine type communication (eMTC), Internet of Things (loT), and/or narrowband loT user devices, enhanced mobile broadband (eMBB), and ultra-reliable and low-latency communications (URLLC).
  • MTC machine type communications
  • eMTC enhanced machine type communication
  • LoT Internet of Things
  • URLLC ultra-reliable and low-latency communications
  • Many of these new 5G (NR) - related applications may require generally higher performance than previous wireless networks.
  • loT may refer to an ever-growing group of objects that may have Internet or network connectivity, so that these objects may send information to and receive information from other network devices.
  • many sensor type applications or devices may monitor a physical condition or a status, and may send a report to a server or other network device, e.g., when an event occurs.
  • Machine Type Communications MTC, or Machine to Machine communications
  • MTC Machine Type Communications
  • eMBB Enhanced mobile broadband
  • Ultra-reliable and low-latency communications is a new data service type, or new usage scenario, which may be supported for New Radio (5G) systems.
  • 5G New Radio
  • 3 GPP targets in providing connectivity with reliability corresponding to block error rate (BLER) of 10-5 and up to 1 ms U-Plane (user/data plane) latency, by way of illustrative example.
  • BLER block error rate
  • U-Plane user/data plane
  • URLLC user devices/UEs may require a significantly lower block error rate than other types of user devices/UEs as well as low latency (with or without requirement for simultaneous high reliability).
  • a URLLC UE or URLLC application on a UE
  • the techniques described herein may be applied to a wide variety of wireless technologies or wireless networks, such as 5G (New Radio (NR)), cmWave, and/or mmWave band networks, loT, MTC, eMTC, eMBB, URLLC, 6G, etc., or any other wireless network or wireless technology.
  • 5G New Radio
  • cmWave and/or mmWave band networks
  • loT loT
  • MTC mobile communications
  • eMTC eMTC
  • eMBB eMBB
  • URLLC 6G, etc.
  • 6G Wireless Fidelity
  • a random access (RACH) procedure may be used by a UE to establish a connection with a cell or gNB.
  • a UE may receive a RACH configuration index from a gNB via system information block (SIB) 1 that identifies a RACH configuration to be used for RACH preamble transmission.
  • SIB system information block
  • the RACH configuration may include information, e.g., such as an indication of time-frequency resources (or RACH occasions) in which transmission of a RACH preamble may take place, and information indicating a mapping between synchronization signal block (SSB) (or beam) indices and RACH occasions.
  • SSB synchronization signal block
  • the UE may select the best or strongest SSB, and then may transmit a RACH preamble via a RACH occasion that is associated with or mapped to the best or selected SSB.
  • a set of RACH occasions for a cell may be determined via a RACH (or PRACH) configuration, e.g., which may indicate a RACH period or RACH periodicity and offset (in radio frames), the specific slots and time occasions within each slot for RACH occasions.
  • the UE may select the RACH occasion corresponding to the best or strongest SSB beam measured by the UE, for uplink transmission of a RACH preamble to the gNB or cell.
  • Techniques are described herein that allow a list of RACH occasions to be determined by UE and gNB that are more distributed.
  • One RACH occasion of the list of RACH occasions is identified based on an index, and used for transmitting (by a UE) and receiving (by a gNB or network node) a RACH preamble.
  • potential RACH preamble inter-cell interference may be reduced, and the RACH preamble processing load at a gNB may be more distributed in time.
  • FIG. 2A is a flow chart illustrating operation according to an example embodiment.
  • Operation 210 includes determining a list of random access (RACH) occasions distributed within one or more RACH periods.
  • the list of RACH occasions may include a subset of available RACH occasions.
  • Operation 220 includes generating an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN).
  • Operation 230 includes identifying one of the RACH occasions of the list of RACH occasions based on the generated index.
  • operation 240 includes transmitting (e.g., by a UE or user device) or receiving (e.g., by a gNB or network node) a random access preamble via the identified RACH occasion.
  • the operations of FIG. 2A may apply to, or may be performed by, either a UE or user device, or a gNB or network node.
  • the generating may include generating the index into the list based on the physical cell identity (PCI), the global synchronization channel number (GSCN) and a system frame number (SFN).
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include selecting a plurality of the RACH occasions to be on the list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period.
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include selecting the plurality of RACH occasions wherein at least some of the RACH occasions are selected to be on the list such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match.
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include selecting a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; and selecting a second RACH occasion such that a first inter-RACH occasion distance between the first and second RACH occasions most closely matches a second inter-RACH occasion distance between the second RACH occasion and a slot position that is one RACH period after the first RACH occasion.
  • RACH random access
  • the method may include repeating or iteratively performing, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match, or the RACH occasions are selected that are most equally spaced apart.
  • the method may include if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeating one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • the selecting may include in case of a tie between two RACH occasions that are equally spaced apart or have equal inter-RACH occasion distances, selecting a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include selecting a plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include selecting a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; and selecting a second RACH occasion such that a sum of: 1) a square of a first inter-RACH occasion distance in slots between the first and second RACH occasions, plus 2) a square of a second inter-RACH occasion distance in slots between the second RACH occasion and a slot that is one RACH period after the first RACH occasion, is minimized.
  • the method may include repeating or iteratively performing, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • the method may include if all available
  • RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeating one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • the selecting may include in case of a tie between two RACH occasions that cause a sum of squared distances in slots between adjacent selected RACH occasions to be equal, selecting a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include determining a set of RACH occasions in one or more radio frames up to a RACH period; and if a synchronization signal burst (SSB) period is greater than a threshold, eliminating RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • RACH random access
  • the determining the list of random access (RACH) occasions distributed within one or more RACH periods may include receiving, by a user device from a network node, assistance information via system information block that provides configuration information for RACH occasions, including one or more parameters including one or more of: the RACH period or RACH periodicity, a starting symbol, a number of RACH preamble slots within a radio frame, a number of time durations within a slot, a RACH preamble duration and/or a subframe number for RACH occasions; and determining a set of RACH occasions in one or more radio frames up to a RACH period.
  • assistance information via system information block that provides configuration information for RACH occasions, including one or more parameters including one or more of: the RACH period or RACH periodicity, a starting symbol, a number of RACH preamble slots within a radio frame, a number of time durations within a slot, a RACH preamble duration and/or a subframe number for RACH occasions.
  • the determining the set of RACH occasions may include if a synchronization signal burst (SSB) period is greater than a threshold, eliminating RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • SSB synchronization signal burst
  • the method may further include determining the physical cell identity of a cell based on system information received from a network node; detecting a timing or position of a synchronization signal block from the network node; and determining the global synchronization channel number based on the timing or position of the synchronization signal block.
  • the list of RACH occasions may be eight RACH occasions in length.
  • the generating may include generating, by the user device, the index into the list based on the physical cell identity (PCI), the global synchronization channel number (GSCN) and a system frame number (SFN)/128.
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • the selecting the plurality of the RACH occasions to be on the list of RACH occasions may include selecting the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances(sqdist) in slots between adjacent selected RACH occasions is minimized, wherein a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and wherein a sum of squared distances for a list of RACH occasions(ro_l, ro_2, ro_3, . .
  • FIG. 2B is a flow chart illustrating operation according to another example embodiment.
  • Operation 250 includes selecting a plurality of random access (RACH) occasions to be on a list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period.
  • Operation 260 includes generating, e.g., pseudo-randomly generating, an index into the list of RACH occasions.
  • Operation 270 includes identifying one of the RACH occasions of the list of RACH occasions based on the generated index.
  • operation 280 includes transmitting or receiving a random access preamble via the identified RACH occasion.
  • the UE and gNB may identify one of the RACH occasions from the list of RACH occasions based on the index (e.g., the RACH occasion identified by, or associated with, the index).
  • the UE may transmit a RACH preamble via the identified RACH occasion (the indexed occasion), and the gNB or network node may receive (e.g., receive, detect and/or decode) the RACH preamble via the identified RACH occasion.
  • FIG. 3 is a flow chart illustrating operation of a user device (or UE) and network node (or gNB) according to an example embodiment.
  • a UE would perform steps (0)-(70), whereas gNb would perform steps (10)-(70) of the method or flow chart of FIG. 3.
  • the UE may determine a need to perform a RACH procedure, e.g., to establish a connection with a gNB.
  • one RACH period includes four radio frames (radio frames 0-3), with each radio frame including two half-frames (half-frame 0 and 1). Each half-frame includes 10 slots (slots 0-9). Thus, in this example, one RACH period includes 80 slots across 4 radio frames.
  • RACH occasion numbers are listed as: radioframe.half-frame.slot.
  • RACH occasion 0.0.9 corresponding to radio frame 0, half-frame 0 and slot 9
  • RACH occasion 1.0.9 corresponding to radio frame 1, half-frame 0 and slot 9
  • RACH occasion 1.1.9 corresponding to radio frame 1, half-frame 1 and slot 9
  • RACH occasion 2.0.9 corresponding to radio frame 2, half-frame 0 and slot 9
  • RACH occasion 2.1.9 corresponding to radio frame 2, half-frame 1 and slot 9
  • RACH occasion 3.0.9 corresponding to radio frame 3, half-frame 0 and slot 9
  • RACH occasion 3.1.9 corresponding to radio frame 3, half-frame 1 and slot 9
  • FIG. 5 is a diagram that illustrates remaining RACH occasions after some RACH occasions have been eliminated from the list of RACH occasions based on SSB period being greater than a threshold.
  • the SSB period may be 20ms or two radio frames, with only the even radio frames (0, 2, . . .) having SSBs (SSBs are transmitted only within the even radio frames (0, 2, . .
  • the UE may transmit the RACH preamble soon after measuring SSB(s) or soon after the radio frame that includes the SSBs (which may have been measured by the UE). There may not be sufficient time for the UE to both receive and measure SSBs and then transmit a RACH preamble within a RACH occasion within the same radio frame. After measuring SSBs (SSB beams) within radio frame 0, the UE may then transmit the RACH preamble via a RACH occasion during a RACH occasion of a next or subsequent radio frame. However, if the SSB period is greater than a threshold (e.g.
  • the UE may measure SSBs during radio frame 0 and/or 2, and then transmit a RACH preamble during RACH occasions during radio frames 1 and/or 3, respectively.
  • the UE and gNB may eliminate RACH occasions from the SSB radio frames (the even radio frames 0 and 2), leaving remaining possible (or candidate) RACH occasions 1.0.9, 1.1.9, 3.0.9 and 3.2.9 in radio frames 1 and 9, which is shown in FIG. 5.
  • the UE and gNB does not or may not need to eliminate any RACH occasions from the RACH occasions of one RACH period.
  • FIG. 6 is a diagram illustrating the list 610 of (e.g., ordered) RACH occasions that includes the first RACH occasion on the list 610.
  • the UE and gNB may select the first or earliest (e.g., earliest in time, within the RACH period) RACH occasion to be on the list of RACH occasions.
  • the first possible RACH occasion or earliest RACH occasion is RACH occasion 1.0.9 (corresponding to radio frame 1, half-frame 0 and slot 9).
  • This first or earliest RACH occasion of the possible RACH occasions is added or entered as the first entry on the list 610 of RACH occasions (see FIG. 6).
  • index 0 corresponds to RACH occasion 1.0.9, which has been added or entered as the first or earliest entry of the list 610 of RACH occasions.
  • the UE and gNB may select for the next RACH occasion index on the list, the RACH occasion that is most equally spaced apart within the RACH period, or selecting RACH occasions for the list, where two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match.
  • the distance of one full RACH period from the first RACH occasion on the list 610 may be considered when looking at spacing between RACH occasions.
  • FIG. 9 is a diagram of the list 610 of RACH occasions that includes all 8 selected RACH occasions for the list. The list 610 of RACH occasions is now complete (the list 610 is full, as it has 8 RACH occasions).
  • the UE and/or gNB may identify a RACH occasion based on an index. For example, an index to the list 610 of RACH occasions may be generated, e.g., based on a function of one or more of: PCI, GSCN and/or SFN.
  • FIG. 11 is a diagram illustrating a list 1110 of RACH occasions that were selected based on the second example.
  • the RACH occasion is selected that is most equally spaced between the first RACH occasion (at 0.0.9) and a slot that is 1 RACH period (or 8 radio frames) away from the first RACH occasion (which would be slot at 8.0.9).
  • RACH occasion 4.0.9 which is exactly 4 radio frames away from the first RACH occasion 0.0.9, although the selected RACH occasion does not have to be exactly in the middle between those two, just the RACH occasion that is most equally spaced between those two points.
  • the UE will select a third RACH occasion for the list 1110, which is most equally spaced between either the first and second RACH occasions (0.0.9 and 4.0.9) or most equally spaced between 4.0.9 and the slot at 8.0.9 that is 1 RACH period away from the first RACH period.
  • the UE and gNB may search for the RO that can fill or be located in a gap and which is most equally spaced between two selected RACH occasions or between the last selected RACH occasion and the slot at 8.0.9.
  • RACH occasions 2.0.9 and 6.0.9 are most equally spaced between selected RACH occasions and/or between a (e.g., last) selected RACH occasion and the slot at 8.0.9.
  • This process or procedure may be repeated or performed iteratively, until all entries of the list 1110 have been filled with RACH occasions or until all available RACH occasions of 1 RACH period have been selected.
  • the selected RACH occasions for the list 1110 includes 0.0.9, 0.1.9, 1.0.9, 1.1.9, 2.0.9, 2.1.9, 3.0.9, 3.1.9, 4.0.9, 4.1.9, 5.0.9, 5.1.9, 6.0.9, 6.1.9, 7.0.9 and 7.1.9.
  • there are more than 8 available or possible RACH occasions and the list 1110 of RACH occasions is filled with 8 RACH occasions from the available RACH occasions of the RACH period. Because the list 1110 of RACH occasions is now filled, there is no need to repeat any of the selected RACH occasions.
  • RACH occasions for the list 610 of RACH occasions (first example) and/or list 1110 of RACH occasions (second example) may be selected that are distributed, and may even be or include RACH occasion(s) that are most equally spaced apart as possible within the RACH period.
  • One example technique that may be used to select RACH occasions that are most equally spaced apart as possible within a RACH period may be to select RACH occasions such that a sum of squared distances (e.g., distance measured in slots) between adjacent selected RACH occasions is minimized. By minimizing these squared distances between selected RACH occasions, this may result in selecting RACH occasions for the list of RACH occasions that are most equally spaced apart, and/or create a most equally spaced apart list of RACH occasions within 1 period.
  • a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and this provides a positive value associated with distance, although this is actually a square of the distance between two RACH occasions.
  • the UE and gNB may select the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances(sqdist) in slots between adjacent selected RACH occasions is minimized, wherein a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and wherein a sum of squared distances for a list of RACH occasions(ro_l, ro_2, ro_3, . .
  • the UE and gNB may look for the RACH occasion that minimizes this sum of squared distances for the new/updated list of RACH occasions.
  • the most equally spaced RACH occasion ro_i at position rf_i.hf_i.s_i is the one that minimizes the sum of squared distances of the RACH occasions, e.g., the RACH occasion with or associated with minimal value of sqdist( ⁇ rf. hf. s, rf_i.hf_i.s_i, rf + p.hf.s ⁇ ).
  • the earliest one i.e. the one with smallest position, is selected to be added to the list of RACH occasions.
  • RACH occasion 3.0.9 gives the smallest value and is added to the index list and the distance list ⁇ 1.0.9, 3.0.9, 5.0.9 ⁇ ).
  • the earlier RACH occasion 1.1.9 is selected to be added to the list next.
  • the remaining RACH occasion 3.1.9 is added to the list.
  • Example 1 An apparatus (e.g., 1300, FIG. 5; and/or UE 410 in FIG. 4) comprising: at least one processor (e.g., processor 1304, FIG. 5); and at least one memory (e.g., memory 1306, FIG. 5) storing instructions that, when executed by the at least one processor (1304), cause the apparatus at least to: determine a list of random access (RACH) occasions distributed within one or more RACH periods; generate an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN); identify one of the RACH occasions of the list of RACH occasions based on the generated index; and transmit or receive a random access preamble via the identified RACH occasion.
  • processor e.g., processor 1304, FIG. 5
  • memory e.g., memory 1306, FIG. 5
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • Example 2 The apparatus of example 1 : wherein the apparatus comprises or is provided in a user device or user equipment; and wherein the apparatus is caused to transmit the random access preamble via the identified RACH occasion.
  • Example 3 The apparatus of example 1 : wherein the apparatus comprises or is provided in a network node or gNB; and wherein the apparatus is caused to receive the random access preamble via the identified RACH occasion.
  • Example 4 The apparatus of any of examples 1-3, wherein the apparatus caused to generate comprises the apparatus caused to: generate the index into the list based on the physical cell identity (PCI), the global synchronization channel number (GSCN) and a system frame number (SFN).
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • Example 5 The apparatus of any of examples 1-4, wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: select a plurality of the RACH occasions to be on the list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period.
  • RACH random access
  • Example 6 The apparatus of any of examples 1-5, wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: select the plurality of RACH occasions wherein at least some of the RACH occasions are selected to be on the list such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match.
  • RACH random access
  • Example 7 The apparatus of any of examples 1-6, wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: select a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; select a second RACH occasion such that a first inter-RACH occasion distance between the first and second RACH occasions most closely matches a second inter-RACH occasion distance between the second RACH occasion and a slot position that is one RACH period after the first RACH occasion.
  • RACH random access
  • Example 8 The apparatus of any of examples 6-7, wherein the apparatus is caused to repeat or iteratively perform, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match, or the RACH occasions are selected that are most equally spaced apart.
  • Example 9 The apparatus of example 8, wherein the apparatus is further caused to: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeat one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 10 The apparatus of any of examples 5-9, wherein the apparatus caused to select comprises the apparatus caused to: in case of a tie between two RACH occasions that are equally spaced apart or have equal inter-RACH occasion distances, select a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 11 The apparatus of any of claims 1-8, wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: select a plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • RACH random access
  • Example 13 The apparatus of any of examples 11-12, wherein the apparatus is caused to: repeat or iteratively perform, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • Example 14 The apparatus of example 13, wherein the apparatus is further caused to: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeat one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 15 The apparatus of any of examples 11-14, wherein the apparatus caused to select comprises the apparatus caused to: in case of a tie between two RACH occasions that cause a sum of squared distances in slots between adjacent selected RACH occasions to be equal, select a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 16 The apparatus of any of examples 1-15, wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: determine a set of RACH occasions in one or more radio frames up to a RACH period; and if a synchronization signal burst (SSB) period is greater than a threshold, eliminate RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • RACH random access
  • Example 17 The apparatus of any of examples 1-2 and 4-16, wherein the apparatus comprises a user device, and wherein the apparatus caused to determine the list of random access (RACH) occasions distributed within one or more RACH periods comprises the apparatus caused to: receive, by the user device from a network node, assistance information via system information block that provides configuration information for RACH occasions, including one or more parameters including one or more of: the RACH period or RACH periodicity, a starting symbol, a number of RACH preamble slots within a radio frame, a number of time durations within a slot, a RACH preamble duration and/or a subframe number for RACH occasions; and determine a set of RACH occasions in one or more radio frames up to a RACH period.
  • RACH random access
  • Example 18 The apparatus of example 17, wherein the apparatus caused to determine the set of RACH occasions comprises the apparatus caused to: if a synchronization signal burst (SSB) period is greater than a threshold, eliminate RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • SSB synchronization signal burst
  • Example 19 The apparatus of any of examples 1-2 and 4-18, wherein the apparatus comprises or is provided in a user device, the apparatus further caused to: determine the physical cell identity of a cell based on system information received from the network node; detect a timing or position of a synchronization signal block from the network node; and determine the global synchronization channel number based on the timing or position of the synchronization signal block.
  • Example 20 The apparatus of any of examples 1-19, wherein the list of RACH occasions is eight RACH occasions in length.
  • Example 22 The apparatus of example 11, wherein the apparatus caused to select the plurality of the RACH occasions to be on the list of RACH occasions comprises the apparatus caused to: select the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances(sqdist) in slots between adjacent selected RACH occasions is minimized, wherein a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and wherein a sum of squared distances for a list of RACH occasions(ro_l, ro_2, ro_3, . .
  • Example 23 A method comprising: determining a list of random access (RACH) occasions distributed within one or more RACH periods; generating an index into the list of RACH occasions based on a physical cell identity (PCI) and a global synchronization channel number (GSCN); identifying one of the RACH occasions of the list of RACH occasions based on the generated index; and transmitting or receiving a random access preamble via the identified RACH occasion.
  • RACH random access
  • Example 24 The method of example 23, comprising: transmitting, by a user device, the random access preamble via the identified RACH occasion.
  • Example 26 The method of any of examples 23-25, wherein the generating comprises: generating the index into the list based on the physical cell identity (PCI), the global synchronization channel number (GSCN) and a system frame number (SFN).
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • Example 27 The method of any of examples 23-26, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: selecting a plurality of the RACH occasions to be on the list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period.
  • RACH random access
  • Example 28 The method of any of examples 23-27, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: selecting the plurality of RACH occasions wherein at least some of the RACH occasions are selected to be on the list such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match.
  • RACH random access
  • Example 30 The method of any of examples 28-29, comprising: repeating or iteratively performing, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match, or the RACH occasions are selected that are most equally spaced apart.
  • Example 31 The method of example 30, further comprising: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeating one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 32 The method of any of examples 27-31, wherein the selecting comprises: in case of a tie between two RACH occasions that are equally spaced apart or have equal inter-RACH occasion distances, selecting a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 33 The method of any of examples 23-30, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: selecting a plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • RACH random access
  • Example 34 The method of any of examples 23-33, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: selecting a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; and selecting a second RACH occasion such that a sum of: 1) a square of a first inter-RACH occasion distance in slots between the first and second RACH occasions, plus 2) a square of a second inter-RACH occasion distance in slots between the second RACH occasion and a slot that is one RACH period after the first RACH occasion, is minimized.
  • RACH random access
  • Example 35 The method of any of examples 33-34, comprising: repeating or iteratively performing, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • Example 36 The method of example 35, further comprising: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeating one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 37 The method of any of examples 33-36, wherein the selecting comprises: in case of a tie between two RACH occasions that cause a sum of squared distances in slots between adjacent selected RACH occasions to be equal, selecting a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 38 The method of any of examples 23-37, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: determining a set of RACH occasions in one or more radio frames up to a RACH period; and if a synchronization signal burst (SSB) period is greater than a threshold, eliminating RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • RACH random access
  • Example 39 The method of any of examples 23-24 and 26-38, wherein the determining the list of random access (RACH) occasions distributed within one or more RACH periods comprises: receiving, by a user device from a network node, assistance information via system information block that provides configuration information for RACH occasions, including one or more parameters including one or more of: the RACH period or RACH periodicity, a starting symbol, a number of RACH preamble slots within a radio frame, a number of time durations within a slot, a RACH preamble duration and/or a subframe number for RACH occasions; and determining a set of RACH occasions in one or more radio frames up to a RACH period.
  • assistance information via system information block that provides configuration information for RACH occasions, including one or more parameters including one or more of: the RACH period or RACH periodicity, a starting symbol, a number of RACH preamble slots within a radio frame, a number of time durations within a slot, a RACH preamble duration and/or a subframe
  • Example 40 The method of example 39, wherein the determining the set of RACH occasions comprises: if a synchronization signal burst (SSB) period is greater than a threshold, eliminating RACH occasions in the set of RACH occasions in any radio frames that have a synchronization signal burst transmission.
  • SSB synchronization signal burst
  • Example 41 The method of any of examples 23-24 and 26-40, further comprising: determining the physical cell identity of a cell based on system information received from a network node; detecting a timing or position of a synchronization signal block from the network node; and determining the global synchronization channel number based on the timing or position of the synchronization signal block.
  • Example 42 The method of any of examples 23-41, wherein the list of RACH occasions is eight RACH occasions in length.
  • Example 43 The method of example 26, wherein the generating comprises: generating, by the user device, the index into the list based on the physical cell identity (PCI), the global synchronization channel number (GSCN) and a system frame number (SFN)/128.
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • Example 44 The method of example 33, wherein the selecting the plurality of the RACH occasions to be on the list of RACH occasions comprises: selecting the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances(sqdist) in slots between adjacent selected RACH occasions is minimized, wherein a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and wherein a sum of squared distances for a list of RACH occasions(ro_l, ro_2, ro_3, . .
  • Example 45 An apparatus comprising: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to: select a plurality of random access (RACH) occasions to be on a list of RACH occasions, wherein at least some of the RACH occasions are selected that are most equally spaced apart within a RACH period; generate an index into the list of RACH occasions; identify one of the RACH occasions of the list of RACH occasions based on the generated index; and transmit or receive a random access preamble via the identified RACH occasion.
  • RACH random access
  • Example 46 The apparatus of example 45, wherein the apparatus caused to generate comprises the apparatus caused to: generate, by the user device or network node, the index into the list of RACH occasions based on one or more of: a physical cell identity (PCI); a global synchronization channel number (GSCN); and/or a system frame number (SFN).
  • PCI physical cell identity
  • GSCN global synchronization channel number
  • SFN system frame number
  • Example 47 The apparatus of any of examples 45-46, wherein the apparatus caused to select the plurality of RACH occasions comprises the apparatus caused to: select the plurality of RACH occasions wherein at least some of the RACH occasions are selected to be on the list such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match.
  • Example 48 The apparatus of any of examples 45-47, wherein the apparatus caused to select the plurality of RACH occasions comprises the apparatus caused to: select a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; select a second RACH occasion such that a first inter-RACH occasion distance between the first and second RACH occasions most closely matches a second inter-RACH occasion distance between the second RACH occasion and a slot position that is one RACH period after the first RACH occasion.
  • Example 49 The apparatus of any of examples 45-48, wherein the apparatus is caused to: repeat or iteratively perform, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions such that two or more inter-RACH occasion distances between adjacent selected RACH occasions most closely match, or the RACH occasions are selected that are most equally spaced apart.
  • Example 50 The apparatus of example 49, wherein the apparatus is further caused to: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeat one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 51 The apparatus of any of examples 45-50 wherein the apparatus caused to select comprises the apparatus caused to: in case of a tie between two RACH occasions that are equally spaced apart or have equal inter-RACH occasion distances, select a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 52 The apparatus of any of examples 45-51, wherein the apparatus caused to select the plurality of RACH occasions comprises the apparatus caused to: select the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • Example 53 The apparatus of any of examples 45-52, wherein the apparatus caused to select the plurality of RACH occasions comprises the apparatus caused to: select a first RACH occasion that is an earliest RACH occasion in a RACH period to be on the list of RACH occasions; select a second RACH occasion such that a sum of: 1) a square of a first inter-RACH occasion distance in slots between the first and second RACH occasions, plus 2) a square of a second inter-RACH occasion distance in slots between the second RACH occasion and a slot that is one RACH period after the first RACH occasion, is minimized.
  • Example 54 The apparatus of any of examples 52-53, wherein the apparatus is caused to: repeat or iteratively perform, until the list of RACH occasions has been filled or all available RACH occasions of the RACH period have been selected, the selecting of one or more additional RACH occasions to be on the list of RACH occasions, such that a sum of squared distances in slots between adjacent selected RACH occasions is minimized.
  • Example 55 The apparatus of example 54, wherein the apparatus is further caused to: if all available RACH occasions of the RACH period have been selected but the list of RACH occasions has not been filled, then repeat one or more of the RACH occasions already on the list, until the list of RACH occasions has been filled.
  • Example 56 The apparatus of any of examples 52-55, wherein the apparatus caused to select comprises the apparatus caused to: in case of a tie between two RACH occasions that cause a sum of squared distances in slots between adjacent selected RACH occasions to be equal, select a RACH occasion of the two RACH occasions to be on the list that occurs earlier in time.
  • Example 57 The apparatus of any of examples 45-56, wherein the apparatus caused to select the plurality of the RACH occasions to be on the list of RACH occasions comprises the apparatus caused to: select the plurality of the RACH occasions to be on the list of RACH occasions, such that a sum of squared distances(sqdist) in slots between adjacent selected RACH occasions is minimized, wherein a squared distance in slots sqdist(ro_l, ro_2) between two RACH occasions rol and ro2 is defined as square(pos(rol) - pos(ro2)), and wherein a sum of squared distances for a list of RACH occasions(ro_l, ro_2, ro_3, . .
  • Processor 1304 may be programmable and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as one or more of the tasks or methods described above.
  • Processor 1304 may be (or may include), for example, hardware, programmable logic, a programmable processor that executes software or firmware, and/or any combination of these.
  • processor 1304 and transceiver 1302 together may be considered as a wireless transmitter/receiver system, for example.
  • a controller (or processor) 1308 may execute software and instructions, and may provide overall control for the station 1300, and may provide control for other systems not shown in FIG. 12, such as controlling input/output devices (e.g., display, keypad), and/or may execute software for one or more applications that may be provided on wireless station 1300, such as, for example, an email program, audio/video applications, a word processor, a Voice over IP application, or other application or software.
  • RF or wireless transceiver(s) 1302A/1302B may receive signals or data and/or transmit or send signals or data.
  • Processor 1304 (and possibly transceivers 1302A/1302B) may control the RF or wireless transceiver 1302 A or 1302B to receive, send, broadcast or transmit signals or data.
  • Example embodiments are provided or described for each of the example methods, including: An apparatus (e.g., 1300, FIG. 12) including means (e.g., processor 1304, RF transceivers 1302A and/or 1302B, and/or memory 1306, in FIG. 12) for carrying out any of the methods; a non-transitory computer-readable storage medium (e.g., memory 1306, FIG. 12) comprising instructions stored thereon that, when executed by at least one processor (processor 1304, FIG. 12), are configured to cause a computing system (e.g., 1300, FIG. 12) to perform any of the example methods; and an apparatus (e.g., 1300, FIG. 12) including at least one processor (e.g., processor 1304, FIG.
  • At least one memory e.g., memory 1306, FIG. 12
  • the at least one memory 1306) and the computer program code configured to, with the at least one processor (1304), cause the apparatus (e.g., 1300) at least to perform any of the example methods.
  • Embodiments of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them.
  • Embodiments may be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, a data processing apparatus, e.g., a programmable processor, a computer, or multiple computers.
  • Embodiments may also be provided on a computer readable medium or computer readable storage medium, which may be a non-transitory medium.
  • embodiments of the various techniques described herein may use a cyber-physical system (CPS) (a system of collaborating computational elements controlling physical entities).
  • CPS may enable the embodiment and exploitation of massive amounts of interconnected ICT devices (sensors, actuators, processors microcontrollers,...) embedded in physical objects at different locations.
  • ICT devices sensors, actuators, processors microcontrollers, etc.
  • Mobile cyber physical systems in which the physical system in question has inherent mobility, are a subcategory of cyber-physical systems. Examples of mobile physical systems include mobile robotics and electronics transported by humans or animals. The rise in popularity of smartphones has increased interest in the area of mobile cyber-physical systems. Therefore, various embodiments of techniques described herein may be provided via one or more of these technologies.
  • Method steps may be performed by one or more programmable processors executing a computer program or computer program portions to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • FPGA field programmable gate array
  • ASIC application-specific integrated circuit

Landscapes

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

Abstract

Un procédé comprend la détermination d'une liste d'occasions d'accès aléatoire (RACH) distribuées dans une ou plusieurs périodes RACH ; la génération d'un indice dans la liste d'occasions RACH sur la base d'une identité de cellule physique (PCI) et d'un numéro de canal de synchronisation global (GSCN) ; l'identification de l'une des occasions RACH de la liste d'occasions RACH sur la base de l'indice généré ; et l'émission ou la réception d'un préambule d'accès aléatoire par l'intermédiaire de l'occasion RACH identifiée.
PCT/EP2024/083888 2023-12-22 2024-11-28 Indice dans une liste d'occasions d'accès aléatoire Pending WO2025131609A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GB2319891.4A GB2636827A (en) 2023-12-22 2023-12-22 Index into list of random access occasions
GB2319891.4 2023-12-22

Publications (1)

Publication Number Publication Date
WO2025131609A1 true WO2025131609A1 (fr) 2025-06-26

Family

ID=89768093

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2024/083888 Pending WO2025131609A1 (fr) 2023-12-22 2024-11-28 Indice dans une liste d'occasions d'accès aléatoire

Country Status (2)

Country Link
GB (1) GB2636827A (fr)
WO (1) WO2025131609A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210112602A1 (en) * 2018-02-16 2021-04-15 Telefonaktiebolaget Lm Ericsson (Publ) Methods providing rach occasion indication for random access procedure initiated by pdcch order and related wireless terminals and base stations

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210112602A1 (en) * 2018-02-16 2021-04-15 Telefonaktiebolaget Lm Ericsson (Publ) Methods providing rach occasion indication for random access procedure initiated by pdcch order and related wireless terminals and base stations

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ERICSSON: "Initial Access Aspects", vol. RAN WG1, no. e-Meeting; 20210816 - 20210827, 6 August 2021 (2021-08-06), XP052038183, Retrieved from the Internet <URL:https://ftp.3gpp.org/tsg_ran/WG1_RL1/TSGR1_106-e/Docs/R1-2107050.zip R1-2107050 Initial Access Aspects.docx> [retrieved on 20210806] *

Also Published As

Publication number Publication date
GB2636827A (en) 2025-07-02
GB202319891D0 (en) 2024-02-07

Similar Documents

Publication Publication Date Title
US12177801B2 (en) Synchronization priority for sidelink wireless communications
US11595854B2 (en) Use of wait period to obtain on-demand system information for wireless networks
US20170373907A1 (en) Use of frequency offset information for wireless networks
CN110999481A (zh) 减少无线网络中上行链路信道与相邻信道的tdd传输之间干扰的技术
US20180049080A1 (en) Network controlled sharing of measurement gaps for intra and inter frequency measurements for wireless networks
TW201822553A (zh) 測量方法、終端設備和網路設備
US12004101B2 (en) Method and device for receiving information and transmitting information
WO2015196563A1 (fr) Procédé, dispositif, terminal et station de base pour traiter une mesure de cellule
EP4278654B1 (fr) Enregistrement et rapport de procédure d&#39;accès aléatoire pour réseaux sans fil
EP3780863B1 (fr) Procédé et dispositif de communication, appareil et support d&#39;enregistrement
US12267260B2 (en) Synchronization signaling block compatible interference coordination patterns to reduce interference in wireless networks
WO2019048483A1 (fr) Indication de bloc de signal de synchronisation pour réseaux sans fil
US11723052B2 (en) Adjusting a repetition operation of uplink control information associated with multiple transmission reception points
US20250081055A1 (en) Measurement configuration update during conditional reconfiguration for pscell for wireless networks
US10966243B2 (en) Flexible resource usage between scheduling-based and contention-based resource access for wireless networks
CN111713177B (zh) 在用户设备处对smtc信息的处理
WO2025131609A1 (fr) Indice dans une liste d&#39;occasions d&#39;accès aléatoire
WO2015197129A1 (fr) Balayages longs sur des canaux candidats qui sont un sous-ensemble de canaux sur lesquels des balayages courts ont été réalisés
WO2018224545A1 (fr) Utilisation de mesures de transfert pour des réseaux sans fil sur la base d&#39;une condition de blocage de signal
US20240251448A1 (en) Rach process for antenna-distributed networks
US12477586B2 (en) Starting random access channel occasion determination for multiple PRACH transmissions for wireless networks
US20240147339A1 (en) Use of estimated arrival probability-related information to select target secondary nodes for early data forwarding for dual connectivity wireless communications
US20250212231A1 (en) User equipment for sidelink transmission
WO2024078772A1 (fr) Commande de surveillance de réponse d&#39;accès aléatoire pour réseaux sans fil
WO2025257703A1 (fr) Protocoles d&#39;accès aléatoire améliorés

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: 24812532

Country of ref document: EP

Kind code of ref document: A1