Method and apparatus for secondary synchronization in internet of things

Abstract

A method and an apparatus for secondary synchronization in the Internet of things. The receiving apparatus extracts a frequency domain sample by applying channel estimation to a time domain sample of the secondary synchronization signal. Further, the receiving apparatus estimates a physical cell ID (PCI) and 80 ms frame timing (FT) based on decorrelation between a frequency domain standard signal of the secondary synchronization signal and the frequency domain sample.

Claims

1. A method for acquiring, by a receiving apparatus, synchronization in the Internet of things based on a secondary synchronization signal received from a transmitting apparatus, the method comprising: extracting a frequency domain sample by applying channel estimation to a time domain sample of the secondary synchronization signal; and estimating a physical cell ID (PCI) and frame timing (FT) based on decorrelation between a frequency domain standard signal of the secondary synchronization signal and the frequency domain sample, wherein the extracting includes: removing a cyclic prefix (CP) from the time domain sample; down-sampling a sample from which the CP is removed; and performing fast Fourier transform (FFT) on the down-sampled sample, wherein the estimating includes: calculating a first value by performing decorrelation between Fourier series (FS) sequences included in the frequency domain standard signal and the frequency domain sample; calculating a second value by performing decorrelation between a Zadoff Chu (ZC) sequence included in the frequency domain standard signal and the first value; calculating a third value by performing decorrelation between a scrambling sequence included in the frequency domain standard signal and the second value; and estimating the PCI and the FT using the first value, the second value, and the third value.

2. The method of claim 1, wherein the estimating further includes calculating a fourth value by performing a cyclic shift (CS) combining on the third value.

3. The method of claim 2, wherein the estimating of the PCI and the FT includes estimating the PCI and the FT using the first to fourth values.

4. The method of claim 2, wherein after the calculating of the first value, the calculating of the second value, the calculating of the third value, and the calculating of the fourth value are repeatedly performed by the accumulated number of times, the estimating of the PCI and the FT is performed.

5. The method of claim 1, wherein: the first value is calculated only by sign conversion instead of a multiplication operation, and the third value is calculated only by the sign conversion instead of the multiplication operation.

6. The method of claim 1, wherein the FT is 80 ms FT.

7. A method for acquiring, by a terminal, synchronization in the Internet of things based on a secondary synchronization signal received from a base station, the method comprising: extracting a frequency domain sample from a time domain sample of the secondary synchronization signal, wherein the extracting includes: removing a cyclic prefix (CP) from the time domain sample; down-sampling a sample from which the CP is removed; and performing fast Fourier transform (FFT) on the down-sampled sample; and estimating a physical cell ID (PCI) and 80 ms frame timing (FT) based on decorrelation between a sequence included in a frequency domain standard signal of the secondary synchronization signal and the frequency domain sample, wherein the estimating includes: calculating a first value by performing decorrelation between Fourier series (FS) sequences included in the frequency domain standard signal and the frequency domain sample; calculating a second value by performing decorrelation between a Zadoff Chu (ZC) sequence included in the frequency domain standard signal and the first value; calculating a third value by performing decorrelation between a scrambling sequence included in the frequency domain standard signal and the second value; calculating a fourth value by performing cyclic shift (CS) combining on the third value; and estimating the PCI and the FT by using the first to fourth values.

8. The method of claim 7, wherein after the calculating of the first value, the calculating of the second value, the calculating of the third value, and the calculating of the fourth value are repeatedly performed by the accumulated number of times, the estimating of the PCI and the FT is performed.

9. The method of claim 7, wherein: the first value is calculated only by an addition calculation instead of a multiplication operation, and the third value is calculated only by an addition calculation instead of the multiplication operation.

10. A receiving apparatus comprising: an analog-digital converter sampling a secondary synchronization signal received from a transmitting apparatus into a digital signal to generate a first sampling signal: a filter unit filtering the first sampling signal; and a synchronization detector extracting a frequency domain sample by performing channel estimation on the filtered first sampling signal and estimating a physical cell ID (PCI) and 80 ms frame timing (FT) based on decorrelation between a frequency domain standard signal of the secondary synchronization signal and the frequency domain sample, wherein the synchronization detector: removes a cyclic prefix (CP) from the first sampling signal; down-samples a sample from which the CP is removed; and performs fast Fourier transform (FFT) on the down-sampled sample to extract the frequency domain sample, wherein the synchronization detector: calculates a first value by performing decorrelation between Fourier series (FS) sequences included in the frequency domain standard signal and the frequency domain sample, calculates a second value by performing decorrelation between a Zadoff Chu (ZC) sequence included in the frequency domain standard signal and the first value, calculates a third value by performing decorrelation between a scrambling sequence included in the frequency domain standard signal and the second value, and a fourth value by performing cyclic shift (CS) combining on the third value, and estimates the PCI and the FT by using the first to fourth values.

