2004-08-29 Project Title Date Submitted Source(s)

IEEE C80216e-04/241r1 IEEE 802.16 Broadband Wireless Access Working Group <http://ieee802.org/16> GCL-based preamble design for 1024,512 and 128 FFT sizes in the OFDMA PHY layer 2004-08-29 Xiangyang (Jeff) Zhuang Kevin Baum Mark Cudak Fred Vook Vijay Nangia Motorola 1301 E. Algonquin Rd., IL02-2928 Schaumburg, IL 60196, USA

Jeff.Zhuang@motorola.com

Re: Abstract Purpose Notice Release

IEEE P802.16e Preamble

Adoption of proposed changes into P802.16e

This document has been prepared to assist IEEE 802.16. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEEs name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEEs sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE 802.16.

Patent Policy and Procedures

The contributor is familiar with the IEEE 802.16 Patent Policy and Procedures <http://ieee802.org/16/ipr/patents/policy.html>, including the statement "IEEE standards may include the known use of patent(s), including patent applications, provided the IEEE receives assurance from the patent holder or applicant with respect to patents essential for compliance with both mandatory and optional portions of the standard." Early disclosure to the Working Group of patent information that might be relevant to the standard is essential to reduce the possibility for delays in the development process and increase the likelihood that the draft publication will be approved for publication. Please notify the Chair <mailto:chair@wirelessman.org> as early as possible, in written or electronic form, if patented technology (or technology under patent application) might be incorporated into a draft standard being developed within the IEEE 802.16 Working Group. The Chair will disclose this notification via the IEEE 802.16 web site <http://ieee802.org/16/ipr/patents/notices>.

2004-08-29

IEEE C80216e-04/241r1

GCL-based Preamble Design for 1024,512 and 128 FFT Sizes in the OFDMA PHY Layer
Xiangyang (Jeff) Zhuang, Kevin Baum Mark Cudak Fred Vook Vijay Nangia Motorola

1. Introduction
This contribution proposes preamble designs for the 1024, 512 and 128 FFT OFDMA modes. The proposed preambles are based on a particular family of polyphase sequences, i.e., the Generalized Chirp Like or GCL sequences. The proposed preambles have very low PAPR (lower than the PN sequence based preambles in IEEE C80216e04/125 and IEEE C80216e-04/164) and better cross correlation between any pair of the preambles (see Section 4 for simulation results). The design also allows a fast cell search to identify the sequences very easily in a onestep processing (see Appendix A for simulation results). The optimal cross correlation property also allows more reliable estimation of the channels to the desired BS (see Section 4 for simulation results), as well as the interfering BSs that are occupying the same subcarriers. This knowledge of the interference channel can be used for handover or advanced receive processing (e.g., interference suppression). A complexity comparison of GCL and PN is also shown in Appendix A that the GCL is only slightly more complex, but both are well within the comfortable complexity range, to meet the goal of fast access to the network after power-up with low power consumption.

2. Basis of the Proposed Preamble

Sequence design The sequence design methodology for any desired sequence length Nd is described first. We first choose a prime number NG that is the smallest prime number larger than Nd. Then, the sequences is generated according to
k (k +1) su (k ) = exp j 2u , k = 0LNG 1, and u = 1L NG 1 2N G

(1)

2004-08-29

IEEE C80216e-04/241r1

The integer u is referred to as class index. We will have NG-1 sequences that have the optimal cyclic cross correlation between any pair of them. The sequences will be truncated to Nd and be applied to Nd subcarriers. After truncation, the cross correlation still holds well. Due to the oversampling introduced in OFDM with null subcarriers, the PAPR will be degraded to different degrees for different u from the theoretical 0dB value (at Nyquist sampling rate), we can choose the indices that have the best PAPR among NG-1 candidates. The preambles used by different sectors/cells are obtained from different classes of this generalized chirp like (GCL) sequences [2] (unit-amplitude complex-valued sequences). A different u will also act as a cell ID. Sequence properties (See more background information of polyphase sequence in Appendix B) The time domain waveforms of the GCL-modulated OFDM signals have low PAPR. In addition, because of the use of different classes of GCL sequences, any pair of the sequences will have low cross correlation at all time lags, which greatly improves the code detection and CIR estimation. The GCL sequence has the following important properties: Property 1: The GCL sequence has constant amplitude, and its NG -point DFT has also constant amplitude. Property 2: The GCL sequences of any length have an ideal cyclic autocorrelation (i.e., the correlation with the circularly shifted version of itself is a delta function) Property 3: The absolute value of the cyclic cross-correlation function between any two GCL sequences is constant and equal to 1/ N G , when |u1-u2|, u1, and u2 are all relatively prime to NG (a condition that can be easily guaranteed if NG is a prime number). The cross-correlation 1/ N G at all lags (Property 3) actually achieves the minimum cross-correlation value for any two sequences that have the ideal autocorrelation property (meaning that the theoretical minimum of the maximum value of the cross-correlation over all lags is achieved). The minimum is achieved when the cross correlations at all lags equal to 1/ N G . The cross correlation property allows the impact of an interfering signal be evenly spread in the time domain after correlating the received signal with the desired sequence in the time domain. Hence, at least the significant taps of the desired channel can be detected more reliably (see more in the simulation section). A simple tap-selection or de-noising strategy can be used to take advantage of the cross-correlation property. Tap selection simply means that the channel taps below some threshold are set to zero. Thanks to the cross correlation property, the interference channels will be evenly spread over the IFFT window after correlating with the desired preamble, so at least the significant channel tap will be estimated more reliably. Tap selection is especially effective for relatively sparse channels by attempting to match the channel estimator to the instantaneous power delay profile. Compared with BPSK or even QPSK preambles, the complex-valued GCL sequences can be systematically constructed with guaranteed good PAPR and good correlation.

