WO2007126280A2 - Procédé et appareil de génération de séquence de codes dans un système de communication - Google Patents

Procédé et appareil de génération de séquence de codes dans un système de communication Download PDF

Info

Publication number
WO2007126280A2
WO2007126280A2 PCT/KR2007/002117 KR2007002117W WO2007126280A2 WO 2007126280 A2 WO2007126280 A2 WO 2007126280A2 KR 2007002117 W KR2007002117 W KR 2007002117W WO 2007126280 A2 WO2007126280 A2 WO 2007126280A2
Authority
WO
WIPO (PCT)
Prior art keywords
code
sequences
code sequence
sequence
code sequences
Prior art date
Application number
PCT/KR2007/002117
Other languages
English (en)
Other versions
WO2007126280A3 (fr
Inventor
Seung Hee Han
Min Seok Noh
Yeong Hyeon Kwon
Original Assignee
Lg Electronics Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR1020060076813A external-priority patent/KR20070106913A/ko
Application filed by Lg Electronics Inc. filed Critical Lg Electronics Inc.
Priority to US12/298,488 priority Critical patent/US8873649B2/en
Publication of WO2007126280A2 publication Critical patent/WO2007126280A2/fr
Publication of WO2007126280A3 publication Critical patent/WO2007126280A3/fr
Priority to US14/508,735 priority patent/US10135654B2/en
Priority to US14/511,896 priority patent/US10284406B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0055—ZCZ [zero correlation zone]
    • H04J13/0059—CAZAC [constant-amplitude and zero auto-correlation]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H04J13/102—Combining codes
    • H04J13/107—Combining codes by concatenation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation

Definitions

  • the present invention relates to a mobile communication system, and more particularly, to a method for generating a code sequence in a mobile communication system and a method and apparatus for processing data for transmission of the code sequence.
  • a pilot signal or preamble which is used in a mobile communication system, means a reference signal used for acquisition of initial synchronization, cell detection, channel estimation, etc.
  • An orthogonal or quasi-orthogonal code having good correlation properties may be used as a code sequence which constitutes the preamble. Tor example, in case of PI (Portable Internet, Specifications for 2.3GHz band
  • a CAZAC (Constant Amplitude Zero Auto-Correlation) sequence is mainly characterized in that its amplitude is uniform and autocorrelation is represented by a delta function type.
  • cross correlation of the CAZAC sequence although not zero, has a small value.
  • GCL CAZAC sequence and zadoff CAZAC sequence which are mainly used as the CAZAC sequences, are very similar to each other and have different orientations in phase.
  • Equation 1 (in case where N is an odd number)
  • the Zadoff CAZAC sequence can be expressed by the following Equations 3 and 4. [Equation 3]
  • N is a length of the sequence
  • M is a natural number which is relatively prime to N among natural numbers less than N
  • k represents 0, 1 , ..., N.
  • Binary Hadamard codes or poly-phase CAZAC codes are orthogonal codes, and the number of the binary Hadamard codes or the poly-phase CAZAC codes, which maintains orthogonality, is limited.
  • the number of orthogonal codes having a length of N, which can be obtained by NxN Hadamard matrix, is N
  • the number of orthogonal codes having a length of N, which can be obtained by CAZAC code is equivalent to the number of natural numbers less than N, wherein the natural numbers are relatively prime to N.
  • the length of one OFDM (Orthogonal Frequency Division Multiplexing) symbol in an OFDM system generally has a length of exponentiation of 2 to expedite FFT (Fast Fourier Transform) and IFFT (Inverse Fast Fourier Transform).
  • FFT Fast Fourier Transform
  • IFFT Inverse Fast Fourier Transform
  • the present invention is directed to a method and apparatus for generating a code sequence that can be used for acquisition of initial synchronization, cell detection, channel estimation, etc in a communication system and a method of data- processing for transmission of the code sequence, which substantially obviate one or more problems due to limitations and disadvantages of the related art.
  • One aspect of the present invention is a method of generating various kinds of code sequences by combining at least two different code sequences to generate a new code sequence.
  • at least two code sequences are combined with each other to generate one code sequence.
  • Equation 5 illustrates one example that at least two code sequences are combined with each other to generate one code sequence.
  • Equation 5 ⁇ j is a power control constant for the i ⁇ code sequence, ⁇ .j is a delay component of each code sequence, and Mi is a sequence key of the 1 th code sequence.
  • the at least two code sequences are combined with each other by adding up of corresponding elements of the at least two code sequences, so as to generate one code sequence.
  • the at least two code sequences may serially be concatenated to generate one code sequence. Examples of a code to which technical features of the present invention can be applied include, but not limited to, a binary code, a Hadamard code, and a poly-phase CAZAC code.
  • a method for generating a code sequence in a transmitting side of a mobile communication system comprises combining at least two code sequences to generate a new code sequence, and transforming the new code sequence into time domain signals.
  • a transmitter for generating a code sequence in a mobile communication system comprises a sequence combiner combining at least two code sequences to generate a new code sequence, and a time domain signal transforming module transforming the new code sequence generated by the sequence combiner into time domain signals.
  • a method a method of data-processing for transmission of a code sequence from a transmitting side to its receiving side in a mobile communication system comprises mapping a first code sequence to a first part of sub-carriers belonging to a whole band used in the mobile communication system, mapping a second code sequence to a second part of sub-carriers belonging to the whole band, and transforming the first and second code sequences mapped to the sub-carriers into time domain signals.
  • a method of data-processing for transmission of a code sequence from a transmitting side to its receiving side in a mobile communication system comprises generating a new code sequence by serially concatenating at least two code sequences, mapping the generated code sequence to at least a part of sub- carriers belonging to a whole band used in the mobile communication system, transforming the code sequence mapped to the sub-carriers into time domain signals.
  • a method of data-processing for transmission of a code sequence from a transmitting side to its receiving side of a mobile communication system comprises converting at least one code sequence into time domain signals, generating at least two different code sequences by performing circular shift for the at least one code sequence converted into the time domain signals, and combining the at least two code sequences generated by the circular shift.
  • a transmitter for generating a code sequence for transmission to a receiving side in a communication system comprises an IFFT module transforming at least one code sequence into time domain signals, a circular shift module generating at least two different code sequences by performing circular shift for the at least one code sequence converted into the time domain signals, a combiner combining the at least two code sequences generated by the circular shift.
  • FIG 1 is a diagram illustrating a preferred embodiment of the present invention
  • FIGs. 2A and 2B diagrams illustrating examples of hardware configuration for embodiments in accordance with the present invention
  • FIG 3 is a diagram illustrating another preferred embodiment of the present invention.
  • FIG 4 is a diagram illustrating another preferred embodiment of the present invention.
  • FIG 5 is a diagram illustrating another preferred embodiment of the present invention.
  • FIG 6 is a diagram illustrating another preferred embodiment of the present invention
  • FIG 7 is a diagram illustrating another preferred embodiment of the present invention
  • FIGs. 8A and 8B are diagrams illustrating another preferred embodiments of the present invention.
  • FIG 9 is a diagram illustrating an example that values that can be used as delay components are set in accordance with the preferred embodiment of the present invention.
  • FIG 10 is a diagram illustrating steps of the preferred embodiment of the present invention.
  • FIG 11 is a diagram illustrating a performance curve according to the preferred embodiment of the present invention.
  • FIG 1 is a diagram illustrating the preferred embodiment of the present invention.
  • an L th CAZAC sequence is obtained in such a manner that an optional CAZAC sequence, for example, a sequence generated by any one of the Equations 1 to 4 is circular shifted by T L .
  • the CAZAC sequence generated by circular shift has orthogonality with the original sequence before circular shift, a peak is generated by cross correlation.
  • the original CAZAC sequences from which the first to L th CAZAC sequences are generated by the circular shift may be the same sequences as one another or different sequences.
  • the generated CAZAC sequences may be summed up each other to generate a new sequence.
  • the two CAZAC sequences may be summed up each other to generate a new sequence. If at least two different CAZAC sequences are summed up each other, they may not undergo circular shift. Summing up at least two different CAZAC sequences means combining corresponding elements of the sequences.
  • FIG 2A is a block diagram illustrating a transmitter according to the preferred embodiment of the present invention. Referring to FIG. 2A, at least two different code sequences which have not undergone circular shift are combined with each other to generate a new code sequence.
  • the transmitter of FIG 2 A includes a combiner 21 and an EFFT module
  • the combiner 21 receives at least two code sequences and combines respective elements of the code sequences with each other.
  • the IFFT module 22 maps the code sequences generated by the combiner 21 to sub-carriers, and performs IFFT to convert the mapped result into time domain signals.
  • the combiner 21 may generate one code sequence by adding up corresponding elements of the at least two code sequences. Alternatively, the combiner 21 may generate one code sequence by serially concatenating the at least code sequences.
  • the at least two code sequences could be binary codes, Hadamard codes, or poly-phase CAZAC codes.
  • any one of the code sequences is mapped to a part of sub-carriers belonging to the whole band, and the other code sequence is mapped to other part of sub-carriers belonging to the whole band.
  • IFFT is performed for the whole code sequences mapped to the sub-carriers, whereby the same result can be obtained.
  • FIG 2B is a block diagram illustrating another transmitter according to the preferred embodiment of the present invention.
  • the transmitter of FIG 2B includes an EFFT module 23, a circular shift module 24, and an adder 25.
  • the TFFT module 23 receives at least one CAZAC sequence and converts the CAZAC sequence into time domain symbols.
  • the circular shift module 24 circular shifts the at least one CAZAC sequence converted into the time domain symbols to generate at least two different CAZAC sequences.
  • the adder 25 adds the at least two different CAZAC sequences output from the circular shift module 24 to each other so as to generate a new CAZAC sequence.
  • the CAZAC sequences may be circular shifted before IFFT, i.e., in a frequency domain to generate a plurality of CAZAC sequences.
  • at least one CAZAC sequence is circular shifted before IFFT to generate at least two CAZAC sequences, and the generated CAZAC sequences are combined with each other to generate a new CAZAC sequence, whereby the generated new CAZAC sequence is converted into a time domain signal by EFFT.
  • X 1 is a power control constant for the i th CAZAC sequence, and is to allow a new sequence generated by combination of at least two CAZAC sequences to perform normalization, thereby allowing each element to obtain amplitude of 1.
  • Two methods for normalization can be considered. The first method is that each element of the generated sequences is divided by an absolute value of each element. The second method is that the overall power of the generated sequences is adapted to the number N of the elements.
  • FIG 3 is a diagram illustrating another preferred embodiment of the present invention. Referring to FIG 3, at least two code sequences are combined with each other to generate one code sequence.
  • the respective code sequences are combined with each other in such a manner that their lengths are adapted to the that of the longest code sequence to allow the other code sequences except the longest code sequence to have repeated patterns.
  • Examples of a method for combining at least two code sequences with each other include a method of adding up corresponding elements and a method of serially concatenating code sequences having different patterns.
  • the method for adding up corresponding elements of at least two code sequences to generate one code sequence can be expressed by the following Equation 6.
  • Equation 5 or 6 ⁇ 1 '* "2 ''"' ⁇ L> M ⁇ > M 2 i -M L ) m ⁇ ⁇ de ⁇ 68 having diversity of N 2L
  • N 2L the order of N 2L is maintained.
  • a coordinate value mapped with the code one to one can be identified, wherein the code is generated by adding at least two code sequences to each other. From the identified coordinate value, various kinds of information can be transferred or signal can be identified.
  • FIG. 4 is a diagram illustrating another preferred embodiment of the present invention.
  • one sequence code generated by combination of at least two CAZAC sequences is applied to a synchronization channel (SCH).
  • SCH synchronization channel
  • RACH random access channel
  • a code expression value may differently be interpreted.
  • an expression value of the code is ⁇ l a 2 ' l 3 2 ⁇ , wherein
  • expression value may be expressed simply by ⁇ 2 ' 2 - ⁇ This means that the amount of the codes increases through a delay value of the second code and a key value of the code. Supposing that every sample delay can occur, (N- l) ⁇ (N-I) code combinations which are a total number of available cases are generated.
  • FIG. 4 it is supposed that four synchronization channels (SCH) exist in an interval of 20ms and the same code is transmitted to each channel.
  • the synchronization channels (SCH) are used for acquisition of time synchronization from a receiving signal of a receiving side, acquisition of overall frame synchronization after time synchronization, and acquisition of cell identifier (cell ID) or cell group ID and other secondary information. This will now be described briefly.
  • Time synchronization various methods can be used for time synchronization. For example, a method for transmitting a code to the SCH may be used. According to this method, a transmitting side transmits a code symbol to all the sub-carriers while a receiving side obtains direct cross correlation between transmitting and receiving signals. Alternatively, if the transmitting side does not transmit the code symbol to all the sub-carriers but transmit the code symbol at an interval of two sub-carriers or greater, the signals represent periodicity in a time domain. Accordingly, based on this feature, a method for processing auto correlation of a receiving signal at a receiving side and searching for a peak may be used.
  • the method for transmitting a symbol to all the sub- carriers has better performance. If the code sequence according to the present invention is transmitted, it can be applied to the above two cases. If the cross correlation method is used, a
  • the SCHs within different superframes can be added to adapt synchronization.
  • FIG 5 is a diagram illustrating another preferred embodiment of the present invention. The embodiment described with reference to FIG. 5 is applied to the case where a channel structure is a hierarchical structure.
  • a sub-frame of 2ms hierarchically includes two synchronization channels, i.e., a primary synchronization channel
  • P-SCH primary synchronization channel
  • S-SCH secondary synchronization channel
  • the primary synchronization channel exists to search for time synchronization of a symbol, and the same code sequence can be used in every cell.
  • a value greater than 1 can be used as a value of L
  • a code sequence for transmission of cell information for cell detection at the receiving side is used for the secondary synchronization channel (S-SCH).
  • S-SCH secondary synchronization channel
  • the code generated in accordance with the preferred embodiment of the present invention can be used.
  • many kinds of codes can be used in the secondary synchronization channel (S-SCH) if possible.
  • the value of L may be greater than 1.
  • one code key (value of M) is associated with the cell, and much more kinds of information can be transferred depending on the delay value. If the value of L is greater than 1, information corresponding to L times of the case where the value of L is equal to 1 can be transferred.
  • FIG 6 is a view illustrating another preferred embodiment of the present invention. The embodiment described with reference to FIG. 6 is applied to the case where a channel structure is a non-hierarchical structure.
  • the code according to the preferred embodiment of the present invention can be applied to each of synchronization symbols, and 1 or a value greater than 1 can be applied to the value of L. Furthermore, application of the code sequence generated by the Equation 6 enables that the code can be embedded over several synchronization channels, wherein combination of a long code sequence and a short code sequence may depend on the value of L. Referring to FIG 6, when synchronization codes are inserted into the synchronization channels, four synchronization symbols may have different delays for the same code sequence or the same delay for different code sequence. Alternatively, synchronization symbols may be grouped (the size of the group is greater than 1 ), so that each group may have the same sequence. Accordingly, information provided by the synchronization channels is represented by combination of the key value M of the code and the delay value, and is characterized in that the information amount becomes L times if L increases.
  • cell detection sequence employing the present invention will be described.
  • the embodiment described hereinafter illustrates that technical features of the present invention are applied to a hierarchical structure and a non-hierarchical structure, which are discussed as structures of the synchronization channels in 3GPP LTE (Long Term Evolution).
  • 3GPP LTE Long Term Evolution
  • the embodiment based on the GCL CAZAC code will be described hereinafter, since the Zadoff- Chu CAZAC sequence is different from the GCL code in symbol component of phase, its application will be the same as that of the GCL code. Likewise, application of other based CAZAC sequence will be the same as that of the GLC code.
  • the SCH in the hierarchical structure includes P-SCH and S-SCH.
  • the P-SCH is a channel where all the cells transmit the same signal, through which initial synchronization can be acquired.
  • the S-SCH transmits information of cell-specific ID or cell group ID for each cell and also transmits secondary information required for acquisition of frame synchronization and other information.
  • the secondary information required for acquisition of frame synchronization and the other information may be transmitted through a broadcast channel (BCH).
  • BCH broadcast channel
  • Examples of a multiplexing method of the P-SCH and the S-SCH include TDM (Time Division
  • the hierarchical structure shown in FIG 5 corresponds to the case where multiplexing of the P-SCH and the S-SCH is TDM.
  • TDM Time Division Multiplexing
  • CDM Code Division Multiplexing
  • the P-SCH can be provided by insertion of the GCL CAZAC code or another optional code.
  • the same code for each cell is used.
  • the code generated by the preferred embodiment of the present invention is applied to the hierarchical structure, it is preferably used for the S-SCH which transmits cell-specific information.
  • the code for the S-SCH selects different values of M for each cell and transmits the selected values, hi this case, types of codes that can be identified for each cell are related to the length N of the code, and the number of the codes is the number of natural numbers, which are relatively prime to N among natural numbers less than N.
  • Secondary information by circular shift sequence can be used as information of cell ID classification, information of cell group ID classification, information of bandwidth of cell being transmitted, frame synchronization information, information of the number of transmitting antennas, bandwidth information of another channel such as BCH, and information of cyclic prefix (CP) length.
  • CP cyclic prefix
  • 616 circular shift sequences can be used for the S- SCH. If the circular shift sequences are used for cell ID classification or cell group ID classification, a total of 616 cells or cell groups can be identified.
  • code sequences according to the preferred embodiment of the present invention are used for cell classification
  • two cases can be considered as follows, hi the first case, delay components according to circular shift are used as cell group ID information, and each code sequence is used as cell ID information, hi the second case, each code sequence is used as cell group ID information, and delay components according to circular shift are used as cell ID information.
  • Cell group ID 7 (delay group 7)
  • 78 cell groups corresponding to the number of the code sequences can be identified, and 8 cells for each group can be identified.
  • a total of 624 (78x8) cells can be identified. Since one code sequence should be used for the P-SCH in the hierarchical structure, a total of 616 (77x8) cells can be identified.
  • a large number of cell IDs in a physical level are preferably required if possible.
  • all cell IDs prescribed on the standard during network design may be used, some of them may be used.
  • a network designer can use the required number of cell IDs for network design through grouping. For example, supposing that there are provided a total of 624 available cell IDs and that 234 cell IDs are only required during cell design, three cell group IDs having 78 cell IDs can be used. As another example, supposing that the number of required cell IDs is 512, 64 code sequences are respectively used for 8 cell groups. This will now be described in more detail.
  • Cell group ID 7 (delay group 7)
  • FIG 7 is a diagram illustrating another preferred embodiment of the present invention.
  • the number of cell group IDs is 7 and the number of code sequences for each group is 61.
  • numbers within cells represent examples of cell group IDs within each cell group.
  • one cell is comprised of one sector, it is apparent that one cell may be applied to other sector structure such as three sectors and six sectors.
  • the delay components by means of circular shift can be used to indicate information of the number of transmitting antennas or the length of CP.
  • the number (78) of the code sequences available by the existing sequences can be used for cell classification or cell group ID classification, and the number (8) of the delay components by means of circular shift can be used to indicate information of the case where the number of transmitting antennas is 4 and types of the CP length are 2.
  • FIGs. 8 A and 8B are views illustrating another preferred embodiment of the present invention.
  • FIG 8 A is a flow chart illustrating the procedure of the transmitting side
  • FIG. 8B is a flow chart illustrating the procedure of the receiving side.
  • the transmitting side generates the code sequences, i.e., GCL
  • Equation 8 Equation 8
  • the transmitting side maps each sub-carrier to the generated code sequences (72). In this step, the transmitting side can insert guard sub-carrier and DC sub-carrier . in accordance with the following Equation 9. [Equation 9]
  • f() is a function which maps a complex signal equivalent to used sub-carrier to the guard sub-carrier and the DC sub-carrier for IFFT modulation.
  • the transmitting side performs IFFT for the code sequences mapped to the sub- carriers in accordance with the following Equation 10 to generate OFDM symbols of the time domain. 5 [Equation 10]
  • the transmitting side performs circular shift for the IFFT performed signal in accordance with the following Equation 11. [Equation 11]
  • cf (n) c M (mod(N ⁇ + n - ⁇ > N ⁇ ))
  • Equation 11 mod(a, b) means the remainder obtained by dividing a by b.
  • the Equation 11 means circular shift to the right. Circular shift to the left can be obtained by the following Equation 12.
  • c ⁇ n c M (mod(N ⁇ +n + ⁇ f N ⁇ ))
  • the signal generated by the Equation 11 is converted into a form of a phase value of each sub-carrier, which is linearly increased, as expressed by the following Equation 13.
  • the signal after digital to analog (D/ A) conversion may undergo circular delay.
  • the number of samples which undergo circular shift is selected considering delay spread of a channel considered in a system which is used.
  • a CP interval range (exactness is not necessarily required) is considered when this step is performed.
  • FIG 9 is a diagram illustrating an example that values that can be used as delay components are set in accordance with the preferred embodiment of the present invention.
  • 128-point IFFT is performed so that 8 groups for each of 16 samples are grouped if the number of samples of OFDM symbols except CP is 128.
  • the reason why grouping is performed for delay is to allow the receiving side to be robust to influence of a channel and exactly receive a delay value when the receiving side detects the delay value.
  • TU urban
  • 16 samples which correspond to 8.33us cover the maximum delay spread length.
  • the receiving side can robustly estimate a delay value through a margin in spite of interference such as remaining symbol timing offset.
  • the grouping method for grouping 8 groups for each of 16 samples with respect to the 128 symbols is only exemplary, and various numbers of groups and various numbers of samples for each group, such as 16 groups for each of 8 samples, maybe defined.
  • Delay combination that can be obtained in this embodiment includes 8 types such as Ous (0 sample), 8.330 us (16 samples), 16.66us (32 samples),..., 58.3 lus (112 samples).
  • 128-point IFFT is performed
  • other-point (256, 512, 1024, 1536, 2048) IFFT may be performed if 1.25 MHz (75 sub-carriers) is used for the SCH and the other band is used for other purpose in the same manner as the LTE.
  • the time corresponding to one OFDM symbol length is uniformly maintained at 66.7us even though the number of the samples depends on each case.
  • the receiving side removes cyclic prefix (CP) of a received signal (75) and performs fast fourier transform (FFT) (76).
  • CP cyclic prefix
  • FFT fast fourier transform
  • the receiving side estimates the value of M of the GCL CAZAC code transmitted from the transmitting side by using the FFT result (77).
  • the value of M can be estimated through the maximum value of IDFT value of differential encoding in accordance with the following Equation 15.
  • M ' R (t) hi the Equation 15, when (R(k-l)) * ⁇ R(k) is performed, a delay component ⁇ added intentionally by the transmitting side becomes a constant of exp(-j ⁇ ) and thus does not affect estimation of the value of M.
  • () means conjugate.
  • the receiving side detects the delay component ⁇ after estimating the value of M (78).
  • the delay component can be estimated through the following steps.
  • the received signal is compensated by the GCL CAZAC sequence corresponding to M' estimated by the Equation 15, and this step can be performed by the following Equation 16.
  • frequency response of the channel in the frequency domain can be obtained.
  • Equation 17 EFFT is performed for the resultant value of the Equation 16, and this step can be performed by the following Equation 17.
  • FIG 10 is a diagram illustrating the resultant value after the second step is performed.
  • N g means the number of groups that can generate delay
  • g means group indexes (0,1,..).
  • FIG. 11 is a diagram illustrating a performance curve according to the preferred embodiment of the present invention. Referring to FIG 11 , a detection error rate is shown under the experimental environment of the TU channel model of 3km/h.
  • i) 'Delayed S-SCH' illustrates detection performance which detects the delay group only
  • ii) 'Only GCL(IDFT)' illustrates a performance graph when the GCL code according to the related art is only used
  • iii) 'Proposed' illustrates a performance graph from the method according to the preferred embodiment of the present invention.
  • iii) which corresponds to the present invention, is obtained by combination of i) and ii). Since suggested overall performance depends on poorer performance of i) and ii), it depends on performance of ii). Accordingly, it is noted that overall performance is obtained almost equally to that obtained by the related art only.
  • a user equipment detects two delay groups when two signals simultaneously reach the user equipment.
  • a limitation that two base stations should use different values of M can be considered.
  • the number of cell IDs is equal to that of the related art (40)
  • information (8 types) by means of delay can be used for other secondary information (ex., frame synchronization information).
  • initial synchronization is performed by the P-SCH, and cell ID is detected through the S-SCH.
  • both initial synchronization and cell ID detection are performed through the SCH.
  • Initial synchronization of the hierarchical structure is performed by cross correlation using a common signal which each user equipment knows as every base station transmits the common signal through the P-SCH.
  • initial synchronization of the non- hierarchical structure is performed by blind detection using auto correlation through a repeated structure of OFDM signals transmitted from the SCH. Accordingly, since there is no need to know a specific signal, anything transmitted from the SCH can undergo synchronization.
  • cell ID information is transmitted along with the SCH. If the technical spirit according to the present invention is applied to the non-hierarchical structure, cell ID information is transmitted and received in the same method as that applied to the S-SCH in the hierarchical structure.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé de génération d'une séquence de codes pouvant être utilisé pour l'acquisition de synchronisation initiale, de détection de cellule, d'estimation de voie et analogues dans un système de communications mobiles, et un émetteur. Le procédé de génération d'une séquence de codes côté transmission d'un système de communications mobiles comprend la combinaison d'au moins deux séquences de codes entre elles, et la conversion d'une séquence de codes générée par l'étape de combinaison en un signal de domaine temporel.