11. The receiving apparatus of claim 10, wherein the synchronization detector repeatedly calculates the first to fourth values by a predetermined accumulated number of times and then estimates the PCI and the FT.

12. The receiving apparatus of claim 10, wherein the first value is calculated only by an addition calculation instead of a multiplication operation and the third value is calculated only by an addition calculation instead of the multiplication operation.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) FIG. 1 is a flow chart illustrating a method for generating an NSSS signal in a standalone operating mode according to an exemplary embodiment of the present invention.

(2) FIG. 2 is a flow chart illustrating a method for generating an NSSS signal in an in-band operating mode according to an exemplary embodiment of the present invention.

(3) FIG. 3 is a block diagram illustrating a receiving apparatus according to an exemplary embodiment of the present invention.

(4) FIG. 4 is a block diagram illustrating a synchronization detector according to an exemplary embodiment of the present invention.

(5) FIG. 5 is a block diagram illustrating a first processor according to an exemplary embodiment of the present invention.

(6) FIG. 6 is a diagram illustrating a process of processing FFT according to the exemplary embodiment of the present invention.

(7) FIG. 7 is a block diagram illustrating a second processor according to an exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

(8) In the following detailed description, only certain exemplary embodiments of the present invention have been shown and described, simply by way of illustration. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. Accordingly, the drawings and description are to be regarded as illustrative in nature and not restrictive. Like reference numerals designate like elements throughout the specification.

(9) Throughout the specification, a receiving apparatus may refer to a terminal, a mobile terminal (MT), a mobile station (MS), an advanced mobile station (AMS), a high reliability mobile station (HR-MS), a subscriber station (SS), a portable subscriber station (PSS), an access terminal (AT), user equipment (UE), and the like and may include all or some of functions of the terminal, the MT, the AMS, the HR-MS, the SS, the PSS, the AT, the UE, and the like

(10) Further, a transmitting apparatus may refer to a base station (BS), an advanced base station (ABS), a high reliability base station (HR-BS), a nodeB, an evolved node B (eNodeB), an access point (AP), a radio access station (RAS), a base transceiver station (BTS), a mobile multihop relay (MMR)-BS, a relay station (RS) serving as a base station, a high reliability relay station (HR-RS) serving as a base station, and the like and may also include all or some of functions of the BS, the ABS, the nodeB, the eNodeB, the AP, the RAS, the BTS, the MMR-BS, the RS, the HR-RS, and the like.

(11) First, a method for generating a narrowband secondary synchronization signal (NSSS) frequency domain signal according to an exemplary embodiment of the present invention will be described.

(12) The NSSS frequency domain signal (s.sub.u,q,p(n)) may be configured of a combination of a cyclically-extended length-132 Zadoff Chu (ZC) sequence (DeletedTexts), a cyclically-extended length-132 binary Hadamard sequence (DeletedTexts), and a Fourier series (FS) sequence (DeletedTexts). That is, the NSSS frequency domain signal may be defined as the following Equation 1.
s.sub.u,q,p(n)=.sub.u(n)b.sub.q(n).sub.p(n),n=0,1, . . . ,131Equation 1

(13) In the above Equation 1, a cyclic shift index p is applied to the NSSS signal located in a last subframe of a (8 k+2p)-th frame, where 0k127. In addition, the ZC sequence (.sub.u(n)) may be defined as the following Equation 2.

(14) $\begin{array}{cc}{}_u\left(n\right)=\exp \left(\frac{-ju\mathrm{mod}\left(n,131\right)\left(\mathrm{mod}\left(n,131\right)+1\right)}{131}\right),u=3,4,\mathrm{.Math.},128& \mathrm{Equation}2\end{array}$
In addition, a scrambling sequence (b.sub.q(n)) may be defined as the following Equation 3.
b.sub.q(n)=Hadamard.sub.s.sub.q.sup.128128(mod(n,128)),q=0,1,2,3Equation 3