2004-08-29 One-Step Fast Cell Search for GCL Sequences (See Appendix for simulation results)

IEEE C80216e-04/241r1

The one-step fast cell search is to determine directly the class indices u from the received signal. The process is described as in the following. After a rough timing estimate has been found (e.g., using the 1/3 symmetry of the preamble and/or other techniques such as the common sync symbol), a block of N received time-domain data is transformed to the frequency domain using the usual FFT process. Denote the frequency domain data on a particular segment as Y(m) for m = 1 to Np (ignoring the unused subcarriers) and SG(m) is the GCL sequences used at those reference subcarriers, a vector of differential-based values is then computed based on the pairs of reference subcarriers. These values are conveniently collected into vector format (e.g., a differential-based vector) for efficient FFTbased processing. The differential-based vector is computed as (2) Z ( m ) = Y ( m ) * conj (Y ( m + 1)), m = 1,L , N p 1 . where conj() denotes conjugation. Assuming the channel between two adjacent reference subcarriers does not change drastically, which is normally satisfied as long as the spacing of reference subcarriers is not too large, Y(m+1)/Y(m) is approximately equal to
k +1+ q Y ( m + 1) / Y ( m ) S G ( m + 1) / S G ( m ) = exp j 2u , m = 1,L , N p 1 NG

(5)

Thus, the class index (or sequence index) information u is carried in the differential-based vectors. By processing the differential-based values and identifying a prominent frequency component of the vector, we can detect u. To obtain the frequency domain components, a commonly used tool is to take an IFFT (say T-point, T>=Np-1) on {Z(m)} to get (6) { z ( n )} = IFFTT ({Z ( m )}), m = 1,L , N p 1 , n = 1, L , T . The peak position (say nmax) of {z(n)} gives information about u, i.e., the mapping between the identified prominent frequency component at nmax to a corresponding transmitted sequence index is determined as n u (7) = max .
NG T

In summary, the sequence index (and therefore the Cell ID) is identified in a one-step cell search without searching over all of the possible preamble sequences. Instead, only one set of differential multiplications and one IFFT are needed, enabling the cell ID detection within one or two OFDMA symbol periods (note that differential multiplication is already used in the legacy 1/3 symmetry detection process, and has also been assumed in the common sync symbol proposals.)

3. Proposed Text Changes

[Change paragraph in page 556 IEEE802.16d-2004. Change the table 307 to 307a] 3

2004-08-29

IEEE C80216e-04/241r1

