(12) United States Patent
`Han et al.
`
`(10) Patent N0.:
`(45) Date of Patent:
`
`US 7,746,916 B2
`Jun. 29, 2010
`
`US007746916B2
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`9/2008 Zhuang et al.
`7,426,175 B2 *
`2003/0156624 A1 8/2003 Koslar
`2005/0036481 A1
`2/2005 Chayat et al.
`2006/0050799 A1
`3/2006 Hou et al.
`
`............ .. 370/203
`
`E1’
`KR
`W0
`W0
`W0
`W0
`
`FOREIGN PATJN1 DOCUM,
`1065855
`1/2001
`10-2007-0103917
`10/2007
`9605668
`2/1996
`2003049 295
`6/2003
`W0 03/075500
`9/2003
`W0 2005/104412
`11/2005
`OTHER PUBLlCAl'1()N S
`
`Texas Instruments “On allocation of Uplink Pilot Sub-Channels in
`Eutra SC-FDMA”, SGPP TSG-RAN WG1, E1-050922, Aug. 29,
`2005.
`
`"‘ cited by examiner
`
`Primary E.>caminer—DaVid C Payne
`Assistant Exami1zer—Adolf Dsouza
`(74) Attorney, Agent, or Firm—Lee, Hong, Degerman, Kang
`& Waimey
`
`(57)
`
`ABSTRACT
`
`A method of generating a code sequence in a wireless com-
`munication system is disclosed. More specifically,
`the
`method includes recognizing a desired length of the code
`sequence, generating a code sequence having a length differ-
`ent from the desired length, and modifying the length of the
`generated code sequence to equal the desired length. Here,
`the step ofmodifying includes discarding at least one element
`of the generated code sequence or inserting at least one null
`element to the generated code sequence.
`
`11 Claims, 18 Drawing Sheets
`
`(54)
`
`METHOD AND APPARATUS FOR
`GENERATING AND TRANSMITTING CODE
`SEQUENCE IN A VVIRELESS
`COMMUNICATION SYSTEM
`
`Inventors: Seung Hee Ha11, Seoul (KR); Mi11 Seok
`Noh, Seoul (KR); Yeon Hyeon Kwon,
`Suwon-si (KR); Hyun Hwa Park,
`Anyang-si (KR); Hyun VVoo Lee,
`Anyang-si (KR); Dong Cheol Kim,
`Uiwang-si (KR)
`
`Assignee: LG Electronics Inc., Seoul
`
`(*)
`
`Notice:
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 580 days.
`
`(21)
`
`(22)
`
`(65)
`
`11/563,909
`
`Nov. 28. 2006
`
`Prior Publication Data
`
`US 2007/0177682 A1
`
`Aug. 2, 2007
`
`Foreign Application Priority Data
`(30)
`Nov. 28, 2005
`Jul. 4, 2006
`Jul. 7, 2006
`
`.................... .. 10—2005—0114306
`.................... .. 10-2006-0062467
`.................... .. 10-2006-0064091
`
`(KR)
`(KR)
`(KR)
`
`(51)
`
`(52)
`
`(58)
`
`Int. Cl.
`(2006.01)
`H04B 1/00
`U.S. Cl.
`..................... .. 375/142; 370/203; 370/208;
`375/131; 375/140; 375/146; 375/148
`Field of Classification Search ............... .. 370/203;
`375/131, 142
`Sec application file for complete search history.
`
`Subchannel
`Modulation
`Module
`
`ZTE/SAMSUNG/HTC 1001-0001
`
`