(15) In the above Equation 3, s.sub.0=0, s.sub.1=31, s.sub.2=63, s.sub.0=127. Accordingly, b.sub.q(n) is as the following Table 1.

(16) TABLE-US-00001 q b.sub.q(0) . . . b.sub.q(127) 0 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1] 1 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1] 2 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1] 3 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1].

(17) In addition, the FS sequence (.sub.p(n)) may be defined as the following Equation 4.

(18) $\begin{array}{cc}{}_p\left(n\right)=\exp \left(\frac{-j2l_{p}n}{132}\right),p=0,1,2,3& \mathrm{Equation}4\end{array}$
In the above Equation 4, l.sub.0=0, l.sub.1=33, l.sub.2=66, l.sub.3=99. Accordingly, .sub.p(n) is as the following Table 2.

(19) TABLE-US-00002 TABLE 2 p p.sub.y(0) . . . p.sub.y(131) 0 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1] 1 [1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1j 1 j 1j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j] 2 [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1] 3 [1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j 1 j]

(20) Meanwhile, a mapping function of mapping the physical cell ID (PCI) to indexes u and p may be defined as the following Equation 5.

(21) $\begin{array}{cc}u=\mathrm{mod}\left(\mathrm{PCI},126\right)+3\mathrm{and}q=.Math.\frac{\mathrm{PCI}}{126}.Math.& \mathrm{Equation}5\end{array}$

(22) Providing that the receiving apparatus (i.e., terminal) acquires specific u and q, the PCI corresponding thereto becomes (u3)+q*126.

(23) In the standalone operating mode, the method for generating an NSSS signal will be described with reference to FIG. 1. Here, the NSSS frequency domain signal (s.sub.u,q,p(n)) is defined as the above Equation 1.

(24) FIG. 1 is a flow chart illustrating a method for generating an NSSS signal in a standalone operating mode according to an exemplary embodiment of the present invention.

(25) First, a transmitting apparatus generates the NSSS frequency domain signal defined in the above Equation 1 depending on the PCI and the 80 ms FT adopted in a specific transmitting apparatus (i.e., base station).

(26) Next, the transmitting apparatus performs a subcarrier mapping process. The transmitting apparatus segments 132 elements into 11 elements by 12 in order of a large index from a small element index. That is, the transmitting apparatus segments 132 elements into m=0, 1, . . . , 10. The transmitting apparatus generates a total of 128 samples by allocating subcarrier locations {k, n} to 12 elements for each segmented m and the generated sequence element to the symbol m and then performing zero padding. That is, the transmitting apparatus allocates an m-th sequence element to twelve subcarrier locations (n=0, 1, . . . , 11) every m and performs 116 zero padding. Describing in detail, physical subcarrier locations are k=64, 63, 62, . . . , 1, 0, 1, . . . , 62, 63, logical subcarrier locations are n=0, 1, . . . 0, 10, subcarrier locations to which the sequence element is allocated are {6,0}, {5,1}, {4,2}, . . . , {1,5}, {0,6}, . . . , {5,11}, and the rest physical subcarrier locations k (=64, 63, . . . , 7, 6, 7, . . . , 63) are padded with zero. The process is repeatedly performed every symbol m.

(27) The transmitting apparatus performs subcarrier indexing. That is, the transmitting, apparatus performs cyclic shifting by 64. Here, the subcarrier indexing process may be performed by the location exchange between higher subcarrier groups (the number of subcarriers corresponding to the BW of a higher half of the LTE system BW) and lower subcarrier groups (the number of subcarriers corresponding to the BW of a lower half of the LTE system BW).

(28) The transmitting apparatus performs the 128-point inverse fast Fourier transform (IFFT) and then inserts the cyclic prefix (CP). When the CP is inserted, if m=4, a CP length may be 10 and the rest CP length may be 9.

(29) As illustrated in FIG. 1 when the receiving apparatus (terminal) performs analog to digital converter (ADC) sampling on the generated NSSS signal at 1.92 MHz, the number of samples of the NSSS time domain signal may be 1508 (=138+137*10).

