Method and apparatus for transmitting and receiving sidelink synchronization signal in wireless communication system

Abstract

The present disclosure relates to a method and an apparatus for transmitting and receiving a sidelink synchronization signal in a wireless communication system. According to an embodiment of the present disclosure, a method for transmitting a sidelink synchronization signal to a second UE by a first user equipment (UE) in a wireless communication system may include transmitting a sidelink synchronization signal to the second UE based on a number of types of a physical layer sidelink synchronization identifier set and a number of sequences included in each type of the physical layer sidelink synchronization identifier set, determining values of the NID (1) and the NID (2) corresponding to a sidelink identifier (SLID) value; generating a sidelink primary synchronization signal (PSS) sequence and a sidelink secondary synchronization signal (SSS) sequence based on the first primitive polynomial, the second primitive polynomial, and a cyclic shift (CS) value; and mapping the sidelink PSS sequence and the sidelink SSS sequence on a physical resource, and thereby transmitting the sidelink PSS sequence and the sidelink SSS sequence.

Description

[0001] This application is a divisional application of the Chinese invention patent application with the application date of August 9, 2019, application number 201980053334.6, and invention name “Method and device for transmitting and receiving side link synchronization signals in a wireless communication system”. Background Art Technical Field

[0002] The present disclosure relates to a method and apparatus for transmitting and receiving a sidelink synchronization signal in a wireless communication system, and more specifically, to a method and apparatus for setting and generating a sequence of sidelink synchronization signals and transmitting or receiving synchronization signals on a sidelink in a new radio (NR) wireless communication system supporting various parameter configurations (numerology).

[0003] Related fields

[0004] Taking into account various scenarios, service requirements, potential system compatibility, etc., the 3rd Generation Partnership Project (3GPP) New Radio (NR) system can support various parameter configurations on the time-frequency resource unit standard to meet the requirements of the 5th generation (5G) communication. In addition, the NR system can support the transmission of physical signals or physical channels through multiple beams to overcome the adverse channel environment such as high path loss, phase noise and frequency offset that occurs at high carrier frequencies. Through this, the NR system can support applications such as enhanced mobile broadband (eMBB), massive machine type communication (mMTC), ultra machine type communication (uMTC), ultra-reliable and low-latency communication (URLLC), etc.

[0005] Vehicle-to-X; Vehicle-to-Everything (V2X) communication refers to a communication method for exchanging or sharing information (e.g., traffic conditions) by communicating with other vehicles and / or road infrastructure during driving. V2X may include, for example, vehicle-to-vehicle (V2V) involving communication between vehicles, vehicle-to-pedestrian (V2P) involving communication between a vehicle and a user equipment (UE) carried by a pedestrian user, and vehicle-to-infrastructure / network (V2I / N) involving communication between a vehicle and a roadside unit (RSU) / network. In addition, V2X communication may include a method using a PC5 link (or side link) as a device-to-device (D2D) communication interface, a method using a Uu link (or uplink and downlink) as a communication interface between a base station and a UE, or a method using all of a PC5 link and a Uu link.

[0006] 5G side link technology is discussing the incorporation of new and diverse services in 5G mobile communications, such as autonomous driving or remote driving, through performance improvements of ultra-high reliability and / or ultra-low latency. Basically, the communication protocol on the 5G side link needs to acquire synchronization on the side link. So far, the definition of the synchronization reference on the 5G side link and the setting and generation of the synchronization signal sequence according to the synchronization reference have not been determined in detail. DETAILED DESCRIPTION

[0007] Technical Topics

[0008] One aspect of the present disclosure provides a method and apparatus for defining a sidelink synchronization reference and setting and generating a synchronization signal sequence according to the sidelink synchronization reference.

[0009] Another aspect of the present disclosure provides a method and apparatus for generating and transmitting, and receiving an M-sequence-based synchronization signal sequence with respect to each of a sidelink primary synchronization signal (PSS) and a sidelink secondary synchronization signal (SSS).

[0010] Another aspect of the present disclosure provides a method and apparatus for setting and generating a sidelink synchronization signal to improve performance of distinguishing a downlink synchronization signal.

[0011] Those skilled in the art will understand that the objectives achievable by the present disclosure are not limited to the above specific description, and the above and other objectives achievable by the present disclosure will be more clearly understood from the following detailed description.

[0012] Technical Solution

[0013] According to one aspect of the present disclosure, a method for transmitting a sidelink synchronization signal from a first user equipment (UE) to a second UE in a wireless communication system is provided, the method comprising: determining N corresponding to a sidelink identifier (SLID) value based on the number of types of a physical layer sidelink synchronization identifier set and the number of sequences included in each type of the physical layer sidelink synchronization identifier set. ID (1) and N ID (2) By applying the first initialization value to the first primitive polynomial and based on N ID (2) The sidelink primary synchronization signal (PSS) sequence is generated by applying a cyclic shift (CS) to the sidelink primary synchronization signal (PSS) sequence according to the value of N; applying a second initialization value to each of the first primitive polynomial and the second primitive polynomial and based on N ID (1) and N ID (2)The method comprises the steps of: applying CS to the sidelink secondary synchronization signal (SSS) sequence according to the value of CS to generate a sidelink SSS sequence; and mapping the sidelink PSS sequence to which the CS is applied and the sidelink SSS sequence to which the CS is applied on a physical resource, and thereby transmitting the sidelink PSS sequence and the sidelink SSS sequence. At least one of the first primitive polynomial, the second primitive polynomial, the CS value for the sidelink PSS sequence, and the CS value for the sidelink SSS sequence is applied, which is different from at least one of the first primitive polynomial and the second primitive polynomial, the CS value for the downlink PSS sequence, and the CS value for the downlink SSS sequence applied to the downlink PSS or the downlink SSS.

[0014] The features briefly summarized above regarding the present disclosure are provided only as examples to explain the detailed description and should not be construed as limiting the scope of the present disclosure.

[0015] Effect

[0016] According to the present invention, a method and apparatus for setting and generating a synchronization signal sequence according to a sidelink synchronization reference are provided.

[0017] In addition, according to the present disclosure, a method and apparatus for generating and transmitting and receiving an M-sequence-based synchronization signal sequence for each of a sidelink primary synchronization signal (PSS) and a sidelink secondary synchronization signal (SSS) may be provided.

[0018] In addition, according to the present disclosure, a method and apparatus for setting and generating a sidelink synchronization signal to improve performance distinguished from a downlink synchronization signal may be provided.

[0019] In addition, according to the present disclosure, the complexity of generating a sidelink synchronization signal can be reduced, and the performance of distinguishing a downlink synchronization signal from a sidelink synchronization signal by using a primitive polynomial or a cyclic shift value can be maximized.

[0020] Effects that can be obtained by the present disclosure are not limited to the above-mentioned effects, and other effects that are not mentioned can be clearly understood by those skilled in the art from the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 , Figure 2 and Figure 3 An example describing a vehicle-to-everything (V2X) scenario according to the present disclosure is shown;

[0022] Figure 4 An example of a service provided based on a side link is shown.

[0023] Figure 5An example of a downlink synchronization signal in a wireless communication system is shown.

[0024] Figure 6 An example of transmission through multiple beams in synchronization signal transmission according to the present disclosure is shown.

[0025] Figure 7 An example of the structure of a synchronization signal frame in the case of considering transmission through multiple beams in synchronization signal transmission according to the present disclosure is shown.

[0026] Figure 8 An example of the structure of a synchronization signal (SS) block according to the present disclosure is shown.

[0027] Fig. 9 An example of a sidelink synchronization reference according to the present disclosure is shown.

[0028] Fig.10 is a flowchart illustrating an example of a method of transmitting a sidelink synchronization signal sequence according to the present disclosure.

[0029] Fig.11 is a flow chart illustrating an example of a method of receiving a side link synchronization signal sequence according to the present disclosure.

[0030] Fig.12 is a diagram illustrating a configuration of a first terminal device according to the present disclosure.

[0031] Fig.13 is a diagram illustrating a configuration of a second terminal device according to the present disclosure. DETAILED DESCRIPTION

[0033] Hereinafter, embodiments of the present disclosure will be described in detail so that those skilled in the art can easily perform the embodiments with reference to the accompanying drawings. However, the present disclosure may be implemented in many different forms and is not limited to the embodiments described herein.

[0034] In the following description of the embodiments of the present disclosure, when a detailed description of known functions and configurations incorporated herein may make the subject matter of the present disclosure unclear, a detailed description thereof will be omitted. Portions of the drawings that are not related to the description of the present disclosure are omitted, and similar portions are represented by similar reference numerals.

[0035] In the present disclosure, when an element is referred to as being "connected", "coupled" or "connected" to another element, it should be understood to include not only a direct connection relationship but also an indirect connection relationship. In addition, when an element is referred to as "including" or "having" another element, it not only means excluding another element but also means including another element.

[0036] In the present disclosure, the terms first, second, etc. are used only for the purpose of distinguishing one element from another element, and do not limit the order or importance of the elements unless specifically mentioned. Therefore, within the scope of the present disclosure, the first component in an embodiment may be referred to as the second component in another embodiment, and similarly, the second component in an embodiment may be referred to as the second component in another embodiment.

[0037] In the present disclosure, components that are distinguished from each other are intended to clearly illustrate each feature and do not necessarily mean that the components are separate. That is, multiple components can be integrated into one hardware or software unit, or a single component can be distributed into multiple hardware or software units. Therefore, unless otherwise stated, these integrated or distributed embodiments are also included in the scope of the present invention.

[0038] In the present disclosure, the components described in the various embodiments do not necessarily mean essential components, but some may be optional components. Therefore, embodiments consisting of a subset of the components described in the embodiments are also included in the scope of the present invention. In addition, embodiments that include other components in addition to the components described in the various embodiments are also included in the scope of the present disclosure. In addition, the description described herein relates to a wireless communication network, and the operations performed in the wireless communication network can be performed in the process of controlling the network and transmitting data by a system (e.g., a base station) that controls the wireless network, or can be performed in a user equipment connected to the wireless communication network.

[0039] Obviously, in a network including a base station and a plurality of network nodes, various operations performed for communicating with a terminal may be performed by the base station or other network nodes other than the base station. Here, the term "base station (BS)" may be used interchangeably with other terms, such as a fixed station, a node B, an eNode B (eNB), a gNode B (gNB), and an access point (AP). In addition, the term "terminal" may be used interchangeably with other terms, such as a user equipment (UE), a mobile station (MS), a mobile subscriber station (MSS), a subscriber station (SS), and a non-AP station (non-AP STA).

[0040] Here, transmitting or receiving a channel includes the meaning of transmitting or receiving information or signals through the corresponding channel. For example, transmitting a control channel means transmitting control information or signals through the control channel. Similarly, transmitting a data channel means transmitting data information or signals through the data channel.

[0041] In the following, for the sake of clarity of description, the related descriptive terms are described below.

[0042] D2d: Device to Device (communication)

[0043] GNSS: Global Navigation Satellite System

[0044] RSU: Road Side Unit

[0045] SL: Sidelink

[0046] SLSS: Sidelink Synchronization Signal

[0047] SCI: Sidelink Control Information

[0048] PSSCH: Physical Sidelink Shared Channel

[0049] PSBCH: Physical Sidelink Broadcast Channel

[0050] PSCCH: Physical Link Control Channel

[0051] PSDCH: Physical Sidelink Discovery Channel

[0052] ProSe: (Device to Device) Proximity Services

[0053] PSSID (SLID): Physical layer side link synchronization identifier (side link identifier)

[0054] n ID SA : Sidelink group destination identifier

[0055] N ID SL : Physical layer side link synchronization flag

[0056] SA: Scheduling Assignment

[0057] TB: Transport Block

[0058] TTI: Transmission Time Interval

[0059] RB: Resource Block

[0060] V2v: Vehicle to Vehicle

[0061] V2p: Vehicle to Pedestrian

[0062] V2I / N: Vehicle to Infrastructure / Network

[0063] Here, the 5G system can be defined as including any existing long term evolution (LTE) based system and a new radio (NR) system. That is, the 5G system can include the case where LTE-based radio access technology and NR radio access technology are applied together, as well as the case where NR radio access technology is applied alone. In addition, the 5G side link technology can include all of the side link technology that applies NR alone and the side link technology that applies LTE and NR together.

[0064] In V2X communication, the control information transmitted from a UE to another UE may be a scheduling assignment (SA). If the above control information is used for sidelink communication, the control information may be an SCI. Here, if the control information is transmitted through the sidelink, the control information may be transmitted through the above PSCCH which is a channel for transmitting control information in the sidelink.

[0065] In addition, data transmitted from a UE to another UE may be configured based on a unit of a transmission port (TB).Here, if data is transmitted through a side link, the data may be transmitted through the above-mentioned PSSCH which is a channel for transmitting data.

[0066] Here, the operation mode may be defined based on a resource allocation method for transmitting data and control information for V2X communication or direct link (eg, D2D, ProSe, or SL) communication.

[0067] A base station (BS) resource scheduling mode (eNodeB resource scheduling mode) may be a mode in which a BS (eNodeB) or a relay node schedules resources for a UE to transmit V2X (or direct link) control information and / or data. In this way, the UE may transmit V2X (or direct link) control information and / or data. This mode may refer to a BS resource scheduling mode.

[0068] For example, the BS or relay node may provide the sidelink (or direct link) transmitting UE with scheduling information about resources for transmitting the sidelink (or direct link) control information and / or data through downlink control information (DCI). Therefore, the sidelink (or direct link) transmitting UE may transmit the sidelink (or direct link) control information and data to the sidelink (or direct link) receiving UE, and the sidelink (or direct link) receiving UE may receive the sidelink (or direct link) data based on the sidelink (or direct link) control information.

[0069] Meanwhile, the UE autonomous resource selection mode may be a mode in which the UE autonomously selects resources for transmitting control information and data, and such resource selection may be determined by sensing the UE from a resource pool (i.e., a set of resource candidates). In this way, the UE may transmit control information and data. This mode may refer to the UE autonomous resource selection mode.

[0070] For example, a sidelink (or direct link) transmitting UE may transmit sidelink (or direct link) control information and data to a sidelink (or direct link) receiving UE using its selected resources, and the sidelink (or direct link) receiving UE may receive sidelink (or direct link) data based on the sidelink (or direct link) control information.

[0071] Here, for example, in the side link (or direct link) communication for D2D, etc., the above BS resource scheduling method can be referred to as method 1. In addition, in the side link communication for V2X, etc., the BS resource scheduling method can be referred to as method 3. In addition, in the side link (or direct link) communication for D2D, etc., the UE autonomous resource selection method can be referred to as method 2. In addition, in the side link communication for V2X, etc., the UE autonomous resource selection method can be referred to as method 4.

[0072] In addition, although the following description is made based on V2X communication for the sake of clarity, it is provided only as an example. For example, the present disclosure can be similarly applied to communication based on direct links such as D2D, ProSe, etc., and the present disclosure is not limited thereto.

[0073] Likewise, for example, V2X may be a general term for V2V, V2P, and V2I / N. Here, each of V2V, V2P, and V2I / N may be defined as in the following Table 1 in relation to LTE (Long Term Evolution).

[0074] [Table 1]

[0075]

[0076] Likewise, V2X communications may include PC-5 based communications, which is an interface for sidelink communications, for which purpose, as a D2D communication link (e.g., a direct interface between a device and a device supporting a ProSe system). For V2X operations, refer to Figure 1 , Figure 2 and Figure 3 Consider various scenarios (such as Table 2, Table 3, and Table 4 below).