PCT/KR2007/002117 2006-05-01 2007-04-30 Procédé et appareil de génération de séquence de codes dans un système de communication WO2007126280A2 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US12/298,488 US8873649B2 (en) 2006-05-01 2007-04-30 Method and apparatus for generating code sequence in a communication system
US14/508,735 US10135654B2 (en) 2006-05-01 2014-10-07 Method and apparatus for generating code sequence in a communication system
US14/511,896 US10284406B2 (en) 2006-05-01 2014-10-10 Method and apparatus for generating code sequence in a communication system

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
KR10-2006-0039338 2006-05-01
KR20060039338 2006-05-01
KR20060076146 2006-08-11
KR10-2006-0076146 2006-08-11
KR1020060076813A KR20070106913A (ko) 2006-05-01 2006-08-14 통신 시스템에서의 코드 시퀀스 생성 방법 및 송신 장치
KR10-2006-0076813 2006-08-14

Related Child Applications (3)

Application Number Title Priority Date Filing Date
US12/298,488 A-371-Of-International US8873649B2 (en) 2006-05-01 2007-04-30 Method and apparatus for generating code sequence in a communication system
US14/508,735 Continuation US10135654B2 (en) 2006-05-01 2014-10-07 Method and apparatus for generating code sequence in a communication system
US14/511,896 Continuation US10284406B2 (en) 2006-05-01 2014-10-10 Method and apparatus for generating code sequence in a communication system