(30) In the in-band operating mode, the method for generating an NSSS signal will be described with reference to FIG. 2. Here, the NSSS frequency domain signal (s.sub.u,q,p(n)) is defined as the above Equation 1.

(31) FIG. 2 is a flow chart illustrating a method for generating an NSSS signal in an in-band operating mode according to an exemplary embodiment of the present invention.

(32) First, a transmitting apparatus generates the NSSS frequency domain signal defined in the above Equation 1 depending on the PCI and the 80 ms FT adopted in a specific transmitting apparatus (i.e., base station).

(33) Next, the transmitting apparatus performs a subcarrier mapping process. The transmitting apparatus allocates the generated sequence element to the corresponding subcarrier locations {k, n} of the specific physical resource block (RB) and the symbol m in the legacy LTE in-band and then performs the zero padding to generate a total of 128 samples. That is, the transmitting apparatus allocates an m-th sequence element to twelve subcarrier locations ({k,n}={24,0}, {25,1}, . . . , {34,10}, {35,11}) every m and performs 116 zero padding. Further, the transmitting apparatus performs the puncturing at the subcarrier location to which the legacy cell-specific reference signal (CRS) is allocated not to affect the legacy LTE system.

(34) The transmitting apparatus performs the subcarrier indexing according to the bandwidth (BW) of the legacy LTE system. Here, the subcarrier indexing process may be performed by the location exchange between higher subcarrier groups (the number of subcarriers corresponding to the BW of a higher half of the LTE system BW) and lower subcarrier groups (the number of subcarriers corresponding to the BW of a lower half of the LTE system BW).

(35) The transmitting apparatus performs the 128-point inverse fast Fourier transform (IFFT) and then inserts the cyclic prefix (CP).

(36) As illustrated in FIG. 2, when the receiving apparatus (terminal) performs the analog to digital converter (ADC) sampling on the generated NSSS signal at 1.92 MHz, the number of samples of the NSSS time domain signal may be 1508 (=138+137*10) like the standalone operating mode.

(37) Meanwhile, the method for generating NSSS in a guard band operating mode is identically with the in-band operating mode, except that the physical RB location is in the guard band and the CRS puncturing is not required.

(38) Hereinafter, a method and an apparatus for acquiring PCI and 80 ms FT based on an NSSS signal as described above will be described.

(39) FIG. 3 is a block diagram illustrating a receiving apparatus 1000 according to an exemplary embodiment of the present invention.

(40) As illustrated in FIG. 3, a receiving apparatus 1000 according to the exemplary embodiment of the present invention includes an RF processor 100, a analog to digital converter (ADC) 200, a filter unit 300, a synchronization detector 400, and a physical layer controller 500.

(41) The RF processor 100 performs RF signal processing on the NSSS signal received from the transmitting apparatus. The RF signal processing may include a function of amplifying a signal while removing noise, an automatic frequency control (AFC) function, and a function of performing bandpass filtering on an RB band on which an NSSS signal is carried.

(42) The ADC 200 samples an analog signal into a digital signal at a predetermined sampling rate. A bandwidth occupied by an NB-IoT transmission signal is mostly 180 kHz, and therefore the sampling rate may be 1.92 MHz based on Nyquist sampling theorem.

(43) The filter unit 300 performs the baseband filtering on the signal which is input by being sampled at 1.92 MHz from the ADC 200. Since the bandwidth occupied by the NB-IoT transmission signal is 180 kHz, the filter unit 300 may be implemented a low pass filter (LPF) having a bandwidth of 180 kHz. That is, the filter unit 300 filters the physical RB on which the NSSS signal is carried regardless of the system bandwidth (BW) of the transmitting apparatus (e.g., base station), and therefore may have a bandwidth of 180 kHz.

(44) The synchronization detector 400 receives a sampling signal of 1.92 MHz filtered by the physical RB on which the NSSS signal is carried from the filter unit 300, and detects the PCI and the 80 ms FT using the received sampling signal. That is, the synchronization detector 400 detects the PCI and the 80 ms FT using the characteristics of the NSSS frequency domain standard signal transmitted every even numbered frame.

(45) The physical layer controller 500 controls the RF processor 100, the ADC 200, the filter unit 300, and the synchronization detector 400. That is, the physical layer controller 500 controls the overall operation of a physical layer L1. In the following description, the physical layer controller 500 may be interchangeably used with the term L1 control.