[0077] For example, Table 2 and Figure 1 It may involve the case where V2X operation is supported only based on the PC5 interface (or SL). Here, Figure 1 (a) shows an example of V2V operation, Figure 1 (b) shows an example of V2I operation, and Figure 1 (c) shows an example of V2P operation.

[0078] [Table 2]

[0079]

[0080] At the same time, Table 3 and Figure 2 It may refer to a scenario where V2X operations are supported based only on the Uu interface (i.e., the interface between the UE and the BS). Here, Figure 2 (a) shows an example of V2V operation, Figure 2 (b) shows an example of V2I operation, and Figure 2(c) shows an example of V2P operation.

[0081] [Table 3]

[0082]

[0083] Table 4 below and Figure 3 It may involve supporting V2X operations using all UE interfaces and PC5 interface (or SL). Here, Figure 3 (a) shows case 3A of Table 4, Figure 3 (b) shows case 3B of Table 4.

[0084] [Table 4]

[0085]

[0086] As described above, V2X communication can be performed through the BS and can be performed through direct communication between UEs. Here, if the BS is used, transmission and reception can be performed through the Uu link, which is a communication interface between the LTE BS and the UE in the LTE-based V2X communication. In addition, if the side link is used for direct communication between UEs, transmission and reception can be performed through the PC5 link, which is a communication interface between LTE UEs in the LTE-based V2X communication.

[0087] In LTE, communication from a BS to a UE is called a downlink (DL), and communication from a UE to a BS is called an uplink (UL). In addition to the uplink (UL) and the downlink (DL), communication from a UE to another UE is also defined as a sidelink (SL).

[0088] In LTE, the first technology project to use and apply PC5-based sidelink communication is D2D, which is proximity communication (ProSe) for public safety and commercial purposes. In addition, in LTE, the next technology project to apply PC5-based sidelink communication is V2X, which is communication for vehicles.

[0089] Figure 4 An example of a service provided based on a side link is shown.

[0090] refer to Figure 4 , V2X related services or Internet of Things (IoT) services can be provided based on the 5G side link. Here, for example, the 5G side link may be a concept that includes all of the side links based on the existing LTE system and the side links based on the NR system. That is, the 5G side link may be a service provided by considering the side link applied in each system. However, it is provided only as an example.

[0091] For example, refer to Figure 4, for V2X services, vehicle platoons, autonomous driving, advanced sensors, and remote driving services may be provided. Here, vehicle platoons may refer to technologies that allow multiple vehicles to dynamically form a group and operate in a similar manner. In addition, autonomous driving may refer to technologies based on fully automated and semi-automated driving of vehicles. In addition, advanced sensors may refer to technologies that collect and exchange data acquired from sensors or video images. In addition, remote driving may refer to technologies for remotely controlling vehicles and technologies for applications. That is, the above services may be provided as V2X-based services. Here, the services are provided only as examples, and the present disclosure is not limited thereto. Here, requirements such as ultra-latency, ultra-connectivity, low power, and high reliability may be required to provide V2X services. Therefore, the 5G side link may require an operating method for meeting the services and requirements thereof. A detailed method taking into account these requirements is described below.

[0092] Figure 5 An example of a downlink synchronization signal in a wireless communication system is shown.

[0093] In the NR system, two types of synchronization signals may be defined. For example, the two types of synchronization signals may include NR-Primary Synchronization Signal (NR-PSS) and NR-Secondary Synchronization Signal (NR-SSS).

[0094] The NR-PSS may be used to perform synchronization on the initial symbol boundary in the NR cell.

[0095] NR-SSS can be used to detect the NR cell identifier (ID).

[0096] In the previous wireless communication system (e.g., LTE / LTE-A system) of the NR system, the bandwidth for transmission of PSS / SSS and / or physical broadcast channel (PBCH) is defined as 1.08 megahertz (MHz) corresponding to six physical resource blocks (PRBs). Compared with the previous wireless communication system, the NR system can use a relatively wide transmission bandwidth to transmit NR-PSS / SSS and / or NR-PBCH. To this end, the NR system can use a subcarrier spacing (SCS) greater than 15 kilohertz (kHz).

[0097] If operating at 6 gigahertz (GHz) or less, one of 15kHz and 30kHz may be considered the default SCS. If operating at 6 GHz or higher (e.g., if operating between 6 GHz and 52.5 GHz), one of 120kHz and 240kHz may be considered the default SCS.

[0098] In detail, the default SCS set and the minimum carrier bandwidth assumed by the UE during initial access can be defined as follows. If operating at 6 GHz or less, the UE can basically assume a 15 kHz SCS and a bandwidth of 5 MHz. In addition, the UE can assume a 30 kHz SCS and a bandwidth of 10 MHz in a specific frequency band. In addition, if operating at 6 GHz or higher, the UE can assume a 120 kHz SCS and a bandwidth of 10 MHz.

[0099] In addition, the SCS supported by data and / or control information based on a specific frequency band may be defined as follows. If operating at 1 GHz or less, SCSs of 15 kHz, 30 kHz, and 60 kHz may be supported. If operating between 1 GHz and 6 GHz, SCSs of 15 kHz, 30 kHz, and 60 kHz may be supported. If operating between 24 GHz and 52.6 GHz, SCSs of 60 kHz and 120 kHz may be supported for data, but 240 kHz may not be supported. The SCS to be supported may be defined based on the frequency band.

[0100] NR-PSS, NR-SSS, and / or NR-PBCH may be transmitted in a synchronization signal (SS) block. Here, the SS block refers to a time-frequency resource region including all NR-PSS, NR-SSS, and / or NR-PBCH.

[0101] At least one SS block may constitute an SS burst. A single SS burst may be defined as including a predetermined number of SS blocks, which may also be referred to as the duration of the SS burst. Furthermore, at least one SS block may be continuous or discontinuous within a single SS burst. Furthermore, at least one SS block within a single SS burst may be the same or different.

[0102] At least one SS burst may constitute an SS burst set. A single SS burst set may be defined as including a predetermined period and a predetermined number of SS bursts. The number of SS bursts within an SS burst set may be defined as finite. In addition, the transmission time point of the SS burst set may be defined periodically or aperiodically.

[0103] At least one SCS may be predefined for each synchronization signal (e.g., NR-PSS, NR-SSS, NR-PBCH) for a specific frequency range or carrier. For example, at least one of 15, 30, 120, and 240 kHz may be used as the SCS.

[0104] Here, the SCS for NR-PSS, NR-SSS or NR-PBCH may be the same. In addition, at least one frequency range may be given, and different frequency ranges may overlap. In addition, a single parameter configuration may be defined for a specific frequency range, and multiple parameter configurations may be defined. Therefore, one or more SCSs may be defined for a specific frequency range.

[0105] Furthermore, from the UE's perspective, a set of SS bursts may be transmitted periodically.

[0106] Figure 6 An example of transmission through multiple beams in synchronization signal transmission according to the present disclosure is shown.

[0107] To overcome the adverse channel environment such as high path loss, phase noise, and frequency offset occurring in high carrier frequencies, NR systems may consider the transmission of synchronization signals, random access signals, and broadcast channels through multiple beams.

[0108] Regarding transmission through multiple beams, the number of beams used for transmission and the width of each beam may be determined differently based on the cell environment. Therefore, standardization is required regarding the maximum number of beams required for transmission and the maximum number of physical resources to provide the degree of freedom of implementation as described above.

[0109] In the following, reference Figure 6 A method of transmitting a beam in an SS burst including a single SS block or multiple SS blocks is described.

[0110] refer to Figure 6 (a), a single beam is applied to each single SS block, and generally, an analog beamforming method is applied. In this case, the number of applicable beams is limited based on the number of radio frequency (RF) chains.

[0111] Reference Figure 6 (b) Two beams are applied for each single SS block, and a digital beamforming method or a hybrid beamforming method is generally applied. Using this method, beam scanning for covering the target coverage area can be performed more quickly. Figure 6 Compared with the SS blocks in (a), a relatively small number of SS blocks can be used, which can lead to enhanced network resource consumption efficiency.

[0112] Figure 7 An example of the structure of a synchronization signal frame in the case of considering transmission through multiple beams in synchronization signal transmission according to the present disclosure is shown.

[0113] refer to Figure 7In the NR system, transmission of at least one beam may be applied to the same SS block. When multiple beams are transmitted to a single SS block, transmission of the SS block to which different beam patterns are applied by beam scanning may be performed to meet the target coverage area. Here, the target coverage area indicates that transmission of at least one beam and transmission of each beam are performed to cover the target coverage area based on the beam width / azimuth expected by the base station.

[0114] Reference Figure 7 , the synchronization signal can be transmitted by applying a single beam or multiple beams to each single SS block. Within a single SS block, at least one of NR-PSS, NR-SSS, and NR-PBCH can be transmitted. For a given frequency band, a single SS block corresponds to N OFDM symbols based on the default SCS definition. Here, N represents a constant. For example, if N=4, four OFDM symbols can be used within a single SS block. Here, a single OFDM symbol can be used for NR-PSS, another single OFDM symbol can be used for NR-SSS, and the remaining two OFDM symbols can be used for NR-PBCH.

[0115] refer to Figure 7 , a single SS block or multiple SS blocks can be configured as a single SS burst. The SS blocks constituting a single SS burst can be allocated continuously or discontinuously in the time domain or the frequency domain.

[0116] refer to Figure 7 , a single SS burst or multiple SS bursts can be configured as a single SS burst set. From the UE's perspective, the SS burst group is transmitted periodically, and the UE adopts a default transmission period during the initial cell selection of each specific carrier frequency. The UE can receive update information about the SS burst set transmission period from the base station.

[0117] The UE can derive the symbol / slot index and the radio frame index from a single SS block time index. The symbol / slot index and the radio frame index according to the SS block time index of each SS block can be prefixed and defined thereby. Therefore, if the SS block time index of each SS block is known, the frame / symbol timing of each SS block can be known based on the relationship between the SS block time index and the symbol / slot index and the radio frame index, where the symbol / slot index and the radio frame index are prefixed and defined thereby. In this way, the entire frame / symbol timing can be known.

[0118] Here, in the case of SS block time index, 1) the SS burst index can be defined in the SS burst set, and the time index for the single SS block can be defined for each SS block in the single SS burst, and 2) the time index for the single SS block can be defined for each SS block in the SS burst set.

[0119] In addition, the transmission of SS blocks within an SS burst set may be limited to a 5 ms window, regardless of the periodicity of the SS burst set. The number of available candidate SS blocks within the 5 ms window may be given as L. In detail, L represents the maximum number of SS blocks within an SS burst set and may be defined based on the following frequency range. For example, L=4 in a frequency range of 3 GHz or less, L=8 in a frequency range of 3 GHz to 6 GHz, and L=64 in a frequency range of 6 GHz to 52.6 GHz. In addition, in the case of initial access such as cell selection, the default value of the SS burst set periodicity may be defined as 20 ms.

[0120] Figure 8 An example of the structure of a synchronization signal (SS) block according to the present disclosure is shown.

[0121] Reference Figure 8 , NR-PSS, NR-SSS and / or NR-PBCH may be present in a single SS block. A single SS block may correspond to 4 OFDM symbols in the time domain and may correspond to 20 PRBs in the frequency domain. NR-PSS may be mapped to 12 PRBs of the first symbol, NR-SSS may be mapped to 12 PRBs of the third symbol, and NR-PBCH may be mapped to 20 PRBs of each of the second and fourth symbols in the SS block. In addition, at each end of the third symbol of the SS block, the NR-PBCH may be additionally mapped to 4 PRBs. In addition, the demodulation reference signal (DM-RS) associated with the NR-PBCH may also be mapped within the SS block.

[0122] In addition, the SCS supporting the SS block can be 15kHz and 30kHz if operating in 6GHz or lower frequencies, and can be 120kHz and 240kHz if operating in 6GHz or higher frequencies.

[0123] Below, the downlink synchronization signal sequence in the NR system is described.

[0124] There can be a total of 3 NR-PSS sequences. If the NR-PSS is configured based on a pure binary phase shift keying (BPSK) M sequence in the frequency domain, then x 7 +x 4 +1 can be used as a primitive polynomial. By cyclically shifting the primitive polynomial by 0, 43, and 86 in the frequency domain, a total of 3 NR-PSS sequences can be obtained. Here, the shift register value used to generate the sequence by the primitive polynomial can be represented as 11101110 using a binary system. Here, the NR-PSS can have a sequence length of 127 and can be continuously mapped to a total of 127 subcarriers.

[0125] In addition, the NR-SSS may be configured based on a pure BPSK M sequence. Here, the sequence length of the NR-SSS may be 127, which is the same as the sequence length of the NR-PSS, and may be continuously mapped to a total of 127 subcarriers. Here, since approximately 1000 physical cell IDs (PCIDs) are considered for NR, approximately 1000 NR-SSS sequences may be required.

[0126] M sequences can be generated based on irreducible primitive polynomials over GF(2). 7 -1), an M sequence can be generated based on one of a total of 18 irreducible primitive polynomials as shown in Table 5 below.

[0127] [Table 5]

[0128] Decimal Octal Binary Polynomial 131 203 10000011 <![CDATA[x 7 +x+1]]> 137 211 10001001 <![CDATA[x 7 +x 3 +1]]> 143 217 10001111 <![CDATA[x 7 +x 3 +x 2 +x+1]]> 145 221 10010001 <![CDATA[x 7 +x 4 +1]]> 157 235 10011101 <![CDATA[x 7 +x 4 +x 3 +x 2 +1]]> 167 247 10100111 <![CDATA[x 7 +x 5 +x 2 +x+1]]> 171 253 10101011 <![CDATA[x 7 +x 5 +x 3 +x+1]]> 185 271 10111001 <![CDATA[x 7 +x 5 +x 4 +x 3 +1]]> 191 277 10111111 <![CDATA[x 7 +x 5 +x 4 +x 3 +x 2 +x+1]]> 193 301 11000001 <![CDATA[x 7 +x 6 +1]]> 203 313 11001011 <![CDATA[x 7 +x 6 +x 3 +x+1]]> 211 323 11010011 <![CDATA[x 7 +x 6 +x 4 +x+1]]> 213 325 11010101 <![CDATA[x 7 +x 6 +x 4 +x 2 +1]]> 229 345 11100101 <![CDATA[x 7 +x 6 +x 5 +x 2 +1]]> 239 357 11101111 <![CDATA[x 7 +x 6 +x 5 +x 3 +x 2 +x+1]]> 241 361 11110001 <![CDATA[x 7 +x 6 +x 5 +x 4 +1]]> 247 367 11110111 <![CDATA[x 7 +x 6 +x 5 +x 4 +x 2 +x+1]]> 253 375 11111101 <![CDATA[x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1]]>

[0129] For example, referring to Table 5, using the primitive polynomial x 7 +x 3 +1 (expressed as 131 using the decimal system, 211 using the octal system, and 10001001 using the binary system), the M sequence can be generated according to the following equation 1. In equation 1, x(i) represents the M sequence, and 0≤i≤126. In addition, in equation 1, Corresponding to x in the primitive polynomial 7 , Corresponding to x in the primitive polynomial 3 ,and Corresponding to 1 in the primitive polynomial. Although the initialization values ​​x(0), x(1), x(2), x(3), x(4), x(5), and x(6) are expressed as 0, 0, 0, 0, 0, 0, and 1, respectively, in Equation 1, they are provided only as examples. That is, other initialization values ​​may be used.

[0130] [Equation 1]

[0131]

[0132] x(0)=0,x(1)=0,x(2)=0,x(3)=0,x(4)=0,x(5)=0,x(6)=1.

