# US 2025/0159619 A1 · Ss/pbch block patterns > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2025/0159619 A1 - Document ID: US20250159619A1 - Status: Published application - Kind: A1 - Application number: 18/926,195 - Filed: 2024-10-24 - Published: 2025-05-15 - Earliest claimed: 2023-11-09 - Assignees: Samsung Electronics Co., Ltd. - Applicants: Samsung Electronics Co., Ltd. - Inventors: Hongbo Si; Eko Onggosanusi - Web page: https://patentgrep.com/patent/US20250159619A1 ## CPC - H04W 56/001: {Synchronization between nodes} - H04W 48/10: using broadcasted information - H04W 72/044: based on the type of the allocated resource - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract Methods and apparatuses for synchronization signal/physical broadcast channel (SS/PBCH) block pattern. A method of a user equipment (UE) in a wireless communication system includes determining a pattern for SS/PBCH blocks including N candidate SS/PBCH blocks in a time domain and M candidate SS/PBCH blocks in a frequency domain and identifying, for a SS/PBCH block, a first index īt(0≤īt≤N−1) from the N candidate SS/PBCH blocks in the time domain and a second index īf(0≤īf≤M−1) from M candidate SS/PBCH blocks in the frequency domain. The method further includes receiving, from a base station (BS), the SS/PBCH block based on the pattern. ## Claims ### Claim 1 A user equipment (UE) in a wireless communication system, the UE comprising: a processor configured to: determine a pattern for synchronization signals and physical broadcast channel (SS/PBCH) blocks including N candidate SS/PBCH blocks in a time domain and M candidate SS/PBCH blocks in a frequency domain; and identify, for a SS/PBCH block, (i) a first index īt (0≤īt≤N−1) from the N candidate SS/PBCH blocks in the time domain and (ii) a second index īf(0≤īf≤M−1) from M candidate SS/PBCH blocks in the frequency domain; and a transceiver operably coupled to the processor, the transceiver configured to receive, from a base station (BS), the SS/PBCH block based on the pattern. ### Claim 2 (depends on 1) The UE of claim 1, wherein first symbols for the N candidate SS/PBCH blocks in the time domain are given by Sstart+Nsymbslot·K·n, where: K is a number of slots for a predefined time unit; Nsymbslot is a number of symbols in a slot; Sstart is a set of symbols as first symbols of candidate SS/PBCH blocks within the predefined time unit; and n is an index of the predefined time unit. ### Claim 3 (depends on 1) The UE of claim 1, wherein frequency locations for the M candidate SS/PBCH blocks in the frequency domain are given by fstart+(m−1)·finterval, where: fstart is a frequency location of a lowest candidate SS/PBCH block within the M candidate SS/PBCH blocks; m is an index of a candidate SS/PBCH block within the M candidate SS/PBCH blocks, with 1≤m≤M; and finterval is an interval between two consecutive candidate SS/PBCH blocks within the M candidate SS/PBCH blocks, which is applicable when M>1. ### Claim 4 (depends on 3) The UE of claim 3, wherein M, fstart, and finterval are: predefined for a cell in an initial cell search procedure; or provided by higher layer parameters for a cell after the initial cell search procedure. ### Claim 5 (depends on 1) The UE of claim 1, wherein the processor is further configured to: determine a candidate SS/PBCH block index ī based on the first index īt and the second index īf, as one of: ι ¯ = ι ¯ t · M + ι ¯ f ; or ι ¯ = ι ¯ f · N + ι ¯ t . ### Claim 6 (depends on 1) The UE of claim 1, wherein the processor is further configured to determine SS/PBCH blocks are quasi-co-located (QCLed) when the SS/PBCH blocks are with a same value of īt and a same value of īf. ### Claim 7 (depends on 1) The UE of claim 1, wherein the processor is further configured to: determine a first bitmap indicating actually transmitted SS/PBCH blocks in the time domain; and determine a second bitmap indicating actually transmitted SS/PBCH blocks in the frequency domain. ### Claim 8 A base station (BS) in a wireless communication system, the BS comprising: a processor configured to: determine a pattern for synchronization signals and physical broadcast channel (SS/PBCH) blocks including N candidate SS/PBCH blocks in a time domain and M candidate SS/PBCH blocks in a frequency domain; and determine, for a SS/PBCH block, (i) a first index īt (0≤īt≤N−1) from the N candidate SS/PBCH blocks in the time domain and (ii) a second index īf(0≤īf≤M−1) from M candidate SS/PBCH blocks in the frequency domain; and a transceiver operably coupled to the processor, the transceiver configured to transmit, to a user equipment (UE), the SS/PBCH block based on the pattern. ### Claim 9 (depends on 8) The BS of claim 8, wherein first symbols for the N candidate SS/PBCH blocks in the time domain are given by Sstart+Nsymbslot·K·n, where: K is a number of slots for a predefined time unit; Nsymbslot is a number of symbols in a slot; Sstart is a set of symbols as first symbols of candidate SS/PBCH blocks within the predefined time unit; and n is an index of the predefined time unit. ### Claim 10 (depends on 8) The BS of claim 8, wherein frequency locations for the M candidate SS/PBCH blocks in the frequency domain are given by fstart+(m−1)·finterval, where: fstart is a frequency location of a lowest candidate SS/PBCH block within the M candidate SS/PBCH blocks; m is an index of a candidate SS/PBCH block within the M candidate SS/PBCH blocks, with 1≤m≤M; and finterval is an interval between two consecutive candidate SS/PBCH blocks within the M candidate SS/PBCH blocks, which is applicable when M>1. ### Claim 11 (depends on 10) The BS of claim 10, wherein M, fstart, and finterval are: predefined for a cell in an initial cell search procedure; or provided by higher layer parameters for a cell after the initial cell search procedure. ### Claim 12 (depends on 8) The BS of claim 8, wherein the processor is further configured to: determine a candidate SS/PBCH block index ī based on the first index īt and the second index īf, as one of: ι ¯ = ι ¯ t · M + ι ¯ f ; or ι ¯ = ι ¯ f · N + ι ¯ t . ### Claim 13 (depends on 8) The BS of claim 8, wherein the processor is further configured to determine SS/PBCH blocks are quasi-co-located (QCLed) when the SS/PBCH blocks are with a same value of īt and a same value of īf. ### Claim 14 (depends on 8) The BS of claim 8, wherein the processor is further configured to: determine a first bitmap indicating actually transmitted SS/PBCH blocks in the time domain; and determine a second bitmap indicating actually transmitted SS/PBCH blocks in the frequency domain. ### Claim 15 A method of a user equipment (UE) in a wireless communication system, the method comprising: determining a pattern for synchronization signals and physical broadcast channel (SS/PBCH) blocks including N candidate SS/PBCH blocks in a time domain and M candidate SS/PBCH blocks in a frequency domain; identifying, for a SS/PBCH block, (i) a first index īt(0≤īt≤N−1) from the N candidate SS/PBCH blocks in the time domain and (ii) a second index īf(0≤īf≤M−1) from M candidate SS/PBCH blocks in the frequency domain; and receiving, from a base station (BS), the SS/PBCH block based on the pattern. ### Claim 16 (depends on 15) The method of claim 15, wherein first symbols for the N candidate SS/PBCH blocks in the time domain are given by Sstart+Nsymbslot·K·n, where: K is a number of slots for a predefined time unit; Nsymbslot is a number of symbols in a slot; Sstart is a set of symbols as first symbols of candidate SS/PBCH blocks within the predefined time unit; and n is an index of the predefined time unit. ### Claim 17 (depends on 15) The method of claim 15, wherein frequency locations for the M candidate SS/PBCH blocks in the frequency domain are given by fstart+(m−1)·finterval, where: fstart is a frequency location of a lowest candidate SS/PBCH block within the M candidate SS/PBCH blocks; m is an index of a candidate SS/PBCH block within the M candidate SS/PBCH blocks, with 1≤m≤M; finterval is an interval between two consecutive candidate SS/PBCH blocks within the M candidate SS/PBCH blocks, which is applicable when M>1; and M, fstart, and finterval are predefined for a cell in an initial cell search procedure, or provided by higher layer parameters for a cell after the initial cell search procedure. ### Claim 18 (depends on 15) The method of claim 15 further comprising: determining a candidate SS/PBCH block index ī based on the first index īt and the second index īf, as one of: ι ¯ = ι ¯ t · M + ι ¯ f ; or ι ¯ = ι ¯ f · N + ι ¯ t . ### Claim 19 (depends on 15) The method of claim 15 further comprising: determining SS/PBCH blocks are quasi-co-located (QCLed) when the SS/PBCH blocks are with a same value of īt and a same value of īf. ### Claim 20 (depends on 15) The method of claim 15 further comprising: determining a first bitmap indicating actually transmitted SS/PBCH blocks in the time domain; and determining a second bitmap indicating actually transmitted SS/PBCH blocks in the frequency domain.