SIGNALS

BACKGROUND

1. Field

[0001] The present disclosure is directed to a method and apparatus for

communicating synchronization signals. More particularly, the present disclosure is directed to communicating synchronization signals on a wireless wide area network.

2. Introduction

[0002] Presently, wireless communication devices, such as user equipment, communicate with other communication devices using wireless signals. It is expected that new Fifth Generation (5G) Radio Access Technology (RAT), otherwise known as New Radio (NR) RAT, adopts dense small cell deployment in order to increase system capacity and to utilize various ranges of spectrum, such as frequency ranges both below 6GHz and above 6GHz. In high frequency bands, such as above 6GHz, dense small cell deployment is crucial to avoid coverage holes. With an increased number of cells, the number of supported cell Identities (IDs) needs to be increased for flexible network deployment without complex cell ID planning and for reducing potential cell ID confusion at a User Equipment (UE).

[0003] A proposal on Synchronization Signals (SS) design for new 5G RAT can include a method to use SS sequences of the length same as Long Term Evolution (LTE) Primary Synchronization Signals (PSS) and Secondary Synchronization Signals (SSS) and to employ power boosting for (SS) transmission. However, this proposal may not be suitable for support of a larger number of cell ID hypotheses, such as 1000 cell ID hypotheses. With short-length sequences, the number of sequences with good cross-correlation is expected to be limited, and cross-correlation performance among sequences would greatly improve with a longer sequence length. Further, power boosting of SS does not improve SS Signal-to-Interference and Noise Ratio (SINR) observed at a UE receiver. [0004] Repetition of two short Zadoff-Chu (ZC) sequences in the time domain using doubled subcarrier spacing allows frequency offset estimation. However, Cyclic Prefix (CP) overhead can increase or CP length scaling can result in inter-symbol interference in high delay-spread channel conditions.

[0005] For message-based SSS transmission using channel coding, decoding performance is heavily dependent on timing, frequency, and channel estimation performances. With one or three PSS sequences along with dense cell deployment, accurate channel estimation may not be possible. Furthermore, SSS detection and demodulation performance would be limited by co-channel interference in dense deployment.

BRIEF DESCRIPTION OF THE DRAWINGS

[0006] In order to describe the manner in which advantages and features of the disclosure can be obtained, a description of the disclosure is rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. These drawings depict only example embodiments of the disclosure and are not therefore to be considered to be limiting of its scope. The drawings may have been simplified for clarity and are not necessarily drawn to scale.

[0007] FIG. 1 is an example block diagram of a system according to a possible embodiment;

[0008] FIG. 2 is an example flowchart illustrating an example of SSS sequence generation procedure that can be used by a UE for cell detection according to a possible embodiment;

[0009] FIG. 3 is an example flowchart illustrating the operation of a wireless communication device according to a possible embodiment;

[0010] FIG. 4 is an example illustration of multiplying sequences according to a possible embodiment;

[0011] FIG. 5 is an example illustration of a first SS and a second SS in different bandwidths according to a possible embodiment; [0012] FIG. 6 is an example illustration of interleaving sequences in subcarriers according to a possible embodiment;

[0013] FIG. 7 shows example illustrations of receiving sequences in the time domain according to a possible embodiment;

[0014] FIG. 8 is an example flowchart illustrating the operation of a network entity according to a possible embodiment;

[0015] FIG. 9 is an example block diagram of an apparatus according to a possible embodiment;

[0016] FIGS. 10 and 11 are example illustrations of auto-correlation and cross- correlation performance comparisons between proposed length-63 SSS sequences and LTE SSS sequences, respectively according to a possible embodiment;

[0017] FIGS. 12 and 13 are example illustrations of auto-correlation and cross- correlation performances compared for various sequence lengths when proposed SSS sequence generation methods are employed according to a possible embodiment; and [0018] FIG. 14 is an example illustration of cross-correlation performances of concatenated sequences and interleaved sequences according to a possible

embodiment.

DETAILED DESCRIPTION

[0019] Embodiments provide a method and apparatus for communicating

synchronization signals. According to a possible embodiment, a first Synchronization Signal (SS) associated with a first identity (ID) can be received. A first SS sequence for the first SS can be defined by at least an element- wise multiplication of a first cyclically shifted sequence with a second cyclically shifted sequence. The first cyclically shifted sequence can be a first base sequence cyclically shifted with a first cyclic shift value. The second cyclically shifted sequence can be a second base sequence cyclically shifted with a second cyclic shift value. A second SS associated with a second ID can be received. A second SS sequence for the second SS can be defined by at least an element-wise multiplication of a third cyclically shifted sequence with a fourth cyclically shifted sequence. The third cyclically shifted sequence can be the first base sequence cyclically shifted with a third cyclic shift value. The fourth cyclically shifted sequence can be the second base sequence cyclically shifted with a fourth cyclic shift value. The first ID and second ID can be determined to be the same in response to the first cyclic shift value and the third cyclic shift value being same and the second cyclic shift value and the fourth cyclic shift value being different.