[0133] If the generated M sequence is expressed using BPSK, the M sequence can be modulated as represented by the following equation 2. If the sequence value of the M sequence = 0, the value becomes 1 in response to BPSK modulation. If the sequence value of the M sequence = 1, the value becomes -1 in response to BPSK modulation.

[0134] [Equation 2]

[0135]

[0136] Finally, as shown in Equation 3 below, by substituting the sequence of Equation 2 Cyclic shift m to generate a total of 127 sequences, because a total of 127 values ​​from 0 to 126 can be used for the value of m, therefore, Corresponding to the NR-SSS sequence, the NR-SSS sequence is mapped to each of consecutive 127 subcarriers on the frequency axis with respect to a single symbol within substantially a single SS block.

[0137] [Equation 3]

[0138]

[0139] The correlation value of the BPSK M sequence generated in the above manner is expressed as the following equation 4. If the examples of equations 1 to 3 are followed, N=127 corresponds to the length of the M sequence in equation 4. That is, as shown in equation 4, the correlation value between sequences having the same cyclic shift (i.e., the correlation value with the corresponding sequence itself) is N, otherwise it is -1, that is, since the difference is large, the BPSK M sequence can have excellent correlation characteristics.

[0140] [Equation 4]

[0141]

[0142] As described above, the BPSK M sequence has excellent correlation characteristics. However, considering the sequence of length 127 for a total of 127 subcarriers mapped to the frequency, the total number of sequences is 127 and is therefore limited. As described above, approximately 1000 NR PCIDs need to be classified. Here, although scrambling is applied to each of the 127 NR-SSS sequences based on three NR-PSSs, there are a total of 127·3=381 different sequence combinations, and approximately 1000 NR PCIDs may not be classified accordingly. Therefore, a method of generating a larger number of sequences is needed.

[0143] In order to generate a larger number of sequences, a plurality of irreducible primitive polynomials may be used instead of using a single irreducible primitive polynomial as described above with reference to equations 1 to 3, and one of a total of 18 irreducible primitive polynomials may be used in order to generate an M sequence of length 127 as shown in Table 5. Therefore, a maximum of K primitive polynomials may be used among a total of 18 primitive polynomials, as described below.

[0144] If x 0(i) refers to the M sequence generated by the first primitive polynomial, x 1 (i) refers to an M sequence generated by the second primitive polynomial, and in this way, x k (i) refers to the M sequence generated by the (k+1)th primitive polynomial, and a total of 127·K sequences can be generated. Here, 0≤k≤K-1, and the maximum value of K is 18. Here, the (k+1)th primitive polynomial can be one of the 18 primitive polynomials in Table 5. In addition, the M sequence x is generated by each corresponding primitive polynomial k The method of (i) may follow the method described above with reference to Equation 1.

[0145] If the generated M sequence is expressed using BPSK, modulation can be performed as expressed in the following equation 5. If the sequence value of the M sequence = 0, the value becomes 1 in response to BPSK modulation. If the sequence value of the M sequence = 1, the value becomes -1 in response to BPSK modulation.

[0146] [Equation 5]

[0147]

[0148] As shown in Equation 6, since a total of 127 values ​​from 0 to 126 can be used as the value of m, by replacing the sequence of Equation 5 with Cyclic shift m can generate a total of 127 sequences. In addition, 127 sequences can be generated for each k, and a total of 127×K sequences can be generated eventually. Here, 0≤k≤K-1, and the maximum value of K is 18, so s m (n) corresponds to an NR-SSS sequence mapped to each of consecutive 127 subcarriers on the frequency axis with respect to a single symbol within substantially a single SS block.

[0149] [Equation 6]

[0150]

[0151] The correlation value of the BPSK M sequence generated in the above manner is represented by the following equation 7. Here, the maximum absolute value of the correlation value according to equation 7 (here, the maximum absolute value refers to the maximum absolute value among the values ​​excluding the correlation value with the corresponding sequence itself) is 41, which is not much different from 127 compared to equation 4 whose corresponding value is 1 (1 if the absolute value is applied to -1). Therefore, a maximum of 127*K sequences can be generated, which may be sufficient to classify about 1000 NR PCIDs. However, the correlation characteristics may be poor.

[0152] [Equation 7]

[0153]

[0154] Here, when an M sequence is generated based on a maximum connection set of an M sequence instead of generating an M sequence from each of a total of K primitive polynomials, a sequence having a more excellent correlation characteristic can be generated. The maximum connection set of an M sequence may have a total of 18 sets of M sequences with a length of 127 as shown in Table 6. The primitive polynomials of Table 5 may be represented as the primitive polynomials of Table 6 below using the octal system.

[0155] [Table 6]

[0156]

[0157] If x 0 (i) refers to the M sequence generated by the first primitive polynomial, x 1 (i) refers to an M sequence generated by the second primitive polynomial, and in this way, x k (i) refers to the M sequence generated by the (k+1)th primitive polynomial (here, 0≤k≤K-1), then the maximum value of K is 6, which is different from the method described above with reference to equations 5 and 6. Here, each primitive polynomial needs to be a primitive polynomial belonging to the maximum connection set of Table 6 above.

[0158] For example, in the case of using the maximum connection set 1 of Table 6, in response to the representation using the octal system, the primitive polynomial needs to be represented as one of 211, 217, 277, 323, 203 and 253.

[0159] Hereinafter, PCID and synchronization signals in the NR system will be described.

[0160] In NR systems, the PCID ranges from 0 to 1007 and can have one of 1008 distinguishable values. The PCID can be represented as N ID cell And it can be defined as N ID cell =3N ID (1) +N ID (2) .

[0161] Here, N ID (1) can have a single value in {0, 1, ..., 335}, N ID (2) can have a single value in {0, 1, 2}. That is, N ID (1) can have a single value among 336 hypothetical values, N ID(2) Can have a single value out of three assumed values.