----------------Start from here ----------------------------------------------------------------------------------------------------The preambles used for 1024, 512, and 128 modes are defined by k(k +1) " ) = 1L NG 1 (2) su (k) = exp j2u , k = 0LNG 1 and u ("class index 2NG where NG is the length of the sequence that is pre-determined according to the FFT size and u is referred to as the sequence class index that is an integer between 1 and NG-1. The preamble, which depends on the segment used and IDcell parameter, is defined by NG and u in Table 307b-d (PAPR comparisons are given for information only). If the specified value of NG is larger than is needed for the sequence, then the sequence of length NG is truncated from the end until it is the needed length.
Table 307b. 1024-point FFT Index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 ID cell 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Segment 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Sequence index: u (NG=293) 147 146 292 1 117 176 220 73 49 244 98 195 42 251 205 88 45 248 185 PAPR dB) 2.58 2.58 2.64 2.64 2.78 2.78 2.9 2.9 2.95 2.95 3.11 3.11 3.12 3.12 3.17 3.17 3.19 3.19 3.2 (mean=2.99 PAPR in C802.16e04/125 (mean=4.12 dB) 3.65 4.09 3.93 3.94 4.14 4.13 4 4.01 4.1 4.02 4.05 3.98 4.05 4.14 4.08 4.2 4 4.2 4.15

2004-08-29
19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 108 224 69 179 114 21 272 228 65 149 144 39 254 292 1 146 147 73 220 49 244 42 251 117 176 98 195 179 114 185 108 3.2 3.22 3.22 3.25 3.25 3.26 3.26 3.27 3.27 3.33 3.33 3.33 3.33 2.31 2.31 2.41 2.41 2.63 2.63 2.71 2.71 2.77 2.77 2.77 2.77 2.83 2.83 2.88 2.88 2.99 2.99

IEEE C80216e-04/241r1
4.26 4.25 4.11 4.17 3.96 4.12 4.27 4.26 4.04 4.25 4.14 4.2 4.26 3.96 3.96 3.97 3.97 3.97 3.98 3.98 3.99 3.99 3.99 3.99 3.99 3.99 4 4 4 4 4.01

2004-08-29
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 248 45 224 69 40 253 272 21 39 254 238 55 110 183 292 1 73 220 98 195 146 147 42 251 244 49 183 110 117 176 39 3 3 3 3 3.03 3.03 3.04 3.04 3.05 3.05 3.06 3.06 3.14 3.14 2.28 2.28 2.51 2.51 2.58 2.58 2.63 2.63 2.84 2.84 2.85 2.85 2.86 2.86 2.94 2.94 2.98

IEEE C80216e-04/241r1
4.01 4.01 4.02 4.02 4.02 4.02 4.02 4.02 4.02 4.02 4.03 4.03 4.03 4.03 4.27 4.36 4.35 4.29 4.37 4.2 4.35 4.37 4.21 4.12 4.11 4.23 4.06 4.19 4.12 4.18 4.22

2004-08-29
81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 254 21 272 253 40 179 114 69 224 228 65 157 136 51 242 83 171 55 210 122 238 122 65 82 171 228 211 238 205 83 55 2.98 3.03 3.03 3.06 3.06 3.06 3.06 3.07 3.07 3.12 3.12 3.2 3.2 3.21 3.21 3.34 3.17 3.22 3.34 3.17 3.22 3.35 3.18 3.23 3.35 3.18 3.23 3.35 3.22 3.26 3.35

IEEE C80216e-04/241r1
4.15 4.19 4.17 4.14 4.24 4.21 4.29 4.27 4.31 4.25 4.29 4.13 4.23 4.15 4.15 4.26 4.03 4.2 4.1 4.04 4.25 4.22 4.05 4.2 4.28 4.05 4.35 4.37 4.06 4.35 4.13

2004-08-29
112 113 16 17 1 2 88 210 3.22 3.26

IEEE C80216e-04/241r1
4.06 4.23

Table 307c. 512-point FFT Index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ID cell 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Segment 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Sequence index: u (NG=149) 74 75 112 37 1 148 99 50 25 124 30 119 27 122 23 126 121 28 47 102 15 134 78 71 117 PAPR dB) 2.59 2.59 2.83 2.83 2.88 2.88 2.97 2.97 3.18 3.18 3.25 3.25 3.28 3.28 3.31 3.31 3.34 3.34 3.42 3.42 3.45 3.45 3.5 3.5 3.5 (mean=3.18 PAPR in C802.16e04/125 (mean=3.60 dB) 3.83 3.65 3.79 3.63 3.63 3.83 3.83 3.58 3.85 3.84 3.91 3.49 3.83 3.76 3.83 3.88 3.75 3.88 3.85 3.6 3.83 3.79 3.7 3.49 3.81

2004-08-29
25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 0 0 0 0 0 0 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 32 58 91 24 125 82 67 74 75 148 1 37 112 50 99 119 30 23 126 124 25 15 134 35 114 27 122 10 139 82 67 3.5 3.51 3.51 3.52 3.52 3.55 3.55 2.3 2.3 2.34 2.34 2.71 2.71 2.78 2.78 2.92 2.92 2.98 2.98 3.04 3.04 3.04 3.04 3.2 3.2 3.25 3.25 3.27 3.27 3.31 3.31

IEEE C80216e-04/241r1
3.67 3.67 3.88 3.9 3.86 3.55 3.83 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.46 3.47 3.47 3.47 3.47 3.47 3.47 3.48 3.48 3.48 3.48 3.49 3.49

2004-08-29
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 58 91 117 32 36 113 33 116 74 75 148 1 37 112 50 99 119 30 23 126 124 25 15 134 35 114 27 122 10 139 82 3.35 3.35 3.36 3.36 3.41 3.41 3.42 3.42 2.3 2.3 2.34 2.34 2.71 2.71 2.78 2.78 2.92 2.92 2.98 2.98 3.04 3.04 3.04 3.04 3.2 3.2 3.25 3.25 3.27 3.27 3.31

IEEE C80216e-04/241r1
3.49 3.49 3.49 3.5 3.5 3.5 3.5 3.5 3.5 3.5 3.5 3.5 3.5 3.51 3.51 3.51 3.51 3.51 3.51 3.51 3.51 3.51 3.51 3.52 3.52 3.52 3.52 3.53 3.53 3.53 3.54

10

2004-08-29
87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 2 2 2 2 2 2 2 2 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 67 58 91 117 32 36 113 33 116 56 71 71 93 78 78 10 102 102 139 47 47 135 125 125 14 24 24 3.31 3.35 3.35 3.36 3.36 3.41 3.41 3.42 3.42 3.57 3.48 3.48 3.57 3.48 3.48 3.58 3.53 3.53 3.58 3.53 3.53 3.61 3.56 3.56 3.61 3.56 3.56

IEEE C80216e-04/241r1
3.54 3.54 3.54 3.54 3.54 3.54 3.54 3.54 3.54 3.9 3.54 3.54 4.01 3.54 3.54 3.93 3.54 3.54 3.85 3.54 3.54 3.98 3.55 3.55 4 3.55 3.55

Table 307d. 128-point FFT Index ID cell Segment Sequence index: u (NG=41) PAPR dB) (mean=4.23 PAPR in C802.16e04/125 (mean=3.22 dB)

11

2004-08-29
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 40 1 20 21 14 27 7 34 10 31 9 32 6 35 24 17 8 33 15 26 39 2 37 4 5 36 23 18 38 3 12 2.74 2.74 2.74 2.74 3.16 3.16 3.24 3.24 3.3 3.3 3.56 3.56 3.6 3.6 3.94 3.94 4.03 4.03 4.13 4.13 4.2 4.2 4.45 4.45 4.47 4.47 4.7 4.7 5.02 5.02 5.02

IEEE C80216e-04/241r1
2.24 2.27 2.31 2.32 2.35 2.38 2.38 2.39 2.41 2.42 2.42 2.42 2.42 2.42 2.43 2.44 2.44 2.45 2.47 2.48 2.49 2.49 2.49 2.49 2.5 2.5 2.5 2.5 2.5 2.5 2.5

12

2004-08-29
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 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 29 1 40 10 31 20 21 7 34 14 27 6 35 33 8 37 4 18 23 32 9 24 17 36 5 29 12 26 15 2 39 5.02 2.76 2.76 3.14 3.14 3.59 3.59 3.68 3.68 3.71 3.71 3.81 3.81 3.82 3.82 4.21 4.21 4.3 4.3 4.32 4.32 4.37 4.37 4.45 4.45 4.51 4.51 4.59 4.59 4.6 4.6

IEEE C80216e-04/241r1
2.5 3.64 3.64 3.64 3.42 3.64 3.64 3.19 3.35 3.25 3.64 3.64 3.64 3.64 3.64 3.14 3.29 3.19 3.35 3.64 3.64 3.64 3.64 3.62 2.7 3.34 3.64 3.32 3.64 3.39 3.48

13

2004-08-29
62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 38 3 33 8 6 35 4 37 9 32 40 1 7 34 14 27 10 31 26 15 22 19 20 21 11 30 5 36 17 24 38 4.77 4.77 3.23 3.23 3.38 3.38 3.7 3.7 3.77 3.77 3.87 3.87 4.01 4.01 4.12 4.12 4.2 4.2 4.27 4.27 4.34 4.34 4.61 4.61 4.75 4.75 4.8 4.8 4.8 4.8 4.97

IEEE C80216e-04/241r1
3.6 3.37 4.13 3.56 4.19 4.19 3.93 4.69 2.75 2.75 3.41 3.86 3.86 3.56 3.25 4.08 3.79 3.44 3.56 3.25 3.19 3.3 3.3 3.3 4.69 4.14 3.34 3.53 3.5 4.69 3.88

14

2004-08-29
93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 2 2 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 3 23 18 22 19 29 19 22 12 28 11 2 13 30 39 30 16 16 11 25 25 4.97 4.98 4.98 5.2 4.79 4.98 5.2 4.79 4.98 5.21 4.83 5.36 5.21 4.83 5.36 5.48 5.01 5.75 5.48 5.01 5.75

IEEE C80216e-04/241r1
4.1 3.47 3.86 2.56 3.22 3.93 2.57 3.57 4.69 2.57 3.52 4.01 2.57 3.41 4.03 2.57 3.64 4.02 2.58 2.86 3.46

----------------End here -----------------------------------------------------------------------------------------------------

4. Additional Information
PAPR and Cross Correlation Comparison In addition to the low PAPR properties, the cross correlation properties of the proposed preambles are much better than PN-based BPSK sequences such as those proposed in IEEE C80216e-04/125 and IEEE C80216e04/164, as can be seen in the following Figure 1-3 where the cross correlation of all pairs of preambles that are used for segment 0 is plotted (similar correlation for segment 1 and 2). 15

2004-08-29

IEEE C80216e-04/241r1

In IEEE C80216e-04/125, there are a few sequences used twice for segment 0, but for different cellIDs (e.g., for the 512 mode and for segment 1, preamble #1 = preamble #2, #8 = #9, #12 = #13, #15 = #16; for the 128 mode and for segment 2, preamble #1 = preamble #2, #6 = preamble #16, and there are more. But the problem only occurs for 512 and 128 modes). We believe there may be some errors in IEEE C80216e-04/125, and these cross correlation are already excluded from the plot.

0.25

0.25

0.2

0.2

Normalized Cross Correlation

0.15

Normalized Cross Correlation

0.15

0.1

0.1

Mean
0.05

0.05

Mean

200

400

600

800

1000

1200

200

400

600

800

1000

1200

Time Lag

Time Lag

0.25

0.2

Normalized Cross Correlation

0.15

0.1

0.05

Mean

200

400

600

800

1000

1200

Time Lag

Figure 1. Cross- correlation characteristics of the proposed GCL-based preamble (top left, PAPR 2.58-3.26dB with mean 2.99dB) and the BPSK PN ranging sequence from IEEE C80216e-04/125 (top right, PAPR 3.65-4.37 dB with mean 4.12dB) and IEEE C80216e-04/164 (bottom middle, PAPR 4.96-5.94dB with mean 5.54dB) (1024 mode) 16

2004-08-29

IEEE C80216e-04/241r1

0.3

0.3

0.25

0.25

Normalized Cross Correlation

0.2

Normalized Cross Correlation

0.2

0.15

0.15

0.1

0.1

Mean

0.05

Mean

0.05

100

200

300

400

500

600

100

200

300

400

500

600

Time Lag

Time Lag

0.3

0.25

Normalized Cross Correlation

0.2

0.15

0.1

0.05

Mean

100

200

300

400

500

600

Time Lag

Figure 2. Cross- correlation characteristics of the proposed GCL-based preamble (top left, PAPR 2.59-3.56dB with mean 3.18dB) and the BPSK PN ranging sequence from IEEE C80216e-04/125 (top right, PAPR 3.46-4.00 dB with mean 3.60dB) and IEEE C80216e-04/164 (bottom middle, PAPR 4.96-5.94dB with mean 5.54dB) (512 mode)

17

2004-08-29

IEEE C80216e-04/241r1

0.7

0.7

0.6

0.6

Normalized Cross Correlation

0.5

Normalized Cross Correlation

0.5

0.4

0.4

0.3

0.3

0.2

0.2

Mean

Mean
0.1 0.1

20

40

60

80

100

120

140

20

40

60

80

100

120

140

Time Lag

Time Lag

0.7

0.6

Normalized Cross Correlation

0.5

0.4

0.3

0.2

Mean
0.1

20

40

60

80

100

120

140

Time Lag

Figure 3. Cross- correlation characteristics of the proposed GCL-based preamble (top left, PAPR 2.74-5.75dB with mean 4.23dB) and the BPSK PN ranging sequence from IEEE C80216e-04/125 (top right, PAPR 2.24-4.69 dB with mean 3.22dB) and IEEE C80216e-04/164 (bottom middle, PAPR 3.93-6.03dB with mean 4.82dB) (128 mode) Channel Estimation Comparison This cross advantage translates into improved channel estimation performance, as can be seen in the following figure, especially for low SINR (but with decent SNR, which is 7dB in the figure). Two base stations are simulated in the figure (one desired and one interfering). The comparison is made between GCL design and random BPSK design in which a random BPSK sequence is used in each Monte Carlo trial (similar overall cross correlation to that for sequences in IEEE C80216e-04/125). As we can see that even for very low SINR, the channel estimation performance is still reasonable, especially when the delay spread is relatively small. If this SINR is rather for the interference signal, it means that the channel to the weaker interference base station can 18

2004-08-29

IEEE C80216e-04/241r1

be monitored reasonably well (which is good for hard- or soft- handover, potential interference suppression, BScooperative scheduling, etc.).
0.7 RMS delay=0.5 s RMS delay=0.1 s 0.6

0.5
Ch. Est. MSE

0.4

0.3

0.2

0.1 7.5

6.5

6 5.5 SINR (dB)

4.5

Figure 4. Channel estimation error under different delay spread with proposed design (solid lines) and a random BPSK preamble design (dashed lines) for the1024 mode. Try GCL design for 2048 FFT (Information Only) In fact, we can see from the 1024, 512, and 128 modes that the longer the GCL sequence, the better the cross correlation and the easier to choose a subset of sequences with very good PAPR. In addition, the approximation due to truncation can also be made nearly negligible if the sequence is long. Although the 2048 mode is not under the scope of the proposed change, but just to show how easy and effective the GCL-based preamble design can be, we show in the below a quick design for the 2048 mode and an average 1.4dB PAPR reduction is obtained with additional benefit of good cross correlation.
Table YYYa. 2048-point FFT (just to show the easiness and effectiveness of GCL design) Index 0 1 ID cell 0 1 Segment 0 0 Sequence index: u (NG=569) 1 568 PAPR dB) 2.75 2.75 (mean=2.91 PAPR in C802.16e04/125 (mean=4.62 dB) 4.34 4.29

19

2004-08-29
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 190 379 284 285 95 474 427 142 71 498 114 455 512 57 244 325 253 316 38 531 394 175 539 30 561 8 362 207 271 298 1 2.75 2.75 2.8 2.8 2.84 2.84 2.86 2.86 2.87 2.87 2.97 2.97 3 3 3.03 3.03 3.03 3.03 3.03 3.03 3.04 3.04 3.1 3.1 3.11 3.11 3.12 3.12 3.12 3.12 2.54

IEEE C80216e-04/241r1
4.31 4.49 4.39 4.53 4.4 4.49 4.56 4.39 4.52 4.44 4.58 4.47 4.46 4.59 4.48 4.54 4.6 4.5 4.6 4.58 4.6 4.44 4.63 4.59 4.49 4.53 4.63 4.65 4.65 4.63 4.45

20

2004-08-29
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 568 284 285 190 379 427 142 455 114 95 474 498 71 531 38 512 57 253 316 325 244 30 539 175 394 207 362 388 181 274 295 2.54 2.56 2.56 2.63 2.63 2.64 2.64 2.71 2.71 2.71 2.71 2.76 2.76 2.8 2.8 2.84 2.84 2.87 2.87 2.89 2.89 3.01 3.01 3.03 3.03 3.06 3.06 3.11 3.11 3.12 3.12

IEEE C80216e-04/241r1
4.46 4.46 4.46 4.46 4.47 4.48 4.49 4.5 4.5 4.5 4.5 4.51 4.51 4.51 4.51 4.52 4.52 4.52 4.52 4.52 4.52 4.53 4.54 4.54 4.54 4.55 4.55 4.55 4.55 4.55 4.55

21

2004-08-29
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 568 427 142 71 498 379 190 455 114 284 285 95 474 325 244 175 394 30 539 57 512 316 253 531 38 207 362 19 550 91 2.5 2.5 2.51 2.51 2.65 2.65 2.67 2.67 2.67 2.67 2.72 2.72 2.74 2.74 2.84 2.84 2.86 2.86 2.86 2.86 2.87 2.87 2.9 2.9 2.91 2.91 2.95 2.95 2.98 2.98 3.07

IEEE C80216e-04/241r1
4.63 4.69 4.71 4.74 4.79 4.68 4.78 4.47 4.74 4.7 4.79 4.63 4.67 4.77 4.72 4.7 4.61 4.71 4.83 4.83 4.76 4.81 4.85 4.83 4.85 4.71 4.78 4.77 4.84 4.83 4.84

22

2004-08-29
95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 478 388 298 388 181 271 181 19 564 332 550 5 237 194 550 5 375 19 564 3.07 3.21 3.15 3.11 3.21 3.15 3.11 3.22 3.16 3.11 3.22 3.16 3.11 3.27 3.17 3.13 3.27 3.17 3.13

IEEE C80216e-04/241r1
4.82 4.84 4.66 4.82 4.87 4.69 4.87 4.91 4.71 4.88 4.87 4.71 4.85 4.75 4.74 4.88 4.82 4.75 4.94

5. References:
[1] [2] Yossi Segal, Preambles design for OFDMA PHY layer, FFT sizes of 1024,512 and 128, IEEE C802.16e-04/125, June 2004 B.M. Popovic, Generalized Chirp-like Polyphase Sequences with Optimal Correlation Properties, IEEE Trans. Info. Theory, vol. 38, pp. 1406-1409, July 1992

Appendix I: Complexity Analysis (GCL vs. PN)

Single Channel Estimation: Assuming the processing is: Take N-point FFT, Multiply the sequence at Nu/3 subcarriers (not needed for PN), Take N/2-point IFFT back to time. 23

2004-08-29

IEEE C80216e-04/241r1

MMSE frequency domain channel estimation is also possible without transforming back to time domain. But if the full band channel is needed, the additional complexity of getting time domain channel is not too much (comparable to using log2N filter taps in MMSE channel estimation). The only difference between PN and GCL sequence is the additional complexity for GCL on complex multiplication at every third subcarriers. Table 2. Comparison of Complex Multiplication Counts (Simple Channel Estimation) PN sequences 1024 (850) 512 (425) 128 (105) 2048 (1702) 7.42 x 103 3.33 0.64 16.39 7.70 3.47 0.68 16.95 GCL sequences

Cell search for PN sequences: Processing steps: 1. Obtain a rough timing synchronization point The complexity analysis below does NOT include the complexity of this step. The complexity involved in this step will be the same for both GCL and PN sequences. Runcom stated that this coarse synchronization point is derived from a time domain correlation, exploiting the repetitive structure obtained from fact that every third subcarriers is used. 2. Take a N-point FFT to the received data to get the frequency domain data at Nu subcarriers, starting from a timing synchronization point ( N / 2 log 2 N complex multiplications) 3. For each possible channel delay, apply a phase ramp on Nu subcarriers. Sum every third subcarriers (i.e, Nu/3) for each segment, after changing the signs of the frequency data according to the PN sequence of that segment. The result corresponds to the time-domain channel at that delay for that segment. Up to LCP channel taps may need to be searched. If the phase ramping is implemented as a complex multiplication, ignoring the additions, there are LCPN complex multiplications in this step. Assuming LCP=N/8 in the following comparison. Total multiplications: N / 2 log 2 N + N u N / 8 One-step Fast cell search for GCL sequences: Processing steps (GCL sequences with fast cell search) 1. Obtain a rough timing synchronization point Same as PN sequences (the complexity is not counted)

24

2004-08-29

IEEE C80216e-04/241r1

2. Take a N-point FFT to the received data to get the frequency domain data at Nu subcarriers, starting from a timing synchronization point ( N / 2 log 2 N complex multiplications, same as PN sequences) 3. For each of the three segments, compute the differential-based vector for every third subcarrier. Take an N/2-point IFFT from which prominent peak(s) are identified. ( [ N / 4(log 2 N 1) + N u / 3] * 3 ) 4. For the desired cell/segment, multiply the GCL sequence at Nu/3 subcarriers and take an N/2-point IFFT to obtain the time-domain channel estimate. Total multiplications: N / 2 log 2 N + 4[ N / 4(log 2 N 1) + N u / 3] Table 1. Comparison of Complex Multiplication Counts (GCL with fast cell search ) PN sequences 1024 (Nu= 850) 512 (425) 128 (105) 2048 (1702) 11.4 x 104 2.95 0.21 44.7 1.55 0.70 0.14 3.4 GCL sequences

After we presented our differential-based cell search idea, Runcom indicated they can do a similar thing, by changing the step to For each of the three segments, compute the differential-based vector for every third subcarrier. Sum over all possible PNs, by using a modified sequence which is the output of xoring the PN sequence for every to adjacent PN samples (No operation of multiplication, as these are ignored in this calculation). The results will give estimation about the energy over all PNs. Therefore only 3* Nu /3 operations of multiplication. And then, for the desired cell/segment, multiply the PN sequence at Nu/3 subcarriers and take an N/2-point IFFT to obtain the time-domain channel estimate. This results in a total complexity of N N log 2 N + N u + (log 2 N 1) , which is still slightly better than GCL with fast cell search. Our response was:
2 2

1) Now the complexity of PN and GCL approaches is pretty close. The complexity for cell search with either sequence is well within the comfortable complexity range, to meet the goal of fast access to the network after power-up with low power consumption. Thus, the PAPR and cross correlation advantages of GCL sequences make them a clear choice. 2) Using the differential based processing/energy detection (for fast cell search) with PN sequences appears less reliable than with GCL sequences. (See included simulation results below)