[0020] According to another possible embodiment, a first SS associated with a first ID and a second SS associated with a second ID can be stored. A first SS sequence can be generated for the first SS. The first SS sequence can be defined by at least an element-wise multiplication of a first cyclically shifted sequence with a second cyclically shifted sequence. The first cyclically shifted sequence can be a first base sequence cyclically shifted with a first cyclic shift value. The second cyclically shifted sequence can be a second base sequence cyclically shifted with a second cyclic shift value. A second SS sequence can be generated for the second SS. The second SS sequence can be defined by at least an element- wise multiplication of a third cyclically shifted sequence with a fourth cyclically shifted sequence. The third cyclically shifted sequence can be the first base sequence cyclically shifted with a third cyclic shift value. The fourth cyclically shifted sequence can be the second base sequence cyclically shifted with a fourth cyclic shift value. The first SS associated with the first ID and the second SS associated with the second ID can be output.

[0021] Embodiments can provide methods to generate a large number of

synchronization signal sequences, such as 1000 or more, which have enhanced cross- correlation performance than LTE Primary Synchronization Signal (PSS) and

Secondary Synchronization Signal (SSS) sequences. In addition, the disclosed methods can easily support multi-antenna port transmission of SSs and/or allow User Equipments (UEs) with different UE bandwidths to perform cell detection via interleaving and/or concatenation of multiple sequences.

[0022] FIG. 1 is an example block diagram of a system 100 according to a possible embodiment. The system 100 can include a UE 110, a base station 120, and a network 130. The UE 110 can be a wireless wide area network device, a user device, wireless terminal, a portable wireless communication device, a smartphone, a cellular telephone, a flip phone, a personal digital assistant, a personal computer, a selective call receiver, an Internet of Things (IoT) device, a tablet computer, a laptop computer, or any other user device that is capable of sending and receiving communication signals on a wireless network. The base station 120 can be a wireless wide area network base station, a NodeB, an enhanced NodeB (eNB), a 5G NodeB (gNB), an unlicensed network base station, an access point, a Transmission Reception Point (TPvP) coupled to a base station, a network entity, or any other base station that can provide wireless access between a UE and a network.

[0023] The network 130 can include any type of network that is capable of sending and receiving wireless communication signals. For example, the network 130 can include network entities and can include a wireless communication network, a cellular telephone network, a Time Division Multiple Access (TDMA)-based network, a Code Division Multiple Access (CDMA)-based network, an Orthogonal Frequency Division Multiple Access (OFDMA)-based network, a Long Term Evolution (LTE) network, a 5G, a 3rd Generation Partnership Project (3GPP)-based network, a satellite

communications network, a high altitude platform network, the Internet, and/or other communications networks.

[0024] With multi-beam-based system operation, a Network Entity (NE) can transmit more than one SS block within an SS burst set periodicity, where each of the SS blocks can carry at least PSS and SSS transmitted via a common pool of antenna ports, and where the SS burst set can include one or more SS blocks. UE blind detection for slot and/or frame timing information from PSS/SSS may be neither feasible nor efficient. Instead, according to a possible embodiment, the NE can indicate slot and frame timing information, such as symbol index and/or slot index, via a tertiary synchronization signal/channel or physical broadcast channel. Thus, the NE may transmit the same PSS and SSS sequences for all SS blocks of a given cell. If a Tertiary Synchronization Channel (TSCH) is scrambled by a scrambling sequence associated with a full or partial cell ID carried by PSS/SSS and includes CRC, then a UE can check the validity of detected cell ID by decoding TSCH and checking CRC of decoded TSCH. For PSS, one or three Zadoff-Chu (ZC) sequences can be employed for good timing and frequency synchronization performance with low UE detection complexity.

[0025] For generation of SSS sequences, in one embodiment, a basic binary sequence d ₀ (0), ... , d ₀ (L - 1) that can be used to generate the S S S can be constructed from three maximum-length shift-register sequences (m-sequences) of length-L according to where 0 < n≤ L - 1. The indices p and <¾ can be derived from the cell-identity N _ID according to p = N _ID mod(Z), q ₀ = LNio

[0026] The first sequence s^n) can be an m-sequence of length-L. The second and third sequences s ₂ ^(p) (n) and c ^(¾) («) can be defined by a cyclic shift of the m-sequence s ₂ (n) and a cyclic shift of the m-sequence c(n) , respectively, according to s ₂ ^p) (n) = s ₂ ((n + p) mod L) ,

c ^(q ° ^} (n) = c((n + q ₀ ) mod L) .