[0162] N ID (1) It can be given by NR-SSS, N ID (2) It can be given by NR-PSS. That is, the base station transmitting the synchronization signal can determine the PCID value N of the base station ID cell The corresponding N ID (1 and N ID (2) The value of N ID (1 and N ID (2) The UE receiving the synchronization signal for initial cell selection can verify N from the detected NR-SSS sequence and NR-PSS sequence, respectively. ID (1 and N ID (2) , and can be based on N ID cell =3N ID (1) +N ID (2) Determine the PCID of the corresponding cell.

[0163] Hereinafter, a process of generating NR-PSS and NR-SSS sequences is described.

[0164] Use the M sequence to generate the NR-PSS sequence d PSS (n) can be expressed as the following equation 8.

[0165] [Equation 8]

[0166] d PSS (n) = 1-2x (m)

[0167] m=(n+43N ID (2) )mod127

[0168] 0≤n<127

[0169] in

[0170] x(i+7)=(x(i+4)+x(i))mod2

[0171] as well as

[0172] [x(6)x(5)x(4)x(3)x(2)x(1)x(0)]=[1 1 1 0 1 1 0]

[0173] Referring to Equation 8, a pure BPSK M sequence based on the frequency domain may be used to generate the NR-PSS. In addition, three NR-PSSs may be obtained by applying three cyclic shift (CS) values ​​in the frequency domain. That is, the CS value may be defined as follows: if N ID (2) =0, CS = 0; if N ID (2) =1, CS = 43; and if N ID (2) =2, CS=86. Moreover, in the case of a pure BPSK M sequence based on the frequency domain, the length of the NR-PSS sequence can be 127.

[0174] Use the M sequence to generate the sequence d for NR-SSS PSS (n) can be expressed as the following equation 9.

[0175] [Equation 9]

[0176]

[0177] in

[0178] x 0 (i+7)=(x 0 (i+4)+x 0 (i))mod2

[0179] x 1 (i+7)=(x 1 (i+1)+x 1 (i))mod2

[0180] as well as

[0181] [x 0 (6)x 0 (5)x 0 (4)x 0 (3)x 0 (2)x 0 (1)x 0 (0)] = [0 0 0 0 0 0 1]

[0182] [x 1 (6)x 1 (5)x 1 (4)x 1 (3)x 1 (2)x 1 (1)x 1(0)] = [0 0 0 0 0 0 1]

[0183] Referring to Equation 9, the NR-SSS sequence may be generated using a single polynomial to which 112 cyclic shifts are applied and an additional single polynomial to which 9 cyclic shifts are applied.

[0184] Here, the cyclic shift value m 0 and m 1 Based on the NR-PSS (i.e., N ID (2) =0, 1, 2) and NR-SSS (i.e., N ID (1) =0, 1, ..., 335) extracted cell ID (ie, N ID cell =3N ID (1) +N ID (2) ) to determine. For example, m 0 M1 may have a single value in 9 cases including 0, 5, 10, 15, 20, 25, 30, 35, and 40, and M2 may have a single value in 112 cases including 0 to 111. 0 and m 1 The available combinations may correspond to a total of 1008 (=9*112) cell IDs (ie, PCIDs).

[0185] The generated NR-PSS and NR-SSS sequences may be mapped to the time-frequency resources of the SS block. The NR-PSS may be mapped to 127 consecutive subcarriers existing in the middle of the frequency domain at the time position of a single specific symbol of the SS block, and the NR-SSS may be mapped to 127 consecutive subcarriers existing in the middle of the frequency domain at the time position of another specific symbol of the SS block. Figure 8 In the example of , the NR-PSS sequence or NR-SSS sequence is described as being mapped to 12 PRBs (=12*12=144 subcarriers). In detail, the NR-PSS sequence or NR-SSS sequence is mapped to 127 subcarriers among the 144 subcarriers present in the 12 PRBs, and the NR-PSS sequence or NR-SSS sequence may not be mapped to the 8 subcarriers corresponding to the low frequency and the 9 subcarriers corresponding to the high frequency.

[0186] Hereinafter, a method and apparatus for setting and generating a sidelink synchronization signal sequence in a wireless communication system and a method and apparatus for transmitting and receiving a sidelink synchronization signal according to the present disclosure will be described.

[0187] Fig. 9An example of a sidelink synchronization reference according to the present disclosure is shown.

[0188] refer to Fig. 9 , assuming that in a wireless communication system, a first UE (UE1) 910 exists in a network coverage range 905 of a base station 900, and a second UE (UE2) 920, a third UE (UE3) 930, a fourth UE (UE4) 940 and a fifth UE (UE5) 950 exist outside the network coverage range 905.

[0189] Here, the wireless communication system may be a 5G network supporting LTE-based technologies (i.e., LTE and LTE-enhanced radio access technologies) and NR. In addition, the base station 900 may be a gNB or an eNB. As described above, Fig. 9 The wireless communication system of the present invention can be applied to all situations where the NR system operates independently and the NR system and the LTE-based system operate together. In addition, the sidelink technology of the wireless communication system may include all of the NR sidelink technology and the LTE-based sidelink technology.

[0190] Here, the sidelink synchronization reference may be classified into a plurality of types. In addition, a physical layer sidelink synchronization identifier set for a corresponding sidelink synchronization signal may be distinguishably defined based on the type into which the sidelink synchronization reference is classified.

[0191] As a first example, synchronization references may be classified into two types based on whether the synchronization source is an entity existing in the network coverage 905 (ie, an in-coverage entity) or an entity existing outside the network coverage 905 (ie, an out-of-coverage entity).

[0192] In detail, since UE2 920 performs synchronization using a synchronization signal from UE1 910, and UE1 910 performs synchronization using a synchronization signal from the base station 900, UE2 920 uses an entity within the coverage as a synchronization source. UE3 930 performs synchronization using a synchronization signal from UE2 920, UE2 920 performs synchronization using a synchronization signal from UE1 910, and UE1 910 performs synchronization using a synchronization signal from the base station 900. Therefore, UE3 930 uses an entity within the coverage as a synchronization source. In this case, a synchronization reference of a side link 915 between UE1 910 and UE2 920 or a synchronization reference of a side link 925 between UE2 920 and UE3 930 may be referred to as a first type synchronization reference.

[0193] UE5 950 appearing out of coverage performs synchronization using a synchronization signal from UE4 940 appearing out of coverage. In this case, a synchronization reference of a side link 945 between UE4 940 and UE5 950 may be referred to as a second type synchronization reference.

[0194] The side link synchronization identifier set corresponding to the first type of synchronization reference may be referred to as id_net, and the side link synchronization identifier set corresponding to the second type of synchronization reference may be referred to as id_oon. That is, id_net may be applied to the first side link 915 and the second side link 925, and id_oon may be applied to the third side link 945.

[0195] As a second example, synchronization references may be classified into three types based on whether the synchronization source is an entity within coverage or an entity outside coverage, whether the synchronization signal is transmitted from an entity within coverage to an entity outside coverage, or whether the synchronization signal is transmitted from an entity outside coverage to another entity outside coverage.

[0196] In detail, since UE2 920 performs synchronization using a synchronization signal from UE1 910, and UE1 910 performs synchronization using a synchronization signal from a base station, UE2 920 uses an entity within the coverage as a synchronization source. Also, UE1 910 exists within the coverage, while UE2 920 exists outside the coverage. In this case, the synchronization reference of the side link 915 between UE1 910 and UE2 920 may be referred to as a first type synchronization reference.

[0197] UE3 930 performs synchronization using a synchronization signal from UE2 920, UE2 920 performs synchronization using a synchronization signal from UE1 910, and UE1 910 performs synchronization using a synchronization signal from base station 900. Therefore, UE3 930 uses an entity within the coverage as a synchronization source. And, all UE2 920 and UE3 930 are outside the coverage. In this case, the synchronization reference of the side link 925 between UE2 920 and UE3 930 can be referred to as a second type synchronization reference.

[0198] UE5 950 appearing out of coverage performs synchronization using a synchronization signal from UE4 940 appearing out of coverage. In this case, a synchronization reference of a side link 945 between UE4 940 and UE5 950 may be referred to as a third type synchronization reference.

[0199] The side link synchronization identifier set corresponding to the first type of synchronization reference may be referred to as id_net_1, the side link synchronization identifier set corresponding to the second type of synchronization reference may be referred to as id_net_2, and the side link synchronization identifier set corresponding to the third type of synchronization reference may be referred to as id_oon. That is, id_net_1 may be applied to the first side link 915, id_net_2 may be applied to the second side link 925, and id_oon may be applied to the third side link 945.

[0200] As a third example, synchronization references may be classified into three types based on whether the synchronization source is an in-coverage entity or an out-of-coverage entity and based on the type of radio access technology followed by the synchronization source.

[0201] In detail, if the synchronization source of UE2 920 or UE3 930 is an entity present in the coverage area (e.g., a gNB of the NR system) and is based on the first type of radio access technology, the corresponding synchronization reference may be referred to as a first type synchronization reference. Fig. 9 If the base station 900 is a gNB, the synchronization reference of the side link 915 between UE1 910 and UE2 920 or the side link 925 between UE2 920 and UE3 930 can be called a first type synchronization reference.

[0202] Alternatively, if the synchronization source of UE2 920 or UE3 930 is an entity present in the coverage area (e.g., an eNB of an LTE-based system) and is based on the second type of radio access technology, the corresponding synchronization reference may be referred to as a second type synchronization reference. Fig. 9 If the base station 900 is an eNB, the synchronization reference of the side link 915 between UE1 910 and UE2 920 or the side link 925 between UE2 920 and UE3 930 may be referred to as a second type synchronization reference.

[0203] UE5 950 appearing out of coverage performs synchronization using a synchronization signal from UE4 940 appearing out of coverage. In this case, a synchronization reference of a side link 945 between UE4 940 and UE5 950 may be referred to as a third type synchronization reference.

[0204] The side link synchronization identifier set corresponding to the first type of synchronization reference may be referred to as id_net_1, the side link synchronization identifier set corresponding to the second type of synchronization reference may be referred to as id_net_2, and the side link synchronization identifier set corresponding to the third type of synchronization reference may be referred to as id_oon. That is, id_net_1 may be applied to the first side link 915, id_net_2 may be applied to the second side link 925, and id_oon may be applied to the third side link 945.

[0205] According to the present disclosure, two or three types may be defined for the type of synchronization reference or the type of physical layer side link synchronization identifier set.

[0206] If two types are used to define a synchronization identity set, then id_net can be defined that uses entities within the coverage as synchronization references and id_oon that uses entities outside the coverage as synchronization references.

[0207] If three types are used to define a synchronization identifier set, id_net_1 can be defined for the case where an entity within the coverage is used for synchronization reference and a side link synchronization signal is transmitted from the entity within the coverage to an entity outside the coverage, id_net_2 can be defined for the case where an entity within the coverage is used for synchronization reference and a side link synchronization signal is transmitted from an entity outside the coverage to another entity outside the coverage, and id_oon can be defined for the case where an entity outside the coverage is used for synchronization reference.

[0208] Alternatively, if three types are used to define a synchronization identification set, id_net_1 using an entity within the coverage of a first type of radio access technology as a synchronization reference, id_net_2 using an entity within the coverage of a second type of radio access technology as a synchronization reference, and id_oon using an entity outside the coverage as a synchronization reference can be defined.

[0209] Fig.10 is a flowchart illustrating an example of a method of transmitting a sidelink synchronization signal sequence according to the present disclosure.

[0210] Fig.10 The sidelink synchronization signal transmission method can be performed by a sidelink transmitting UE (hereinafter, transmitting UE).

[0211] Reference Fig.10 In operation S1010, the transmitting UE may identify the physical layer side link synchronization identifier (SLID) or N based on the side link identifier (SLID) corresponding to the physical layer side link synchronization identifier information. ID SL , to determine N ID (1) and N ID(2) The value of .

[0212] Here, various examples of the present disclosure may include a method in which two types (e.g., Fig. 9 id_net and id_oon in the example of , or where three types are used (for example, Fig. 9 In the example of id_net1, id_net_2 and id_oon) to configure the physical layer side link synchronization identifier set.

[0213] In addition, various examples of the present disclosure may include a physical layer side link synchronization identifier set (eg, Fig. 9 Each of id_net and id_oon in the example, or each of id_net1, id_net_2 and id_oon) includes a case where each type includes 168 sequences, a case where each type includes 336 sequences, a case where each type includes 504 sequences, or a case where each type includes 1008 sequences.

[0214] As described above, the N corresponding to the SLID value may be determined based on the number of types of physical layer side link synchronization identification sets and the number of synchronization signal sequences included in each type of identification set. ID (1) and N ID (2) The value of .

[0215] In operation S1020, the transmitting UE may generate an NR-primary sidelink synchronization signal (PSSS) sequence by applying a first initialization value to a first primitive polynomial. ID (2) The value of determines the cyclic shift (CS) value to be applied to the generated NR-PSSS sequence, and the CS can be applied to the NR-PSSS sequence.

[0216] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a first primitive polynomial for generating the NR-PSSS sequence that is different from the first primitive polynomial applied to the NR downlink synchronization signal sequence.

[0217] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a CA value of the NR-PSSS that is different from the CS value applied to the NR downlink synchronization signal sequence.

[0218] In operation S1030, the transmitting UE may generate a first NR-Secondary Sidelink Synchronization Signal (NR-SSSS) sequence by applying the second initialization value to the first primitive polynomial, and may generate a second NR-SSSS sequence by applying the second initialization value to the second primitive polynomial.

[0219] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of the first and second primitive polynomials for generating the NR-SSSS sequence, which is different from at least one of the first and second primitive polynomials applied to the NR downlink synchronization signal sequence.

[0220] In operation S1040, the transmitting UE may ID (1) and N ID (2) The value of N determines the CS value to be applied to the generated first NR-SSSS sequence, and the CS may be applied to the first NR-SSSS sequence. ID (1) and N ID (2) The value of determines the CS value to be applied to the generated second NR-SSSS sequence, and the CS can be applied to the second NR-SSSS sequence.

[0221] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of the CS value for the first NR-SSSS sequence and the CS value for the second NR-SSSS sequence (which is different from the CS value applied to the NR downlink synchronization signal sequence).

[0222] In operation S1050, the transmitting UE may generate an NR-PSSS modulation symbol by performing BPSK modulation on the NR-PSSS sequence to which the CS is applied. In addition, the transmitting UE may generate an NR-SSSS modulation symbol by multiplying the BPSK modulation result of the first NR-SSSS sequence to which the CS is applied by the BPSK modulation result of the second NR-SSSS sequence to which the CS is applied.

[0223] In operation S1060, the transmitting UE may map the NR-SSSS modulation symbol to consecutive subcarriers on the frequency in a single symbol in a single SS block, and may map the NR-SSSS modulation symbol to consecutive subcarriers on the frequency in another symbol in the single SS block. The transmitting UE may generate and transmit a synchronization signal based on the modulation symbol mapped to the time-frequency resource.

[0224] Fig.11 is a flow chart illustrating an example of a method of receiving a side link synchronization signal sequence according to the present disclosure.

[0225] Fig.11 The sidelink synchronization signal receiving method can be performed by a sidelink receiving UE (hereinafter, receiving UE).

[0226] Reference Fig.11 In operation S1110, the receiving UE may receive a synchronization signal from the transmitting UE. The receiving UE may detect, from the synchronization signal, NR-PSSS modulation symbols on consecutive subcarriers on a frequency mapped to a single symbol within a single SS block, and may detect NR-SSSS modulation symbols on consecutive subcarriers on a frequency mapped to another symbol within the single SS block.

[0227] In operation S1120, the receiving UE may determine the NR-PSSS sequence to which CS is applied from the detected NR-PSSS modulation symbol. In addition, the receiving UE may determine the first NR-SSSS sequence to which CS is applied and the second NR-SSSS sequence to which CS is applied from the detected NR-SSSS modulation symbol.

[0228] In operation S1130, the receiving UE may calculate N based on the first primitive polynomial applied to the determined NR-PSSS sequence and the CS value. ID (2) The value of .

[0229] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a first primitive polynomial for generating the NR-PSSS sequence that is different from the first primitive polynomial applied to the NR downlink synchronization signal sequence.

[0230] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a CS value for the NR-PSSS sequence that is different from the CS value applied to the NR downlink synchronization signal sequence.

[0231] The receiving UE may know in advance the first primitive polynomial and the candidate CS values ​​that can be used to generate the NR-PSSS sequence. Therefore, the receiving UE may verify the CS value applied to the corresponding NR-PSSS sequence from the NR-PSSS sequence determined in operation S1120, and may calculate N according to the verified CS value. ID (2) The value of the value.

[0232] In operation S1140, the receiving UE may calculate N based on the CS value applied to the determined first NR-SSSS sequence and the CS value applied to the second NR-SSSS sequence. ID (1) The value of .

[0233] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of the first and second primitive polynomials for generating the NR-SSSS sequence, which is different from at least one of the first and second primitive polynomials applied to the NR downlink synchronization signal sequence.

[0234] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of a CS value for a first NR-SSSS sequence and a CS value for a second NR-SSSS sequence that is different from the CS value applied to the NR downlink synchronization signal sequence.

[0235] The receiving UE may know in advance the first primitive polynomial and the second primitive polynomial and the candidate CS values ​​applicable to generating the first NR-SSSS sequence and the second NR-SSSS sequence. Therefore, the receiving UE may verify the CS value applied to each NR-PSSS sequence from each of the first NR-SSSS sequence and the second NR-SSSS sequence determined in operation S1120, and may obtain the CS value from the verified CS value and the N calculated in operation S1130. ID (2) Calculate the value of N ID (1) The value of .

[0236] In operation S1150, the receiving UE may receive the N ID (1) and N ID (2) The calculated value determines the SLID (or N ID SL )value.

[0237] Here, various examples of the present disclosure may include a method in which two types (e.g., Fig. 9 id_net and id_oon in the example of , or where three types are used (for example, Fig. 9 In the example of id_net_1, id_net_2 and id_oon) to configure the physical layer side link synchronization identifier set.

[0238] In addition, various examples of the present disclosure may include a physical layer side link synchronization identifier set (eg, Fig. 9 In the example of , each of id_net and id_oon, or each of id_net_1, id_net_2, and id_oon) includes 168 sequences, the case where each type includes 336 sequences, the case where each type includes 504 sequences, or the case where each type includes 1008 sequences.

[0239] The receiving UE may know in advance the number of types of physical layer sidelink synchronization identifier sets and the number of synchronization signal sequences included in each type of the identifier set, and thus may determine the number of synchronization signal sequences corresponding to N ID (1) and N ID (2) The SLID value corresponding to the value.

[0240] Hereinafter, various examples of the present disclosure will be further described.

[0241] Examples of the present disclosure may include various combinations of examples regarding the number of types of physical layer side link synchronization identification sets (i.e., series of embodiments A), examples regarding the number of sequences included in each type of physical layer side link synchronization identification sets (i.e., series of embodiments B), and examples regarding the types of NR side link synchronization signal sequence resources used to distinguish NR side link synchronization signal sequences from NR downlink synchronization signal sequences (i.e., series of embodiments C).

[0242] The series of embodiments A may include a case where two types are used to configure the physical layer side link synchronization identifier set (embodiment A1) and a case where three types are used to configure the physical layer side link synchronization identifier set (embodiment A2).

[0243] The B series of embodiments may include the case where each type of physical layer side link synchronization identification set includes 168 sequences (embodiment B1), the case where each type of the identification set includes 336 (=168*2) sequences (embodiment B2), the case where each type of the identification set includes 504 sequences (embodiment B3), and the case where each type of the identification set includes 1008 (=504*2) sequences (embodiment B4).

[0244] The series of embodiments C include the case where the type of NR side link synchronization signal sequence resources used to distinguish the NR side link synchronization signal sequence from the NR downlink synchronization signal sequence is a CS value applied to NR-PSSS (embodiment C1), the case where the type of the resources is a CS value applied to NR-SSSS (embodiment C2), the case where the type is a primitive polynomial included in NR-PSSS (embodiment C3), and the case where the type of the resources is a primitive polynomial applied to NR-SSSS (embodiment C4).

[0245] In addition, the series of embodiments C may further include embodiments corresponding to a combination of at least two of C1 to C4.

[0246] For example, the CS value applied to the NR-PSSS may be defined to be distinguished from the CS value applied to the NR downlink PSS, and the CS value applied to the NR-SSSS may be defined to be distinguished from the CS value applied to the NR downlink SSS.

[0247] Alternatively, the primitive polynomial applied to the NR-PSSS may be defined to be distinct from the primitive polynomial applied to the NR downlink PSS, and the primitive polynomial applied to the NR-SSSS may be defined to be distinct from the primitive polynomial applied to the NR downlink SSS.

[0248] Alternatively, the primitive polynomial applied to the NR-PSSS may be defined to be different from the primitive polynomial applied to the NR downlink PSS, and the CS value applied to the NR-SSSS may be defined to be different from the CS value applied to the NR downlink SSS.

[0249] Alternatively, the CS value applied to the NR-PSSS may be defined to be distinguished from the CS value applied to the NR downlink PSS, and the primitive polynomial applied to the NR-SSSS may be defined to be distinguished from the primitive polynomial applied to the NR downlink SSS.

[0250] Alternatively, a primitive polynomial and CS value applied to NR-PSSS and a primitive polynomial and CS value applied to NR-SSSS may be defined that are different from the primitive polynomial and CS value applied to NR downlink PSS and the primitive polynomial and CS value applied to NR downlink SSS.

[0251] As described above, various embodiments of the present invention may include any possible combination of one of the series of embodiments A, one of the series of embodiments B, and one of the series of embodiments C. For example, when the NR sidelink synchronization signal is defined to be generated based on a rule corresponding to a single combination, the transmitting UE may generate and transmit a NR-PSSS sequence and a NR-SSSS sequence corresponding to the SLID according to the rule, and the receiving UE may determine the SLID by processing the received NR-PSSS sequence and NR-SSSS sequence.

[0252] Hereinafter, examples of the combination of the embodiment A series, the embodiment B series, and the embodiment C series will be further described.

[0253] Examples A1 and B1

[0254] The physical layer side link synchronization identification set may be defined as two types, namely, id_net and id_oon, and each of id_net and id_oon may include 168 sequences and may be defined as follows:

[0255] id_net = {0, 1, ..., 167}

[0256] id_oon={168, 169,..., 335}

[0257] N ID SL ={0, 1, ..., 335}

[0258] N ID (1) =N ID SL mod 168

[0259] N ID (2) = int(N ID SL / 168), N ID (2) ={0,1}

[0260] Examples A1, B1 and C1

[0261] Sidelink PSS Resources (Example C1-PSS)

[0262] A primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as those for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS.

[0263] For example, although the same primitive polynomial and initialization value as in Equation 8 are applied to the side link PSS, the CS value for the side link PSS may be defined as represented by the following Equation 10: ID (2) =0, then CS = 0 + k, and if N ID (2) =1, then CS=43+k,. Here, although a value of k=21 or 22 may be given, it is provided only as an example.

[0264] [Equation 10]

[0265] d PSS (n) = 1-2x(m)

[0266] m=(n+43N ID (2) +k)mod127

[0267] 0≤n<127

[0268] Therefore, a value distinguished from a CS value applied to a downlink PSS and corresponding to a farthest distance (eg, up to k) may be applied as a CS value applied to a sidelink PSS.

[0269] Sidelink SSS Resources (Example C1-SSS)

[0270] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as those for the downlink SSS. Here, the CS value for the sidelink SSS may use a portion of the CS value for the downlink SSS.

[0271] That is, the primitive polynomial of equation 9 can be applied to the side link SSS, and m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111} can be used for the CS value of the sidelink SSS.

[0272] For example, as shown in Equation 11 below, m 0 ={0, 5, 15, 20}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={15,20} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 0 The number of possible combinations may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0273] [Equation 11]

[0274]

[0275] As an additional example, m may be used as shown in Equation 12 below: 0 ={0, 5, 10, 15}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={10,15} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The number of possible combinations may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0276] [Equation 12]

[0277]

[0278] As another example, as shown in Equation 13 below, m 0 ={0, 5, 15, 20} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The number of possible combinations may correspond to a total of 336 (=4*84) SLIDs.

[0279] [Equation 13]

[0280]

[0281]

[0282] As another example, as shown in Equation 14 below, m 0 ={0, 5, 10, 15} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The number of possible combinations may correspond to a total of 336 (=4*84) SLIDs.

[0283] [Equation 14]

[0284]

[0285] Examples A1, B1 and C2

[0286] Sidelink PSS Resources (Example C2-PSS)

[0287] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as those for the downlink PSS. Here, the CS value for the sidelink PSS may use a portion of the CS value for the downlink PSS.

[0288] For example, although the same primitive polynomial and initialization value as in Equation 8 is applied to the sidelink PSS, the CS value for the sidelink PSS may be defined as follows: ID (2) =0, then CS = 0, and if N ID (2) =1, then CS=43.

[0289] Sidelink SSS Resources (Example C2-SSS)

[0290] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as those for the downlink SSS. Here, the CS value for the sidelink SSS may be applied, which is different from the CS value for the downlink SSS.

[0291] That is, the primitive polynomial of Equation 9 may be applied to the sidelink SSS, and a CS value may be applied as a CS value different from that of the downlink SSS, as described below.

[0292] For example, as shown in Equation 15 below, m 0 ={0+k, 5+k, 15+k, 20+k}. Here, for m 0 ={0+k, 5+k} can use m 1 ={0, 1, ..., 111}, for m 0 ={15+k, 20+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The number of possible combinations may correspond to a total of 336 (=2*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 90}) that satisfies 20+k<112.

[0293] [Equation 15]

[0294] d SSS (n) = [1-2x 0 ((n+m 0 )mod127)][1-2x 1 ((n+m 1)mod127)]

[0295] m 0 =15+5N ID (2) +k

[0296] m 1 =N ID (1) mod112

[0297] 0≤n<127

[0298] As an additional example, m may be used as shown in Equation 16 below: 0 ={0+k, 5+k, 10+k, 15+k}. Here, for m 0 ={0+k, 5k} can use m 1 ={0, 1, ..., 111}, and for m 0 ={10+k, 15+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The number of possible combinations may correspond to a total of 336 (=2*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 95}) that satisfies 15+k<112.

[0299] [Equation 16]

[0300]

[0301]

[0302] As an additional example, as shown in Equation 17 below, m 0 ={0k, 5+k, 15+k, 20+k} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The number of possible combinations may correspond to a total of 336 (=4*84) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 90}) that satisfies 20+k<112.