25

2004-08-29

IEEE C80216e-04/241r1

0.9

0.9

0.8

0.8

0.7
0.7

0.6
0.6

0.5
0.5

0.4
0.4

0.3
0.3

0.2

0.1

0.2

10

15

20

25

30

35

0.1

10

15

20

25

30

35

Figure 5. Cell identification performance (ID=10,segment 0) for GCL (left, only the first 35 sequence indices are shown) and PN (right, energy detection on 32 Runcom sequences for segment 0), flat channel, no noise, 1024-FFT. (For all simulation results: 200 Monte-Carlo runs, each time with a random channel, Peaks are always normalized to 1 in each run)
1 1

0.9

0.9

0.8

0.8

0.7

0.7

0.6

0.6

0.5

0.5

0.4

0.4

0.3

0.3

0.2

0.2

0.1

0.1

10

15

20

25

30

35

10

15

20

25

30

35

Figure 6. Cell identification (ID=10) for GCL (left) and PN (right, multiple false peaks), RMS Delay Spread =2us, SNR= -1dB, 1024-FFT

26

2004-08-29

IEEE C80216e-04/241r1

0.9

0.9

0.8

0.8

0.7

0.7

0.6

0.6

0.5

0.5

0.4

0.4

0.3

0.3

0.2

0.2

