Method and apparatus for synchronization signal design
A method of a base station (BS) for transmitting synchronization signals in a wireless communication system. The method comprises generating a primary synchronization signal (PSS) including one of multiple PSS sequences that is generated based on a M-sequence of length 127 in a frequency domain, wherein the PSS indicates part of cell identification (ID) information using a cyclic shift performed on the M-sequence generating the PSS; generating a secondary synchronization signal (SSS) including one of multiple SSS sequences that is generated based on multiple BPSK modulated M-sequences of length 127 in the frequency domain, wherein the SSS indicates the cell ID information using cyclic shifts performed on the M-sequences generating the SSS; and transmitting, to a user equipment (UE), the PSS and SSS over downlink channels.
1. A base station (BS) for transmitting synchronization signals in a wireless communication system, the BS comprising:
at least one processor configured to:
generate a primary synchronization signal (PSS) including one of multiple PSS sequences that is generated based on a M-sequence of length 127 in a frequency domain, wherein the PSS indicates part of cell identification (ID) information using a cyclic shift performed on the M-sequence generating the PSS; and
generate a secondary synchronization signal (SSS) including one of multiple SSS sequences that is generated based on multiple M-sequences of length 127 in the frequency domain, wherein the SSS indicates the cell ID information using cyclic shifts performed on the multiple M-sequences generating the SSS; and
a transceiver configured to transmit, to a user equipment (UE), the PSS and the SSS over downlink channels.
2. The BS of claim 1 , wherein the at least one processor is further configured to:
determine a number of PSS sequences corresponding to the cell ID information carried by the PSS; and
determine a number of SSS sequences corresponding to the cell ID information carried by the PSS and the SSS.
3. The BS of claim 1 , wherein the at least one processor is further configured to:
determine a polynomial for the M-sequence generating the PSS; and
determine the cyclic shift for the M-sequence generating the PSS based on the cell ID information carried by PSS; and
generate the PSS by performing the cyclic shift to the M-sequence and a binary phase shift keying (BPSK) modulation.
4. The BS of claim 3 , wherein the polynomial for the M-sequence generating the PSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the M-sequence generating the PSS.
5. The BS of claim 1 , wherein the at least one processor is further configured to:
determine a polynomial for a first M-sequence generating the SSS;
determine a first cyclic shift for the first M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generate a first component of the SSS by performing the first cyclic shift to the first M-sequence generating the SSS and a binary phase shift keying (BPSK) modulation;
determine a polynomial for a second M-sequence generating the SSS;
determine a second cyclic shift for the second M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generate a second component of the SSS by performing the second cyclic shift to the second M-sequence generating the SSS and the BPSK modulation; and
generate the SSS by performing a product of the first and second components of the SSS.
6. The BS of claim 5 , wherein the polynomial for the first M-sequence generating the SSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the first M-sequence generating the SSS.
7. The BS of claim 5 , wherein the polynomial for the second M-sequence generating the SSS is given by x 7 +x+1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+1)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the second M-sequence generating the SSS.
8. A method of a base station (BS) for transmitting synchronization signals in a wireless communication system, the method comprising:
generating a primary synchronization signal (PSS) including one of multiple PSS sequences that is generated based on a M-sequence of length 127 in a frequency domain, wherein the PSS indicates part of cell identification (ID) information using a cyclic shift performed on the M-sequence generating the PSS; and
generating a secondary synchronization signal (SSS) including one of multiple SSS sequences that is generated based on multiple M-sequences of length 127 in the frequency domain, wherein the SSS indicates the cell ID information using cyclic shifts performed on the multiple M-sequences generating the SSS; and
transmitting, to a user equipment (UE), the PSS and the SSS over downlink channels.
9. The method of claim 8 , further comprising:
determining a number of PSS sequences corresponding to the cell ID information carried by the PSS; and
determining a number of SSS sequences corresponding to the cell ID information carried by the PSS and the SSS.
10. The method of claim 8 , further comprising:
determining a polynomial for the M-sequence generating the PSS; and
determining the cyclic shift for the M-sequence generating the PSS based on the cell ID information carried by PSS; and
generating the PSS by performing the cyclic shift to the M-sequence and a binary phase shift keying (BPSK) modulation.
11. The method of claim 10 , wherein the polynomial for the M-sequence generating the PSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the M-sequence generating the PSS.
12. The method of claim 8 , further comprising:
determining a polynomial for a first M-sequence generating the SSS;
determining a first cyclic shift for the first M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generating a first component of the SSS by performing the first cyclic shift to the first M-sequence generating the SSS and a binary phase shift keying (BPSK) modulation;
determining a polynomial for a second M-sequence generating the SSS;
determining a second cyclic shift for the second M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generating a second component of the SSS by performing the second cyclic shift to the second M-sequence generating the SSS and the BPSK modulation; and
generating the SSS by performing a product of the first and second components of the SSS.
13. The method of claim 12 , wherein the polynomial for the first M-sequence generating the SSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the first M-sequence generating the SSS.
14. The method of claim 12 , wherein the polynomial for the second M-sequence generating the SSS is given by x 7 +x+1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+1)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the second M-sequence generating the SSS.
15. A user equipment (UE) for transmitting synchronization signals in a wireless communication system, the UE comprising:
a transceiver configured to receive and detect, from a base station (BS), a primary synchronization signal (PSS) and a secondary synchronization signal (SSS) over downlink channels; and
at least one processor configured to:
determine the PSS including one of multiple PSS sequences that is generated based on a M-sequence of length 127 in a frequency domain, wherein the PSS indicates part of cell identification (ID) information using a cyclic shift performed on the M-sequence generating the PSS; and
determine the SSS including one of multiple SSS sequences that is generated based on multiple M-sequences of length 127 in the frequency domain, wherein the SSS indicates the cell ID information using cyclic shifts performed on the multiple M-sequences generating the SSS.
16. The UE of claim 15 , wherein the at least one processor is further configured to:
determine a number of PSS sequences corresponding to the cell ID information carried by the PSS; and
determine a number of SSS sequences corresponding to the cell ID information carried by the PSS and the SSS.
17. The UE of claim 15 , wherein the at least one processor is further configured to:
determine a polynomial for the M-sequence generating the PSS; and
determine the cyclic shift for the M-sequence generating the PSS based on the cell ID information carried by PSS; and
generate the PSS by performing the cyclic shift to the M-sequence and a binary phase shift keying (BPSK) modulation.
18. The UE of claim 17 , wherein the polynomial for the M-sequence generating the PSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the M-sequence generating the PSS.
19. The UE of claim 15 , wherein the at least one processor is further configured to:
determine a polynomial for a first M-sequence generating the SSS;
determine a first cyclic shift for the first M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generate a first component of the SSS by performing the first cyclic shift to the first M-sequence generating the SSS and a binary phase shift keying (BPSK) modulation;
determine a polynomial for a second M-sequence generating the SSS;
determine a second cyclic shift for the second M-sequence generating the SSS based on the cell ID information carried by the PSS and the SSS;
generate a second component of the SSS by performing the second cyclic shift to the second M-sequence generating the SSS and the BPSK modulation; and
generate the SSS by performing a product of the first and second components of the SSS.
20. The UE of claim 19 , wherein:
the polynomial for the first M-sequence generating the SSS is given by x 7 +x 4 +1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+4)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the first M-sequence generating the SSS; and
the polynomial for the second M-sequence generating the SSS is given by x 7 +x+1 that is equivalent to a recursive construction scheme given by d M (i+7)=[d M (i+1)+d M (i)] mod 2, 0≤i≤119, wherein d M (·) is the second M-sequence generating the SSS.