[0303] [Equation 17]

[0304]

[0305] As an additional example, as shown in Equation 18 below, m 0 ={0+k, 5+k, 10+k, 15+k} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The number of possible combinations may correspond to a total of 336 (=4*84) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 95}) that satisfies 15+k<112.

[0306] [Equation 18]

[0307]

[0308] Therefore, a value distinguished from a CS value applied to a downlink SSS and corresponding to a farthest distance (eg, up to k) may be applied as a CS value applied to a sidelink SSS.

[0309] Examples A1, B1 and C3

[0310] Sidelink PSS Resources (Example C3-PSS)

[0311] As shown in Equations 8 and 9, one of the first and second primitive polynomials (e.g., the polynomials corresponding to octal 221 and 203 in Table 5) for the downlink SSS (e.g., the polynomial corresponding to octal 221 in Table 5) can be used as the primitive polynomial for the downlink PSS.

[0312] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (eg, the polynomial corresponding to octal 203 of Table 5) that is distinct from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS.

[0313] In this case, an initialization value for the sidelink PSS primitive polynomial may be applied that is the same as the initialization value for the downlink PSS primitive polynomial. Alternatively, another single initialization value may be applied.

[0314] For example, the primitive polynomial for the sidelink PSS may be defined as shown in Equation 19 below.

[0315] [Equation 19]

[0316] x(i+7)=(x(i+1)+x(i))mod2

[0317] [x(6)x(5)x(4)x(3)x(2)x(1)x(0)]=[1 1 1 0 1 1 0]

[0318] Here, the CS value for the sidelink PSS may use part of the CS value for the downlink PSS. ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0, and if N ID (2) =1, then CS=43.

[0319] Sidelink SSS Resources (Example C3-SSS)

[0320] Although the primitive polynomial for the sidelink SSS may use the same polynomial as the primitive polynomial for the downlink SSS, the first and second primitive polynomials may be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS may be defined as polynomials corresponding to octal 203 and 221 of Table 5, respectively.

[0321] For example, the first and second primitive polynomials of the side link SSS may be defined as in Equation 20 below.

[0322] [Equation 20]

[0323] x 0 (i+7)=(x 0 (i+1)+x 0 (i))mod2

[0324] x 1 (i+7)=(x 1 (i+4)+x 1 (i))mod2

[0325] [x 0 (6)x 0 (5)x 0 (4)x 0 (3)x 0 (2)x 0 (1)x 0 (0)] = [0 0 0 0 0 0 1]

[0326] [x 1 (6)x 1 (5)x 1 (4)x 1 (3)x 1 (2)x1 (1)x 1 (0)] = [0 0 0 0 0 0 1]

[0327] In this case, an initialization value of the sidelink SSS primitive polynomial may be applied that is the same as the initialization value of the downlink SSS primitive polynomial. Alternatively, another single initialization value may be applied.

[0328] Here, the CS value for the sidelink SSS may use part of the CS value for the downlink SSS.

[0329] That is, the primitive polynomial of equation 20 can be applied to the side link SSS, and m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111} may be used as the CS value for the sidelink SSS.

[0330] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={15,20} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0331] As an additional example, as shown in Equation 12 above, m may be used 0 ={0, 5, 10, 15}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={10,15} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0332] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 15, 20} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1The multiple possible combinations of may correspond to a total of 336 (=4*84) SLIDs.

[0333] As another example, as shown in Equation 14 above, m may be used 0 ={0, 5, 10, 15} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 336 (=4*84) SLIDs.

[0334] Examples A1, B1 and C4

[0335] In this embodiment, first and second primitive polynomials different from those applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials for the sidelink SSS may be used as a primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0336] For example, the primitive polynomials for the sidelink PSS and the sidelink SSS may be defined as primitive polynomials belonging to the same maximum connection set (see Table 6).

[0337] Sidelink PSS Resources (Example C4-PSS)

[0338] As the primitive polynomial for the sidelink PSS, one of the remaining primitive polynomials other than the primitive polynomials for the downlink PSS and the downlink SSS among the polynomials belonging to set 5 included in the primitive polynomials for the downlink PSS and the downlink SSS in the maximum connection set of Table 6 (221 and 203 expressed using the octal system) can be selected. For example, one of the polynomials 253, 271, 367, and 345 expressed using the octal system can be selected as the primitive polynomial for the sidelink PSS.

[0339] For example, as shown in Equation 21 below, a polynomial corresponding to octal 253 may be applied as a primitive polynomial for the sidelink PSS. In this case, an initialization value for the sidelink PSS primitive polynomial may be applied that is the same as the initialization value for the downlink PSS primitive polynomial. Alternatively, another single initialization value may be applied.

[0340] [Equation 21]

[0341] x(i+7)=(x(i+5)+x(i+3)+x(i+1)+x(i))mod2

[0342] [x(6)x(5)x(4)x(3)x(2)x(1)x(0)]=[1 1 1 0 1 1 0]

[0343] Here, the CS value for the sidelink PSS may use part of the CS value for the downlink PSS. ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0, and if N ID (2) =1, then CS=43.

[0344] Sidelink SSS Resources (Example C4-SSS)

[0345] A primitive polynomial that is the same as the primitive polynomial used for the sidelink PSS can be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial can be selected as the second primitive polynomial for the sidelink SSS.

[0346] For example, a single polynomial applied to the sidelink PSS and the remaining single polynomials in the polynomials among the polynomials corresponding to octal 253, 271, 367, and 345 belonging to the maximum connection set 5 of Table 6 may be applied as primitive polynomials of the sidelink SSS. For example, if a polynomial corresponding to octal 253 is applied to the sidelink PSS, polynomials corresponding to 253 and 271, 253 and 367, or 253 and 345 may be applied as first and second primitive polynomials for the sidelink SSS.

[0347] For example, as shown in Equation 22 below, polynomials corresponding to octal 253 and 271 may be used as the first and second primitive polynomials for the sidelink SSS. In this case, an initialization value for the sidelink PSS primitive polynomial may be applied that is the same as the initialization value for the downlink SSS primitive polynomial. Alternatively, another single initialization value may be applied.

[0348] [Equation 22]

[0349] x 0 (i+7)=(x 0 (i+5)+x 0 (i+3)+x 0 (i+1)+x 0 (i))mod2

[0350] x 1 (i+7)=(x 1 (i+5)+x 1 (i+4)+x1 (i+3)+x 1 (i))mod2

[0351] [x 0 (6)x 0 (5)x 0 (4)x 0 (3)x 0 (2)x 0 (1)x 0 (0)] = [0 0 0 0 0 0 1]

[0352] [x 1 (6)x 1 (5)x 1 (4)x 1 (3)x 1 (2)x 1 (1)x 1 (0)] = [0 0 0 0 0 0 1]

[0353] Here, the CS value for the sidelink SSS may use part of the CS value for the downlink SSS.

[0354] That is, the first and second primitive polynomials as shown in Equation 22 or additional examples may be applied to the side link SSS, and m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111} may be used as a CS value for the sidelink SSS.

[0355] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={15,20} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0356] As an additional example, as shown in Equation 12 above, m may be used 0 ={0, 5, 10, 15}. Here, for m 0 ={0,5} can use m 1 ={0, 1, ..., 111}, for m 0 ={10,15} can use m1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs.

[0357] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 15, 20} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 336 (=4*84) SLIDs.

[0358] As another example, as shown in Equation 14, m 0 ={0, 5, 10, 15} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 336 (=4*84) SLIDs.

[0359] Examples A1, B1, C1 and C2

[0360] In this embodiment, an example is described of distinguishing the sidelink synchronization signal sequence and the NR downlink synchronization signal sequence by applying different resources of the sidelink PSS or the sidelink SSS for each type of the physical layer sidelink synchronization identifier set (e.g., id_net, id_oon).

[0361] For example, with respect to id_net, a CS value for sidelink SSS may be applied, which is different from a CS value for downlink SSS. In addition, with respect to id_oon, a CS value for sidelink PSS may be applied, which is different from a CS value for downlink PSS.

[0362] Sidelink PSS Resources (Example C1+C2-PSS)

[0363] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, with respect to id_oon, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. In addition, with respect to id_net, the CS value for the sidelink PSS may use a portion of the CS value for the downlink PSS.

[0364] For example, although the same primitive polynomial and initialization value as in Equation 8 may be applied to the sidelink PSS, the CS value for the sidelink PSS may be defined as ID(2) = 0 (i.e., in the case of id_net) then CS = 0, and if N ID (2) =1 (ie, in the case of id_oon), then CS=43+k, as represented by the following equation 23. Here, although a value of k=21 or 22 may be given, it is provided only as an example.

[0365] [Equation 23]

[0366] d PSS (n) = 1-2x(m)

[0367] m=(n+(43+k)N ID (2) )mod127

[0368] 0≤n<127

[0369] Sidelink SSS Resources (Example C1+C2-SSS)

[0370] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, with respect to id_net, a CS value for the sidelink SSS may be applied, which is different from the CS value for the downlink SSS. In addition, with respect to id_oon, a portion of the CS value for the downlink SSS may be used as the CS value for the sidelink SSS.

[0371] That is, the primitive polynomial of Equation 9 may be applied to the side link SSS, and the CS value may be applied as shown in the following example.

[0372] For example, as shown in Equation 24 below, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0,15}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 15+k}. Moreover, for m 0 ={0,0+k} can use m 1 ={0, 1, ..., 111}, for m 0 ={15, 15+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1The possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 95}) satisfying 15+k<112.

[0373] [Equation 24]

[0374]

[0375] As another example, as shown in Equation 25 below, if N ID (2) N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0,5}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k}. In addition, for m 0 ={0,0+k} can use m 1 ={0, 1, ..., 111}, and for m 0 ={5, 5+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The possible combinations of may correspond to a total of 336 (=2*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 105}) satisfying 5+k<112.

[0376] [Equation 25]

[0377]

[0378]

[0379] As another example, as shown in Equation 26 below, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0,15}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 15+k}. Moreover, for m 0={0, 0+k, 15, 15+k} can use m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 336 (=4*84) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 95}) that satisfies 15+k<112.

[0380] [Equation 26]

[0381]

[0382] As another example, as shown in Equation 27 below, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0,5}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k}. Moreover, for m 0 ={0, 0+k, 5, 5+k} can use m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 336 (=4*84) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 105}) such that 5+k<112 is satisfied.

[0383] [Equation 27]

[0384]

[0385] Examples A1 and B2

[0386] The physical layer side link synchronization identification set may be defined as two types, namely, id_net and id_oon, and each of id_net and id_oon may include 336 sequences and may be defined as follows:

[0387] id_net={0,1,...,335}

[0388] id_oon={336,337,...,671}

[0389] N ID SL ={0,1,...,671}

[0390] N ID (1) =N ID SL mod 336

[0391] N ID (2) = int(N ID SL / 336),N ID (2) ={0,1}

[0392] Examples A1, B2 and C1

[0393] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment corresponds to the embodiment C1-PSS in the above combination of the embodiments A1, B1 and C1, and further description is therefore omitted.

[0394] The primitive polynomial and initialization value for the side link SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value for the side link SSS may use part of the CS value for the downlink SSS. This embodiment corresponds to the embodiment C1-SSS in the above combination of the embodiments A1, B1, and C1, and further description is omitted. Here, an example of this embodiment regarding the CS value of the side link SSS is described.

[0395] For example, as shown in Equation 11 above, if CS for sidelink SSS is applied, m 0 ={0, 5, 15, 20, 30, 35} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0396] As an additional example, as shown in Equation 12 above, if CS for sidelink SSS is applied, m may be used. 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0397] Examples A1, B2 and C2

[0398] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, the CS value for the sidelink PSS may use part of the CS value for the downlink PSS. This embodiment corresponds to the embodiment C2-PSS in the above combination of embodiments A1, B1 and C2, and further description is therefore omitted.

[0399] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value for the sidelink SSS may be applied, which is different from the CS value for the downlink SSS. This embodiment corresponds to the embodiment C2-SSS in the above combination of the embodiments A1, B1 and C2, and further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0400] For example, as shown in Equation 15 above, m 0 ={0+k, 5+k, 15+k, 20+k, 30+k, 35+k} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 75}) satisfying 35+k<112.

[0401] As another example, as shown in Equation 16 above, m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value that satisfies 25+k<112 among multiples of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 85}).

[0402] Examples A1, B2 and C3

[0403] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS. This embodiment corresponds to the embodiment C3-PSS in the above combination of the embodiments A1, B1, and C3, and thus further description is omitted.

[0404] Although the primitive polynomial and initialization value for the sidelink SSS can use the same polynomial as the primitive polynomial and initialization value for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to the octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to the octal 203 and 221 of Table 5, respectively. This embodiment corresponds to Embodiment C3-SSS in the above combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0405] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20, 30, 35} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0406] As an additional example, as shown in Equation 12 above, m may be used 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0407] Examples A1, B2 and C4

[0408] In this embodiment, first and second primitive polynomials different from those applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials for the sidelink SSS may be used as a primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0409] For example, the primitive polynomials for the sidelink PSS and the sidelink SSS may be defined as primitive polynomials belonging to the same maximum connection set (see Table 6).

[0410] The present embodiment of selecting a primitive polynomial for a side chain PSS from the maximum connection set of Table 6 corresponds to the embodiment C4-PSS in the above combination of the embodiments A1, B1 and C4, and thus further description is omitted.

[0411] The same primitive polynomial as the primitive polynomial for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to embodiment C4-SSS in the above combination of embodiments A1, B1, and C4, so further description is omitted here. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0412] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20, 30, 35} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0413] As an additional example, as shown in Equation 12 above, m may be used 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs.

[0414] Examples A1, B2, C1 and C2

[0415] In this embodiment, an example is described of distinguishing the sidelink synchronization signal sequence and the NR downlink synchronization signal sequence by applying different resources of the sidelink PSS or the sidelink SSS for each type of the physical layer sidelink synchronization identifier set (e.g., id_net, id_oon).

[0416] For example, regarding id_net, a CS value for sidelink SSS may be applied, which is different from a CS value for downlink SSS. In addition, regarding id_oon, a CS value for sidelink PSS may be applied, which is different from a CS value for downlink PSS.