[0027] In another example, <¾ can be defined by q ₀ = I ^■ wherein / can be a positive integer. The value / can be determined, based on the total number of supported cell IDs, the sequence length-L, and/or the number of concatenated or interleaved sequences for SSS.

[0028] The cell-identity N _ID can be determined jointly by the physical-layer cell identity group N$ and the physical-layer identity N , e.g. N$ e {0, 1, ... , 333} ,

Ng' e {0, 1, 2} , and N _ro = 3 · N^ + Ν$■ If more than one PSS sequence is defined, the physical-layer identity N^ information can be carried by PSS. Alternatively, one PSS sequence can be defined, and a UE can use the PSS not for obtaining partial or full information on the cell-identity, but for timing and frequency synchronization. In this case, SSS alone can be used to carry cell-identity information.

[0029] In one possible embodiment, the SSS sequence d(n) can be the same as the basic sequence as follows: d(n) = d ₀ (n) , where 0 < n≤ L - 1.

[0030] In another possible embodiment, the SSS sequence can be constructed by concatenation and/or interleaving of K sequences of length-L. With concatenation of K sequences, the SSS sequence of length- (K ^■ L) can be defined by d(n) = d ₀ (n),

d(n + L) = d _x (ri), d(n + (K-\)-L) = d _K _ _l (n),

where 0 < n≤ L - 1. With interleaving and concatenation of K sequences, where K can be an even number, the SSS sequence of length- (K ^■ L) can be defined by d(2n) = d ₀ (n),

d(2n + 2L) = d ₂ (n),

d(2n + l + 2L) = d ₃ (n), d(2n + {KI2-l)-2L) = d _K _ ₂ {n),

d(2n + \ + {KI2-l)-2L) = d _K _ _x {n),

where 0 < n≤ L - 1. With interleaving of K sequences, the SSS sequence of length- (K ^■ L) can be defined by d(n-K) = d ₀ (n),

d(n-K + l) = d _l (n), d(n-K + K-2) = d _K _ ₂ (n),

d{n-K + K-\) = d _K _ _l {n), where 0 < n≤ L - 1. The k-t sequence d _k (n) used for concatenation and/or interleaving can be generated by applying a cyclic shift of the m-sequence c(n) different from q ₀ according to where the cyclic shift value ¾ can be defined by where \≤k≤K-\. In one example, n _o ^k _ffset =k-\LIK ^~ \.

[0031] And yet in another embodiment, the m-sequences and ^ ² ^^ can be a preferred pair of m-sequences that can generate L- 1 additional sequences resulting in bounded low cross-correlation. In this case, L sequences generated by s^s^in) can be a part of Gold sequences.