Publications (2)

Publication Number Publication Date
WO2007126280A2 true WO2007126280A2 (fr) 2007-11-08
WO2007126280A3 WO2007126280A3 (fr) 2008-03-06

Family

ID=38655925

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2007/002117 WO2007126280A2 (fr) 2006-05-01 2007-04-30 Procédé et appareil de génération de séquence de codes dans un système de communication

Country Status (1)

Country Link
WO (1) WO2007126280A2 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008078919A2 (fr) * 2006-12-22 2008-07-03 Lg Electronics Inc. Procédé de production et de transmission de séquence reposant sur l'utilisation d'une unité de transmission de domaine temporel et fréquentiel
CN102035770A (zh) * 2010-12-01 2011-04-27 南京航空航天大学 一种利用相关进行的信道估计方法
WO2021143529A1 (fr) * 2020-01-16 2021-07-22 中兴通讯股份有限公司 Procédé et appareil de traitement de signal, premier nœud de communication, second nœud de communication et support de stockage

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2350037A (en) * 1999-03-15 2000-11-15 Lg Inf & Comm Ltd Pilot signals for synchronization and/or channel estimation
US20040170157A1 (en) * 2003-02-28 2004-09-02 Samsung Electronics Co., Ltd. Apparatus and method for transmitting/receiving preamble in ultra wideband communication system
WO2006015108A2 (fr) * 2004-07-27 2006-02-09 Zte San Diego, Inc. Transmission et reception de signaux de preambule de reference dans des systemes de communication ofdma ou ofdm

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2350037A (en) * 1999-03-15 2000-11-15 Lg Inf & Comm Ltd Pilot signals for synchronization and/or channel estimation
US20040170157A1 (en) * 2003-02-28 2004-09-02 Samsung Electronics Co., Ltd. Apparatus and method for transmitting/receiving preamble in ultra wideband communication system
WO2006015108A2 (fr) * 2004-07-27 2006-02-09 Zte San Diego, Inc. Transmission et reception de signaux de preambule de reference dans des systemes de communication ofdma ou ofdm

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008078919A2 (fr) * 2006-12-22 2008-07-03 Lg Electronics Inc. Procédé de production et de transmission de séquence reposant sur l'utilisation d'une unité de transmission de domaine temporel et fréquentiel
WO2008078919A3 (fr) * 2006-12-22 2009-11-12 Lg Electronics Inc. Procédé de production et de transmission de séquence reposant sur l'utilisation d'une unité de transmission de domaine temporel et fréquentiel
US8228782B2 (en) 2006-12-22 2012-07-24 Lg Electronics Inc. Sequence generation and transmission method based on time and frequency domain transmission unit
US8929194B2 (en) 2006-12-22 2015-01-06 Lg Electronics Inc. Sequence generation and transmission method based on time and frequency domain transmission unit
US9538508B2 (en) 2006-12-22 2017-01-03 Lg Electronics Inc. Sequence generation and transmission method based on time and frequency domain transmission unit
US10250373B2 (en) 2006-12-22 2019-04-02 Lg Electronics Inc. Sequence generation and transmission method based on time and frequency domain transmission unit
US10715299B2 (en) 2006-12-22 2020-07-14 Lg Electronics Inc. Sequence generation and transmission method based on time and frequency domain transmission unit
CN102035770A (zh) * 2010-12-01 2011-04-27 南京航空航天大学 一种利用相关进行的信道估计方法
WO2021143529A1 (fr) * 2020-01-16 2021-07-22 中兴通讯股份有限公司 Procédé et appareil de traitement de signal, premier nœud de communication, second nœud de communication et support de stockage