[0417] The example of the present embodiment in which id_oon applies a CS value for a sidelink PSS that is different from a CS value for a downlink PSS and in which id_net uses a portion of a CS value for a downlink PSS as a CS value for a sidelink PSS corresponds to embodiment C1+C2-PSS in the aforementioned combination of embodiments A1, B1, C1, and C2, and therefore further description is omitted.

[0418] In addition, regarding the example in which the CS value for the side link SSS is applied to id_net (which is different from the CS value for the downlink SSS) and the part of the CS value for the downlink SSS is used as the CS value for the side link SSS, regarding id_oon, it corresponds to the embodiment C1+C2-SSS in the combination of the above-mentioned embodiments A1, B1, C1 and C2, and thus further description is omitted. Here, an example of the present embodiment regarding the CS value of the side link SSS is described.

[0419] For example, as shown in Equation 24 above, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0, 15, 30}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 15+k, 30+k}. Moreover, for m 0 ={0, 0+k, 15, 15+k, 30, 30+k} can use m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 80}) that satisfies 30+k<112.

[0420] As another example, as shown in Equation 25 above, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0,5,10}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k, 10+k}. Moreover, for m 0 ={0, 0+k, 5, 5+k, 10, 10+k} can use m1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The various possible combinations of may correspond to a total of 672 (=6*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 100}) such that 10+k<112 is satisfied.

[0421] Examples A1 and B3

[0422] The physical layer side link synchronization identification set may be defined as two types, namely, id_net and id_oon, and each of id_net and id_oon may include 504 sequences and may be defined as follows:

[0423] id_net={0,1,...,503}

[0424] id_oon={504,505,...,1007}

[0425] N ID SL ={0,1,...,1007}

[0426] N ID (1) =N ID SL mod 504

[0427] N ID (2) = int(N ID SL / 504),N ID (2) ={0,1}

[0428] Examples A1, B3 and C1

[0429] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment corresponds to Embodiment C1-PSS in the above combination of Embodiments A1, B1, and C1, and further description is therefore omitted.

[0430] A primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, a CS value for the sidelink SSS may be applied, which is different from the CS value for the downlink SSS. The present embodiment is the same as the embodiment C1-SSS in the combination of the above-mentioned embodiments A1, B1, and C1 in terms of the primitive polynomial and the initialization value for the sidelink SSS, but is different therefrom in terms of the example of the CS value for the sidelink SSS. Therefore, further description related to the corresponding description is omitted, and an example of the present embodiment regarding the CS value for the sidelink SSS is described.

[0431] For example, as shown in Equation 11 above, if CS for sidelink SSS is applied, m 0 ={0, 5, 15, 20, 30, 35, 45, 50, 60, 65}. Here, for m 0 ={0, 5, 15, 20, 30, 35, 45, 50} can use m 1 ={0, 1, ..., 111}, for m 0 ={60,65} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0432] As another example, as shown in Equation 12 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45}. Here, for m 0 You can use m 1 ={0, 1, ..., 111}, for m 0 ={40, 45} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0433] As another example, as shown in Equation 13 above, m 0 ={0, 5, 15, 20, 30, 35, 45, 50, 60, 65, 75, 80} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0434] As another example, as shown in Equation 14 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0435] Examples A1, B3 and C2

[0436] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, the CS value for the sidelink PSS may use part of the CS value for the downlink PSS. This embodiment corresponds to the embodiment C2-PSS in the above combination of embodiments A1, B1 and C2, and therefore further description is omitted here.

[0437] The primitive polynomial and initialization value for the side link SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value of the side link SSS may be applied, which is different from the CS value of the downlink SSS. This embodiment corresponds to the embodiment C2-SSS in the above combination of the embodiments A1, B1 and C2, and further description is omitted. Here, an example of this embodiment regarding the CS value of the side link SSS is described.

[0438] For example, as shown in Equation 15 above, M0={0+k, 5+k, 15+k, 20+k, 30+k, 35+k, 45+k, 50+k, 60+k, 65+k} may be used. 0 ={0+k, 5+k, 15+k, 20+k, 30+k, 35+k, 45+k, 50+k} can use m 1 ={0, 1, ..., 111}, for m 0 ={60+k, 65+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs. Here, k=45 may be given. For example, k may be a value that satisfies 65+k<112 in a multiple of 5, which is greater than 40.

[0439] As another example, as shown in Equation 16 above, m 0={0+k, 5+k, 10+k, 15+k, 20+k, 25+k, 30+k, 35+k, 40+k, 45+k}. Here, for m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k, 30+k, 35+k} can use m 1 ={0, 1, ..., 111}, for m 0 ={40+k, 45+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, 60, 65}) such that 45+k<112 is satisfied.

[0440] As another example, as shown in Equation 18 above, m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k, 30+k, 35+k, 40+k, 45+k, 50+k, 55+k} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55}) that satisfies 55+k<112.

[0441] Examples A1, B3 and C3

[0442] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS. This embodiment corresponds to the embodiment C3-PSS in the above combination of the embodiments A1, B1, and C3, and thus further description is omitted.

[0443] Although the primitive polynomial and initialization value for the sidelink SSS can use the same polynomial as the primitive polynomial and initialization value for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to the octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to the octal 203 and 221 of Table 5, respectively. This embodiment corresponds to Embodiment C3-SSS in the above combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0444] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20, 30, 35, 45, 50, 60, 65}. Here, for m 0 ={0, 5, 15, 20, 30, 35, 45, 50} can use m 1 ={0, 1, ..., 111}, for m 0 ={60,65} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0445] As another example, as shown in Equation 12 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45}. Here, for m 0 ={0, 5, 10, 15, 20, 25, 30, 35} can use m 1 ={0, 1, ..., 111}, for m 0 ={40, 45} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0446] As another example, as shown in Equation 13 above, m 0 ={0, 10, 15, 20, 30, 35, 45, 50, 60, 65, 75, 80} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0447] As another example, as shown in Equation 14 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0448] Examples A1, B3 and C4

[0449] In this embodiment, the first and second primitive polynomials different from the primitive polynomials applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials used for the sidelink SSS may be used as the primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0450] For example, the primitive polynomials for the sidelink PSS and the sidelink SSS may be defined as primitive polynomials belonging to the same maximum connection set (see Table 6).

[0451] The present embodiment of selecting one of the polynomials belonging to the maximum connection set of Table 6 as the primitive polynomial for the side link PSS corresponds to the embodiment C4-PSS in the above combination of the embodiments A1, B1 and C4, and thus further description is omitted.

[0452] The same primitive polynomial as the primitive polynomial for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to embodiment C4-SSS in the above combination of embodiments A1, B1, and C4, and thus further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0453] For example, as shown in Equation 11 above, m 0 ={0, 5, 15, 20, 30, 35, 45, 50, 60, 65}. Here, for m 0 ={0, 5, 15, 20, 30, 35, 45, 50} can use m 1 ={0, 1, ..., 111}, for m0 ={60,65} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0454] As another example, as shown in Equation 12 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45}. Here, for m 0 ={0, 5, 10, 15, 20, 25, 30, 35} can use m 1 ={0, 1, ..., 111}, for m 0 ={40, 45} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs.

[0455] As another example, as shown in Equation 13 above, m 0 ={0, 10, 15, 20, 30, 35, 45, 50, 60, 65, 75, 80} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0456] As another example, as shown in Equation 14 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs.

[0457] Examples A1, B3, C1 and C2

[0458] This embodiment illustrates an example of distinguishing a sidelink synchronization signal sequence and a NR downlink synchronization signal sequence by applying different resources of a sidelink PSS or a sidelink SSS for each type of a physical layer sidelink synchronization identifier set (e.g., id_net, id_oon).

[0459] For example, regarding id_net, a CS value for sidelink SSS may be applied, which is different from a CS value for downlink SSS. In addition, regarding id_oon, a CS value for sidelink PSS may be applied, which is different from a CS value for downlink PSS.

[0460] The example of the present embodiment regarding id_oon applying a CS value for a sidelink PSS (which is different from a CS value for a downlink PSS) and regarding id_net using a portion of the CS value of a downlink PSS as a CS value for a sidelink PSS corresponds to embodiment C1+C2-PSS in the aforementioned combination of embodiments A1, B1, C1, and C2, and therefore further description is omitted.

[0461] In addition, regarding the example in which the CS value for the side link SSS is applied to id_net (which is different from the CS value for the downlink SSS) and the part of the CS value for the downlink SSS is used as the CS value for the side link SSS, regarding id_oon, it corresponds to the embodiment C1+C2-SSS in the combination of the above-mentioned embodiments A1, B1, C1 and C2, and thus further description is omitted. Here, an example of the present embodiment regarding the CS value of the side link SSS is described.

[0462] For example, as shown in Equation 24 above, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0, 15, 30, 45, 60}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 15+k, 30+k, 45+k, 60+k}. Moreover, for m 0 ={0, 0+k, 15, 15+k, 30, 30+k, 45, 45+k} can use m 1 ={0, 1, ..., 111}, and for m 0 ={60, 60+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value that satisfies 60+k<112 among multiples of 5 greater than 40 (e.g., one of k={45, 50}).

[0463] As an additional example, as shown in Equation 25 above, if NID (2) =1 (i.e., in the case of id_oon), then m 0 ={0, 5, 10, 15, 20}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k, 10+k, 15+k, 20+k}. Moreover, for m 0 ={0, 0+k, 5, 5+k, 10, 10+k, 15, 15+k} can use m 1 ={0, 1, ..., 111}, and for m 0 ={20, 20+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=8*112+2*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a multiple of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 90}) that satisfies 20+k<112.

[0464] As an additional example, as shown in Equation 27 above, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0, 5, 10, 15, 20, 25}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k}. Here, for m 0 ={0, 0+k, 5, 5+k, 10, 10+k, 15, 15+k, 20, 20+k, 25, 25+k} can use m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=12*84) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value that satisfies 25+k<112 among multiples of 5 greater than 40 (e.g., one of k={45, 50, 55, ..., 85}).

[0465] Examples A1 and B4

[0466] The physical layer side link synchronization identification set may be defined as two types, namely, id_net and id_oon, and each of id_net and id_oon may include 1008 sequences and may be defined as follows:

[0467] id_net={0,1,...,1007}

[0468] id_oon={1008,1009,...,2015}

[0469] N ID SL ={0,1,...,2015}

[0470] N ID (1) =N ID SL mod 1008

[0471] N ID (2) = int(N ID SL / 1008),N ID (2) ={0,1}

[0472] Embodiments A1, B4 and C1

[0473] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment corresponds to the embodiment C1-PSS in the above combination of the embodiments A1, B1 and C1, and further description is therefore omitted.

[0474] The primitive polynomial and initialization value for the side link SSS can be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value of the side link SSS can be applied, which is different from the CS value of the downlink SSS. The present embodiment is the same as the embodiment C1-SSS in the combination of the above-mentioned embodiments A1, B1 and C1 in terms of the primitive polynomial for the SSS side link and the initialization value of the side link SSS, but is different from it in terms of the example of the CS value for the side link SSS. Therefore, further description related to the corresponding description is omitted. And an example of the present embodiment regarding the CS value of the side link SSS is described.

[0475] For example, as shown in Equation 12 above, m 0={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 111}. Therefore, m 0 With m 1 The various possible combinations of may correspond to a total of 2016 (=18*112) SLIDs.

[0476] Examples A1, B4 and C3

[0477] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS. This embodiment corresponds to the embodiment C3-PSS in the above combination of the embodiments A1, B1, and C3, and thus further description is omitted.

[0478] Although the primitive polynomial and initialization value for the sidelink SSS can use the same polynomial as that for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to octal 203 and 221 of Table 5, respectively. This embodiment corresponds to Embodiment C3-SSS in the above combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0479] For example, as shown in Equation 12 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 111}. Therefore, m 0 With m 1 The various possible combinations of may correspond to a total of 2016 (=18*112) SLIDs.

[0480] Examples A1, B4 and C4

[0481] In this embodiment, the first and second primitive polynomials different from the primitive polynomials applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials of the sidelink SSS may be used as the primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0482] For example, the primitive polynomials for the sidelink PSS and the sidelink SSS may be defined as primitive polynomials belonging to the same maximum connection set (see Table 6).

[0483] The present embodiment of selecting one of the polynomials belonging to the maximum connection set of Table 6 as the primitive polynomial for the side chain PSS corresponds to the embodiment C4-PSS in the above combination of the embodiments A1, B1 and C4, and therefore further description is omitted.

[0484] The same primitive polynomial as that used for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to the embodiment C1-SSS in the above combination of the embodiments A1, B1, and C1, and thus further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0485] For example, as shown in Equation 12 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 111}. Therefore, m 0 With m 1 The various possible combinations of may correspond to a total of 2016 (=18*112) SLIDs.

[0486] Examples A1, B4, C1 and C2

[0487] This embodiment describes an example of using different resources of the sidelink PSS or sidelink SSS for each type of physical layer sidelink synchronization identifier set (e.g., id_net and id_oon) to distinguish between the sidelink synchronization signal sequence and the NR downlink synchronization signal sequence.

[0488] For example, with respect to id_net, a CS value for sidelink SSS may be applied, which is different from a CS value for downlink SSS. In addition, with respect to id_oon, a CS value for sidelink PSS may be applied, which is different from a CS value for downlink PSS.

[0489] The example of the present embodiment regarding id_oon applying a CS value for a sidelink PSS (which is different from a CS value for a downlink PSS) and regarding id_net using a portion of the CS value of a downlink PSS as a CS value for a sidelink PSS corresponds to embodiment C1+C2-PSS in the aforementioned combination of embodiments A1, B1, C1, and C2, and therefore further description is omitted.

[0490] In addition, regarding the example in which the CS value for the side link SSS is applied to id_net (which is different from the CS value for the downlink SSS) and the part of the CS value for the downlink SSS is used as the CS value for the side link SSS, regarding id_oon, it corresponds to the embodiment C1+C2-SSS in the combination of the above-mentioned embodiments A1, B1, C1 and C2, and thus further description is omitted. Here, an example of the present embodiment regarding the CS value of the side link SSS is described.

[0491] For example, as shown in Equation 25 above, if N ID (2) =1 (i.e., in the case of id_oon), then m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40}, and if N ID (2) = 0 (i.e., in the case of id_net), then m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k, 30+k, 35+k, 40+k}. Moreover, for m 0 ={0, 0+k, 5, 5+k, 10, 10+k, 15, 15+k, 20, 20+k, 25, 25+k, 30, 30+k, 35, 35+k, 40, 40+k}, you can use m 1 ={0, 1, ..., 111}. Therefore, m 0 With m 1 The various possible combinations of may correspond to a total of 2016 (=18*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value that satisfies 40+k<112 among multiples of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 70}).

[0492] Examples A2 and B1

[0493] The physical layer side link synchronization identifier set may be defined as three types, namely, id_net_1, id_net_2, and id_oon, and each of id_net_1, id_net_2, and id_oon may include 168 sequences and may be defined as follows:

[0494] id_net_1={0,1,...,167}

[0495] id_net_2 = {168,169,...,335}

[0496] id_oon={336,337,...,503}

[0497] N ID SL ={0,1,...,503}

[0498] N ID (1) =N ID SL mod 168

[0499] N ID (2) = int(N ID SL / 168),N ID (2) ={0,1,2}

[0500] Examples A2, B1 and C1

[0501] The primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment corresponds to Embodiment C1-PSS in the above combination of Embodiments A1, B1, and C1, and further description is therefore omitted.

[0502] As shown in Equation 10 above, if N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0 + k. If N ID (2) =1, then CS = 43 + k, and if N ID (2) =2, then CS=86+k. Here, although a value of k=21 or 22 may be given, it is provided only as an example.