`
`U.S. Patent
`
`0102992HHJ
`
`Sheet 1 of 18
`
`US 7,746,916 B2
`
`
`2:22225:2%:2252
`
`mmEmu::o_um_=uo2mowfiuwofl
`
`_2a_%e_mEma
`
`Eao
`
`3.5
`
`ZTE/SAMSUNG/HTC 1001-0002
`
`

`
`U.S. Patent
`
`0102992HHJ
`
`Sheet 2 of 18
`
`US 7,746,916 B2
`
`
`
`mocfismofinomflawofi
`
`
`
`_s.maEaafim
`
`2:82225:
`
`ZTE/SAMSUNG/HTC 1001-0003
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 3 of 18
`
`US 7,746,916 B2
`
`Generate code sequence having length M
`based on code generating algorithm
`
`Generate code sequence having length N
`by removing {M—N) number of elements
`from each code sequence for N
`number of code sequence (M>N )
`
`ZTE/SAMSUNG/HTC 1001-0004
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`001f044|.eehS
`
`US 7,746,916 B2
`
`.~5..._..._..
`
`xlllwzlluullfilllmll
`
`sequence 0
`
`,~—"l‘-
`|
`.-1’
`I
`5
`E___.—-"’T\'\.
`r
`1
`r
`I
`i___,""1\-.,
`
`rIs
`
`--s—
`
`rr
`
`,J.—
`r
`
`,...,,,,r|lr|lr:V||P|,,,,,,,..,,__g,.....,:..r:..,.......,.......,.....
`.....__,,.
`
`32.Unu
`
`3335.
`
`Code Index
`
`Thnelndex
`
`ZTE/SAMSUNG/HTC 1001-0005
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 5 of 18
`
`US 7,746,916 B2
`
`Amplitude
`
`[DS TO-9--
`
`sequence 0
`
`Time Index
`
`ZTE/SAMSUNG/HTC 1001-0006
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 6 of 18
`
`US 7,746,916 B2
`
`3 --- Present Embodiment (N=1024)
`f —-—-_Convent'1onal N=1024
`>
`
`0.1
`
`0.2
`
`0.3
`
`0.4
`
`0.5
`
`0,6
`
`0:’?
`
`0.8
`
`0.9
`
`1
`
`Value of Correlation
`
`ZTE/SAMSUNG/HTC 1001-0007
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 7 of 18
`
`US 7,746,916 B2
`
`—- Conventional ($I=103i)
`—— Present Embodiment (N=1024
`
`0.2
`
`0.3
`
`0.4
`
`0.5
`
`0.6
`
`0.7
`
`0.8
`
`0.9
`
`1
`
`Value of Correlation
`
`ZTE/SAMSUNG/HTC 1001-0008
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 8 of 18
`
`US 7,746,916 B2
`
`FIG. 8
`
`Required CAZAC length=L
`bee
`
`C:
`
`Generated CAZAC length=X>L, X=prime number
`+-————————e-4
`
`
`
`Truncated CAZAC length=L
`P-——e-~Z-4
`
`:3
`
`FIG. 9
`
`Required CAZAC1ength=L
` 4
`
`::
`
`Generated CAZAC length=X<L, Xrprime numbef
`
`generated CAZAC 1ength=L
`
`ZTE/SAMSUNG/HTC 1001-0009
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 9 of 18
`
`US 7,746,916 B2
`
`Origina1CAZAC seq.
`
`DeIayedCAZACseq.—
`
`ZTE/SAMSUNG/HTC 1001-0010
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 10 of 18
`
`US 7,746,916 B2
`
`FIG. 11
`
`Required sequence length, L
`+~——-«——%-~4
`
`::J ~’'“”
`
`A CAZAC sequence with prime length X; L
`+-———————~———-+
`|:::l:] 1””
`
`Truncated CAZAC sequence length, L
`+-—————————-——-+
`
`+-—g————-4
`Delayed CAZAC sequence length, L
`
`ZTE/SAMSUNG/HTC 1001-0011
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 11 of 18
`
`US 7,746,916 B2
`
`Required sequence length, Lq
`E
`:1 ‘ml
`
`A CAZAC sequence with prime length XEL
`1-fi—————-----4
`
`|<——
`Basle CAZAC sequence length, X; L
`
`:1: /‘W4
`
`r-—¥—?~—-4
`Truncated CAZAC sequence length, L
`
`ZTE/SAMSUNG/HTC 1001-0012
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 12 of 18
`
`US 7,746,916 B2
`
`Required sequence length, L
`+-*——————~———--4
`
`:: /M"
`
`A CAZAC sequence with prime lengTl1 X: L
`1-———»——~——-4
`
`:: /“"2
`
`Truncated CAZAC sequence length, L
`1-——————~———»-4
`
`ZTE/SAMSUNG/HTC 1001-0013
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 13 of 18
`
`US 7,746,916 B2
`
`Required sequence length, L
`e-—————=———~1
`
`[:3 ~-’”‘”
`
`A CAZAC sequence with prime length XSL
`+~————-———~4
`
`+~—.—-——————»+
`Baslc CAZAC sequence length, }{;L
`
`Generated CAZAC sequence length, L
`|
`
`[:J:§ /”°“
`
`ZTE/SAMSUNG/HTC 1001-0014
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 14 of 18
`
`US 7,746,916 B2
`
`generated CAZAC 1engt]1=L
`
`ZTE/SAMSUNG/HTC 1001-0015
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 15 of 18
`
`US 7,746,916 B2
`
`T['ElI1SITliiIiIlg End
`
`Recgivjug End
`
`Basic Code Sequence Generation Unit
`
`5
`
`Code Sequence Length Adjustment Unit
`
`Sequence
`Generation
`Unit
`
`1 70213
`
`Code
`3:13:95:
`Unit
`g
`
`Raciding
`Unit
`
`ZTE/SAMSUNG/HTC 1001-0016
`
`

`
`U.S. Patent
`
`Jun. 29,2010
`
`001:10614|.CChS
`
`US 7,746,916 B2
`
`% ——— Truncated ~>shifl
`
`_
`
`ZTE/SAMSUNG/HTC 1001-0017
`
`

`
`U.S. Patent
`
`Jun. 29,2010
`
`001f0714|.eehS
`
`US 7,746,916 B2
`
`——-— Truncated -bshifi
`
`......... shift -> Truncated
`
`ZTE/SAMSUNG/HTC 1001-0018
`
`

`
`U.S. Patent
`
`Jun. 29, 2010
`
`Sheet 18 of 18
`
`US 7,746,916 B2
`
`Required CAZAC1ength=L
`
`Power per tone-=1: /S1111} ofE0t£er§L//
`
`Powerper tone=L/X]: gun;/(:"’Pow-1.:/
`
`ZTE/SAMSUNG/HTC 1001-0019
`
`

`
`US 7,746,916 B2
`
`1
`METHOD AND APPARATUS FOR
`GENERATING AND TRANSMITTING CODE
`SEQUENCE IN A VVIRELESS
`COMMUNICATION SYSTEM
`
`This application claims the benefit of Korean Application
`No. P2005-114306, filed on Nov. 28, 2005. Korean Applica-
`tion No. P2006-62467, filed or1 Jul. 4, 2006, and Korean
`Application No. P2006-64091, filed on Jul. 7, 2006, which
`are hereby incorporated by reference.
`BACKGROUND OF TI IE INVENTION
`
`1. Field of the Invention
`Tl1e present invention relates to a method of generating and
`transmitting code sequence, and more particularly,
`to a
`method and apparatus for generating and transmitting code
`sequence in a wireless communication system.
`2. Discussion of the Related Art
`Usually, a pilot signal or a preamble ofa wireless co1m11u-
`nication system is referred to as a reference signal used for
`initial synchronization, cell search, and chamiel estimation.
`Further, the preamble is comprised of a code sequence, and
`the code sequence is further comprised of orthogonal or
`quasi-orthogonal which represent good correlation proper-
`ties.
`For example, a Hadamard matrix of 128x128 is used in a
`portable intemet (P1) to insert the code sequence to the fre-
`quency domain. I11 so doing, 127 types ofcode sequences are
`used.
`Although the Hadmard code sequence and a poly—phase
`Constant Amplitude Zero Auto-Correlation (CAZAC) code
`sequence are orthogonal codes, a number of codes used to
`maintain orthogonality is limited. For example, a number of
`N orthogonal codes in a N><N Hadamard matrix is N, and a
`number of N orthogonal codes that can be expressed by the
`CAZAC codes is N and a prime number smaller than N
`(David C. Cl1u, “Polyphase Codes with Good Periodic Cor-
`relation Properties,” Information Theory IEEE Tranmczion
`on, vol. 18, issue 4, pp. 531-532, July 1972). With respect to
`CAZAC sequence types, GCL CAZAC and Zadoff—Chu
`CAZAC are often used.
`If the code sequence is generated using the Hadamard
`codes, N number of sequence types corresponding to the
`entire length of the codes is generated. However, the if the
`code sequence is generated using the CAZAC codes. only
`l1alf or N/2 number of sequence types are generated.
`
`2
`attained by the structure particularly pointed out in the written
`description and claims hereof as well as the appended draw-
`ings.
`To achieve these objects and other advantages and in accor-
`dance with the purpose of the invention, as embodied and
`broadly described herein, a method of generating a code
`sequence in a wireless communication system includes rec-
`ognizing a desired length of the code sequence, generating a
`code sequence having a ler1gtl1 different fror11 tl1e desired
`length, and r11odifyir1g tl1e length of tlie generated code
`sequence to equal tl1e desired length. Here, tl1e step of modi-
`fying includes discarding at least one element of the gener-
`ated code seque11ce or inserting at least one mill element to the
`generated code sequence.
`In another aspect of the present invention, method of gen-
`erating a code sequence in a wireless communication system
`includes a recognizing a desired length of a first code
`sequence, generating a second code sequence having a length
`I different from the desired length of the first code sequence,
`and modifying the length of the second code sequence to
`equal the desired length ofthe first code sequence. Here, the
`step ofmodifying includes discarding at least one element of
`the modified code sequence if the length ofthe modified code
`sequence is longer than the desired length of the first code
`sequence or inserting at least one null element to the modified
`code sequence if the length of the modified second code
`sequence is shorter than the desired length of the first code
`sequence.
`In a further aspect ofthe present invention, an apparatus for
`generating a code sequence in a wireless communication
`system includes a sequence selection unit for recognizing a
`desired length of the code sequence, generating a code
`sequence having a length different from the desired length,
`and modifying the length of the generated code sequence to
`equal the desired length, wherein the sequence selection unit
`discards at least one element of the generated code sequence
`or inserts at least one null element to the generated code
`sequence in modifying the length of tlie generated code
`sequence, and a transmitting unit for transmitting the modi-
`fied generated code sequence via at least one antenna.
`It is to be understood that both the foregoing general
`description and the following detailed description of the
`7 present invention are exemplary and explanatory and are
`intended to provide further explanation of the invention as
`claimed.
`
`,
`
`SUMMARY OF THE INVENTION
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`Accordingly, the present invention is directed to a method
`and apparatus for generating and transmitting code sequence
`in a wireless communication system that substantially obvi-
`ates one or more problems due to limitations and disadvan-
`tages of the related art.
`An object ofthe present invention is to provide a method of
`generating a code sequence in a wireless communication
`system.
`Another object of the present invention is to provide an
`apparatus for generating a code sequence in a wireless com-
`munication system.
`Additional advantages, objects, and features of tlie inven-
`tion will be set forth in part in the description which follows
`and in part will become apparent to those having ordinary
`skill in the art upon examination of the following or may be
`learned from practice of tlie invention. The objectives and
`other advantages of the invention may be realized and
`
`The accompanying drawings, which are included to pro-
`vide a further understanding of the invention and are incor-
`porated in and constitute a part of this application, illustrate
`embodiment(s) ofthe invention and together with the descrip-
`tion serve to explain the principle of the invention. In the
`drawings;
`FIG. 1 illustrates a structure of an apparatus for transmit-
`ting data using Orthogonal Frequency Division Multiplexing
`(OFDM) or OFDM Access (OFDMA) scheme;
`FIG. 2 illustrates a structure of an apparatus for receiving
`data using OFDM/OFDMA scheme;
`FIG. 3 is a flow diagram illustrating adjusting a code
`sequence;
`FIG. 4 illustrates cross—correlation properties of the gener-
`ated code sequence;
`FIG. 5 illustrates a generated CAZAC. sequence
`
`ZTE/SAMSUNG/HTC 1001-0020
`
`

`
`US 7,746,916 B2
`
`aNmLN,d\y
`
`using N (:l024);
`FIG. 6 illustrates a cross-correlation properties cumulative
`distribution function (CDF) ofthe code sequences that can be
`generated according, to the code sequence
`
`aNseq_M’IN
`
`and the CAZAC sequence
`
`H/VWLNXN
`
`when N:l024;
`FIG. 7 illustrates the cross-correlation properties CDF of
`the code sequences that can be generated based on the V
`CAZAC sequence generated using the prime munber of
`N:l03l and a code sequence sct
`
`3/\}mLMrN
`
`4
`FIG. 20 is an exemplary diagram illustrating boosting the
`power of the generated code sequence.
`
`DF,TAII,F,D DFSCRIPTION OF THF, INVFNTION
`
`Reference will now be made in detail to the preferred
`embodiments ofthe present invention. examples ofwhich are
`illustrated in the accompanying drawings. Wherever pos-
`sible, the same reference numbers will be used throughout tl1e
`drawings to refer to the same or like parts.
`FIG. 1 illustrates a structure of an apparatus for trans1nit—
`ting data using Orthogonal Frequency Division Multiplexing
`(OFDM) or OFDM Access (OFDMA) scheme. FIG. 2 illus-
`trates a structure of an apparatus for receiving data using
`OFDM/OFDMA scheme.
`
`In FIG. 1, traflic data and control data are multiplexed at a
`muxer 11. Ilere, the tra flic data is used to provide service from
`a transmitting end to a receiving end, and the control data is
`‘ used to facilitate transmission from the transmitting end to the
`receiving end. The discussion relating to the present invention
`regarding the code sequence which relates to a type of a code
`sequence of the control data. The code sequence can be used
`for initial synchronization, cell search, or channel estimation.
`Depending on tl1e commtmication system,
`the code
`sequence can be used in various forms. For example, the code
`sequence in anIE A 4 802.16 wideband wireless access system
`can be used in a oreamble or a pilot signal format, and in a
`multi-input, r11ulti-output (MIMO) system, tl1e code sequence
`can be used as a midamble format.
`
`having length of 1024 (seven (7) elements removed);
`FIG. 8 illustrates a method ofgenerating CAZAC sequence
`using a length required by a communication system;
`FIG. 9 illustrates a method of generating a CA7.AC
`sequence using a padding portion;
`FIG. 10 illustrates an exemplary application of circular
`shift;
`FIG. 11 is an exemplary diagram illustrating application of
`circular shift to the generated code sequence after the ele-
`ments of the code sequence are removed;
`FIG. 12 is an exemplary diagram illustrating application of
`circular shift to the generated code sequence prior to rcmov- 45
`ing the elements of the code sequence;
`FIG. 13 is an exemplary diagram illustrating application of
`circular shift to the generated code sequence after a padding
`portion is attached;
`FIG. 14 is an exemplary diagram illustrating application of 7
`circular shift to the generated code sequence prior to attach-
`ing a padding portion;
`FIG. 15 is an exemplary diagram of a padding portion of
`the code sequence in which the padding portion is used as a
`lower bandwidth guard interval;
`FIG. 16 is a structural diagram for transmitting the code
`sequence. Depending on whether the transmission ofthe code
`sequence is made in a downlink direction or an uplink direc-
`tion, the structure can be in different form;
`FIG. 17 is a structural diagram illustrating a basic code
`sequence generation unit and a code sequence length adjust-
`ment unit;
`FIG. 18 illustrates cross-correlation characteristics of the
`code sequence;
`FIG. 19 illustrates cross-correlation characteristics of the
`code sequence; and
`
`After being processed at the muxer 11, the multiplexed
`traffic and control data is then charmel coded by a channel
`coding module 12. Channel coding is used to allow tl1e receiv-
`ing end to correct error that can occur during transmission by
`adding parity bits. Examples of chaimel coding include con-
`volution coding, turbo coding, and low density parity check
`(LDPC) coding.
`Thereafter, the channel coded data is modulated by a digital
`modulation module 13 in which data symbols are mapped
`using algorithms such as a quadrature phase shift keying
`(QPSK) or a 16-quadrature amplitude modulation ( l 6 QAM).
`The mapped data symbols are then processed by a subchannel
`modulation module 14 through which the data symbols are
`mapped to each subcarrier of the OFDM system or OFDMA
`system. Then, tl1e data symbols mapped to subcarriers are
`processed by an inverse fast Fourier transform (IFFT) module
`15 which transform the data symbols into a signal in a time
`domain. The transformed data symbols are then processed
`through a filter 16 and further processed through a digital-to-
`analog conversion (DAC) module 17 where tl1e filtered data
`symbols are converted to analog signals. Lastly, the analog
`signals are converted into a radio frequency (RF) by a RF
`module 18 which is then transmitted via an antemia 19 to the
`receiving end.
`Based on the type of generated code (c.g., CAZAC code),
`the steps of charmel coding and/or symbol mapping can be
`omitted. FIG. 2 illustrates a receiving end whose processes
`are inverse to those of the transmitting end.
`A code sequence is used for transmitting control inforrna—
`tion, which includes identification (ID) and synchronization
`information, to classify types of sequences iii a commLn1ica-
`tion system. In order for more effective reception of the
`control information using code sequence, the code sequence
`can be adjusted or modified. Further, the code sequence can
`be applied to all of tlie channels that use code sequence for
`control signaling such as a random access channel (RACH),
`
`ZTE/SAMSUNG/HTC 1001-0021
`
`

`
`US 7,746,916 B2
`
`5
`downlinlduplink reference symbol, charmel quality informa-
`tion
`(CQI),
`and Acknowledgement
`(ACK)/Negative
`Acknowledgement (NACK).
`FIG. 3 is a flow diagram illustrating adjusting a code
`sequence. More specifically, a length of the code sequence is
`defined as N, a number of codes in the code sequence is
`defined as NMLN, and a code sequence set defined as
`
`czNmLN,,,\y .
`
`In operation, the code sequence set
`
`aNmLNX,\,
`
`6
`Noise (PN) code, and a Constant Amplitude Zero Auto-Cor-
`relation (CAZAC) code, among others to be used for initial
`synchronization, cell search, and chamiel estimation in the
`wireless communication system. The code sequence set hav-
`ing length M per each code type can be generated by various
`schemes as discussed. As for the CAZAC code, the Value of
`length M is a smallest prime number greater than the value of
`length N, preferably.
`Subsequently, a code sequence set
`
`I1NWLMx~ ,
`
`having NSWJ/I number of code sequences, can be generated
`where a resulting length of the code sequence is length N.
`More specifically, the code sequence set
`
`having NSELN number of codes can be extended to a code
`sequence set
`
`5lN,eq_MxM ,
`
`51/v,sq_MxN
`
`having Nseq
`Equation
`
`M number of codes.
`
`aNssqiN,W
`
`is a matrix of NEW NXN of
`
`having NSGLM number of code sequences where each code
`sequence has length M (from step S301), can have elements
`of the code sequence removed. That is, elements which coin-
`prise each code sequence can be removed from the code
`sequence allowing the length of the code sequence to be
`adjusted or shortened. Here, M—N number of elements can be
`removed from the code sequence whose lengtl1 corresponds
`to length M. By removing elements from the code sequence
`with length M, a code sequence having length N can be
`generated. As discussed. N is smaller than M. Consequently,
`a code sequence set
`
`"'mr1
`1
`0
`_
`3/V5sq_NxI\’ - [“m'mLNx/v“/vM_Nx/\r--- “N,°q_NxN]
`
`T
`
`I
`~ and 5’/vmLNxN
`
`IINWLMXN)
`
`is a row vector of
`
`alV'mLNxI\’ = l_”l\'s6q_NxN(0)”i\'mLNxN(1)---“ii/,6q_Nx.vlN '1)
`
`Furthennore,
`
`i1§vsEqiN/‘A, (IL)
`
`.
`.
`indicates n(:0, 1, 2,
`:eq_
`N
`N—l) code sequence.
`Referring to FIG. 3, a code sequence set
`
`.
`
`, N—l) element of k(:(),
`
`1, 2,
`
`51/V'5sq_MxM ,
`
`having NW1 M number of code sequence(s) where each code
`sequence has length M, can be generated based on the code
`generation algorithm based on code type in which a value of
`length M is a natural number greater than a value of length N
`(S301). Here, the code types include Hadamard code, Pseudo
`
`having NMLM number ofcode sequences in wl1icl1 each code
`sequence has length N, can be generated (S302).
`A code sequence is used for transmitting control inforrna—
`tion, which includes identification (ID) and synchronization
`information, to classify types of sequences iii a con1mu11ica-
`tion system. Currently in 3“ Generation Partnership Project
`(3GPP) Long Term Evolution (LTE), a CAZAC sequence is
`being considered.
`The CAZAC sequence can be used by channels to output
`Various IDs and information. The channels include charmels
`for downlink synchronization (e.g., primary synchronization
`charmel, secondary synchronization channel, and broadcast
`chaimel), uplink synchronization (e.g., random access chan-
`nel), and pilot channels (e.g., data pilot and channel quality
`pilot). Further, the CAZAC sequence can be used in scram-
`bling as well as charmels that use code sequence such as
`RACH.
`
`Although there are various types ofthe CAZAC sequences,
`there are two types of often used CAZAC sequences—GCL
`CAZAC and Zadoff-Chu CAZAC. The Zadoff-Chu CAZAC
`sequence can be defined by the following equations.
`
`J/7rMk(k + 1)
`c(k; N, M) = exp TJ (for odd N)
`
`[Equation 1]
`
`ZTE/SAMSUNG/HTC 1001-0022
`
`

`
`US 7,746,916 B2
`
`7
`
`V
`c(k;N, M)=exp
`
`-continued
`j:rMlc2
`N 1 (for even N)
`
`_
`
`[Equation 2]
`
`Here, 1; denotes sequence index, N denotes a length of
`CAZAC to be generated, and M denotes sequence ID.
`Ifthe Zadoff-Chu CAZAC sequence and the GCL CAZAC
`sequence are expressed by c(l<;N ,M) as shown in Equations 1
`and 2, then the sequences have the following three (3) char-
`acteristics as presented in following equations.
`
`|c(k; N, M)[ = 1 (for all k, N, M)
`
`1,
`0,
`
`(for d : 0)
`(for d i 0)
`
`RMW (d) = {
`RMl_M2‘N(d) = p (for all M1, M2 and N)
`
`[Equation 3]
`
`[Equation 4]
`
`[Equation 5]
`
`,
`
`According to Equation 3, the CAZAC sequence always has
`a size of 1, and the CAZAC sequence of Equation 4 has an
`auto-correlation function denoted by a delta function. Here,
`the auto-correlation is based on circular correlation. Further,
`Equation 5 is a cross-correlation which is constant ifN is a
`prime number,
`If the length to be applied in the wireless communication
`system for generating the CAZAC sequence is denoted by L,
`a method for generating the CAZAC sequence sets N of
`Equations 1 and 2 to equal L (N:L)—identified as step
`Step (2) canbe identified by a method where a value ofN is set
`to be a prime number greater than a value of length L for
`generating the CAZAC sequence.
`Referring to the characteristics of the generated CAZAC
`sequence having a specified length of L, if L is not a prime
`number, the generated CA7AC sequence can include M:l,
`2,
`.
`.
`. L—1 number of codes, some of which are repeated
`codes. In other words, the number of different codes is less
`than L—1 number of codes. On the contrary, if L is a prime
`number, there is L—1 number of different codes. The above
`descriptions may also be applied to other types of code
`sequences and are not
`limited to Zadoff—Chu CAZAC
`sequence.
`the following technique has been considered.
`Further,
`More specifically, if the length of code to be applied to the
`system is not a prime number, and there are a large number of
`codes to be used, a smallest prime number greater than L was
`selected. Using the selected prime number, the CAZAC
`sequence was generated, and discards or removes at least one .
`element of the generated CAZAC sequence for use. This
`technique is different than the technique introduced with
`respect to step 1.
`For example, assume that a number of codes of a CAZAC
`code sequence (N) is 1024. The following equation can be
`used to express an algorithm for generating a Zadoff-Chu
`CAZAC code.
`
`8
`In Equation 6, A and M are natural numbers, and index(A)
`s
`seq
`(:0, 1, 2. .
`.
`. N
`M—1) is an index ofA in ascending order.
`In order to extend the CAZAC sequence where N:1024. a
`smallest prime ntunber greater than 1024 is used. That is, the
`smallest prime number greaterthan 1024 is 103 I
`. As such, the
`code sequence set
`
`I1/vmq Mm
`
`where l\/1:10.31 is applied to Equation 6.
`Since M (:1031) is a prime number, NmLM:1030. Fur-
`thermore, A canbe referred to as a seed value used to generate
`a code sequence maintaining CAZAC properties. If M is a
`prime number, a total of l\/I-1 number of code sequences can
`be generated. In other words, for example, if M”1024, a total
`of 512 (:1024/2 or N/2) number of code sequences are gen-
`V erated. However, if M—1 031, a total of 1030 number of code
`sequences (M—1) are generated. Moreover, the cross-corre1a-
`tion properties ofthe generated code sequence are better if M
`is a prime number than a composite number.
`In order to adjust or modify the CAZAC code sequence set
`
`IINWLMXM
`
`where M:1031 to a code sequence set
`
`5lN,eq_MxM
`
`whose length is N”1024, M—N number of elements can be
`removed from index n:N. .
`.
`.
`, M—1, generating a code
`sequence set
`
`UN,Eq_Mx~ >
`
`In determining the value of M, although the number ofcode
`sequences can increase with increase in value of N, it is
`preferable to determine the value of M based on the code
`sequence whose length is N that promotes maintenance of
`good correlation properties. In case of the CAZAC code,
`optimum correlation properties can be attained if the value of
`length M is the smallest prime number greater than the value
`of length N.
`If the code sequence set
`
`61NmLMx~
`
`airulz/rM)(n) :
`
`exp
`
`,A7m(n + 1)
`M£e],when M is odd
`V/lzm‘
`_
`exp a
`, when M is even
`M
`
`wheren:0. 1,2,
`
`,M—1
`
`[Equation 6]
`
`generated using length N:1024 is compared with the code
`sequence set
`
`61/\/(cg Mm .
`
`a total number code sequences of the former can be repre-
`sented by N/2 or 512 (:1024/2) code sequences having an
`
`ZTE/SAMSUNG/HTC 1001-0023
`
`

`
`US 7,746,916 B2
`
`9
`. ,N/2-1 (N:l024), and a total number ofcode
`.
`index 0, 1,2, .
`sequences of the latter can be represented by M—1 or 1030
`having an index 0, 1, 2, .
`.
`.
`, M—2 (M:1031).
`FIG. 4 illustrates cross—correlation properties of the gener-
`ated code sequence. More specifically, the cross—correlation ,
`properties of
`
`afivmLM,N(k = 1. 2.
`
`..\*.aLM -1)
`
`associated with the remaining NSCLM ( 1 02 9) code sequences
`for
`
`D
`[1N,sq_MxN
`
`code sequence of the code sequence set
`
`V
`
`01/vm] MxN-
`
`The figure illustrates this with respect to amplitude, code
`index, and time index.
`Further, FIG. 5 illustrates a generated CAZAC sequence
`
`aNseq_N"N
`
`using N(:1024). More specifically,
`cross—correlation properties of
`
`the figures illustrate
`
`_
`k
`at“, M3:/\/lk— 1,2,
`
`, N<nq_M * 1)
`
`regarding the remaining N5eL,V(511) code sequences. The
`figure illustrates this with respect to amplitude, code index,
`and time index. Between FIG. 4 and FIG. 5, the cross—corre-
`lation properties of the generated code sequence of FIG. 4 are
`better.
`
`FIG. 6 illustrates a cross—correlation properties cumulative
`distribution function (CDF) ofthe code sequences that can be
`generated according to the code sequence
`
`£1/gag MAN
`
`and the CAZAC sequence
`
`a;ymLN,d\y
`
`when N:l024.
`
`FIG. 7 illustrates the cross—correlation properties CDF of
`the code sequences that can be generated based on the
`CAZAC sequence generated using the prime number of
`N:103l and a code sequence set
`
`I1/vsCq_Mx~
`
`having le11gth of 1024 (seven (7) elements removed). The
`performance lines of FIGS. 4-7 indicate that
`the code
`sequence set with seven (7) elements removed has equivalent
`cross—correlation properties compared to the original code
`sequence set.
`As discussed, the codes in addition to the CAZAC code are
`available, sucl1 as the PN code and the Hadamard code. The
`discussion with respect to the CAZAC code sequence can
`also be applied to the PN code and the Hadarnard code. With
`respect to the PN code, a modular shift register generator is
`used to generate tl1e code sequences. If a number of shift
`registers generated is represented by N, a code sequence
`having a length of 2N-1 is generated. Thereafter, a value “I”
`is added to the shift register, resulting in a length 2"°'1—1, and
`then, adjust the length to equal 2N.
`With respect to tl1e Hadarnard codes, a number of code
`sequences, which equal the length ofthe code sequence, make
`up a code sequence. However, for example, if M number of
`code sequences having length N is required (M>N), then M
`number of code sequences having length M are generated,
`followed by removing a specified number of elements to
`make the length of the code sequence equal length N.
`FIG. 8 illustrates a method ofgenerating CAZAC sequence
`using a length required by a communication system. That is,
`the required (or desired) length of the CAZAC sequence can
`be represented by length L. Further, the codes types can be
`extended. However, since a generated code sequence can be
`truncated or have elements discarded to correspond to the
`desired length L, the auto—correlation and cross—correlation
`properties of the truncated code sequence can experience
`deterioration. Similarly, even if a code sequence portion is
`added/attached to the generated code sequence (e.g., zero-
`padding or cyclic prefix) to correspond to the desired length
`L, the auto—correlation and cross—correlation properties can
`experience deterioration. Here, auto—correlation properties
`relate to the auto—correlation value being 1 when tl1e delay is
`0. Otherwise, the auto—correlation value is 0 when the delay is
`a value other than 0. Further, the cross—correlation properties
`having a constant value is negatively affected.
`Assuming that the code sequence having poor auto—corre-
`lation and cross—correlation properties are removed,
`the
`remaining number of code sequences may be less than L—1.
`In order to attain a desired le11gth and a maximum number
`of CAZAC sequence types corresponding to tl1e desired
`length, a smallest prime number, X, greater than the desired
`length, L, O(>L) can be selected. Although the CAZAC
`sequence can be generated using X. due to deterioration ofthe
`correlation properties, the correlations properties of CAZAC
`sequence as shown in Equations 4 and 5 cannot be attained.
`Further, when selecting a length of the generated code
`sequence, the length that is nearest to the desired length L
`which is between a smallest prime number larger than the
`desired length or a largest prime mnnber smaller than the
`desired length can be selected.
`Referring to FIG. 8, the generated CAZAC sequence has
`length X. Thereafter, the generated CAZAC sequence having
`length X has elements of the code sequence removed (or
`truncated) so as to make the length of the generated CAZAC
`sequence correspond to the desired length L.
`FIG. 9 illustrates a method of generating a CAZAC
`sequence using a padding portion As discussed, the gener-
`
`ZTE/SAMSUNG/HTC 1001-0024
`
`

`
`US 7,746,916 B2
`
`11
`atcd CAZAC scqucncc is trlmcatcd. With respect to auto-
`correlation and cross correlation properties. delay of 0 indi-
`cates an auto-correlation value of 1, as shown i11 Equation 4,
`and a delay not equaling 0 indicates a value of0. Moreover,
`the properties where the cross—correlation value is always a
`prime number is not deteriorated whereby effective correla-
`tion is maintained. Further, additional control information
`car1 be transmitted by using the information inputted to the
`fading unit.
`Referring to FIG. 9, thc gcncratcd CAZAC scqucncc has
`length X. Here, the value of X is a largest prime number less
`than the value of L. In other words, X is a prime number less
`than L. Thereafter, the generated CAZAC sequence having
`length X has elements added or a paddingportion added to the
`CAZAC sequence in order to make the length ofthe generated
`CAZAC sequence corresponding to the desired length L.
`Here, C1 represents the length of the CAZAC sequence hav-
`ing length X, and C2 represents the padding portion. By
`combining C1 and C2 (C1+C2),
`the generated CAZAC
`sequence can have a length corresponding to the desired
`length