(46) FIG. 4 is a block diagram illustrating the synchronization detector 400 according to an exemplary embodiment of the present invention.

(47) As illustrated in FIG. 4, the synchronization detector 400 according to the exemplary embodiment of the present invention includes a first processor 410 and a second processor 420. The synchronization detector 400 is executed by receiving an enable signal (i_start=ON) from the physical layer controller 500. The first processor 410 may be interchangeably mixed with the term NSSS Step1, and the second processor 420 may be interchangeably used with the term NSSS Step2.

(48) The first processor 410 performs channel estimation every 10 ms at a fixed sample timing offset from timing when the enable signal (i_start=ON) is received from the physical layer controller 500. In addition, the first processor 410 performs a frequency domain conversion process and a channel recovering process by receiving samples corresponding to the total number of samples of the NSSS time domain standard signal every 10 ms at the fixed STO from timing when the enable signal is received from the physical layer controller 500, thereby extracting the samples corresponding to the NPSS frequency domain standard signal. Here, the fixed STO means a narrowband primary synchronization signal (NPSS) subframe starting point defined upon the implementation of the receiving apparatus 1000. Here, an NSSS detection window size of the first processor 410 may be 20 ms.

(49) The second processor 420 performs a correlation and accumulation (i_NumAcc) process between the samples extracted by the first processor 410 and the NSSS frequency domain standard signal to acquire the PCI and the 80 ms FT. The second processor 420 transmits the acquired PCI (o_PCI) and 80 ms FT (o_FT) to the physical layer controller 500 and is disabled (o_Done=ON).

(50) The following Table 3 shows an input signal for a functional interface of the synchronization detector 400.

(51) TABLE-US-00003 TABLE 3 Signal Signal Signal Characteristics Name Description Type Size Rate Source i_Start NSSS Detector int [1] Radio L1 enable strobe frame Control i_NumAcc Per-20 ms int [1] Radio L1 NSSS frame Control subframe symbol accumulation num in1920 Filtered signal dcomplx [1] Sam- 180-kHz at 1.92 MHz pling BW Filter Rate

(52) The following Table 4 shows an output signal for the functional interface of the synchronization detector 400.

(53) TABLE-US-00004 TABLE 4 Signal Signal Signal Characteristics Desti- Name Description Type Size Rate nation o_PCI Acquired PCI int [1] Radio L1 frame Control o_FT Acquired 80 ms FT int [2] Radio L1 from NSSS detector frame Control 1.sup.st: FS sequence index 2.sup.nd: first or second frame o_Done NSSS Detector int [1] Radio L1 finish strobe frame Control

(54) FIG. 5 is a block diagram illustrating the first, processor 410 according to the exemplary embodiment of the present invention. The first processor 410 converts the time domain samples suffering from the NPSS estimation and passing through an automatic frequency control (AFC) into a frequency domain, thereby performing the channel compensation.

(55) As illustrated in FIG. 5, the first processor 410 according to the exemplary embodiment of the present invention includes a buffer 411, a cyclic prefix (CP) remover 412, a down-sampler 413, and fast Fourier transform (FFT) 414. The first processor 410 is performed by receiving i_Start_s1=ON from the synchronization detector 400.

(56) The buffer 411 buffers 1508 samples corresponding to the NPSS time domain standard signal every 10 ms at the fixed STO from the timing when the i_Start_s1=ON is received from the synchronization detector 400. The buffer 411 buffers 1508 samples corresponding to the NSSS time domain standard signal every 10 ms at the fixed STO from the timing when the i_Start_s1=ON is received from the synchronization detector 400. In FIG. 5, the signal buffered by the buffer 411, that is, the signal for the 1508 samples corresponding to the NSSS time domain standard signal is shown by buf_rx_nsss_s1.

(57) The CP remover 412 removes the cyclic prefix (CP). For the 1508 samples stored in the buffer 411, the CP remover 412 performs a process of removing first 9 samples every 137 samples for 137*4 samples, first 10 samples for next 138 samples, and first 9 samples every 137 samples for next 137*6 samples.