0.1

0.1

10

15

20

25

30

35

10

15

20

25

30

35

Figure 7. Two cell identification (ID=10 and ID=4, same received power, each has SNR= 2dB), GCL (left) and PN (right, several peaks in addition to the two expected peaks), RMS = 2us, 1024-FFT (Note: For PN, in addition to the false detection, the relative amplitude of the two expected peaks are often incorrect, meaning one can pick the wrong cell if we want to pick the best cell when there is a power difference. On the other hand, the peaks for GCL are clearer) Brute-force cell search (for information only): Processing steps (GCL sequences with fast cell search) 1. Obtain a rough timing synchronization point Same as PN sequences (the complexity is not counted) 2. Take a N-point FFT to the received data to get the frequency domain data at Nu subcarriers, starting from a timing synchronization point ( N / 2 log 2 N complex multiplications, same as PN sequences) 3. Multiply with the GCL conjugate on each of the Nu/3 subcarriers (for each preamble, assuming P of them in total). Take an IFFT to get the time domain channel (since there are only Nu/3 non-zero subcarriers, we can take an N/2-point IFFT). The complexity for this step is N / 4 (log 2 N 1) + N u / 3 . Total multiplications: N / 2 log 2 N + P[ N / 4(log 2 N 1) + N u / 3] Table 3. Comparison of Complex Multiplication Counts (Brute Force Cell Search) PN sequences 1024 (Nu =850) 512 (425) 128 (105) 2048 (1702) 11.4 x 10 3.0 0.21 44.7
4