Also Published As

Publication number Publication date
WO2007126280A3 (fr) 2008-03-06

Similar Documents

Publication Publication Date Title
US10284406B2 (en) Method and apparatus for generating code sequence in a communication system
EP1974516B1 (fr) Procede de generation de sequence de code et procede de transmission de signal faisant appel audit procede
JP5642838B2 (ja) 通信システムにおける同期信号を確立する方法、装置、システム及びプログラム
CN101641924B (zh) 用于有效检测的序列产生方法及采用该方法收发信号的方法
CN101689930B (zh) 在无线通信系统中执行小区搜索的方法
US9591598B2 (en) Method of generating code sequence and method of transmitting signal using the same
EP2117194A1 (fr) Procédé de transmission de signal à utiliser dans un système de communication
WO2007075463A2 (fr) Canal de synchronisation pour liaison descendante d'interface radio umts d'acces multiple par repartition orthogonale de la frequence (ofdma)
WO2008144188A1 (fr) Construction d'une séquence de référence pour la recherche rapide d'une cellule
WO2008038979A2 (fr) Procédé de transmission d'informations comprenant l'utilisation d'une séquence
WO2008057752A2 (fr) Procédé et appareil de recherche rapide de cellule
JP4983807B2 (ja) セルラシステムにおける送信装置及び受信装置
KR20080042421A (ko) 프리앰블 심벌을 이용한 직교 주파수 분할 다중화 시스템 및 그 생성 방법 및 타이밍/주파수 동기 획득하는 방법
WO2007126280A2 (fr) Procédé et appareil de génération de séquence de codes dans un système de communication
KR100835562B1 (ko) 광대역 무선접속 통신시스템에서 프레임 동기 획득 장치 및방법
KR101265619B1 (ko) 복합 동기 채널 구조, 이를 이용한 신호 전송, 시퀀스적용, 시퀀스 분석 방법 및 장치
Lee et al. Use of training subcarriers for synchronization in low latency uplink communication with GFDM
RU2446586C2 (ru) Передающее устройство и приемное устройство в системе сотовой связи
KR101306710B1 (ko) 동기 채널을 위한 시퀀스에 부가 정보를 추가하는 방법
KR20070090519A (ko) 광대역 무선접속 통신시스템에서 프레임 동기 획득 장치 및방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07746274

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase in:

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 12298488

Country of ref document: US

122 Ep: pct application non-entry in european phase

Ref document number: 07746274

Country of ref document: EP

Kind code of ref document: A2