[0503] The primitive polynomial and initialization value for the side link SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value for the side link SSS may use part of the CS value for the downlink SSS. This embodiment corresponds to the embodiment C1-SSS in the above combination of the embodiments A1, B1, and C1, and further description is omitted. Here, an example of this embodiment regarding the CS value of the side link SSS is described.

[0504] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25}. Here, for m 0 ={0, 5, 10} can use m 1 ={0, 1, ..., 111}, for m 0 ={15, 20, 25} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 504 (=3*112+3*56) SLIDs.

[0505] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 83}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 504 (=6*84) SLIDs.

[0506] Examples A2, B1 and C2

[0507] The primitive polynomial and initialization value for the sidelink PSS can be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, the CS value for the sidelink PSS can be applied, which is the same as the CS value for the downlink PSS. That is, if N ID (2) = 0, then the CS value can be defined as CS = 0, if N ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0508] The primitive polynomial and initialization value for the side link SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value of the side link SSS may be applied, which is different from the CS value of the downlink SSS. This embodiment corresponds to the embodiment C2-SSS in the above combination of the embodiments A1, B1 and C2, and further description is omitted. Here, an example of this embodiment regarding the CS value of the side link SSS is described.

[0509] For example, as shown in Equation 15 above, m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k}. Here, for m 0 ={0+k, 5+k, 10+k} can use m 1 ={0, 1, ..., 111}, for m 0 ={15+k, 20+k, 25+k} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The possible combinations of may correspond to a total of 504 (=3*112+3*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value satisfying 25+k<112 among multiples of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 85}).

[0510] As another example, as shown in Equation 17 above, m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k} and m 1 ={0, 1, ..., 83}. Therefore, m 0 With m 1 The possible combinations of may correspond to a total of 504 (=3*112+3*56) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value satisfying 25+k<112 among multiples of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 85}).

[0511] Examples A2, B1 and C3

[0512] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS. This embodiment is the same as the description of the sidelink PSS primitive polynomial and the initialization value in Embodiment C3-PSS in the combination of Embodiments A1, B1, and C3 above, and thus further description is omitted.

[0513] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0514] Although the primitive polynomial and initialization value for the sidelink SSS use the same polynomial as the primitive polynomial and initialization value for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to the octal 221 and 203 of Table 5, respectively (see Equation 9), then the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to the octal 203 and 221 of Table 5, respectively. The present embodiment corresponds to Embodiment C3-SSS in the above-mentioned combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of the present embodiment regarding the CS value of the sidelink SSS will be described.

[0515] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25}. Here, for m 0 ={0, 5, 10} can use m 1 ={0, 1, ..., 111}, for m 0 ={15, 20, 25} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 504 (=3*112+3*56) SLIDs.

[0516] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 83}. Therefore, m 0 With m1 The multiple possible combinations of may correspond to a total of 504 (=6*84) SLIDs.

[0517] Examples A2, B1 and C4

[0518] In this embodiment, the first and second primitive polynomials different from the primitive polynomials applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials of the sidelink SSS may be used as the primitive polynomial of the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0519] The primitive polynomial for the side link PSS can be selected from the polynomials of the maximum connection set belonging to Table 6. This embodiment is the same as the description of the side link PSS primitive polynomial and initialization value in Embodiment C4-PSS in the combination of Embodiments A1, B1 and C4 above, so further description is omitted.

[0520] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0521] The same primitive polynomial as the primitive polynomial for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to embodiment C4-SSS in the above combination of embodiments A1, B1, and C4, so further description is omitted here. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0522] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25}. Here, for m 0 ={0, 5, 10} can use m 1 ={0, 1, ..., 111}, for m 0 ={15, 20, 25} can use m 1 ={0, 1, ..., 55}. Therefore, m 0 With m 1The multiple possible combinations of may correspond to a total of 504 (=3*112+3*56) SLIDs.

[0523] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 10, 15, 20, 25} and m 1 ={0, 1, ..., 83}. Therefore, m 0 With m 1 The multiple possible combinations of may correspond to a total of 540 (=6*84) SLIDs.

[0524] Examples A2 and B2

[0525] The physical layer side link synchronization identification set may be defined as three types, namely, id_net_1, id_net_2, and id_oon, and each of id_net_1, id_net_2, and id_oon may include 336 sequences and may be defined as follows:

[0526] id_net_1={0,1,...,335}

[0527] id_net_2 = {336,337,...,503}

[0528] id_oon={504,505,...,1007}

[0529] N ID SL ={0,1,...,1007}

[0530] N ID (1) =N ID SL mod 336

[0531] N ID (2) = int(N ID SL / 336),N ID (2) ={0,1,2}

[0532] Examples A2, B2 and C1

[0533] A primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment is the same as the description of the sidelink PSS primitive polynomial and initialization value in Embodiment C1-PSS in the combination of Embodiments A1, B1, and C1 above, and therefore further description is omitted.

[0534] As shown in Equation 10 above, if N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0 + k. If N ID (2) =1, then CS = 43 + k, and if N ID (2) =2, then CS=86+k. Here, although a value of k=21 or 22 may be given, it is provided only as an example.

[0535] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as those for the downlink SSS. Here, the CS value for the sidelink SSS may be applied, which is the same as that for the downlink SSS.

[0536] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=9*112) SLIDs.

[0537] Examples A2, B2 and C2

[0538] The primitive polynomial and initialization value for the sidelink PSS can be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, the CS value for the sidelink PSS can be applied, which is the same as the CS value for the downlink PSS. That is, if N ID (2) =0, then the CS value can be defined as CS = 0. If N ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0539] The primitive polynomial and initialization value for the side link SSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink SSS. Here, the CS value of the side link SSS may be applied, which is different from the CS value of the downlink SSS. This embodiment corresponds to the embodiment C2-SSS in the above combination of the embodiments A1, B1 and C2, and further description is omitted. Here, an example of this embodiment regarding the CS value of the side link SSS is described.

[0540] For example, as shown in Equation 15 above, m 0 ={0+k, 5+k, 10+k, 15+k, 20+k, 25+k, 30+k, 35+k, 40+k} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total of 1008 (=9*112) SLIDs. Here, although a value of k=45 may be given, it is provided only as an example. For example, k may be a value that satisfies 40+k<112 among multiples of 5 greater than 40 (e.g., k=one of {45, 50, 55, ..., 70}).

[0541] Examples A2, B2 and C3

[0542] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS among the first and second primitive polynomials for the sidelink SSS. This embodiment is the same as the description of the sidelink PSS primitive polynomial and the initialization value in Embodiment C3-PSS in the combination of Embodiments A1, B1, and C3 above, and thus further description is omitted.

[0543] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0544] Although the primitive polynomial and initialization value for the sidelink SSS can use the same polynomial as the primitive polynomial and initialization value for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to the octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to the octal 203 and 221 of Table 5, respectively. This embodiment corresponds to Embodiment C3-SSS in the above combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0545] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=9*112) SLIDs.

[0546] Examples A2, B2 and C4

[0547] In this embodiment, the first and second primitive polynomials different from the primitive polynomials applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials used for the sidelink SSS may be used as the primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0548] The primitive polynomial for the side link PSS can be selected from the polynomials of the maximum connection set belonging to Table 6. This embodiment is the same as the description of the side link PSS primitive polynomial and initialization value in Embodiment C4-PSS in the combination of Embodiments A1, B1 and C4 above, so further description is omitted.

[0549] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0550] The same primitive polynomial as the primitive polynomial for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to embodiment C4-SSS in the above combination of embodiments A1, B1, and C4, so further description is omitted here. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0551] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40} and m 1 ={0, 1, ..., 111}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1008 (=9*112) SLIDs.

[0552] Implementation A2 and B3

[0553] The physical layer side link synchronization identification set may be defined as three types, namely, id_net_1, id_net_2, and id_oon, and each of id_net_1, id_net_2, and id_oon may include 504 sequences and may be defined as follows:

[0554] id_net_1={0,1,...,503}

[0555] id_net_2 = {504,505,...,1007}

[0556] id_oon={1008,1009,...,1511}

[0557] N ID SL ={0,1,...,1512}

[0558] N ID (1) =N ID SL mod 504

[0559] N ID (2) = int(N ID SL / 504),N ID (2) ={0,1,2}

[0560] Examples A2, B3 and C1

[0561] A primitive polynomial and initialization value for the sidelink PSS may be applied, which are the same as the primitive polynomial and initialization value for the downlink PSS. Here, a CS value for the sidelink PSS may be applied, which is different from the CS value for the downlink PSS. This embodiment is the same as the description of the sidelink PSS primitive polynomial and initialization value in Embodiment C1-PSS in the combination of Embodiments A1, B1, and C1 above, and therefore further description is omitted.

[0562] As shown in Equation 10 above, if N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0 + k. If N ID (2) =1, then CS = 43 + k, and if N ID (2) =2, then CS=86+k. Here, although a value of k=21 or 22 may be given, it is provided only as an example.

[0563] The primitive polynomial and initialization value for the sidelink SSS may be applied, which are the same as those for the downlink SSS. Here, the CS value for the sidelink SSS may be applied, which is the same as that for the downlink SSS.

[0564] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70}. Here, m 1 ={0, 1, ..., 111} can be used for m 0 = {0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55}, m 1 ={0, 1, ..., 55} can be used for m 0 ={60, 65, 70}. Therefore, m 0 and m 1 The possible combinations of may correspond to a total number of 1512 (=12×112+3×56) SLIDs.

[0565] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1The multiple possible combinations of may correspond to a total of 1512 (=18*84) SLIDs.

[0566] Examples A2, B3 and C3

[0567] The primitive polynomial for the sidelink PSS may use another single primitive polynomial (e.g., a polynomial corresponding to octal 203 of Table 5) that is different from the primitive polynomial applied to the downlink PSS between the first and second primitive polynomials for the sidelink SSS. This embodiment is the same as the description of the sidelink PSS primitive polynomial and the initialization value in Embodiment C3-PSS in the combination of Embodiments A1, B1, and C3 above, and thus further description is omitted.

[0568] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0569] Although the primitive polynomial and initialization value for the sidelink SSS can use the same polynomial as the primitive polynomial and initialization value for the downlink SSS, the first and second primitive polynomials can be replaced with each other. For example, if the first and second primitive polynomials applied to the downlink SSS are defined as polynomials corresponding to the octal 221 and 203 of Table 5, respectively (see Equation 9), the first and second primitive polynomials applied to the sidelink SSS can be defined as polynomials corresponding to the octal 203 and 221 of Table 5, respectively. The present embodiment corresponds to Embodiment C3-SSS in the above combination of Embodiments A1, B1 and C3, and therefore further description is omitted. Here, an example of the present embodiment regarding the CS value of the sidelink SSS will be described.

[0570] For example, as shown in Equation 11 above, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70}. Here, m 1 ={0, 1, ..., 111} can be used for m 0 = {0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55}, m 1 ={0, 1, ..., 55} can be used for m 0 ={60, 65, 70}. Therefore, m 0 and m 1The possible combinations of may correspond to a total number of 1512 (=12×112+3×56) SLIDs.

[0571] As another example, as shown in Equation 13 above, m may be used 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1512 (=18*84) SLIDs.

[0572] Examples A2, B3 and C4

[0573] In this embodiment, the first and second primitive polynomials different from the primitive polynomials applied to the downlink SSS may be applied to the sidelink SSS. In addition, one of the first and second primitive polynomials for the sidelink SSS may be used as the primitive polynomial for the sidelink PSS. Therefore, the first and second primitive polynomials for the downlink PSS and the downlink SSS and the first and second primitive polynomials for the sidelink PSS and the sidelink SSS may not overlap.

[0574] The primitive polynomial for the side link PSS can be selected from the polynomials of the maximum connection set belonging to Table 6. This embodiment is the same as the description of the side link PSS primitive polynomial and initialization value in Embodiment C4-PSS in the combination of Embodiments A1, B1 and C4 above, so further description is omitted.

[0575] If N ID (2) = 0, the CS value for the sidelink PSS can be defined as CS = 0. ID (2) =1, then CS = 43, and if N ID (2) =2, then CS=86.

[0576] The same primitive polynomial as the primitive polynomial for the sidelink PSS may be selected as the first primitive polynomial for the sidelink SSS, and one of the polynomials belonging to the same maximum connection set as the first primitive polynomial may be selected as the second primitive polynomial for the sidelink SSS. This embodiment corresponds to embodiment C4-SSS in the above combination of embodiments A1, B1, and C4, so further description is omitted here. Here, an example of this embodiment regarding the CS value of the sidelink SSS is described.

[0577] For example, as shown in Equation 11 above, m0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70}. Here, m 1 ={0, 1, ..., 111} can be used for m 0 = {0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55}, m 1 ={0, 1, ..., 55} can be used for m 0 ={60, 65, 70}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1512 (=12×112+3×56) SLIDs.

[0578] As another example, as shown in Equation 13, m 0 ={0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85} and m 1 ={0, 1, ..., 83}. Therefore, m 0 and m 1 The multiple possible combinations of may correspond to a total of 1512 (=18*84) SLIDs.

[0579] Fig.12 is a diagram showing a configuration of a first terminal device according to the present disclosure.

[0580] refer to Fig.12 , the first terminal device 1200 may include a processor 1210 , an antenna device 1220 , a transceiver 1230 , and a memory 1240 .

[0581] The processor 1210 may perform baseband-related signal processing and may include an upper layer processing 1211 and a physical (PHY) layer processing 1215. The upper layer processing 1211 may process the operation of a media access control (MAC) layer, a radio resource control (RRC) layer, or more upper layers. The PHY layer processing 1215 may process the operation of the PHY layer (e.g., downlink (DL) received signal processing, uplink (UL) transmission signal processing, sidelink (SL) transmission signal processing, etc.). In addition to performing baseband-related signal processing, the processor 1210 may also control the overall operation of the first terminal device 1200.

[0582] The antenna device 1220 may include at least one physical antenna. If the antenna device 1220 includes multiple antennas, multiple input multiple output (MIMO) transmission and reception may be supported. The transceiver 1230 may include a radio frequency (RF) transmitter and an RF receiver. The memory 1240 may store operation processing information of the processor 1210 and software, an operating system (OS), applications, etc. associated with the operation of the first terminal device 1200, and may include components such as a buffer.

[0583] The processor 1210 of the first terminal device 1200 can be used to implement the operations of the first UE or SL transmitting UE in the embodiments described in this document.

[0584] For example, the upper layer processing 1211 of the processor 1210 of the first terminal device 1200 may receive settings and parameters regarding the side link synchronization signal from the base station and may forward it to the PHY layer processing 1215 .

[0585] The PHY layer processing 1215 may include a side link synchronization signal sequence generator 1216 and an SS block generator 1217 .

[0586] The side link synchronization signal sequence generator 1216 may be based on the side link identifier (SLID) or N ID SL To determine N ID (1) and N ID (2) The value of .