(58) The down-sampler 413 down-samples samples from which the CP remover 412 removes the CP. That is, the down-sampler 413 performs 8 times down-sampling, and repeats a process of equivalently catching one sample every 8 samples for 1408 samples from which the CP is removed.

(59) The FFT 414 performs the fast Fourier transform (FFT) on the down-sampled samples. FIG. 6 is a diagram illustrating a process of processing the FFT 414 according to the exemplary embodiment of the present invention. Referring to FIG. 6, the FFT 414 repeatedly performs a subcarrier indexing process and a guard band removing and extracting process after performing a 16-point FFT conversion process every 16 samples for 8 times sampled 176 samples to output 12*11=132 samples (buf_rx240_nsss[]) corresponding to the NPSS frequency domain standard signal. Meanwhile, as illustrated in FIG. 6, the subcarrier indexing process is an reverse process of the subcarrier indexing in the transmitting apparatus, and the guard band removing process is a process of removing higher two subcarriers and lower two subcarriers.

(60) The FFT 414 transmits 1322 samples (buf_rx240_nsss[]) extracted for 20 ms time window to the second processor (SSS Step 2) 420 at a period of 20 ms. The FFT 414 transmits a control signal o_Done_s1=ON to the second processor (NSSS Step2) 420 at an end of each period.

(61) The following Table 5 shows an input signal for a functional interface of the first processor 410.

(62) TABLE-US-00005 TABLE 5 Signal Signal Signal Characteristics Name Description Type Size Rate Source i_Start_s1 NSSS Step1 Int [1] Radio- NSSS enable strobe frame Detector i_Start_s1 = i_Start ( 3) in1920 Filtered signal dcomplx [1] Sampling 180-kHz at 1.92 MHz Rate BW Filter

(63) The following Table 6 shows an output signal for the functional interface of the first processor 410.

(64) TABLE-US-00006 TABLE 6 Signal Signal Signal Characteristics Desti- Name Description Type Size Rate nation buf_rx240_nsss Extracted FD dcomplx [132 Radio- NSSS output data 2] frame Step2 o_Done_s1 NSSS Step1 Int [1] Radio- NSSS finish strobe frame Step2

(65) FIG. 7 is a block diagram illustrating the second processor 420 according to the exemplary embodiment of the present invention. The second processor 420 sequentially performs, four times, a hypothesis process on the samples corresponding to the NPSS frequency domain standard signal input from the first processor 410, repeatedly twice in units of 132 samples.

(66) As illustrated in FIG. 7, the second processor 420 according to the exemplary embodiment of the present invention includes a first estimator 421, second estimator 422, a third estimator 423, a fourth estimator 424, a cyclic shift (CS) combiner 425, a memory 426, a buffer 427, and a selector 428. The first estimator 421 may be interchangeably used with term PCI_FT_H0, the second estimator 422 may be interchangeably used with term PCI_FT_H1, the third estimator 423 may be interchangeably used with term PCI_FT_H2, and the fourth estimator 424 may be interchangeably used with term PCI_FT_H3. The second processor 420 is performed by receiving o_Done_s1=ON from the first processor 410.

(67) The first estimator 421 performs decorrelation on a 0-th sequence (.sub.0(n)) in the FS sequence shown by the above Equation 4, decorrelation on a ZC sequence shown by the above Equation 2, and descrambling on a scramble sequence shown by the above Equation 3.

(68) The second estimator 422 performs decorrelation on a 1-th sequence (.sub.1(n)) in the FS sequence shown by the above Equation 4, decorrelation on a ZC sequence shown by the above Equation 2, and descrambling on a scramble sequence shown by the above Equation 3.

(69) The third estimator 423 performs decorrelation on a 3-th sequence (.sub.2(n)) in the FS sequence shown by the above Equation 4, decorrelation on a ZC sequence shown by the above Equation 2, and descrambling on a scramble sequence shown by the above Equation 3.

(70) The fourth estimator 424 performs decorrelation on a 4-th sequence (.sub.3(n)) in the FS sequence shown by the above Equation 4, decorrelation on a ZC sequence shown by the above Equation 2, and descrambling on a scramble sequence shown by the above Equation 3.

(71) The CS combiner 425 performs cyclic shift (CS) combining on descrambling values output from the first to fourth estimators 421 to 424, respectively.