P=114(19cellx6sec) 30.0 13.5 2.6 66.0 27

GCL sequences 78(13cellx6sec) 42(7cellx6sec) 20.7 11.4 9.3 5.1 1.8 1.0 45.5 25.0

6(1cellx6sec) 2.1 0.93 0.18 4.5

2004-08-29

IEEE C80216e-04/241r1

Appendix B: A Few Facts of GCL and Polyphase Sequences

GCL sequence definition: Official definition of Generalized Chirp Like (GCL) sequence is
a(k ) = s (k )b(k mod m), k = 0L N G 1, N G = cm 2

where {b(i)}, i=0,,m-1 is any sequence of m complex numbers with unit amplitude and {s(k)} is a ZadoffChu sequence k (k + 1) + qk exp j 2u , for odd NG 2N G su (k ) = k = 0LNG 1, q any integer, and u = 1L NG 1 2 k + qk exp j2u , for even NG 2N G A particular GCL family we like: In order to come up a maximal number of sequences with low PAPR and good cross correlation, we choose a prime number NG because any class index u will be relatively prime to NG, which results in optimal cross correlation between any two sequences with different class indices (we also choose b=1, q=0 for simplicity). Note that a prime number NG means that in the first equation c=NG and m=1. Any desired length is obtained by picking the smallest prime number that is larger than the desired length, then truncate the sequences. The good sequences characteristics are approximated reasonably well. GCL is one type of CAZAC (constant amplitude zero auto-correlation). But GCL is also optimal in terms of cross correlations (the best among all CAZAC). If you need one sequence, we can get away with any of the CAZAC sequence below, if the sequence length provided happens to meet you need. Relationship to other polyphase sequences: Frank-Zadoff sequence: (one type of CAZAC)
pq NG , p, q = 0L N G 1, NG = x2