[0032] In the following embodiments, examples of m-sequences used for generating basic sequences of different lengths can be provided. According to a possible embodiment, m-sequences can be used for generating length-63 basic sequences. The first m-sequence s _{ (n) can be given by s _l (n) = \-2x(n) , 0<«<62, where x(n) can be defined by x(i + 6) = (x(z + 5) + x( )mod 2, 0 < i < 56 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 1. [0033] The second m-sequence s ₂ (n) can be given by s ₂ (n) = 1 - 2x(n) , 0 < n < 62 , where x(n) can be defined by x(i + 6) = (x(z + 5) + x(i + 4) + x(i + 1) + x(/ ^' ))mod 2, 0 < / ^' < 56 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 1 .

[0034] The third m-sequence c(n) can be given by c(n) = 1 - 2x(n) , 0 < n≤ 62 , where x(n) can be defined by x(i + 6) = (x(i + 5) + x(i + 4) + x(i + 2) + x(i + l))mod 2, 0 < / ^' < 56 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 1 .

[0035] According to another possible embodiment, m-sequences can be used for generating length- 127 basic sequences. The first m-sequence s _{ (n) can be given by s _{ (n) = 1 - 2x(n) , 0 < n≤ 126 , where x(n) can be defined by x(z + 7) = (x(z + 6) + x(i + 2))mod 2, 0 < < 1 19 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 1.

[0036] The second m-sequence s ₂ (n) can be given by s ₂ (n) = \ - 2x(n) , 0 < « < 126 , where χ( ) can be defined by x(z + 7) = (x(z + 6) + x(i + 2) + x(i + 1) + x(/))mod 2, 0 < < 1 19 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 1.

[0037] The third m-sequence c(n) can be given by c(n) = 1 - 2x(n) , 0 < n≤ 126 , where x(n) can be defined by x(i + 7) = (x(i + 6) + x(i + 4) + x(i + 3) + x(z + 2) + x(i + 1) + x(/))mod 2, 0 < < 1 19 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 1.

[0038] According to another possible embodiment, m-sequences can be used for generating length-255 basic sequences. The first m-sequence s^n) can be given by s _{ (n) = 1 - 2x(n) , 0 < n≤ 254 , where x(n) can be defined by x(i + 8) = (x(z + 7) + x(i + 6) + x(i + 5) + x(i + 4) + x(i + 1) + x(/ ^' ))mod 2, 0 < / ^' < 246 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 0, x(7) = 1.

[0039] The second m-sequence s ₂ (n) can be given by s ₂ (n) = 1 - 2x(n) , 0 < n≤ 254 , where x(n) can be defined by x(i + 8) = (x(i + 7) + x(i + 5) + x(i + 4) + x(i + 2))mod 2, 0 < < 246 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 0, x(7) = 1.

[0040] The third m-sequence c(n) can be given by c(n) = 1 - 2x(n) , 0 < n≤ 254 , where x(n) can be defined by x(i + 8) = (x(i + 7) + x(i + 5) + x(i + 4) + x(/))mod 2, 0 < < 246 with initial conditions x(0) = 0, x(l) = 0, x(2) = 0, x(3) = 0, x(4) = 0 , x(5) = 0, x(6) = 0, x(7) = 1. [0041] FIG. 2 is an example flowchart 200 illustrating an example of SSS sequence generation procedure that can be used by a UE for cell detection according to a possible embodiment. In this embodiment, the UE can generate SSS sequences corresponding to all possible cell ID hypotheses and perform cross-correlation between received signals and the generated SSS sequences.

[0042] At 210, in order to generate all possible SSS sequences, the UE can first generate three m-sequences S I, S2, and C of length-L. At 220, the UE can generate a base set of L sequences via element- wise multiplication of S I with each of L cyclic shifts of S2, respectively, where the cyclic shift values can be from 0 to L-l. At 230, the UE can generate a first set of Ν^ ^α1 sequences via element-wise multiplication of each of the base set of L sequences with each of cyclic shifts of C, respectively, where the cyclic shift values can be from 0 to .

[0043] At 240, a determination can be made as to whether SSS is constructed from concatenation or interleaving of K sequences. At 250, if SSS is constructed from concatenation or interleaving of K sequences, the UE can further generate additional K-l sets of N£' ^al sequences. The k-t set of N^ ^al sequences can be generated via element-wise multiplication of each of the base set of L sequences with each of cyclic shifts of C, respectively, wherein the cyclic shift values for the k-t set can be from Offset to n _o ^k _ffset +LNi _D ^fa/ / J- ^{At 260} _> ^{the UE can} generate N£ ^fa/ SSS sequences of length- (KxL) by concatenating or interleaving K sequences, where each of the K sequences can be selected from each of the K sets of N[^ ^al sequences. At 270, if concatenation or interleaving of multiple sequences is not employed for SSS or after the UE generates N£f SSS sequences of length-( xL), the sequence generation procedure can end and the UE can use the first set of N[^ ^al sequences for cell detection.

[0044] FIG. 3 is an example flowchart 300 illustrating the operation of a wireless communication device, such as a UE, according to a possible embodiment. FIG. 4 is an example illustration 400 of multiplying sequences according to a possible embodiment.

[0045] At 310, a first SS associated with a first ID can be received. The first ID can be physical cell identity. SSs can be used by a UE to acquire at least synchronization in time and frequency. The first SS can be received when operating with a first antenna port. A first SS sequence 430 for the first SS can be defined by at least an element- wise multiplication of a first cyclically shifted sequence 410 with a second cyclically shifted sequence 420. The first SS sequence 430 for the first SS can be mapped to a first set of subcarriers. The first set of subcarriers may or may not be contiguous. The first cyclically shifted sequence 410 can be a first base sequence, such as sequence S2, cyclically shifted with a first cyclic shift value. The first base sequence can be a maximum-length shift-register sequence. The second cyclically shifted sequence 420 can be a second base sequence, such as sequence C, cyclically shifted with a second cyclic shift value.

[0046] At 320, a second SS associated with a second ID can be received. The second ID can be physical cell identity. The second SS can be received when operating with a second antenna port. The second antenna port and the first antenna port can be different antenna ports. Alternately, the first SS can the second SS can be received on the same antenna port. Additionally, the first SS and the second SS may or may not be received from the same base station or from the same TRP. Also, the first SS and the second SS may or may not be received on the same bandwidth. A second SS sequence 460 for the second SS can be mapped to a second set of subcarriers. The second set of subcarriers may or may not be contiguous. The first set of subcarriers and the second set of subcarriers may or may not be non-overlapping. For example, the first SS and the second SS can be concatenated in the frequency domain on an OFDM symbol. According to another possible embodiment, the first SS and the second SS can be concatenated in the time domain on different OFDM symbols. The second SS sequence 460 for the second SS can be defined by at least an element- wise multiplication of a third cyclically shifted sequence 440 with a fourth cyclically shifted sequence 450. The third cyclically shifted sequence 440 and the fourth cyclically shifted sequence 450 can also be considered multiplicand sequences. The third cyclically shifted sequence 440 can be the first base sequence, such as sequence S2, cyclically shifted with a third cyclic shift value. The fourth cyclically shifted sequence 450 can be the second base sequence, such as sequence C, cyclically shifted with a fourth cyclic shift value. According to a possible implementation, at least the first and third cyclic shift values can be determined based on the first and second IDs, respectively. For example, a cyclic shift value p can be given by P ^{= m} °d(L) _^ where Nm can be a cell identity and L can be a length of the sequence.

[0047] At 330, a determination can be made that the first ID and second ID are the same in response to the first cyclic shift value and the third cyclic shift value being the same and the second cyclic shift value and the fourth cyclic shift value being different. The method can also include obtaining the cyclic shift values from their respective SSs, comparing the first cyclic shift value with the third cyclic shift value, and comparing the second cyclic shift value with the fourth cyclic shift value for making the determination that the first ID and second ID are the same. The first SS and the second SS can be used to synchronize with at least one base station. For example, the first SS and the second SS can be used to synchronize with a TRP associated with at least one base station. The synchronizing can be time and/or frequency

synchronizing. Also, at least one physical cell identity can be determined using the first SS and the second SS. The at least one physical cell identity can be used to communicate with a wireless network.

[0048] FIG. 5 is an example illustration 500 of receiving the first SS and the second SS in different bandwidths according to a possible embodiment. The first SS sequence 430 for the first SS can be received in a first bandwidth 510. The first SS sequence 430 for the first SS and the second SS sequence 460 for the second SS can be received in a second bandwidth 520, such as on one or more OFDM symbols 530. The second bandwidth 520 can be larger than the first bandwidth 510. For example, the first SS sequence 430 for the first SS and the second SS sequence 460 for the second SS can be concatenated in the frequency domain, such as in the second bandwidth 520. The first SS sequence 430 for the first SS can be received in the first bandwidth 510 without the first SS sequence 430 for the first SS and the second SS sequence 460 for the second SS being received in the second bandwidth 520.

According to a possible implementation, the second bandwidth 520 can include the first bandwidth 510 or they can be in different or partially overlapping frequencies. According to different implementations, there may or may not be frequency gaps in between the concatenated sequences. For example, there can be anywhere from guard band or smaller gaps up to gaps of multiple subcarrier widths in between the interleaved and/or concatenated sequences.

[0049] FIG. 6 is an example illustration 600 of interleaving sequences in subcarriers according to a possible embodiment. The first SS sequence 430 for the first SS can be mapped to a first set of subcarriers, such as within a OFDM symbol 530. The second SS sequence 460 for the second SS can be mapped to a second set of subcarriers, such as within the OFDM symbol 530. The first and second set of subcarriers can be interleaved.

[0050] FIG. 7 shows example illustrations 710 and 720 of receiving sequences in the time domain according to a possible embodiment. According to a possible

embodiment, the first SS sequence 430 for the first SS and the second SS sequence 460 for the second SS can be received sequentially in the time domain as shown in the illustration 710. This can be employed for concatenation in the time domain.

According to another possible embodiment, the first SS sequence 430 for the first SS and the second SS sequence 460 for the second SS can be received interleaved in the time domain, such as in different symbols like symbol 730 as shown in the illustration 720. There may or may not be gaps, such as short time gaps and/or at least one symbol-length gaps, between the first SS sequence 430 and the second SS sequence 460 for receiving them sequentially or interleaved.

[0051] FIG. 8 is an example flowchart 800 illustrating the operation of a network entity according to a possible embodiment. The network entity can be an eNB, a gNB, a TRP, a base station coupled to a TRP, a system controller, a baseband controller, and/or any other network entity. At 810, a first SS associated with a first ID and a second SS associated with a second ID can be stored.

[0052] At 820, a first SS sequence can be generated for the first SS. The first SS sequence can be defined by at least an element-wise multiplication of a first cyclically shifted sequence with a second cyclically shifted sequence. The first cyclically shifted sequence can be a first base sequence cyclically shifted with a first cyclic shift value. The second cyclically shifted sequence can be a second base sequence cyclically shifted with a second cyclic shift value. The first and second base sequences can be maximum-length shift-register sequences. [0053] At 830, a second SS sequence can be generated for the second SS. The second SS sequence can be defined by at least an element- wise multiplication of a third cyclically shifted sequence with a fourth cyclically shifted sequence. The third cyclically shifted sequence can be the first base sequence cyclically shifted with a third cyclic shift value. The fourth cyclically shifted sequence can be the second base sequence cyclically shifted with a fourth cyclic shift value.

[0054] At 840, the first SS associated with the first ID and the second SS associated with the second ID can be output. According to a possible embodiment, first SS sequence for the first SS can be mapped to a first set of subcarriers. The second SS sequence for the second SS can be mapped to a second set of subcarriers. The first and second set of subcarriers can be interleaved. According to another possible embodiment, the first SS sequence for the first SS can be transmitted in a first bandwidth. The first SS sequence for the first SS and the second SS sequence for the second SS can be transmitted in a second bandwidth. The second bandwidth can be larger than the first bandwidth. According to another possible embodiment, first and second SS can be transmitted sequentially in the time domain. According to another possible implementation, the first SS sequence for the first SS and the second SS sequence for the second SS can be transmitted interleaved in the time domain.

According to another possible implementation, the first SS sequence for the first SS can be mapped to a first set of subcarriers. The second SS sequence for the second SS can be mapped to a second set of subcarriers. The first set of subcarriers can be contiguous. The second set of subcarriers can be contiguous. The first set of subcarriers and the second set of subcarriers can be non-overlapping. According to another possible embodiment, the first SS sequence for the first SS can be transmitted with a first transmit antenna port and the second SS sequence for the second SS can be transmitted with a second transmit antenna port.

[0055] A UE can receive the first SS based on the UE operating with a first antenna port and can receive the second SS based on the UE operating with a second antenna port. The UE can determine at least one physical cell identity using the first SS and the second SS. The UE can be communicated with using the at least one physical cell identity. [0056] It should be understood that, notwithstanding the particular steps as shown in the figures, a variety of additional or different steps can be performed depending upon the embodiment, and one or more of the particular steps can be rearranged, repeated or eliminated entirely depending upon the embodiment. Also, some of the steps performed can be repeated on an ongoing or continuous basis simultaneously while other steps are performed. Furthermore, different steps can be performed by different elements or in a single element of the disclosed embodiments.

[0057] FIG. 9 is an example block diagram of an apparatus 900, such as the UE 110, the base station 120, a network entity, or any other communication device disclosed herein, according to a possible embodiment. The apparatus 900 can include a housing 910, a controller 920 coupled to the housing 910, audio input and output circuitry 930 coupled to the controller 920, a display 940 coupled to the controller 920, a

transceiver 950 coupled to the controller 920, an antenna 955 coupled to the transceiver 950, a user interface 960 coupled to the controller 920, a memory 970 coupled to the controller 920, and a network interface 980 coupled to the controller 920. The apparatus 900 may not necessarily include all of the illustrated elements for different embodiments of the present disclosure. The apparatus 900 can perform the methods described in all the embodiments.

[0058] The display 940 can be a viewfinder, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, an Organic Light Emitting Diode (OLED) display, a plasma display, a projection display, a touch screen, or any other device that displays information. The transceiver 950 can include a transmitter and/or a receiver. The audio input and output circuitry 930 can include a microphone, a speaker, a

transducer, or any other audio input and output circuitry. The user interface 960 can include a keypad, a keyboard, buttons, a touch pad, a joystick, a touch screen display, another additional display, or any other device useful for providing an interface between a user and an electronic device. The network interface 980 can be a

Universal Serial Bus (USB) port, an Ethernet port, an infrared transmitter/receiver, an IEEE 1394 port, a WLAN transceiver, or any other interface that can connect an apparatus to a network, device, or computer and that can transmit and receive data communication signals. The memory 970 can include a random access memory, a read only memory, an optical memory, a solid state memory, a flash memory, a removable memory, a hard drive, a cache, or any other memory that can be coupled to an apparatus.

[0059] The apparatus 900 or the controller 920 may implement any operating system, such as Microsoft Windows®, UNIX®, or LINUX®, Android™, or any other operating system. Apparatus operation software may be written in any programming language, such as C, C++, Java or Visual Basic, for example. Apparatus software may also run on an application framework, such as, for example, a Java® framework, a .NET® framework, or any other application framework. The software and/or the operating system may be stored in the memory 970 or elsewhere on the apparatus 900. The apparatus 900 or the controller 920 may also use hardware to implement disclosed operations. For example, the controller 920 may be any programmable processor. Disclosed embodiments may also be implemented on a general-purpose or a special purpose computer, a programmed microprocessor or microprocessor, peripheral integrated circuit elements, an application-specific integrated circuit or other integrated circuits, hardware/electronic logic circuits, such as a discrete element circuit, a programmable logic device, such as a programmable logic array, field programmable gate-array, or the like. In general, the controller 920 may be any controller or processor device or devices capable of operating an apparatus and implementing the disclosed embodiments. Some or all of the additional elements of the apparatus 900 can also perform some or all of the operations of the disclosed embodiments.

[0060] In operation as a UE according to a possible embodiment, the transceiver 950 can receive a first synchronization signal associated with a first ID. A first SS sequence for the first SS can be defined by at least an element- wise multiplication of a first cyclically shifted sequence with a second cyclically shifted sequence. The first cyclically shifted sequence can be a first base sequence cyclically shifted with a first cyclic shift value. The first base sequence can be a maximum-length shift-register sequence. The second cyclically shifted sequence can be a second base sequence cyclically shifted with a second cyclic shift value. The second base sequence can be a maximum-length shift-register sequence. [0061] The transceiver 950 can receive a second SS associated with a second ID. A second SS sequence for the second SS can be defined by at least an element- wise multiplication of a third cyclically shifted sequence with a fourth cyclically shifted sequence. The third cyclically shifted sequence can be the first base sequence cyclically shifted with a third cyclic shift value. The fourth cyclically shifted sequence can be the second base sequence cyclically shifted with a fourth cyclic shift value. The controller 920 can determine that the first ID and second ID are the same in response to the first cyclic shift value and the third cyclic shift value being the same and the second cyclic shift value and the fourth cyclic shift value being different.

[0062] According to a possible embodiment, the first SS sequence for the first SS can be received in a first bandwidth. The first SS sequence for the first SS and the second SS sequence for the second SS can be received in a second bandwidth. The second bandwidth can be larger than the first bandwidth. According to another possible embodiment, the first SS sequence for the first SS can be mapped to a first set of subcarriers. The second SS sequence for the second SS can be mapped to a second set of subcarriers. The first and second set of subcarriers can be interleaved. According to another possible embodiment, the first SS sequence for the first SS and the second SS sequence for the second SS can be received sequentially in the time domain.

According to another possible embodiment, the first SS sequence for the first SS and the second SS sequence for the second SS can be received interleaved in the time domain.

[0063] According to another possible embodiment, the antenna 955 can be multiple antennas having multiple antenna ports. A first antenna port can receive the first SS when the apparatus 900 operates with the first antenna port. The second antenna port can receive the second SS when the apparatus 900 operates with the second antenna port.

[0064] According to a possible embodiment, the first SS sequence for the first SS can be mapped to a first set of subcarriers. The second SS sequence for the second SS can be mapped to a second set of subcarriers. The first set of subcarriers can be

contiguous. The second set of subcarriers can be contiguous. The first set of subcarriers and the second set of subcarriers can be non-overlapping. [0065] According to a possible embodiment, the controller 920 can synchronize with at least one base station using the first SS and the second SS. For example, the controller 920 can synchronize with at least one base station via the transceiver 950. According to another possible embodiment, the controller 920 can determine at least one physical cell identity based on the first SS and the second SS and the transceiver 950 can communicate, using the at least one physical cell identity, with a wireless network.

[0066] In operation as a network entity, such as an eNB, a gNB, a TRP, a system controller, a scheduler a baseband controller, and/or any other network entity according to a possible embodiment, the memory 970 can store a first SS associated with a first ID and a second SS associated with a second ID. The controller 920 can generate a first SS sequence for the first SS. The first SS sequence can be defined by at least an element-wise multiplication of a first cyclically shifted sequence with a second cyclically shifted sequence. The first cyclically shifted sequence can be a first base sequence cyclically shifted with a first cyclic shift value and the second cyclically shifted sequence can be a second base sequence cyclically shifted with a second cyclic shift value. The first and second base sequences can be maximum- length shift-register sequences.

[0067] The controller 920 can generate a second SS sequence for the second SS. The second SS sequence can be defined by at least an element- wise multiplication of a third cyclically shifted sequence with a fourth cyclically shifted sequence. The third cyclically shifted sequence can be the first base sequence cyclically shifted with a third cyclic shift value and the fourth cyclically shifted sequence can be the second base sequence cyclically shifted with a fourth cyclic shift value.

[0068] The first ID and the second ID can be the same based on the first cyclic shift value and the third cyclic shift value being same and based on the second cyclic shift value and the fourth cyclic shift value being different. According to a possible implementation, at least the first cyclic shift value can be determined based on the first ID, and at least the third cyclic shift value can be determined based on the second ID.

[0069] An interface, such as the network interface 980, the transceiver 950, an interface between the controller 920 and other components or devices, and/or any other interface, can output the first SS associated with the first ID and the second SS associated with the second ID. For example, the SS sequences can be generated by the controller 920 and sent to a TRP for transmission. According to another implementation, the TRP can be at a gNB, such as the apparatus 900, including a baseband controller, such as the controller 920. At least one TRP can be connected to a base station, such as the apparatus 900, and different TRP's can be in different locations.

[0070] The first SS sequence for the first SS can be transmitted in a first bandwidth, such as via the transceiver 950, via a TRP coupled to the network interface 980, or otherwise transmitted. The first SS sequence for the first SS and the second SS sequence for the second SS can be transmitted in a second bandwidth. The second bandwidth can be larger than the first bandwidth. According to a possible

embodiment, the interface can be the transceiver 950, which can transmit the SS sequences. According to another possible embodiment, the interface can be a component or the network interface 980 that sends the SS sequences for transmission, such as from a TRP.

[0071] The first SS sequence for the first SS can be mapped, such as by the controller 920, to a first set of subcarriers. The second SS sequence for the second SS can be mapped, such as by the controller 920, to a second set of subcarriers. The first and second set of subcarriers can be interleaved. The first and second SS can also be transmitted sequentially in the time domain. The first SS sequence for the first SS and the second SS sequence for the second SS can further be transmitted interleaved in the time domain. Furthermore, for transmission, the first SS sequence for the first SS can be mapped to a first set of subcarriers, the second SS sequence for the second SS can be mapped to a second set of subcarriers. The first set of subcarriers can be contiguous. The second set of subcarriers can be contiguous. The first set of subcarriers and the second set of subcarriers can be non-overlapping.

[0072] The first SS sequence for the first SS can be transmitted with a first transmit antenna port and the second SS sequence for the second SS can be transmitted with a second transmit antenna port. For example, the antenna 955 can include multiple antennas that create the antenna ports for transmission of the SS sequences. The apparatus 900 can also send the SS sequences to another device, such as a TRP, for transmission from antenna ports at the other device. A UE can receive the first SS from the apparatus 900 based on the UE operating with a first antenna port and can receive the second SS based on the UE operating with a second antenna port.

[0073] FIGS. 10 and 11 are example illustrations 1000 and 1100 of auto-correlation and cross-correlation performance comparisons between proposed length-63 SSS sequences and LTE SSS sequences, respectively, according to a possible embodiment. Since SSS can be detected in the frequency domain after timing and frequency acquisition from PSS, cross-correlation performance of SSS sequences can be a more important factor to impact on the overall cell detection performance. With similar sequence length, the proposed length-63 SSS sequences can show better cross- correlation performance, where normalized cross-correlation is upper-bounded by approximately 0.5.

[0074] FIGS. 12 and 13 are example illustrations 1200 and 1300 of auto-correlation and cross-correlation performances compared for various sequence lengths, when proposed SSS sequence generation methods are employed according to a possible embodiment. In the illustration 1300 it is shown that concatenation of two length-127 sequences can yield the best cross-correlation performance among various sequence lengths and generation methods, where the normalized cross-correlation value can be upper-bounded by 0.26. With 15 kHz subcarrier spacing, SSS transmission

bandwidth for two concatenated length-127 sequences can be roughly 4MHz, which can be suitable for a carrier bandwidth of 5 MHz or wider.

[0075] FIG. 14 is an example illustration 1400 of cross-correlation performances of concatenated sequences and interleaved sequences according to a possible

embodiment. With a given SSS sequence length, concatenated sequences can have slightly lower upper bounds, but in overall both schemes can perform very similarly. These results show that proposed sequence generation methods can be suitable for interleaving or concatenation, which can be used for multiple antenna port

transmission or for support of UEs with various operating bandwidth.

[0076] The method of this disclosure can be implemented on a programmed processor. However, the controllers, flowcharts, and modules may also be implemented on a general purpose or special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit elements, an integrated circuit, a hardware electronic or logic circuit such as a discrete element circuit, a programmable logic device, or the like. In general, any device on which resides a finite state machine capable of implementing the flowcharts shown in the figures may be used to implement the processor functions of this disclosure.

[0077] While this disclosure has been described with specific embodiments thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art. For example, various components of the embodiments may be interchanged, added, or substituted in the other embodiments. Also, all of the elements of each figure are not necessary for operation of the disclosed embodiments. For example, one of ordinary skill in the art of the disclosed embodiments would be enabled to make and use the teachings of the disclosure by simply employing the elements of the independent claims. Accordingly, embodiments of the disclosure as set forth herein are intended to be illustrative, not limiting. Various changes may be made without departing from the spirit and scope of the disclosure.

[0078] In this document, relational terms such as "first," "second," and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The phrase "at least one of,"" "at least one selected from the group of," or "at least one selected from" followed by a list is defined to mean one, some, or all, but not necessarily all of, the elements in the list. The terms "comprises,"

"comprising," "including," or any other variation thereof, are intended to cover a nonexclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by "a," "an," or the like does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises the element. Also, the term "another" is defined as at least a second or more. The terms "including," "having," and the like, as used herein, are defined as "comprising." Furthermore, the background section is written as the inventor's own understanding of the context of some embodiments at the time of filing and includes the inventor's own recognition of any problems with existing

technologies and/or problems experienced in the inventor's own work.