(72) The memory 426 accumulates values (i.e., the CS combining values for the first to fourth estimators 421 to 424, respectively) output from the CS combiner 415 by the accumulated number of times (i_NumAcc) transmitted from the synchronization detector 400 and stores the accumulated values, respectively.

(73) The selector 428 compares the stored values for the first to fourth estimators 421 to 424 received from the memory 425, and finally determines the PCI and the 80 ms FT. If the selector 427 finally determines the PCI and the 80 ms FT, it transmits o_Done_s2=ON to the synchronization detector 400.

(74) Meanwhile, the second processor 420 performs decorrelation on the FS sequence of the above Equation 4 for the first to fourth estimators 421 to 424 before the accumulated number of times i_NumAcc received from the synchronization detector 400, decorrelation on the ZC sequence of the above Equation 2, descrambling on the scramble sequence of the above Equation 3, and only CS combining of the CS combiner 425. The second processor 420 finally detects the PCI and the 80 ms FT using the selector 428 if the accumulated number of times i_NumAcc arrives.

(75) As illustrated in FIG. 7, the first estimator 421 according to the exemplary embodiment of the present invention includes a de-correlator 4211, a de-correlator 4212, and a de-scrambler 4213. As illustrated in FIG. 7, the second to fourth estimators 422, 423, and 424 have the same components as the first estimator 421, and for convenience, the first estimator 421 will be described mainly.

(76) The de-correlator 4211 performs the FS sequence decorrelation on a sample (buf_rx240_nsss[]=y(n), n=0,1, . . . , 131) corresponding to the NSSS frequency domain standard signal input from the first processor 410, as the following Equation 6.
y.sub.S1,p,1(n)=y.sub.1(n)*.sub.p(n),n=0,1, . . . ,131,Equation 6 where y.sub.1 is the FD signal for the first frame.
y.sub.S1,p,2(n)=y.sub.2(n)*.sub.p(n),n=0,1, . . . ,131, where y.sub.2 is the FD signal for the second frame.
In the above Equation 6, .sub.p(n) is the same as the above Equation 4 and the above Table 2. As shown in the above Table 2, the sample values are 1 or j, and therefore if only a sign conversion is used instead of a multiplication operation, the above Equation 6 may be calculated only by addition. Meanwhile, the de-correlator 4211 performs the decorrelation on the 0-th sequence (.sub.0(n)) among the FS sequence, and therefore in the above Equation 6, .sub.p(n) is replaced by .sub.0(n).

(77) The de-correlator 4212 performs the decorrelation on a ZC sequence .sub.u(n) of the Equation 2. The decorrelation is performed as the following Equation 7.
y.sub.S2,p,u,1(n)=y.sub.S1,p,1(n)*.sub.u(n)
y.sub.S2,p,u,2(n)=y.sub.S1,p,2(n)*.sub.u(n)Equation 7

(78) As shown by the above Equation 7, the de-correlator 4212 performs the decorrelation using the ZC sequence .sub.u(n) of the above Equation 2 and y.sub.S1,p,1(n) and y.sub.S1,p,2(n) of the Equation 6.

(79) The de-scrambler 4213 performs the decorrelation on the scrambling sequence b.sub.q(n) of the Equation 3. The decorrelation is performed as the following Equation 8.
y.sub.S3,p,u,q,1(n)=y.sub.S2,p,u,1(n)b.sub.u(n)
y.sub.S3,p,u,q,2(n)=y.sub.S2,p,u,2(n)b.sub.u(n)Equation 8

(80) As shown by the above Equation 8, the de-scrambler 4214 performs the decorrelation using the ZC sequence b.sub.q(n) of the above Equation 3 and y.sub.S2,p,u,1(n) and y.sub.S2,p,u,2(n) of the Equation 7. As shown in the above Table 1, the elements of the scrambling sequence are binary, and therefore if only the sign conversion is used instead of the multiplication operation, the above Equation 8 may be calculated only by the addition.

(81) The CS combiner 425 performs the CS combining as the following Equation 9.

