Jump to content

Zadoff–Chu sequence

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Yobot (talk | contribs) at 22:13, 14 January 2021 (References after punctuation per WP:REFPUNCT, WP:CITEFOOT, WP:PAIC + other fixes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Zadoff–Chu (ZC) sequence, also referred to as Chu sequence or Frank–Zadoff–Chu (FZC) sequence,[1]: 152  is a complex-valued mathematical sequence which, when applied to a signal, gives rise to a new signal of constant amplitude. When cyclically shifted versions of a Zadoff–Chu sequence are imposed upon a signal the resulting set of signals detected at the receiver are uncorrelated with one another.

They are named after Solomon A. Zadoff, David C. Chu and Robert L. Frank.

Description

Zadoff–Chu sequences exhibit the useful property that cyclically shifted versions of themselves are orthogonal to one another, provided that each cyclic shift, when viewed within the time domain of the signal, is greater than the combined propagation delay and multipath delay spread of the signal between the transmitter and receiver.

A generated Zadoff–Chu sequence that has not been shifted is known as a root sequence.

Plot of a Zadoff-Chu sequence for u=7, N=353

The complex value at each position n of each root Zadoff–Chu sequence parametrised by u is given by

where

,
and ,
,
,
.

Zadoff–Chu sequences are CAZAC sequences (constant amplitude zero autocorrelation waveform).

Note that the special case results in a Chu sequence,[1]: 151  and that results in cyclic shifts of the Chu sequence by terms.[1]: 152 

Properties of Zadoff-Chu sequences

1. They are periodic with period if is odd.

2. If is prime, the Discrete Fourier Transform of a Zadoff–Chu sequence is another Zadoff–Chu sequence conjugated, scaled and time scaled.

where is the multiplicative inverse of u modulo .

3. The auto correlation of a Zadoff–Chu sequence with a cyclically shifted version of itself is zero, i.e., it is non-zero only at one instant which corresponds to the cyclic shift.

4. The cross-correlation between two prime length Zadoff–Chu sequences, i.e. different values of , is constant , provided that is relatively prime to .[2]

Usages

Zadoff–Chu sequences are used in the 3GPP Long Term Evolution (LTE) air interface in the Primary Synchronization Signal (PSS), random access preamble (PRACH), uplink control channel (PUCCH), uplink traffic channel (PUSCH) and sounding reference signals (SRS).

By assigning orthogonal Zadoff–Chu sequences to each LTE eNodeB and multiplying their transmissions by their respective codes, the cross-correlation of simultaneous eNodeB transmissions is reduced, thus reducing inter-cell interference and uniquely identifying eNodeB transmissions.

Zadoff–Chu sequences are an improvement over the Walsh–Hadamard codes used in UMTS because they result in a constant-amplitude output signal, reducing the cost and complexity of the radio's power amplifier.[3]

See also

References

  1. ^ a b c Zepernick, Hans-Jürgen; Finger, Adolf (2005). Pseudo Random Signal Processing: Theory and Application. Wiley. ISBN 978-0-470-86657-3.
  2. ^ Popovic, B.M. (1992). "Generalized Chirp-Like polyphase sequences with optimum correlation properties". IEEE Trans. Inf. Theory. 38 (4): 1406–9. doi:10.1109/18.144727.
  3. ^ Song, Lingyang; Shen, Jia, eds. (2011). Evolved Cellular Network Planning and Optimization for UMTS and LTE. New York: CRC Press. ISBN 978-1439806500.

Further reading

  • Frank, R. L. (Jan 1963). "Polyphase codes with good nonperiodic correlation properties". IEEE Trans. Inf. Theory. 9 (1): 43–45. doi:10.1109/TIT.1963.1057798.
  • Chu, D. C. (July 1972). "Polyphase codes with good periodic correlation properties". IEEE Trans. Inf. Theory. 18 (4): 531–532. doi:10.1109/TIT.1972.1054840.
  • S. Beyme and C. Leung (2009). "Efficient computation of DFT of Zadoff-Chu sequences". Electron. Lett. 45 (9): 461–463. doi:10.1049/el.2009.3330.