[0587] Here, various examples of the present disclosure may include a method in which two types (e.g., Fig. 9 id_net and id_oon in the example of , or where three types are used (for example, Fig. 9 In the example of id_net_1, id_net_2 and id_oon) to configure the physical layer side link synchronization identifier set.

[0588] In addition, various examples of the present disclosure may include a physical layer side link synchronization identifier set (eg, Fig. 9 The example of each of id_net and id_oon, or each of id_net_1, id_net_2 and id_oon) includes a case where each type of the identification set includes 168 sequences, a case where each type of the identification set includes 336 sequences, a case where each type of the identification set includes 504 sequences, or a case where each type of the identification set includes 1008 sequences.

[0589] As described above, the N corresponding to the SLID value may be determined based on the number of types of physical layer side link synchronization identification sets and the number of synchronization signal sequences included in each type of identification set. ID (1) and N ID (2) The value of .

[0590] The side link synchronization signal sequence generator 1216 may generate an NR primary side link synchronization signal (NR-PSSS) sequence by applying a first initialization value to a first primitive polynomial. ID (2) The value of determines the cyclic shift (CS) value to be applied to the generated NR-PSSS sequence, and the CS can be applied to the NR-PSSS.

[0591] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a first primitive polynomial for generating the NR-PSSS sequence (which is different from the first primitive polynomial applied to the NR downlink synchronization signal sequence).

[0592] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a CS value for the NR-PSSS that is different from the CS value applied to the NR downlink synchronization signal sequence.

[0593] The sidelink synchronization signal sequence generator 1216 can generate a first NR secondary sidelink synchronization signal (NR-SSSS) sequence by applying a second initialization value to the first primitive polynomial, and can generate a second NR-SSSS sequence by applying a second initialization value to the second primitive polynomial.

[0594] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of the first and second primitive polynomials for generating the NR-SSSS sequence (which is different from at least one of the first and second primitive polynomials applied to the NR downlink synchronization signal sequence).

[0595] The side link synchronization signal sequence generator 1216 may be based on N ID (1) and N ID (2) , determine the CS value to be applied to the first NR-SSSS sequence, and apply the CS to the first NR-SSSS. In addition, the transmitting UE may ID (1) and N ID(2) The value of , determines the CS value to be applied to the generated second NR-SSSS sequence, and the CS can be applied to the second NR-SSSS sequence.

[0596] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of a CS value for a first NR-SSSS sequence and a CS value for a second NR-SSSS sequence (which is different from the CS value applied to the NR downlink synchronization signal sequence).

[0597] The side link synchronization signal sequence generator 1216 can generate NR-PSSS modulation symbols by performing BPSK modulation on the NR-PSSS sequence to which CS is applied. In addition, the transmitting UE 7 can generate NR-PSS modulation symbols by multiplying the BPSK modulation result of the first NR-SSSS sequence to which CS is applied by the BPSK modulation result of the second NR-SSSS sequence to which CS is applied.

[0598] The SS block generator 1217 may map the NR-PSSS modulation symbols to consecutive subcarriers on a frequency in a single symbol within a single SS block, and may map the NR-SSSS modulation symbols to consecutive subcarriers on a frequency in another symbol within a single SS block. The PHY layer processing 1215 may generate and transmit a sidelink synchronization signal based on the modulation symbols mapped on the time-frequency resources.

[0599] Fig.13 is a diagram showing a configuration of a second terminal device according to the present disclosure.

[0600] refer to Fig.13 , the second terminal device 1300 may include a processor 1310 , an antenna device 1320 , a transceiver 1330 , and a memory 1340 .

[0601] The processor 1310 may perform baseband-related signal processing and may include an upper layer processing 1311 and a PHY layer processing 1315. The upper layer processing 1311 may process the operation of the MAC layer, the RRC layer, or more upper layers. The PHY layer processing 1315 may process the operation of the PHY layer (e.g., DL received signal processing, UL transmission signal processing, SL received signal processing, etc.). In addition to performing baseband-related signal processing, the processor 1310 may also control the overall operation of the second terminal device 1300.

[0602] The antenna device 1320 may include at least one physical antenna. If the antenna device 1320 includes multiple antennas, MIMO transmission and reception may be supported. The transceiver 1330 may include an RF transmitter and an RF receiver. The memory 1340 may store operation processing information, software, OS, applications, etc. of the processor 1310 associated with the operation of the second terminal device 1300, and may include components such as a buffer.

[0603] The processor 1310 of the second terminal device 1300 may be configured to implement operations of the second UE or SL receiving UE in the embodiments described herein.

[0604] The upper layer processing 1311 of the processor 1310 of the second terminal device 1300 can receive settings and parameters about the side link synchronization signal from the base station and can forward it to the PHY layer processing 1315.

[0605] The PHY layer processing 1315 may include SS block processing 1316 and side link synchronization signal sequence processing 1317 .

[0606] The SS block processing 1316 may receive an SS block from the first terminal device 1200. The SS block processing 1316 may detect an NR-PSSS modulation symbol mapped to consecutive subcarriers on frequency from a single symbol within a single SS block, and may detect an NR-SSSS modulation symbol mapped to consecutive subcarriers on frequency from another symbol within a single SS block.

[0607] The sidelink synchronization signal sequence processing 1317 may determine the NR-PSSS sequence to which the CS is applied from the detected NR-PSSS modulation symbol. In addition, the sidelink synchronization signal sequence processing 1317 may determine the first NR-SSSS sequence to which the CS is applied and the second NR-SSSS sequence to which the CS is applied from the detected NR-SSSS modulation symbol.

[0608] The sidelink synchronization signal sequence processing 1317 may calculate N based on the first primitive polynomial and CS value applied to the determined NR-PSSS sequence. ID (2) The value of .

[0609] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a first primitive polynomial for generating the NR-PSSS sequence (which is different from the first primitive polynomial applied to the NR downlink synchronization signal sequence).

[0610] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying a CS value for the NR-PSSS (which is different from the CS value applied to the NR downlink synchronization signal sequence).

[0611] The sidelink synchronization signal sequence processing 1317 may know in advance the first primitive polynomial and the candidate CS value that can be used to generate the NR-PSSS sequence, and thus may verify the CS value applied to the corresponding NR-PSSS from the determined NR-PSSS sequence, and may calculate N according to the verified CS value. ID (2) The value of .

[0612] The sidelink synchronization signal sequence processing 1317 may calculate N from the CS value applied to the determined first NR-SSSS sequence and the CS value applied to the second NR-SSSS sequence. ID (1) The value of .

[0613] Here, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of the first and second primitive polynomials for generating the NR-SSSS sequence (which is different from at least one of the first and second primitive polynomials applied to the NR downlink synchronization signal sequence).

[0614] In addition, in various examples of the present disclosure, the NR sidelink synchronization signal sequence can be distinguished from the NR downlink synchronization signal sequence by applying at least one of a CS value for a first NR-SSSS sequence and a CS value for a second NR-SSSS sequence (which is different from the CS value applied to the NR downlink synchronization signal sequence).

[0615] The side link synchronization signal sequence processing 1317 may know in advance the first primitive polynomial and the second primitive polynomial and the candidate CS values ​​that may be applied to generate the first NR-SSSS sequence and the second NR-SSSS sequence, and thus may verify the CS value applied to each NR-PSSS from each of the first NR-SSSS sequence and the second NR-SSSS sequence, and may obtain the CS value from the verified CS value and N ID (2) Calculate the value of N ID (1) The value of .

[0616] The side link synchronization signal sequence processing 1317 can be obtained from the calculated N ID (1) and N ID (2) The value of SLID (or N IDSL ).

[0617] Here, various examples of the present disclosure may include a method in which two types (e.g., Fig. 9 id_net and id_oon in the example of , or where three types are used (for example, Fig. 9 In the example of id_net_1, id_net_2 and id_oon) to configure the physical layer side link synchronization identifier set.

[0618] In addition, various examples of the present disclosure may include a physical layer side link synchronization identifier set (eg, Fig. 9 The example of each of id_net and id_oon, or each of id_net_1, id_net_2 and id_oon) includes a case where each type of the identification set includes 168 sequences, a case where each type of the identification set includes 336 sequences, a case where each type of the identification set includes 504 sequences, or a case where each type of the identification set includes 1008 sequences.

[0619] The side link synchronization signal sequence processing 1317 can know in advance the number of types of physical layer side link synchronization identification sets and the number of synchronization signal sequences included in each type of the identification set, and thus can determine the number of synchronization signal sequences corresponding to N. ID (1) and N ID (2) The SLID value corresponding to the value.

[0620] The foregoing description made in the foregoing examples of the present disclosure may be similarly applied to operations of the first terminal device 1200 and the second terminal device 1300 , and thus further description is omitted.

[0621] In the above-mentioned example method, the process is described as a series of operations based on the flow chart, and the aspects of the present disclosure are not limited to the order or sequence shown. Certain operations can be processed in different orders, or can be performed substantially simultaneously. In addition, it will be understood that the operations shown in the flow chart do not necessarily exclude other operations, other operations can be included and one or more operations can be omitted without departing from the meaning and scope of the present disclosure.

[0622] The various embodiments of the present disclosure are not all possible combinations, but are used to explain the representative aspects of the present disclosure. Therefore, it is obvious that the descriptions made in the various embodiments can be applied independently or in combination of at least two thereof.

[0623] Moreover, various embodiments of the present disclosure may be implemented by hardware, firmware, software, or a combination thereof. In the case of hardware implementation, the embodiments may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), general purpose processors, controllers, microcontrollers, microprocessors, etc.

[0624] The scope of the present disclosure includes software or machine-executable instructions (e.g., OS, applications, firmware, programs, etc.) so that the operations of the methods of various embodiments can be performed on a device or computer and a non-transitory computer-readable medium storing such software or instructions so as to be executable on a device or computer.

[0625] Industrial Applicability

[0626] Aspects of the present disclosure may be applied to various systems.

Claims

1. A wireless user equipment, comprising: processor; as well as a memory storing instructions that, when executed by the processor, cause the wireless user device to: determining a first side link identifier (SLID) parameter and a second SLID parameter; Determining a first parameter associated with a sidelink primary synchronization signal is based on: The second parameter; Offset value; as well as a multiple of the second SLID parameter; determining, based on the first parameter, a sequence for the sidelink primary synchronization signal; as well as At least one sidelink synchronization signal is transmitted to a second wireless user equipment, the sidelink synchronization signal comprising the sidelink primary synchronization signal and comprising a sidelink secondary synchronization signal.

2. The wireless user device of claim 1, wherein the instructions, when executed by the processor, cause the wireless user device to determine the first parameter based on a sum of the second parameter, the offset value, and the multiple of the second SLID parameter.

3. The wireless user equipment of claim 1 , wherein the second parameter is an integer n, where 0≤n<N, and N is a preconfigured integer corresponding to the length of the sequence for the sidelink primary synchronization signal, and wherein the instructions, when executed by the processor, cause the wireless user device to determine the first parameter based on a modulo operation by using: a sum of the second parameter, the offset value, and the multiple of the second SLID parameter; and N。 4. The wireless user equipment according to claim 1, wherein the second SLID parameter comprises: a first value indicating that the wireless user equipment is synchronized with a base station; or a second value indicating that the wireless user equipment is not synchronized with a base station.

5. The wireless user equipment according to claim 1, wherein the sequence comprises d PSS (n), where k is the offset value, p is an integer value, and is the second SLID parameter, and is the multiple of the second SLID parameter, wherein 0≤n<N, and N is a preconfigured integer.

6. The wireless user equipment of claim 5, wherein p is equal to 43, wherein k is equal to 21 or 22, and wherein N is 127.

7. The wireless user equipment according to claim 1, wherein the multiple of the second SLID parameter is and for the second SLID parameter, and where k is the offset value, and or in for The lower limit of yes upper limit.

8. The wireless user equipment according to claim 1, wherein the multiple of the second SLID parameter is and for the second SLID parameter, and Where k is the offset value and is one of the integer values ​​closest to half of p.

9. The wireless user equipment of claim 1, wherein the first SLID parameter is selected from a first set {0, 1, 2, ..., 333, 334, 335}, and wherein the second SLID parameter is selected from a second set {0, 1}.

10. The wireless user device of claim 1, wherein the instructions, when executed by the processor, cause the wireless user device to: generating the sidelink primary synchronization signal based on the sequence for the sidelink primary synchronization signal; and The sidelink secondary synchronization signal is generated based on the first SLID parameter and the second SLID parameter.

11. The wireless user device of claim 1 , wherein the instructions, when executed by the processor, cause the wireless user device to: receiving at least one downlink synchronization signal block from a base station, the downlink synchronization signal block comprising a primary synchronization signal (PSS) and a secondary synchronization signal (SSS), and The first SLID parameter and the second SLID parameter are associated with the SLID of the wireless user equipment used for side link communication between wireless user equipments.

12. The wireless user device of claim 1 , wherein the instructions, when executed by the processor, cause the wireless user device to: A sequence for the sidelink secondary synchronization signal is determined based on: a first value associated with the first SLID parameter and associated with the second SLID parameter; and a second value associated with the first SLID parameter, and The first SLID parameter and the second SLID parameter are associated with the SLID of the wireless user equipment used for side link communication between wireless user equipments.

13. A wireless user equipment, comprising: processor; as well as a memory storing instructions that, when executed by the processor, cause the wireless user device to: receiving a sidelink primary synchronization signal and a sidelink secondary synchronization signal, wherein the sidelink secondary synchronization signal is associated with a sidelink identifier (SLID), the SLID comprising a first SLID parameter and a second SLID parameter; The second SLID parameter is determined based on the sidelink primary synchronization signal, wherein a sequence for the sidelink primary synchronization signal is associated with a first parameter, the first parameter being based on: The second parameter; Offset value; as well as a multiple of the second SLID parameter; and The first SLID parameter is determined based on the second SLID parameter and based on the sidelink secondary synchronization signal.

14. The wireless user device of claim 13, wherein the instructions, when executed by the processor, cause the wireless user device to: Based on the first parameter, determining a sequence for a second sidelink primary synchronization signal; and The second sidelink primary synchronization signal is transmitted to a second wireless user equipment.

15. The wireless user equipment according to claim 14, wherein: The instructions, when executed by the processor, cause the wireless user device to: generating a second sidelink secondary synchronization signal based on the first SLID parameter and the second SLID parameter; and The second sidelink secondary synchronization signal is sent to the second wireless user equipment.

16. The wireless user equipment of claim 13, wherein the instructions, when executed by the processor, cause the wireless user equipment to: determine the first parameter based on a sum of the second parameter, the offset value, and the multiple of the second SLID parameter.

17. The wireless user equipment of claim 13, wherein the second parameter is an integer n, where 0≤n<N, and N is a preconfigured integer corresponding to the length of the sequence for the sidelink primary synchronization signal, and wherein the instructions, when executed by the processor, cause the wireless user device to determine the first parameter based on a modulo operation by using: a sum of the second parameter, the offset value, and the multiple of the second SLID parameter; and N。 18. The wireless user equipment of claim 13, wherein the second SLID parameter comprises: a first value indicating that the wireless user equipment is synchronized with a base station; or a second value indicating that the wireless user equipment is not synchronized with a base station.

19. The wireless user device of claim 13, wherein the instructions, when executed by the processor, cause the wireless user device to: Determine the sequence, wherein The sequence includes d PSS (n), where d pss (n) = 1-2x(m), k is an offset value, p is an integer value, and is the second SLID parameter, and is the multiple of the second SLID parameter, wherein 0≤n<N, and N is a preconfigured integer.

20. The wireless user equipment of claim 19, wherein p is equal to 43, wherein k is equal to 21 or 22, and wherein N is 127.

21. The wireless user equipment according to claim 13, wherein the multiple of the second SLID parameter is in for the second SLID parameter, and where k is the offset value, and or in for The lower limit of yes upper limit.

22. The wireless user equipment according to claim 13, wherein the multiple of the second SLID parameter is in for the second SLID parameter, and Where k is the offset value and is one of the integer values ​​closest to half of p.

23. The wireless user equipment of claim 13, wherein the first SLID parameter is selected from a first set {0, 1, 2, ..., 333, 334, 335}, and wherein, The second SLID parameter is selected from a second set {0, 1}.

Images