(82) $\begin{array}{cc}{y}_{S4,p,1}\left(p*128*8+\left(u-3\right)*8+2*q\right)={.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132/2-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.}^2+{.Math.\underset{\underset{u=3,q=0}{n=132/2,p=0}}{\overset{\begin{array}{c}n=131,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.}^2\mathrm{or}.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132/2-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.+.Math.\underset{\underset{u=3,q=0}{n=132/2,p=0}}{\overset{\begin{array}{c}n=131,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.\mathrm{or}{.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.}^2\mathrm{or}.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,1}\left(n\right).Math.y_{S4,p,2}\left(p*128*8+\left(u-3\right)*8+2*q+1\right)={.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132/2-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S4,p,u,q,2}\left(n\right).Math.}^2+{.Math.\underset{\underset{u=3,q=0}{n=132/2,p=0}}{\overset{\begin{array}{c}n=131,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S4,p,u,q,2}\left(n\right).Math.}^2\mathrm{or}.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132/2-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,2}\left(n\right).Math.+.Math.\underset{\underset{u=3,q=0}{n=132/2,p=0}}{\overset{\begin{array}{c}n=131,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,2}\left(n\right).Math.\mathrm{or}{.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,2}\left(n\right).Math.}^2\mathrm{or}.Math.\underset{\underset{u=3,q=0}{n=0,p=0}}{\overset{\begin{array}{c}n=132-1,p=3\\ u=128,q=3\end{array}}{.Math.}}{y}_{S3,p,u,q,2}\left(n\right).Math.\mathrm{For}\mathrm{initializaiton},D_{S4,A,1}\left(n\right)=y_{S4,p,1}\left(n\right),D_{S4,A,2}\left(n\right)=y_{S4,p,2}\left(n\right)\mathrm{For}\mathrm{non}\text{-}\mathrm{initializaiton},D_{S4,A,1}\left(n\right)=y_{S4,\mathrm{mod}\left(p-1,4\right),A-1,1}\left(n\right)+\left(1-\right)y_{S4,p,1}\left(n\right)D_{S4,A,2}\left(n\right)=y_{S4,\mathrm{mod}\left(p-1,4\right),A-1,2}\left(n\right)+\left(1-\right)y_{S4,p,2}\left(n\right)& \mathrm{Equation}9\end{array}$

(83) In the above Equation 9, represents a decay factor, and A corresponds to 20 ms as a window size of the synchronization detector 400. In the above Equation 9, mod (1,4)=3.

(84) The selector 428 acquires specific u, q, and p having the highest correlation value among decision variables derived in the course of the above Equation 9. Here, the PCI may be calculated by (u3)+q*126 from u and q. The 80 ms FT may be obtained from the information on whether it belongs to the first 132 samples and belongs, to the following 132 samples, through p.

(85) The following Table 7 shows the input signal for the functional interface of the second processor 420.

(86) TABLE-US-00007 TABLE 7 Signal Signal Signal Characteristics Name Description Type Size Rate Source buf_rx240_nsss Buffered dcomplx [132 Sam- NSSS output 2] pling Step1 data from Rate NSSS Step1 i_NumAcc Per-20 ms int [1] Radio- NSSS NSSS frame De- subframe tector accumulation num o_Done_s1 NSSS Step1 int [1] Radio- NSSS finish strobe frame Step1

(87) The following Table 8 shows the output signal for the functional interface of the second processor 420.

(88) TABLE-US-00008 TABLE 8 Signal Signal Signal Characteristics Desti- Name Description Type Size Rate nation o_PCI Acquired PCI int [1] Radio- NSSS frame Detector o_FT Acquired 80 ms FT int [2] Radio- NSSS from NSSS detector frame Detector 1.sup.st: FS sequence index 2.sup.nd: first or second frame o_Done_s2 NSSS Detector int [1] Radio- NSSS finish strobe frame Detector

(89) According to the exemplary embodiment of the present invention, since the complex operation process is not required in the decorrelation process on one of two different sequences transmitted from the transmitting apparatus for the PCI acquisition, and therefore the low-power receiving apparatus can be implemented. According to the exemplary embodiment of the present invention, the complex operation is not required in the decorrelation process on the FT sequence transmitted from the transmitting apparatus for 80 ms acquisition, and therefore the low-power receiving apparatus may be implemented. By doing so, the optimized receiving apparatus may be implemented.

(90) Although the exemplary embodiment of the present invention has been described in detail hereinabove, the scope of the present invention is not limited thereto. That is, several modifications and alterations made by those skilled in the art using a basic concept of the present invention as defined in the claims fall within the scope of the present invention.