s u ( k = p + q N G ) = exp j

was extended by Chu to any code length to what is known as Zadoff-Chu sequence. Frank-Zadoff sequence is also related to the modulatable orthogonal sequence proposed by Suehiro for NG=x2. This sequence has N G phases, which is the minimal number of phases required. In the original ployphase literature, the sequences ware used in time domain for applications like radar signal detection and channel training, so the length N G = 2 2 n was often used mainly to facilitate FFT processing. Milewski extended to length t2n+1 with tn+1 phases (one example is t=2) 28

2004-08-29

IEEE C80216e-04/241r1

s u ( k = p + qt n ) = exp j

pq t
2 n +1

p = 0 L t n 1, q = 0 L t n + 1 1,

N G = t 2 n +1

Chu sequence used in ZTEs proposal: (I cannot find it from Chus publication. I have seen a paper referred to this as the Newman sequence.)

k2 su (k ) = exp j , k = 0L N G 1, N G is even N G
It can be obtained as a special case of GCL (u=1,q=0 of Zadoff-Chu) Some Properties: GCL sequences are circular, i.e., s ( k ) = s ( k mod N G ) A cyclic shift of the sequence is equivalent to applying a phase ramp (denoting the circularly shifted sequence of {s(k)} as {s(k+z)}):

s ( k + z ) = s (k )e

j 2 u

2 zk + z + z 2 2NG

=e

j 2 u

z+ z2 2NG

j 2u

zk NG

s(k )

When a cyclically shifted GCL sequences is used in the frequency domain, it is equivalent to cyclically shift the time sequence by some amount, as can be seen from this time domain cross correlation of the two time-domain sequences:
2

2 zk + z + z s (k + z ) j 2 u 2 N G IFFT IFFT e = s(k )

z+ z zk j 2 u j 2u N G 2NG e IFFT e =
2

This means that in time domain, the second sequence is a cyclically delayed replica of the first sequence (by uzN/NG samples, and up to a constant phase rotation). So, if another base uses the second sequence, we want to make sure that its signal will not be confused with a delayed multipath of the first sequence.

29